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 26 matches
- 2016
- Johannes Bader, Simon Gog, Matthias Petri:
Practical Variable Length Gap Pattern Matching. SEA 2016: 1-16 - Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Exact Computation of Isochrones in Road Networks. SEA 2016: 17-32 - Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. SEA 2016: 33-49 - Henrique Becker, Luciana S. Buriol:
UKP5: A New Algorithm for the Unbounded Knapsack Problem. SEA 2016: 50-62 - Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. SEA 2016: 63-74 - Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbcík:
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. SEA 2016: 75-88 - Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben:
Compact Flow Diagrams for State Sequences. SEA 2016: 89-104 - Joshimar Cordova, Gonzalo Navarro:
Practical Dynamic Entropy-Compressed Bitvectors with Applications. SEA 2016: 105-117 - Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. SEA 2016: 118-133 - Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. SEA 2016: 339-352 - Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - Jyrki Katajainen:
Worst-Case-Efficient Dynamic Arrays in Practice. SEA 2016: 167-183 - Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias:
On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors. SEA 2016: 184-200 - Taito Lee, Shuhei Denzumi, Kunihiko Sadakane:
Engineering Hybrid DenseZDDs. SEA 2016: 201-216 - Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke:
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry. SEA 2016: 353-368 - Stephan Sloth Lorenzen, Pawel Winter:
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances. SEA 2016: 217-230 - Mehrdad Niknami, Samitha Samaranayake:
Tractable Pathfinding for the Stochastic On-Time Arrival Problem. SEA 2016: 231-245 - Matthias Poloczek, David P. Williamson:
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. SEA 2016: 246-261 - Zhen Qiu, Clifford Stein, Yuan Zhong:
Experimental Analysis of Algorithms for Coflow Scheduling. SEA 2016: 262-277 - Nourhan Sakr, Cliff Stein:
An Empirical Study of Online Packet Scheduling Algorithms. SEA 2016: 278-293 - Peter Sanders, Christian Schulz:
Advanced Multilevel Node Separator Algorithms. SEA 2016: 294-309 - Julien Subercaze, Christophe Gravier, Pierre-Olivier Rocher:
A Merging Heuristic for the Rectangle Decomposition of Binary Matrices. SEA 2016: 310-325 - Daniel Valenzuela:
CHICO: A Compressed Hybrid Index for Repetitive Collections. SEA 2016: 326-338 - Chun-Nam Yu, Michael S. Crouch, Ruichuan Chen, Alessandra Sala:
Online Algorithm for Approximate Quantile Queries on Sliding Windows. SEA 2016: 369-384 - Andrew V. Goldberg, Alexander S. Kulikov:
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings. Lecture Notes in Computer Science 9685, Springer 2016, ISBN 978-3-319-38850-2 [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-10-07 08: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