default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th SEA 2016: St. Petersburg, Russia
- 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 - Johannes Bader
, Simon Gog, Matthias Petri:
Practical Variable Length Gap Pattern Matching. 1-16 - Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Exact Computation of Isochrones in Road Networks. 17-32 - Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. 33-49 - Henrique Becker, Luciana S. Buriol:
UKP5: A New Algorithm for the Unbounded Knapsack Problem. 50-62 - Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. 63-74 - Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbcík:
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. 75-88 - Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben:
Compact Flow Diagrams for State Sequences. 89-104 - Joshimar Cordova, Gonzalo Navarro:
Practical Dynamic Entropy-Compressed Bitvectors with Applications. 105-117 - Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. 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. 134-149 - Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. 150-166 - Jyrki Katajainen:
Worst-Case-Efficient Dynamic Arrays in Practice. 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. 184-200 - Taito Lee, Shuhei Denzumi, Kunihiko Sadakane:
Engineering Hybrid DenseZDDs. 201-216 - Stephan Sloth Lorenzen, Pawel Winter:
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances. 217-230 - Mehrdad Niknami, Samitha Samaranayake:
Tractable Pathfinding for the Stochastic On-Time Arrival Problem. 231-245 - Matthias Poloczek, David P. Williamson:
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. 246-261 - Zhen Qiu, Clifford Stein, Yuan Zhong:
Experimental Analysis of Algorithms for Coflow Scheduling. 262-277 - Nourhan Sakr, Cliff Stein:
An Empirical Study of Online Packet Scheduling Algorithms. 278-293 - Peter Sanders, Christian Schulz:
Advanced Multilevel Node Separator Algorithms. 294-309 - Julien Subercaze, Christophe Gravier, Pierre-Olivier Rocher:
A Merging Heuristic for the Rectangle Decomposition of Binary Matrices. 310-325 - Daniel Valenzuela:
CHICO: A Compressed Hybrid Index for Repetitive Collections. 326-338 - Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. 339-352 - Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke:
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry. 353-368 - Chun-Nam Yu, Michael S. Crouch, Ruichuan Chen, Alessandra Sala:
Online Algorithm for Approximate Quantile Queries on Sliding Windows. 369-384
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.
last updated on 2024-11-25 22:50 CET 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:
