Остановите войну!
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
- 2003
- Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Discrete models and algorithms for packet scheduling in smart antennas. Electron. Notes Discret. Math. 13: 1-4 (2003) - Stephan Dominique Andres:
The Game Chromatic Index of Forests of Maximum Degree 5. Electron. Notes Discret. Math. 13: 5-8 (2003) - Armen S. Asratian, Natalia Oksimets:
Pk+1-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases. Electron. Notes Discret. Math. 13: 9-13 (2003) - Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
A heuristic for large-scale p-median instances. Electron. Notes Discret. Math. 13: 14-17 (2003) - Paul S. Bonsma:
The Complexity of the Matching-cut Problem for Various Graph Classes. Electron. Notes Discret. Math. 13: 18-21 (2003) - Sandro Bosio, Giovanni Righini:
A combinatorial optimization problem arising from text classification. Electron. Notes Discret. Math. 13: 22-25 (2003) - Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger:
Preface: Volume 13. Electron. Notes Discret. Math. 13: 128 (2003) - A. Bumb, C. Hoede:
The standard set game of a cooperative game. Electron. Notes Discret. Math. 13: 26-29 (2003) - Massimiliano Caramia, Stefano Giordani:
A new graph model and heuristic algorithm for multi-mode task scheduling problem. Electron. Notes Discret. Math. 13: 30-33 (2003) - Márcia R. Cerioli:
Clique Graphs and Edge-clique graphs. Electron. Notes Discret. Math. 13: 34-37 (2003) - Paolo Detti, Carlo Meloni:
A channel state dependent scheduling in wireless communication systems. Electron. Notes Discret. Math. 13: 38-40 (2003) - Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda:
m_Path Cover Saturated Graphs. Electron. Notes Discret. Math. 13: 41-44 (2003) - Thomas Epping, Winfried Hochstättler:
Shortest paths through two-tone pairs. Electron. Notes Discret. Math. 13: 45-48 (2003) - Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online Matching On a Line. Electron. Notes Discret. Math. 13: 49-51 (2003) - Jutta Gebert, Martin Lätsch, Stefan Pickl, Gerhard-Wilhelm Weber, Röbbe Wünschiers:
Mathematical Modeling and Discrete Approximation in Evaluation and Forecasting of Expression-Data. Electron. Notes Discret. Math. 13: 52-56 (2003) - Harald Gropp:
The (r, 1)-designs with 13 points. Electron. Notes Discret. Math. 13: 57-60 (2003) - Peter Lennartz:
The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem. Electron. Notes Discret. Math. 13: 61-63 (2003) - Dmitrii Lozovanu, Stefan Pickl:
Polynomial Time Algorithms for Determining Optimal Strategies. Electron. Notes Discret. Math. 13: 64-68 (2003) - Francesco Maffioli, Norma Zagaglia Salvi:
On Some Properties of Base-matroids. Electron. Notes Discret. Math. 13: 69-70 (2003) - Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Karmarkar-Karp Differencing Method. Electron. Notes Discret. Math. 13: 71-75 (2003) - Henry Martyn Mulder, Ladislav Nebesky:
Signpost Systems and Their Underlying Graphs. Electron. Notes Discret. Math. 13: 76-80 (2003) - Tim Nieberg:
Distributed Algorithms in Wireless Sensor Networks. Electron. Notes Discret. Math. 13: 81-83 (2003) - Stavros D. Nikolopoulos, Charis Papadopoulos:
Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. 13: 84-92 (2003) - Arnaud Pêcher, Annegret Wagler:
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. Electron. Notes Discret. Math. 13: 93-96 (2003) - Werner Poguntke:
Using mincuts to design secret sharing schemes in graphs. Electron. Notes Discret. Math. 13: 97-102 (2003) - A. N. M. Salman, Haitze J. Broersma:
The Ramsey Numbers of Paths Versus Fans. Electron. Notes Discret. Math. 13: 103-107 (2003) - Frederik Stork, Marc Uetz:
Enumeration of Circuits and Minimal Forbidden Sets. Electron. Notes Discret. Math. 13: 108-111 (2003) - Hao Sun, Theo S. H. Driessen:
A Individually Marginalistic Value for Set Games on Matroids. Electron. Notes Discret. Math. 13: 112-116 (2003) - A. Toni:
Average Complexity of Addition Updates and Range Queries over an Array using Graphs. Electron. Notes Discret. Math. 13: 117-122 (2003) - Blaz Zmazek, Janez Zerovnik:
On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13: 123-127 (2003)
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-06-28 14:08 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