default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 39 matches
- 2011
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241 - Ernst Althaus, Rouven Naujoks, Eike Thaden
:
A Column Generation Approach to Scheduling of Periodic Tasks. SEA 2011: 340-351 - Igor R. de Assis, Cid C. de Souza:
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs. SEA 2011: 304-314 - André Berger, Heiko Röglin, Ruben van der Zwaan:
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53 - Nieves R. Brisaboa, Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez-Prieto, Gonzalo Navarro:
Compressed String Dictionaries. SEA 2011: 136-147 - Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale:
Dynamic Arc-Flags in Road Networks. SEA 2011: 88-99 - Mojtaba Daryabari, Behrouz Minaei-Bidgoli, Hamid Parvin:
Localizing Program Logical Errors Using Extraction of Knowledge from Invariants. SEA 2011: 124-135 - Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387 - David Eppstein, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA 2011: 364-375 - Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende:
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data. SEA 2011: 410-420 - Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Changeover Cost Arborescences. SEA 2011: 112-123 - Robert Geisberger, Christian Vetter:
Efficient Routing in Road Networks with Turn Costs. SEA 2011: 100-111 - Marc Goerigk, Anita Schöbel:
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. SEA 2011: 181-192 - Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Online Dictionary Matching with Variable-Length Gaps. SEA 2011: 76-87 - Alexander Hein, Arie M. C. A. Koster:
An Experimental Evaluation of Treewidth at Most Four Reductions. SEA 2011: 218-229 - Stefan Heinz, Jens Schulz:
Explanations for the Cumulative Constraint: An Experimental Study. SEA 2011: 400-409 - Stelios Joannou, Rajeev Raman:
An Empirical Evaluation of Extendible Arrays. SEA 2011: 447-458 - Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner:
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303 - Michael Kaufmann, Stephan Kottler:
Beyond Unit Propagation in SAT Solving. SEA 2011: 267-279 - Lasse Kliemann:
Matching in Bipartite Graph Streams in a Small Number of Passes. SEA 2011: 254-266 - Spyros C. Kontogiannis, Paul G. Spirakis:
Approximability of Symmetric Bimatrix Games and Related Experiments. SEA 2011: 1-20 - Christos Koukouvinos, Dimitris E. Simos:
Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm. SEA 2011: 148-156 - Tina M. Kouri, Dinesh P. Mehta:
Improved Automated Reaction Mapping. SEA 2011: 157-168 - Weiqi Li:
A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem. SEA 2011: 65-75 - Dennis Luxen, Peter Sanders:
Hierarchy Decomposition for Faster User Equilibria on Road Networks. SEA 2011: 242-253 - Rafael Martinelli, Diego Pecin, Marcus Poggi, Humberto J. Longo:
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem. SEA 2011: 315-326 - Sascha Meinert, Dorothea Wagner:
Generating Time Dependencies in Road Networks. SEA 2011: 434-446 - Antonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan:
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. SEA 2011: 206-217 - Chandrashekhar Nagarajan, David P. Williamson:
An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms. SEA 2011: 169-180 - Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela:
Practical Compressed Document Retrieval. SEA 2011: 193-205
skipping 9 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-18 10:14 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
