default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th ESA 2017: Vienna, Austria
- Kirk Pruhs, Christian Sohler:
25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. LIPIcs 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-049-1 - Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers. 0:i-0:xx
- David P. Woodruff:
Sketching for Geometric Problems (Invited Talk). 1:1-1:5 - Peyman Afshani, Ingo van Duijn:
Permuting and Batched Geometric Lower Bounds in the I/O Model. 2:1-2:13 - Peyman Afshani, Zhewei Wei:
Independent Range Sampling, Revisited. 3:1-3:14 - Pankaj K. Agarwal, Natan Rubin
, Micha Sharir:
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. 4:1-4:13 - Dror Aiger, Haim Kaplan, Micha Sharir:
Output Sensitive Algorithms for Approximate Incidences and Their Applications. 5:1-5:13 - Hassene Aissi, Ali Ridha Mahjoub, R. Ravi:
Randomized Contractions for Multiobjective Minimum Cuts. 6:1-6:13 - Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. 7:1-7:14 - Daniel Antunes, Claire Mathieu, Nabil H. Mustafa:
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. 8:1-8:13 - Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders:
In-Place Parallel Super Scalar Samplesort (IPSSSSo). 9:1-9:14 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online Bin Packing with Cardinality Constraints Resolved. 10:1-10:14 - Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf:
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. 11:1-11:16 - Amariah Becker, Philip N. Klein, David Saulpic:
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. 12:1-12:15 - Kristóf Bérczi, Yusuke Kobayashi:
The Directed Disjoint Shortest Paths Problem. 13:1-13:13 - Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. 14:1-14:13 - Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan:
Improved Algorithm for Dynamic b-Matching. 15:1-15:13 - Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. 16:1-16:13 - Vittorio Bilò, Cosimo Vinci:
On the Impact of Singleton Strategies in Congestion Games. 17:1-17:14 - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. 18:1-18:14 - Thomas Bosman, Neil Olver:
Exploring the Tractability of the Capped Hose Model. 19:1-19:12 - Karl Bringmann, Ralph Keusch, Johannes Lengler:
Sampling Geometric Inhomogeneous Random Graphs in Linear Time. 20:1-20:15 - Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. 21:1-21:14 - Niv Buchbinder, Danny Segev, Yevgeny Tkach:
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. 22:1-22:14 - Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann:
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. 23:1-23:14 - T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. 24:1-24:14 - Timothy M. Chan, Dimitrios Skrepetos:
Faster Approximate Diameter and Distance Oracles in Planar Graphs. 25:1-25:13 - Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. 26:1-26:15 - Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. 27:1-27:15 - Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices. 28:1-28:13 - Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan:
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. 29:1-29:15 - Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. 30:1-30:14 - Syamantak Das, Andreas Wiese:
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. 31:1-31:14 - Constantinos Daskalakis, Yasushi Kawase:
Optimal Stopping Rules for Sequential Hypothesis Testing. 32:1-32:14 - William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz:
The Online House Numbering Problem: Min-Max Online List Labeling. 33:1-33:15 - Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Clustering. 34:1-34:14 - Alon Eden, Tomer Ezra, Michal Feldman:
Pricing Social Goods. 35:1-35:14 - Katherine Edwards, Irene Muzi, Paul Wollan:
Half-Integral Linkages in Highly Connected Directed Graphs. 36:1-36:12 - Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. 37:1-37:15 - Travis Gagie, Giovanni Manzini, Rossano Venturini:
An Encoding for Order-Preserving Matching. 38:1-38:15 - Kshitij Gajjar, Jaikumar Radhakrishnan:
Distance-Preserving Subgraphs of Interval Graphs. 39:1-39:13 - Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. 40:1-40:13 - Shay Golan, Ely Porat:
Real-Time Streaming Multi-Pattern Search for Constant Alphabet. 41:1-41:15 - Omer Gold, Micha Sharir:
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. 42:1-42:13 - Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika:
Profit Sharing and Efficiency in Utility Games. 43:1-43:14 - Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. 44:1-44:14 - Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. 45:1-45:14 - Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità:
Single-Sink Fractionally Subadditive Network Design. 46:1-46:13 - Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-Contractions, Edge Deletions and Connectivity Preservation. 47:1-47:13 - Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. 48:1-48:10 - John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. 49:1-49:14 - Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. 50:1-50:15 - Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. 51:1-51:10 - Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. 52:1-52:13 - Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Linear Time. 53:1-53:14 - Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. 54:1-54:14 - Gilad Kutiel, Dror Rawitz:
Local Search Algorithms for Maximum Carpool Matching. 55:1-55:14 - Zhijiang Li, Norbert Zeh:
Computing Maximum Agreement Forests without Cluster Partitioning is Folly. 56:1-56:14 - Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear-Time Parameterized Algorithm for Node Unique Label Cover. 57:1-57:15 - Tobias Maier, Peter Sanders:
Dynamic Space Efficient Hashing. 58:1-58:14 - Dániel Marx, Marcin Pilipczuk:
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. 59:1-59:15 - Daniel Neuen, Pascal Schweitzer:
Benchmark Graphs for Practical Graph Isomorphism. 60:1-60:14 - Zeev Nutov:
On the Tree Augmentation Problem. 61:1-61:14 - Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Prize-Collecting TSP with a Budget Constraint. 62:1-62:14 - Marc Roth:
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. 63:1-63:14 - Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. 64:1-64:14 - Thomas Schibler, Subhash Suri:
K-Dominance in Multidimensional Data: Theory and Applications. 65:1-65:13 - Martin R. Schuster, Maciej Liskiewicz:
New Abilities and Limitations of Spectral Graph Bisection. 66:1-66:15 - Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Space-Optimal Grammar Compression. 67:1-67:15 - Hisao Tamaki:
Positive-Instance Driven Dynamic Programming for Treewidth. 68:1-68:13 - Antonis Thomas:
Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes. 69:1-69:14 - Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke:
Maxent-Stress Optimization of 3D Biomolecular Models. 70:1-70:15
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 2025-10-29 01:27 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:
