default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SEA 2017: London, UK
- Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman:
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. LIPIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-036-1 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. 0:i-0:xiv
- Radu Baltean-Lugojan, Christodoulos A. Floudas, Ruth Misener, Miten Mistry:
Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear Optimisation. 1:1-1:1 - Martin Farach-Colton:
Dictionaries Revisited. 2:1-2:1 - Graham Cormode:
Engineering Streaming Algorithms. 3:1-3:1 - Christian Schulz
, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. 4:1-4:15 - Leo Liberti, Claudia D'Ambrosio:
The Isomap Algorithm in Distance Geometry. 5:1-5:13 - Robert Lion Gottwald, Stephen J. Maher, Yuji Shinano:
Distributed Domain Propagation. 6:1-6:11 - Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. 7:1-7:23 - Amariah Becker, Eli Fox-Epstein, Philip N. Klein, David Meierfrankenfeld:
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs. 8:1-8:17 - Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. 9:1-9:16 - Michael Huang, Clifford Stein:
Extending Search Phases in the Micali-Vazirani Algorithm. 10:1-10:19 - Nicola Prezza:
A Framework of Dynamic Data Structures for String Processing. 11:1-11:15 - Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
Practical Range Minimum Queries Revisited. 12:1-12:16 - Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. 13:1-13:22 - Jihyuk Lim, Kunsoo Park:
Algorithm Engineering for All-Pairs Suffix-Prefix Matching. 14:1-14:12 - Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. 15:1-15:14 - Paulo G. S. da Fonseca, Israel B. F. da Silva:
Online Construction of Wavelet Trees. 16:1-16:14 - Juha Kärkkäinen, Dominik Kempa:
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. 17:1-17:14 - Stefan Funke, Sören Laue, Sabine Storandt:
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees. 18:1-18:13 - Moritz Baum, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications. 19:1-19:18 - Lars Briem, H. Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, Tobias Zündorf:
Efficient Traffic Assignment for Public Transit Networks. 20:1-20:14 - Tobias Heuer, Sebastian Schlag:
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. 21:1-21:19 - Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. 22:1-22:14 - Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. 23:1-23:16 - Andrei Alexandrescu:
Fast Deterministic Selection. 24:1-24:19 - Antoine Limasset, Guillaume Rizk, Rayan Chikhi, Pierre Peterlongo:
Fast and Scalable Minimal Perfect Hashing for Massive Key Sets. 25:1-25:16 - Manuel Penschuck:
Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory. 26:1-26:21 - Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, Luigi Laura:
Incremental Low-High Orders of Directed Graphs and Applications. 27:1-27:21 - Max Bannach, Sebastian Berndt, Thorsten Ehlers:
Jdrasil: A Modular Library for Computing Tree Decompositions. 28:1-28:21 - Stefano Coniglio, Stefano Gualandi:
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem. 29:1-29:13 - Orlando Moreira, Merten Popp, Christian Schulz:
Graph Partitioning with Acyclicity Constraints. 30:1-30:15 - Nicola Basilico, Stefano Coniglio, Nicola Gatti, Alberto Marchesi:
Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria. 31:1-31:14 - Daniyah A. Aloqalaa, Jenny A. Hodgson, Prudence W. H. Wong:
The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process. 32:1-32:16 - Harshita Kudaravalli, Miguel A. Mosteiro:
Ad-Hoc Affectance-Selective Families for Layer Dissemination. 33:1-33:16
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-12-03 20:16 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:
