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 36 matches
- 1999
- Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. WADS 1999: 181-192 - Artur Andrzejak, Komei Fukuda:
Optimization over k-set Polytopes and Efficient k-set Enumeration. WADS 1999: 1-12 - Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 - Gill Barequet, Prosenjit Bose, Matthew Dickerson:
Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS 1999: 62-73 - Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III:
2-Point Site Voronoi Diagrams. WADS 1999: 219-230 - Michael A. Bender, Chandra Chekuri:
Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS 1999: 80-85 - David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman:
Representing Trees of Higer Degree. WADS 1999: 169-180 - Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky:
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. WADS 1999: 25-36 - Sergei Bespamyatnikh, Klara Kedem, Michael Segal:
Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329 - Sergei Bespamyatnikh, Michael Segal:
Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287 - Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Balls. WADS 1999: 145-156 - Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79 - Christoph A. Bröcker, Alejandro López-Ortiz:
Position-Independent Street Searching. WADS 1999: 241-252 - Christoph A. Bröcker, Sven Schuierer:
Searching Rectilinear Streets Completely. WADS 1999: 98-109 - Gerth Stølting Brodal, Rolf Fagerberg:
Dynamic Representation of Sparse Graphs. WADS 1999: 342-351 - Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick:
Resizable Arrays in Optimal Time and Space. WADS 1999: 37-48 - Samarjit Chakraborty, Somenath Biswas:
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. WADS 1999: 253-264 - Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang:
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. WADS 1999: 231-240 - Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305 - Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian:
Robot Map Verification of a Graph World. WADS 1999: 86-97 - Michael T. Goodrich, John G. Kloss II:
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. WADS 1999: 205-216 - Dan Gusfield, Charles U. Martel:
Tresholds for Sports Elimination Numbers Algorithms and Complexity. WADS 1999: 330-341 - Claudia Iturriaga, Anna Lubiw:
Elastic Labels Around the Perimeter of a Map. WADS 1999: 306-317 - Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. WADS 1999: 110-121 - S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom:
On an Optimal Split Tree Problem. WADS 1999: 157-168 - Won-Sook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann:
Generating 3D Virtual Populations from Pictures of a Few Individuals. WADS 1999: 134-144 - Charles E. Leiserson:
Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). WADS 1999: 55 - Tamás Lukovszki:
New Results of Fault Tolerant Geometric Spanners. WADS 1999: 193-204 - Gabriele Neyer:
Line Simplification with Restricted Orientations. WADS 1999: 13-24 - Rasmus Pagh:
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. WADS 1999: 49-54
skipping 6 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-12-25 12:37 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