Остановите войну!
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 37 matches
- 2002
- Anne Berry, Jean R. S. Blair, Pinar Heggernes:
Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12 - Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger:
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG 2002: 13-24 - Olivier Bodini:
On the Minimum Size of a Contraction-Universal Tree. WG 2002: 25-34 - Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Optimal Area Algorithm for Planar Polyline Drawings. WG 2002: 35-46 - Franz-Josef Brandenburg:
Cycles in Generalized Networks. WG 2002: 47-56 - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67 - Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More about Subcolorings. WG 2002: 68-79 - Alain Cournier:
Search in Indecomposable Graphs. WG 2002: 80-91 - Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria:
On the Complexity of (k, l)-Graph Sandwich Problems. WG 2002: 92-101 - Marc Demange, Vangelis Th. Paschos:
Algorithms and Models for the On-Line Vertex-Covering. WG 2002: 102-113 - Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 - Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
The Complexity of Restrictive H-Coloring. WG 2002: 126-137 - Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs. WG 2002: 138-149 - Yon Dourisboure:
An Additive Stretched Routing Scheme for Chordal Graphs. WG 2002: 150-163 - Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175 - Frank van den Eijkhof, Hans L. Bodlaender:
Safe Reduction Rules for Weighted Treewidth. WG 2002: 176-185 - Henning Fernau:
Graph Separator Algorithms: A Refined Analysis. WG 2002: 186-197 - Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210 - Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222 - Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. WG 2002: 223-234 - Toru Hasunuma:
Completely Independent Spanning Trees in Maximal Planar Graphs. WG 2002: 235-245 - Patrick Healy, Nikola S. Nikolov:
Facets of the Directed Acyclic Graph Layering Polytope. WG 2002: 246-257 - Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG 2002: 258-269 - Hajime Ishihara, Bakhadyr Khoussainov:
Complexity of Some Infinite Games Played on Finite Graphs. WG 2002: 270-281 - Ton Kloks, Chuan-Min Lee, Jiping Liu:
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. WG 2002: 282-295 - Yehuda Koren, David Harel:
A Multi-scale Algorithm for the Linear Arrangement Problem. WG 2002: 296-309 - Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
On the b-Chromatic Number of Graphs. WG 2002: 310-320 - Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage. WG 2002: 321-332 - Sven Oliver Krumke, Diana Poensgen:
Online Call Admission in Optical Networks with Larger Demands. WG 2002: 333-344 - Isabella Lari, Federica Ricca, Andrea Scozzari:
The Forest Wrapping Problem on Outerplanar Graphs. WG 2002: 345-354
skipping 7 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-03-28 21:17 CET 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