Остановите войну!
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 52 matches
- 1999
- Claudio Arbib:
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs. Electron. Notes Discret. Math. 3: 2-6 (1999) - Ulrich Blasum, Winfried Hochstättler, Peter Oertel:
STEINER-Diagrams. Electron. Notes Discret. Math. 3: 13-18 (1999) - Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier:
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electron. Notes Discret. Math. 3: 19-26 (1999) - S. Brandt:
Triangle-free graphs without forbidden subgraphs. Electron. Notes Discret. Math. 3: 27 (1999) - Gunnar Brinkmann, Brendan D. McKay:
Fast generation of some classes of planar graphs. Electron. Notes Discret. Math. 3: 28-31 (1999) - Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser:
Fast generation of nanotube caps. Electron. Notes Discret. Math. 3: 32 (1999) - Victor Chepoi, Feodor F. Dragan:
A note on distance approximating trees in graphs. Electron. Notes Discret. Math. 3: 39 (1999) - Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth. Electron. Notes Discret. Math. 3: 33-38 (1999) - Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
On bounds for the rotation distance between binary coupling trees. Electron. Notes Discret. Math. 3: 40-44 (1999) - Corinne Feremans, Martine Labbé, Gilbert Laporte:
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. Electron. Notes Discret. Math. 3: 45-50 (1999) - Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks. Electron. Notes Discret. Math. 3: 230-234 (1999) - Miranca Fischermann, Lutz Volkmann:
Graphs having distance-n domination number half their order. Electron. Notes Discret. Math. 3: 51-54 (1999) - Juliane Greinus, Gunnar Brinkmann:
Patches with minimal boundary length. Electron. Notes Discret. Math. 3: 55-59 (1999) - Harald Gropp:
On triple systems, in particular those with 13 elements. Electron. Notes Discret. Math. 3: 60-64 (1999) - Yubao Guo, Jin Ho Kwak:
The cycle structure of regular multipartite tournaments. Electron. Notes Discret. Math. 3: 65-68 (1999) - Thomas Harmuth:
The enumeration of cubic maps with given genus and given face degrees. Electron. Notes Discret. Math. 3: 69-71 (1999) - Mark E. Hartmann, Özgür Özlük:
Solving the Traveling Circus Problem by Branch & Cut. Electron. Notes Discret. Math. 3: 72-76 (1999) - M. Hayer, Winfried Hochstättler:
Test Sets for Vertex Cover Problems. Electron. Notes Discret. Math. 3: 77-81 (1999) - Arne Hoffmann, Bert Randerath, Lutz Volkmann:
Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electron. Notes Discret. Math. 3: 82-85 (1999) - Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3: 86-89 (1999) - Sandi Klavzar, Uros Milutinovic, Ciril Petr:
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract). Electron. Notes Discret. Math. 3: 90-93 (1999) - Ton Kloks, Dieter Kratsch, Haiko Müller:
On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. 3: 94 (1999) - Ekkehard Köhler, Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electron. Notes Discret. Math. 3: 95-101 (1999) - Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Solving Frequency Assignment Problems via Tree-Decomposition1. Electron. Notes Discret. Math. 3: 102-105 (1999) - Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electron. Notes Discret. Math. 3: 106-109 (1999) - Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. Electron. Notes Discret. Math. 3: 110-113 (1999) - Jamel Lakhal, Luc Litzler:
An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs. Electron. Notes Discret. Math. 3: 114-117 (1999) - Van Bang Le:
Bipartite-Perfect Graphs. Electron. Notes Discret. Math. 3: 7-12 (1999) - Martin Lügering:
Provably Good Global Routing of Integrated Circuits. Electron. Notes Discret. Math. 3: 118-127 (1999) - Lilian Markenzon, N. Paciornik:
Equilateral Drawing of 2-Connected Planar Chordal Graphs. Electron. Notes Discret. Math. 3: 128-132 (1999)
skipping 22 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-27 16:29 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