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 28 matches
- 2005
- Amihood Amir, Gad M. Landau:
Foreword. Discret. Appl. Math. 146(2): 123 (2005) - Derek E. Armstrong, Sheldon H. Jacobson:
Data-independent neighborhood functions and strict local optima. Discret. Appl. Math. 146(3): 233-243 (2005) - Jørgen Bang-Jensen, Morten Hegner Nielsen:
Finding complementary cycles in locally semicomplete digraphs. Discret. Appl. Math. 146(3): 245-256 (2005) - Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. 146(1): 27-42 (2005) - Gary Benson:
Tandem cyclic alignment. Discret. Appl. Math. 146(2): 124-133 (2005) - Anne Bergeron:
A very elementary presentation of the Hannenhalli-Pevzner theory. Discret. Appl. Math. 146(2): 134-145 (2005) - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Hamiltonian colorings of graphs. Discret. Appl. Math. 146(3): 257-272 (2005) - Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera:
On approximating the b-chromatic number. Discret. Appl. Math. 146(1): 106-110 (2005) - Erzsébet Csuhaj-Varjú, Jürgen Dassow:
A remark on evolutionary systems. Discret. Appl. Math. 146(1): 111-115 (2005) - Igor Dolinka:
A note on identities of two-dimensional languages. Discret. Appl. Math. 146(1): 43-50 (2005) - Andreas W. M. Dress, Barbara R. Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff:
Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. Discret. Appl. Math. 146(1): 51-73 (2005) - Aviezri S. Fraenkel, Jamie Simpson:
An extension of the periodicity lemma to longer periods. Discret. Appl. Math. 146(2): 146-155 (2005) - John P. Georges, David W. Mauro:
A note on collections of graphs with non-surjective lambda labelings. Discret. Appl. Math. 146(1): 92-98 (2005) - Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. 146(2): 156-179 (2005) - Shmuel Tomi Klein, Yair Wiseman:
Parallel Lempel Ziv coding. Discret. Appl. Math. 146(2): 180-191 (2005) - Wieslaw Kubiak:
Minimization of ordered, symmetric half-products. Discret. Appl. Math. 146(3): 287-300 (2005) - Peter Leupold, Carlos Martín-Vide, Victor Mitrana:
Uniformly bounded duplication languages. Discret. Appl. Math. 146(3): 301-310 (2005) - Shun-Shii Lin, Chung-Liang Wei:
Optimal algorithms for constructing knight's tours on arbitrary n?m chessboards. Discret. Appl. Math. 146(3): 219-232 (2005) - Vadim V. Lozin, Raffaele Mosca:
Independent sets in extensions of 2K2-free graphs. Discret. Appl. Math. 146(1): 74-80 (2005) - Daniel Meister:
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discret. Appl. Math. 146(3): 193-218 (2005) - Anna Palbom:
Complexity of the directed spanning cactus problem. Discret. Appl. Math. 146(1): 81-91 (2005) - Amine El Sahili:
A characterization problem on underlying graphs of line digraphs. Discret. Appl. Math. 146(1): 99-101 (2005) - Hanif D. Sherali, J. Cole Smith:
A class of web-based facets for the generalized vertex packing problem. Discret. Appl. Math. 146(3): 273-286 (2005) - George Steiner, Zhihui Xue:
The maximum traveling salesman problem on van der Veen matrices. Discret. Appl. Math. 146(1): 1-2 (2005) - Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
A hypocoloring model for batch scheduling. Discret. Appl. Math. 146(1): 3-26 (2005) - Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno:
On sequential diagnosis of multiprocessor systems. Discret. Appl. Math. 146(3): 311-342 (2005) - Sheng-Liang Yang:
On the LU factorization of the Vandermonde matrix. Discret. Appl. Math. 146(1): 102-105 (2005) - V. Yugandhar, Sanjeev Saxena:
Parallel algorithms for separable permutations. Discret. Appl. Math. 146(3): 343-364 (2005)
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-10-20 11: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