Остановите войну!
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
- 2001
- Jørgen Bang-Jensen, Anders Yeo:
Making a tournament k-arc-strong by reversing arcs. Electron. Notes Discret. Math. 8: 2-5 (2001) - Anne Berry, Jean Paul Bordat:
Moplex elimination orderings. Electron. Notes Discret. Math. 8: 6-9 (2001) - Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader:
Strongly Connected Components can Predict Protein Structure. Electron. Notes Discret. Math. 8: 10-13 (2001) - Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Electron. Notes Discret. Math. 8: 98-101 (2001) - Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl:
Preface: Volume 8. Electron. Notes Discret. Math. 8: 1 (2001) - Tiziana Calamoneri, Rossella Petreschi:
LD-Coloring of Regular Tiling (Extended Abstract). Electron. Notes Discret. Math. 8: 18-21 (2001) - Stéphan Ceroi:
Clique number and ball containment number of unit ball graphs. Electron. Notes Discret. Math. 8: 22-25 (2001) - Benjamin Doerr, Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. 8: 27-30 (2001) - A. F. Dumb, Walter Kern:
A simple dual ascent algorithm for the multilevel facility location problem. Electron. Notes Discret. Math. 8: 14-17 (2001) - Thomas Epping, Winfried Hochstättler, Peter Oertel:
Some Results on a Paint Shop Problem for Words. Electron. Notes Discret. Math. 8: 31-33 (2001) - Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Extending Partial Suborders. Electron. Notes Discret. Math. 8: 34-37 (2001) - Irene Finocchi, Rossella Petreschi:
Tree partitioning via vertex deletion. Electron. Notes Discret. Math. 8: 38-41 (2001) - Harald Gropp:
Nonsymmetric configurations with line sizek=4. Electron. Notes Discret. Math. 8: 42-45 (2001) - V. S. Izhutkin, A. A. Sushenzov:
Study of Methods of Nonlinear Optimization Using Computer Means. Electron. Notes Discret. Math. 8: 106-110 (2001) - Lars Kaderali, Alexander Schliep:
A new Algorithm for Accelerating Pair-Wise Computations of Melting Temperature. Electron. Notes Discret. Math. 8: 46-49 (2001) - M. Kloock:
Factorization as a SAT problem. Electron. Notes Discret. Math. 8: 50-53 (2001) - Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel:
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8: 54-57 (2001) - Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. Electron. Notes Discret. Math. 8: 128-132 (2001) - Dmitrii Lozovanu:
Discrete optimal control problems and dynamic games with p players. Electron. Notes Discret. Math. 8: 58-61 (2001) - Michal Malafiejski:
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs. Electron. Notes Discret. Math. 8: 62 (2001) - Carlo Meloni:
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. Electron. Notes Discret. Math. 8: 26 (2001) - Sounaka Mishra, Kripasindhu Sikdar:
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract). Electron. Notes Discret. Math. 8: 63-66 (2001) - M. M. Ibrahim Mohamed, B. Tawfik:
A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear Steiner Minimal Tree. Electron. Notes Discret. Math. 8: 102-105 (2001) - Angela Niciilitsa, Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular and uniquely colorable mixed hypergraphs. Electron. Notes Discret. Math. 8: 115-118 (2001) - Stavros D. Nikolopoulos:
Hamiltonian Cycles in Quasi-threshold Graphs. Electron. Notes Discret. Math. 8: 67 (2001) - Gianpaolo Oriolo:
Clique Covers in Claw-Free Berge Graphs. Electron. Notes Discret. Math. 8: 68-71 (2001) - Stefan Pickl:
Combinatorial Structures of Max-Type Functions characterizing the Optimal Solution of the Equivalence Problem. Electron. Notes Discret. Math. 8: 72-75 (2001) - Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8: 76-79 (2001) - Stefan Porschen:
On Covering Z-Grid Points by Rectangles. Electron. Notes Discret. Math. 8: 80-83 (2001) - Bert Randerath, Ingo Schiermeyer:
3-Colorability element oF P for p6-free Graphs. Electron. Notes Discret. Math. 8: 85-89 (2001)
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-05-31 04:25 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