Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 237 matches
- 2007
- Moncef Abbas, Marc Pirlot, Philippe Vincke:
Tangent circle graphs and 'orders'. Discret. Appl. Math. 155(4): 429-441 (2007) - David Abelson, Seok-Hee Hong, Donald E. Taylor:
Geometric automorphism groups of graphs. Discret. Appl. Math. 155(17): 2211-2226 (2007) - Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland:
The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs. Discret. Appl. Math. 155(10): 1314-1325 (2007) - Sarah Spence Adams, Matthew Tesch, Denise Sakai Troxell, Bradford Westgate, Cody Wheeland:
On the hole index of L(2, 1)-labelings of r-regular graphs. Discret. Appl. Math. 155(17): 2391-2393 (2007) - Omran Ahmadi, Darrel Hankerson, Alfred Menezes:
Formulas for cube roots in F3m. Discret. Appl. Math. 155(3): 260-270 (2007) - Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer:
Connecting colored point sets. Discret. Appl. Math. 155(3): 271-278 (2007) - Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences. Discret. Appl. Math. 155(6-7): 676-685 (2007) - Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Tree loop graphs. Discret. Appl. Math. 155(6-7): 686-694 (2007) - Abdo Y. Alfakih:
On dimensional rigidity of bar-and-joint frameworks. Discret. Appl. Math. 155(10): 1244-1253 (2007) - Faryad Ali:
On the ranks of O'N and Ly. Discret. Appl. Math. 155(3): 394-399 (2007) - José María Alonso-Meijide, Francesc Carreras, María Albina Puente:
Axiomatic characterizations of the symmetric coalitional binomial semivalues. Discret. Appl. Math. 155(17): 2282-2293 (2007) - Kazuyuki Amano, Akira Maruoka:
Better upper bounds on the QOBDD size of integer multiplication. Discret. Appl. Math. 155(10): 1224-1232 (2007) - Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair:
Flows over edge-disjoint mixed multipaths and applications. Discret. Appl. Math. 155(15): 1979-2000 (2007) - Alberto Apostolico, Cinzia Pizzi:
Motif discovery by monotone scores. Discret. Appl. Math. 155(6-7): 695-706 (2007) - Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The harmonious coloring problem is NP-complete for interval and permutation graphs. Discret. Appl. Math. 155(17): 2377-2382 (2007) - M. Atapour, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
Characterization of double domination subdivision number of trees. Discret. Appl. Math. 155(13): 1700-1707 (2007) - David Avis, Tsuyoshi Ito:
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities. Discret. Appl. Math. 155(13): 1689-1699 (2007) - Maxim A. Babenko, Alexander V. Karzanov:
Free multiflows in bidirected and skew-symmetric graphs. Discret. Appl. Math. 155(13): 1715-1730 (2007) - Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis:
Phase transitions of PP-complete satisfiability problems. Discret. Appl. Math. 155(12): 1627-1639 (2007) - Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 155(18): 2444-2455 (2007) - Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez:
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155(16): 2053-2060 (2007) - Camino Balbuena, Pedro García-Vázquez:
A sufficient condition for Pk-path graphs being r-connected. Discret. Appl. Math. 155(13): 1745-1751 (2007) - Jørgen Bang-Jensen, Jing Huang, Louis Ibarra:
Recognizing and representing proper interval graphs in parallel using merging and sorting. Discret. Appl. Math. 155(4): 442-456 (2007) - Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Finding submasses in weighted strings with Fast Fourier Transform. Discret. Appl. Math. 155(6-7): 707-718 (2007) - Dominique Barth, Johanne Cohen, Taoufik Faik:
On the b-continuity property of graphs. Discret. Appl. Math. 155(13): 1761-1768 (2007) - Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155(10): 1336-1343 (2007) - Nadine Baumann, Ekkehard Köhler:
Approximating earliest arrival flows with flow-dependent transit times. Discret. Appl. Math. 155(2): 161-171 (2007) - Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155(8): 979-988 (2007) - Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes:
Regular-SAT: A many-valued approach to solving combinatorial problems. Discret. Appl. Math. 155(12): 1613-1626 (2007) - Sergey Bereg, Hao Wang:
Wiener indices of balanced binary trees. Discret. Appl. Math. 155(4): 457-467 (2007)
skipping 207 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-31 09:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint