Остановите войну!
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
- 2004
- Néstor E. Aguilera, Valeria A. Leoni:
Characterizations of Postman Sets. Electron. Notes Discret. Math. 18: 5-10 (2004) - Liliana Alcón:
Clique-Critical Graphs. Electron. Notes Discret. Math. 18: 11-15 (2004) - Liliana Alcón, Celina M. H. de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis:
Tree Loop Graphs. Electron. Notes Discret. Math. 18: 17-23 (2004) - Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. Electron. Notes Discret. Math. 18: 25-30 (2004) - Juan Manuel Barrionuevo, Aureliano Calvo, Guillermo Durán, Fábio Protti:
New advances about a conjecture on Helly circle graphs. Electron. Notes Discret. Math. 18: 31-36 (2004) - Ivo Blöchliger:
Color-blind Graphs and Suboptimal Colorings. Electron. Notes Discret. Math. 18: 37-40 (2004) - Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
Computational complexity of edge modification problems in different classes of graphs. Electron. Notes Discret. Math. 18: 41-46 (2004) - C. N. Campos, Célia Picinin de Mello:
A result on the total colouring of powers of cycles. Electron. Notes Discret. Math. 18: 47-52 (2004) - Héctor Cancela, Louis Petingi:
Domination Invariant of a Diameter Constrained Network Reliability Model. Electron. Notes Discret. Math. 18: 53-58 (2004) - Héctor Cancela, Franco Robledo, Gerardo Rubino:
A GRASP algorithm with RNN based local search for designing a WAN access network. Electron. Notes Discret. Math. 18: 59-65 (2004) - Alfredo Candia-Véjar, Hugo Bravo-Azlán:
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks. Electron. Notes Discret. Math. 18: 67-72 (2004) - Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electron. Notes Discret. Math. 18: 73-79 (2004) - Frédéric Chavanon, Eric Rémila:
Rhombus tilings: decomposition and space structure: (extended abstract). Electron. Notes Discret. Math. 18: 81-87 (2004) - José R. Correa:
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations. Electron. Notes Discret. Math. 18: 89-95 (2004) - Maria Patricia Dobson, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
Treelike Comparability Graphs. Electron. Notes Discret. Math. 18: 97-102 (2004) - Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Clique-independent sets of Helly circular-arc graphs. Electron. Notes Discret. Math. 18: 103-108 (2004) - Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
On minimal N+- rank graphs. Electron. Notes Discret. Math. 18: 109-114 (2004) - Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo:
Note on Lift-and-Project Ranks and Antiblocker Duality. Electron. Notes Discret. Math. 18: 115-119 (2004) - Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi:
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18: 121-126 (2004) - Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some Formulations for the Group Steiner Tree Problem. Electron. Notes Discret. Math. 18: 127-132 (2004) - Hans L. Fetter:
Multiple hamiltonian covers. Electron. Notes Discret. Math. 18: 133-137 (2004) - Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales:
On Clique-inverse graphs of Kp-free graphs. Electron. Notes Discret. Math. 18: 139-143 (2004) - David Hartvigsen:
1-restricted Simple 2-matchings: (Extended Abstract). Electron. Notes Discret. Math. 18: 145-149 (2004) - Gonzalo Hernández, Luis Salinas:
Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs. Electron. Notes Discret. Math. 18: 151-156 (2004) - Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau:
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC. Electron. Notes Discret. Math. 18: 157-163 (2004) - Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a cograph by modular decomposition. Electron. Notes Discret. Math. 18: 165-169 (2004) - Thomas M. Liebling, Guillermo Durán, Martín Matamala:
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004. Electron. Notes Discret. Math. 18: 1-4 (2004) - C. M. R. R. Lima, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg:
A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. Electron. Notes Discret. Math. 18: 171-176 (2004) - Javier Marenco, Annegret Wagler:
Combinatorial equivalence of Chromatic Scheduling Polytopes. Electron. Notes Discret. Math. 18: 177-180 (2004) - Silvia Mazzeo, Irene Loiseau:
An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electron. Notes Discret. Math. 18: 181-186 (2004)
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-07-31 08:30 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