Остановите войну!
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 30 matches
- 2001
- Hans-Jürgen Bandelt:
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. WG 2001: 1-7 - Sergei L. Bezrukov, Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. WG 2001: 9-20 - Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31 - Maw-Shang Chang, Ton Kloks, Chuan-Min Lee:
Maximum Clique Transversals. WG 2001: 32-43 - Maw-Shang Chang, Haiko Müller:
On the Tree-Degree of Graphs. WG 2001: 44-54 - Jianer Chen, Iyad A. Kanj:
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65 - Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano:
(k, +)-Distance-Hereditary Graphs. WG 2001: 66-77 - Derek G. Corneil, Udi Rotics:
On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90 - Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner:
Planarity of the 2-Level Cactus Model. WG 2001: 91-102 - Feodor F. Dragan:
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. WG 2001: 103-116 - Wolfgang Espelage, Frank Gurski, Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG 2001: 117-128 - Haodi Feng:
(g, f)-Factorizations Orthogonal to k Subgraphs. WG 2001: 129-139 - Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs. WG 2001: 140-153 - Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165 - Fedor V. Fomin, Hans L. Bodlaender:
Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176 - Fedor V. Fomin, Dimitrios M. Thilikos:
On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188 - Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth:
Multiple Hotlink Assignment. WG 2001: 189-200 - Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216 - Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228 - Friedhelm Meyer auf der Heide:
Invited Presentation: Data Management in Networks. WG 2001: 8 - Öjvind Johansson:
log n-Approximative NLCk-Decomposition in O(n2k+1) Time. WG 2001: 229-240 - Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart:
On Subfamilies of AT-Free Graphs. WG 2001: 241-253 - Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262 - Van Bang Le, Bert Randerath:
On Stable Cutsets in Line Graphs. WG 2001: 263-271 - Eunseuk Oh, Jianer Chen:
On Strong Menger-Connectivity of Star Graphs. WG 2001: 272-283 - Maurizio Patrignani, Maurizio Pizzonia:
The Complexity of the Matching-Cut Problem. WG 2001: 284-295 - Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs. WG 2001: 296-305 - Antonio Puricella, Iain A. Stewart:
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. WG 2001: 306-316 - Annegret Wagler:
Critical and Anticritical Edges in Perfect Graphs. WG 2001: 317-328 - Andreas Brandstädt, Van Bang Le:
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2204, Springer 2001, ISBN 3-540-42707-4 [contents]
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-06 18:41 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