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
- 2006
- Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20 - Tetsuo Asano:
Computational Geometric and Combinatorial Approaches to Digital Halftoning. CATS 2006: 3 - Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos:
Greedy algorithms for on-line set-covering and related problems. CATS 2006: 145-151 - Jacek Blazewicz, Marta Kasprzak:
On the complexity of the DNA Simplified Partial Digest Problem. CATS 2006: 93-100 - Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105 - James Harland:
The Busy Beaver, the Placid Platypus and other Crazy Creatures. CATS 2006: 79-86 - Toro Hasunuma:
Multilayer Grid Embeddings of Iterated Line Digraphs. CATS 2006: 21-26 - Brian Herlihy, Peter Schachte, Harald Søndergaard:
Boolean equation solving as graph traversal. CATS 2006: 123-132 - Andrei V. Kelarev:
A Polynomial Algorithm for Codes Based on Directed Graphs. CATS 2006: 87-92 - Rafal Kolanski, Gerwin Klein:
Formalising the L4 microkernel API. CATS 2006: 53-68 - Shuai Cheng Li:
Faster Algorithms for Finding Missing Patterns. CATS 2006: 107-111 - Sebastian Link:
On the Logical Implication of Multivalued Dependencies with Null Values. CATS 2006: 113-122 - Chung Keung Poon, Feifeng Zheng, Yinfeng Xu:
On-demand Bounded Broadcast Scheduling with Tight Deadlines. CATS 2006: 139-143 - M. R. K. Krishna Rao:
Learnability of Term Rewrite Systems from Positive Examples. CATS 2006: 133-137 - Ando Saabas, Tarmo Uustalu:
Compositional Type Systems for Stack-Based Low-Level Languages. CATS 2006: 27-39 - Michiel H. M. Smid:
Geometric spanners with few edges and degree five. CATS 2006: 7-9 - Tadao Takaoka, Stephen Violich:
Combinatorial Generation by Fusing Loopless Algorithms. CATS 2006: 69-77 - Ye Henry Tian:
Mechanically Verifying Correctness of CPS Compilation. CATS 2006: 41-51 - Joachim Gudmundsson, C. Barry Jay:
Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. CRPIT 51, Australian Computer Society 2006, ISBN 1-920682-33-3 [contents]
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-12-28 08:19 CET 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