default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th ESA 2018: Helsinki, Finland
- Yossi Azar, Hannah Bast, Grzegorz Herman:
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland. LIPIcs 112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-081-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. 1:1-1:14 - Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
:
Two-Dimensional Maximal Repetitions. 2:1-2:14 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. 3:1-3:14 - Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau:
On the Worst-Case Complexity of TimSort. 4:1-4:13 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New and Improved Algorithm for Online Bin Packing. 5:1-5:14 - Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. 6:1-6:13 - Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. 7:1-7:13 - Amariah Becker, Philip N. Klein, David Saulpic:
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. 8:1-8:15 - Sebastian Brandt, Seth Pettie, Jara Uitto:
Fine-grained Lower Bounds on Cops and Robbers. 9:1-9:12 - Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. 10:1-10:13 - Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. 11:1-11:15 - Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh:
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. 12:1-12:15 - Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. 13:1-13:16 - Cameron T. Chalk, Austin Luchsinger, Robert T. Schweller, Tim Wylie:
Self-Assembly of Any Shape with Constant Tile Types using High Temperature. 14:1-14:14 - T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. 15:1-15:13 - Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. 16:1-16:17 - Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. 17:1-17:15 - Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. 18:1-18:15 - Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. 19:1-19:14 - Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. 20:1-20:16 - Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. 21:1-21:15 - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. 22:1-22:13 - Hu Ding, Manni Liu:
On Geometric Prototype and Applications. 23:1-23:15 - Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. 24:1-24:13 - Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. 25:1-25:13 - Matthias Englert, David Mezlaf, Matthias Westermann:
Online Makespan Scheduling with Job Migration on Uniform Machines. 26:1-26:14 - Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub:
Truthful Prompt Scheduling for Minimizing Sum of Completion Times. 27:1-27:14 - Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser:
Weighted Model Counting on the GPU by Exploiting Small Treewidth. 28:1-28:16 - Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. 29:1-29:15 - Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. 30:1-30:14 - Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. 31:1-31:13 - Waldo Gálvez, José A. Soto, José Verschae:
Symmetry Exploitation for Online Machine Covering with Bounded Migration. 32:1-32:14 - Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka:
Edit Distance with Block Operations. 33:1-33:14 - Shilpa Garg, Tobias Mömke:
A QPTAS for Gapless MEC. 34:1-34:14 - Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT Algorithms for Embedding into Low Complexity Graphic Metrics. 35:1-35:13 - Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik:
The Stochastic Score Classification Problem. 36:1-36:14 - Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Improved Space-Time Tradeoffs for kSUM. 37:1-37:14 - Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. 38:1-38:14 - Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. 39:1-39:13 - Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. 40:1-40:15 - Mayank Goswami, Dzejla Medjedovic, Emina Mekic, Prashant Pandey:
Buffered Count-Min Sketch on SSD: Theory and Experiments. 41:1-41:15 - Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. 42:1-42:14 - Roberto Grossi, Luca Versari:
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. 43:1-43:14 - Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. 44:1-44:15 - Xiaoyu He, Neng Huang, Xiaoming Sun:
On the Decision Tree Complexity of String Matching. 45:1-45:13 - Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. 46:1-46:16 - Bart M. P. Jansen, Jesper Nederlof:
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. 47:1-47:15 - Bart M. P. Jansen, Astrid Pieterse:
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. 48:1-48:15 - Michael Jarret, Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita:
Quantum Algorithms for Connectivity and Related Problems. 49:1-49:13 - Vít Jelínek, Michal Opler, Pavel Valtr:
Generalized Coloring of Permutations. 50:1-50:14 - Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. 51:1-51:14 - Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. 52:1-52:13 - Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. 53:1-53:13 - Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching a Tree with Permanently Noisy Advice. 54:1-54:13 - Stefan Kratsch, Florian Nelles:
Efficient and Adaptive Parameterized Algorithms on Modular Decompositions. 55:1-55:15 - Marvin Künnemann:
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. 56:1-56:16 - Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. 57:1-57:14 - Umang Bhaskar, Phani Raj Lolakapuri:
Equilibrium Computation in Atomic Splittable Routing Games. 58:1-58:14 - Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. 59:1-59:12 - Tung Mai, Vijay V. Vazirani:
Finding Stable Matchings That Are Robust to Errors in the Input. 60:1-60:11 - Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen:
Disconnected Cuts in Claw-free Graphs. 61:1-61:14 - Michael Matheny, Jeff M. Phillips:
Practical Low-Dimensional Halfspace Range Space Sampling. 62:1-62:14 - J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. 63:1-63:16 - Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. 64:1-64:8 - Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. 65:1-65:13 - Gábor Ivanyos, Anupam Prakash, Miklos Santha:
On Learning Linear Functions from Subset and Its Applications in Quantum Computing. 66:1-66:14 - Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek:
Strong Collapse for Persistence. 67:1-67:13 - Maximilian Probst:
On the Complexity of the (Approximate) Nearest Colored Node Problem. 68:1-68:14 - Rajiv Raman, Saurabh Ray:
Planar Support for Non-piercing Regions and Applications. 69:1-69:14 - Daniel R. Schmidt, Bernd Zey, François Margot:
An Exact Algorithm for the Steiner Forest Problem. 70:1-70:14 - Michael Dinitz, Michael Schapira, Gal Shahaf:
Large Low-Diameter Graphs are Good Expanders. 71:1-71:15 - Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. 72:1-72:16 - Bo Zhou, Yi-Jen Chiang, Chee Yap:
Soft Subdivision Motion Planning for Complex Planar Robots. 73:1-73:14
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-11-18 22:34 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:
