Остановите войну!
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
- 2001
- Said Sadique Adi, Carlos Eduardo Ferreira:
DNA Fragments Assembly Programs: a comparative study. Electron. Notes Discret. Math. 7: 158-161 (2001) - Liliana Alcón, Marisa Gutierrez:
Clique Planar Graphs. Electron. Notes Discret. Math. 7: 126-129 (2001) - Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck:
Dual Heuristics on the Exact Solution of Large Steiner Problems. Electron. Notes Discret. Math. 7: 150-153 (2001) - Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electron. Notes Discret. Math. 7: 42-45 (2001) - J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. Electron. Notes Discret. Math. 7: 174-177 (2001) - Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena:
Maximum flow problems under special nonnegative lower bounds on arc flows. Electron. Notes Discret. Math. 7: 66-69 (2001) - Gruia Calinescu, Cristina G. Fernandes:
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electron. Notes Discret. Math. 7: 194-197 (2001) - Manoel B. Campêlo, Claudio T. Bornstein:
Add/Drop Procedures for the Capacitated Plant Location Problem. Electron. Notes Discret. Math. 7: 102-105 (2001) - Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti:
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. Electron. Notes Discret. Math. 7: 166-169 (2001) - Stéphan Ceroi, Frédéric Havet:
Trees with three leaves are (n + l)-unavoidable. Electron. Notes Discret. Math. 7: 202-205 (2001) - Jaime Cohen:
A Graph Partitioning Scheme and Applications to Fault Tolerant Computing. Electron. Notes Discret. Math. 7: 82-85 (2001) - Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electron. Notes Discret. Math. 7: 22-25 (2001) - Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah:
Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms. Electron. Notes Discret. Math. 7: 134-137 (2001) - Milind Dawande, Jayant Kalagnanam, Jay Sethuraman:
Variable Sized Bin Packing With Color Constraints. Electron. Notes Discret. Math. 7: 154-157 (2001) - Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Stable marriages with restricted pairs. Electron. Notes Discret. Math. 7: 14-17 (2001) - Benjamin Doerr, Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. 7: 78-81 (2001) - Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Electron. Notes Discret. Math. 7: 18-21 (2001) - Antonio Fernández, Tom Leighton, José Luis López-Presa:
Containment Properties of Product and Power Graphs. Electron. Notes Discret. Math. 7: 46-49 (2001) - Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7: 26-29 (2001) - Zhicheng Gao, Jianyu Wang:
Exact Enumeration of Rooted 3-connected Triangular Maps on the Projective Plane (Extended Abstract). Electron. Notes Discret. Math. 7: 30-33 (2001) - A. Goldman, Christophe Rapine:
Scheduling with Duplication on m Processors with Small Communication Delays. Electron. Notes Discret. Math. 7: 182-185 (2001) - Vince Grolmusz:
Constructive Upper Bounds for Intersecting Set Systems. Electron. Notes Discret. Math. 7: 54-57 (2001) - Marisa Gutierrez, Joao Meidanis:
The Clique Operator, Set Families, and Their Properties. Electron. Notes Discret. Math. 7: 94-97 (2001) - Toru Hasunuma:
Independent spanning cycle-rooted trees in the cartesian product of digraphs. Electron. Notes Discret. Math. 7: 106-109 (2001) - Ryan B. Hayward, William J. Lenhart:
Perfectly Orderable P4 Composition. Electron. Notes Discret. Math. 7: 190-193 (2001) - Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. Electron. Notes Discret. Math. 7: 98-101 (2001) - David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan:
An O(n2) Algorithm for the Characteristic Polynomial of a Tree. Electron. Notes Discret. Math. 7: 86-89 (2001) - Jesper Jansson:
On the Complexity of Inferring Rooted Evolutionary Trees. Electron. Notes Discret. Math. 7: 50-53 (2001) - Jeong Han Kim:
Nearly Optimal Partial Steiner Systems. Electron. Notes Discret. Math. 7: 74-77 (2001) - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Electron. Notes Discret. Math. 7: 110-113 (2001)
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-06-06 14:02 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