default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SEA 2014: Copenhagen, Denmark
- Joachim Gudmundsson, Jyrki Katajainen:
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings. Lecture Notes in Computer Science 8504, Springer 2014, ISBN 978-3-319-07958-5
Invited Presentation
- Jon Louis Bentley:
Selecting Data for Experiments: Past, Present and Future. 1-9
Combinatorial Optimization
- Péter Biró, David F. Manlove
, Iain McBride:
The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models. 10-21 - Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi:
Integral Simplex Using Decomposition with Primal Cuts. 22-33 - Martin Bergner, Marco E. Lübbecke, Jonas T. Witt:
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. 34-45 - David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. 46-58 - Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
An Exact Algorithm for the Discrete Chromatic Art Gallery Problem. 59-73 - Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski:
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. 74-86 - Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. 87-98 - Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves:
Dynamic Windows Scheduling with Reallocation. 99-110
Data Structures
- Stephan Erb, Moritz Kobitzsch, Peter Sanders:
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates. 111-122 - Aapo Kyrola, Julian Shun, Guy E. Blelloch:
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest. 123-137 - Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou:
Retrieval and Perfect Hashing Using Fingerprinting. 138-149 - José Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, Diego Seco:
Efficient Wavelet Tree Construction and Querying for Multicore Architectures. 150-161 - David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. 162-173 - Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Loop Nesting Forests, Dominators, and Applications. 174-186 - Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. 187-198 - Noy Rotbart, Marcos Vaz Salles, Iasonas Zotos:
An Evaluation of Dynamic Labeling Schemes for Tree Networks. 199-210
Graph Drawing
- Donatella Firmani, Giuseppe F. Italiano, Marco Querini:
Engineering Color Barcode Algorithms for Mobile Applications. 211-222 - Livio De La Cruz, Stephen G. Kobourov, Sergey Pupyrev, Paul S. Shen, Sankar Veeramoni:
Computing Consensus Curves. 223-234 - Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. 235-246 - Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev:
Experimental Comparison of Semantic Word Clouds. 247-258
Shortest Path
- Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck:
Hub Labels: Theory and Practice. 259-270 - Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. 271-282 - Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Erratum: Customizable Contraction Hierarchies. - Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. 283-294 - Luca Allulli, Giuseppe F. Italiano, Federico Santaroni:
Exploiting GPS Data in Public Transport Journey Planners. 295-306
Strings
- Tamanna Chhabra, Jorma Tarhio:
Order-Preserving Matching with Filtration. 307-314 - Tommi Hirvola, Jorma Tarhio:
Approximate Online Matching of Circular Strings. 315-325 - Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. 326-337 - Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Improved ESP-index: A Practical Self-index for Highly Repetitive Texts. 338-350
Graph Algorithms
- Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning Complex Networks via Size-Constrained Clustering. 351-363 - Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. 364-375 - Sepp Hartung, Clemens Hoffmann, André Nichterlein:
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. 376-387 - Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki:
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. 388-399
Suffix Structures
- N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson:
Efficient Representation for Online Suffix Tree Construction. 400-411 - Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. 412-423 - Gonzalo Navarro, Alberto Ordóñez Pereira:
Faster Compressed Suffix Trees for Repetitive Text Collections. 424-435 - Simon Gog, Gonzalo Navarro:
Improved and Extended Locating Functionality on Compressed Suffix Arrays. 436-447
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-20 21:07 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:
