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 21 matches
- 2001
- Stefan Näher, Dorothea Wagner:
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1982, Springer 2001, ISBN 3-540-42512-8 [contents] - 2000
- Susanne Albers, Bianca Schröder:
An Experimental Study of Online Scheduling Algorithms. WAE 2000: 11-22 - Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches. WAE 2000: 51-62 - Javed A. Aslam, Alain Leblanc, Clifford Stein:
Clustering Data without Prior Knowledge. WAE 2000: 74-86 - Werner Backes, Susanne Wetzel:
Lattice Basis Reduction with Dynamic Approximation. WAE 2000: 63-73 - Jesper Bojesen, Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System. WAE 2000: 159-170 - Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. WAE 2000: 99-110 - Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE 2000: 147-158 - Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229 - Stefan Edelkamp, Patrick Stiegeler:
Pushing the Limits in Sequential Sorting. WAE 2000: 39-50 - Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE 2000: 195-206 - Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. WAE 2000: 171-182 - Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. WAE 2000: 123-134 - Isabelle Guérin Lassous, Jens Gustedt:
Portable List Ranking: An Experimental Study. WAE 2000: 111-122 - Annegret Liebers, Karsten Weihe:
Recognizing Bundles in Time Table Graphs - A Structural Approach. WAE 2000: 87-98 - Kurt Mehlhorn, Guido Schäfer:
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. WAE 2000: 23-38 - Guido Proietti:
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. WAE 2000: 207-217 - Peter Sanders, Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. WAE 2000: 135-146 - Jan Vahrenhold, Klaus H. Hinrichs:
Planar Point Location for Large Data Sets: To Seek or Not to Seek. WAE 2000: 183-194 - Karsten Weihe:
On the Differences between "Practical" and "Applied". WAE 2000: 1-10
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-04 18:24 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