Остановите войну!
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 34 matches
- 2008
- Ilya Averbouch, Benny Godlin, Johann A. Makowsky:
A Most General Edge Elimination Polynomial. WG 2008: 31-42 - Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. WG 2008: 43-54 - Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The Valve Location Problem in Simple Network Topologies. WG 2008: 55-65 - Paul S. Bonsma, Florian Zickfeld:
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. WG 2008: 66-77 - Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Pseudo-achromatic Number Problem. WG 2008: 78-89 - Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini:
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. WG 2008: 1-13 - Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286 - Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca:
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100 - Marek Cygan, Marcin Pilipczuk:
Faster Exact Bandwidth. WG 2008: 101-109 - Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang:
Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121 - Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov:
Upward Straight-Line Embeddings of Directed Graphs into Point Sets. WG 2008: 122-133 - Jirí Fiala, Petr A. Golovach:
Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145 - J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. WG 2008: 146-158 - Fabrizio Frati:
A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170 - Leszek Gasieniec, Tomasz Radzik:
Memory Efficient Anonymous Graph Exploration. WG 2008: 14-29 - Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. WG 2008: 171-182 - Benny Godlin, Tomer Kotek, Johann A. Makowsky:
Evaluations of Graph Polynomials. WG 2008: 183-194 - Petr A. Golovach, Yngve Villanger:
Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205 - Martin Grohe:
Algorithmic Meta Theorems. WG 2008: 30 - Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo:
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. WG 2008: 206-217 - Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229 - Vít Jelínek:
The Rank-Width of the Square Grid. WG 2008: 230-239 - Joachim Kneis, Alexander Langer, Peter Rossmanith:
Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251 - Pascal Koiran, Klaus Meer:
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG 2008: 252-263 - Athanassios Koutsonas, Dimitrios M. Thilikos:
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. WG 2008: 264-274 - Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. WG 2008: 336-347 - Dániel Marx, Ildikó Schlotter:
Parameterized Graph Cleaning Problems. WG 2008: 287-299 - Xavier Muñoz, Ignasi Sau:
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG 2008: 300-311 - Nicolas Nisse, Karol Suchan:
Fast Robber in Planar Graphs. WG 2008: 312-323 - Yahav Nussbaum:
From a Circular-Arc Model to a Proper Circular-Arc Model. WG 2008: 324-335
skipping 4 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-07-02 01:05 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