![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- 2003
- Claudio Arbib
, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering. WG 2003: 23-33 - Lali Barrière, Pierre Fraigniaud, Nicola Santoro
, Dimitrios M. Thilikos:
Searching Is Not Jumping. WG 2003: 34-45 - Simon M. Becker, Bernhard Westfechtel:
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars. WG 2003: 46-57 - Anne Berry, Pinar Heggernes, Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process. WG 2003: 58-70 - Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Generalized Parametric Multi-terminal Flows Problem. WG 2003: 71-80 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92 - Paul S. Bonsma:
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. WG 2003: 93-105 - Franz-Josef Brandenburg:
Erratum: Cycles in Generalized Networks. WG 2003: 383 - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118 - Anna Bretscher, Derek G. Corneil, Michel Habib
, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130 - Hajo Broersma
, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. WG 2003: 131-142 - Paz Carmi, Thomas Erlebach, Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155 - Christian S. Collberg, Stephen G. Kobourov
, Edward Carter, Clark D. Thomborson
:
Graph-Based Approaches to Software Watermarking. WG 2003: 156-167 - Sabine Cornelsen, Dorothea Wagner:
Completely Connected Clustered Graphs. WG 2003: 168-179 - Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting. WG 2003: 180-191 - Vida Dujmovic, David R. Wood
:
Tree-Partitions of k-Trees with Applications in Graph Layout. WG 2003: 205-217 - Thomas Erlebach, Aris Pagourtzis, Katerina Potika
, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229 - Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto:
An Improved Upper Bound on the Crossing Number of the Hypercube. WG 2003: 230-236 - Michael R. Fellows:
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. WG 2003: 1-12 - Emilio Di Giacomo
, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve. WG 2003: 192-204 - Alexander Glikson, Johann A. Makowsky:
NCE Graph Grammars and Clique-Width. WG 2003: 237-248 - Martin Charles Golumbic, Marina Lipshteyn:
Chordal Probe Graphs. WG 2003: 249-260 - Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel
, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 - Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
:
On the Recognition of General Partition Graphs. WG 2003: 273-283 - Lukasz Kowalik:
Short Cycles in Planar Graphs. WG 2003: 284-296 - Jan Kratochvíl:
Complexity of Hypergraph Coloring and Seidel's Switching. WG 2003: 297-308 - Dieter Kratsch, Haiko Müller
, Ioan Todinca:
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321 - Asaf Levin
, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions. WG 2003: 322-333 - Paul D. Manuel
, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. WG 2003: 334-345 - Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem. WG 2003: 346-357
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-21 03: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