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 17 matches
- 1999
- Hans L. Bodlaender:
A note on domino treewidth. Discret. Math. Theor. Comput. Sci. 3(4): 141-150 (1999) - Peter Bürgisser:
On the Structure of Valiant's Complexity Classes. Discret. Math. Theor. Comput. Sci. 3(3): 73-94 (1999) - Nathalie Caspard:
A characterization for all interval doubling schemes of the lattice of permutations. Discret. Math. Theor. Comput. Sci. 3(4): 177-188 (1999) - Elisha Falbel, Pierre-Vincent Koseleff:
The Number of Sides of a Parallelogram. Discret. Math. Theor. Comput. Sci. 3(2): 33-42 (1999) - Anna E. Frid:
Applying a uniform marked morphism to a word. Discret. Math. Theor. Comput. Sci. 3(3): 125-140 (1999) - Manfred Göbel:
Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order. Discret. Math. Theor. Comput. Sci. 3(2): 65-70 (1999) - Ralf Hinze:
Polytypic Functions Over Nested Datatypes. Discret. Math. Theor. Comput. Sci. 3(4): 193-214 (1999) - Charles Knessl, Wojciech Szpankowski:
Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. 3(2): 43-64 (1999) - Daniel Krob, Christoph Meinel, Michel Morvan:
Editors foreword - Selected papers from STACS 1998. Discret. Math. Theor. Comput. Sci. 3(3): 71-72 (1999) - Kim S. Larsen:
Partially persistent search trees with transcript operations. Discret. Math. Theor. Comput. Sci. 3(3): 95-107 (1999) - Keqin Li:
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks. Discret. Math. Theor. Comput. Sci. 3(4): 155-166 (1999) - Andrzej Proskurowski, Jan Arne Telle:
Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. 3(4): 167-176 (1999) - Aaron Robertson:
Permutations Containing and Avoiding 123 and 132 Patterns. Discret. Math. Theor. Comput. Sci. 3(4): 151-154 (1999) - Thomas Schwentick, Klaus Barthelmann:
Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discret. Math. Theor. Comput. Sci. 3(3): 109-124 (1999) - Herbert S. Wilf:
Accelerated series for universal constants, by the WZ method. Discret. Math. Theor. Comput. Sci. 3(4): 189-192 (1999) - 1998
- Ulrik Brandes, Dagmar Handke:
NP-Completeness Results for Minimum Planar Spanners. Discret. Math. Theor. Comput. Sci. 3(1): 1-10 (1998) - Christian Krattenthaler:
An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula. Discret. Math. Theor. Comput. Sci. 3(1): 11-32 (1998)
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-19 00:44 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