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 68 matches
- 2011
- Pablo Adasme, Abdel Lisser, Ismael Soto:
A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks. Electron. Notes Discret. Math. 37: 69-74 (2011) - Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete:
On the facets of the lift-and-project relaxations of graph subdivisions. Electron. Notes Discret. Math. 37: 201-206 (2011) - Liliana Alcón:
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs. Electron. Notes Discret. Math. 37: 81-86 (2011) - Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
Polynomial instances of the Packing Coloring Problem. Electron. Notes Discret. Math. 37: 363-368 (2011) - Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37: 141-146 (2011) - Rafael Ayala, Desamparados Fernández-Ternero, José Antonio Vilches:
A graph-theoretical approach to cancelling critical elements. Electron. Notes Discret. Math. 37: 285-290 (2011) - Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37: 9-14 (2011) - Hernán Berinsky, Paula Zabala:
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. Electron. Notes Discret. Math. 37: 273-278 (2011) - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. Electron. Notes Discret. Math. 37: 189-194 (2011) - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Near-perfect graphs with polyhedral N+(G). Electron. Notes Discret. Math. 37: 393-398 (2011) - Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Electron. Notes Discret. Math. 37: 327-332 (2011) - Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 37: 1-2 (2011) - Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Mouny Samy Modeliar:
Efficient Constraint Propagation for Graph Coloring. Electron. Notes Discret. Math. 37: 243-248 (2011) - Mónica Braga, Javier Marenco:
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope. Electron. Notes Discret. Math. 37: 213-218 (2011) - Letícia Rodrigues Bueno, Celina M. H. de Figueiredo, Luérbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen:
Hamiltonian Cycles in Kneser Graphs for n=2k+2. Electron. Notes Discret. Math. 37: 291-296 (2011) - Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Restricted coloring problems on graphs with few P'4s. Electron. Notes Discret. Math. 37: 57-62 (2011) - Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. Electron. Notes Discret. Math. 37: 297-302 (2011) - Pablo De Caria:
The difference between clique graphs and iterated clique graphs. Electron. Notes Discret. Math. 37: 39-44 (2011) - Pablo De Caria, Marisa Gutierrez:
Comparing trees characteristic to chordal and dually chordal graphs. Electron. Notes Discret. Math. 37: 33-38 (2011) - Serafino Cicerone:
Characterizations of Graphs with Stretch Number less than 2. Electron. Notes Discret. Math. 37: 375-380 (2011) - Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37: 51-56 (2011) - Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. Electron. Notes Discret. Math. 37: 207-212 (2011) - Diego Delle Donne, Guillermo Durán, Javier Marenco:
Solving the segmentation problem for the 2010 Argentine census with integer programming. Electron. Notes Discret. Math. 37: 279-284 (2011) - Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe:
Forbidden subgraphs and the Kőnig property. Electron. Notes Discret. Math. 37: 333-338 (2011) - Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Probe interval and probe unit interval graphs on superclasses of cographs. Electron. Notes Discret. Math. 37: 339-344 (2011) - Mariana S. Escalante, Javier L. Marenco, María del Carmen Varaldo:
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs. Electron. Notes Discret. Math. 37: 261-266 (2011) - Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi:
Selfish Square Packing. Electron. Notes Discret. Math. 37: 369-374 (2011) - Cristina G. Fernandes, Maya Stein:
Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. 37: 351-356 (2011) - Carlos Eduardo Ferreira, Alexandre S. Freire, G. A. Puglia:
A dynamic programming algorithm for the tree mapping problem. Electron. Notes Discret. Math. 37: 147-152 (2011) - Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37: 87-92 (2011)
skipping 38 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-09-27 06:05 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