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 19 matches
- 2002
- R. Julian R. Abel, Frank E. Bennett, Gennian Ge:
Almost resolvable perfect Mendelsohn designs with block size five. Discret. Appl. Math. 116(1-2): 1-15 (2002) - Esther M. Arkin, Refael Hassin:
A note on orientations of mixed graphs. Discret. Appl. Math. 116(3): 271-278 (2002) - József Balogh, Béla Bollobás, David Weinreich:
Measures on monotone properties of graphs. Discret. Appl. Math. 116(1-2): 17-36 (2002) - Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann:
Uniform emulations of Cartesian-product and Cayley graphs. Discret. Appl. Math. 116(1-2): 37-54 (2002) - Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser:
A constructive enumeration of nanotube cap. Discret. Appl. Math. 116(1-2): 55-71 (2002) - Rostislav Caha, Václav Koubek:
Optimal embeddings of odd ladders into a hypercube. Discret. Appl. Math. 116(1-2): 73-102 (2002) - Katarína Cechlárová:
On the complexity of exchange-stable roommates. Discret. Appl. Math. 116(3): 279-287 (2002) - Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh:
Domination in distance-hereditary graphs. Discret. Appl. Math. 116(1-2): 103-113 (2002) - Gary Chartrand, John Frederick Fink, Ping Zhang:
Convexity in oriented graphs. Discret. Appl. Math. 116(1-2): 115-126 (2002) - Andrzej Czygrinow:
Partitioning problems in dense hypergraphs. Discret. Appl. Math. 116(3): 179-191 (2002) - Elias Dahlhaus:
Minimal elimination ordering for graphs of bounded degree. Discret. Appl. Math. 116(1-2): 127-143 (2002) - Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart:
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116(1-2): 145-159 (2002) - Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic:
The vehicle routing problem with pickups and deliveries on some special graphs. Discret. Appl. Math. 116(3): 193-229 (2002) - Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi:
Rearrangement of DNA fragments: a branch-and-cut algorithm. Discret. Appl. Math. 116(1-2): 161-177 (2002) - Joan Gimbert, Yaokun Wu:
The underlying line digraph structure of some (0, 1)-matrix equations. Discret. Appl. Math. 116(3): 289-296 (2002) - Juha Honkala:
On infinite words generated by polynomial D0L systems. Juha Honkala. Discret. Appl. Math. 116(3): 297-305 (2002) - Frank K. Hwang, Wenan Zang:
Group testing and fault detection for replicated files. Discret. Appl. Math. 116(3): 231-242 (2002) - Aristide Mingozzi, Serena Morigi:
Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. Discret. Appl. Math. 116(3): 243-260 (2002) - Aleksander Vesel:
Recognizing pseudo-median graphs. Discret. Appl. Math. 116(3): 261-269 (2002)
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-21 15:17 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