default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th ESA 2019: Munich/Garching, Germany
- Michael A. Bender, Ola Svensson
, Grzegorz Herman:
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. LIPIcs 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-124-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant-Factor FPT Approximation for Capacitated k-Median. 1:1-1:14 - Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. 2:1-2:19 - Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. 3:1-3:14 - Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. 4:1-4:15 - Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky:
Repetition Detection in a Dynamic String. 5:1-5:18 - Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Substring Made Fully Dynamic. 6:1-6:17 - Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan:
Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem. 7:1-7:16 - Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke:
On the Complexity of Anchored Rectangle Packing. 8:1-8:14 - Simon Apers:
Quantum Walk Sampling by Growing Seed Sets. 9:1-9:12 - Martin Aumüller, Tobias Christiani, Rasmus Pagh, Michael Vesterli:
PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. 10:1-10:16 - Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. 11:1-11:14 - Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan:
A Constant Approximation for Colorful k-Center. 12:1-12:14 - Ulrich Bauer, Abhishek Rathod, Jonathan Spreer:
Parametrized Complexity of Expansion Height. 13:1-13:15 - Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. 14:1-14:16 - Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. 15:1-15:14 - Aleksandrs Belovs:
Quantum Algorithms for Classical Probability Distributions. 16:1-16:11 - Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. 17:1-17:14 - Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. 18:1-18:14 - Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich:
Computing k-Modal Embeddings of Planar Digraphs. 19:1-19:16 - Georgios Birmpas, Evangelos Markakis, Guido Schäfer:
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. 20:1-20:17 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. 21:1-21:14 - Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. 22:1-22:13 - Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. 23:1-23:14 - Nicolas Bousquet, Valentin Bartier:
Linear Transformations Between Colorings in Chordal Graphs. 24:1-24:15 - Cornelius Brand:
Patching Colors with Tensors. 25:1-25:16 - Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen:
On Geometric Set Cover for Orthants. 26:1-26:18 - Deeparnab Chakrabarty, Chaitanya Swamy:
Simpler and Better Algorithms for Minimum-Norm Load Balancing. 27:1-27:12 - Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. 28:1-28:16 - Jing Chen, Samuel McCauley, Shikha Singh:
Non-Cooperative Rational Interactive Proofs. 29:1-29:16 - Markus Chimani, Tilo Wiedera:
Stronger ILPs for the Graph Genus Problem. 30:1-30:15 - Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. 31:1-31:15 - Jinhee Chun, Kenya Kikuchi, Takeshi Tokuyama:
Consistent Digital Curved Rays and Pseudoline Arrangements. 32:1-32:16 - Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. 33:1-33:14 - Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. 34:1-34:13 - Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. 35:1-35:14 - Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Robustness of Randomized Rumour Spreading. 36:1-36:15 - Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. 37:1-37:15 - Martin Dietzfelbinger, Stefan Walzer:
Dense Peelable Random Uniform Hypergraphs. 38:1-38:16 - Martin Dietzfelbinger, Stefan Walzer:
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. 39:1-39:18 - Hu Ding, Haikuo Yu, Zixiu Wang:
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction. 40:1-40:16 - Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck:
Bidirectional Text Compression in External Memory. 41:1-41:16 - Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of Bounded Treewidth Graphs by Convolutions. 42:1-42:11 - Khaled M. Elbassioni, Kazuhisa Makino:
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. 43:1-43:15 - Yuval Emek, Adam Goldbraikh, Erez Kantor:
Online Disjoint Set Cover Without Prior Knowledge. 44:1-44:16 - Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Bayesian Generalized Network Design. 45:1-45:16 - Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre:
Obviously Strategyproof Mechanisms for Machine Scheduling. 46:1-46:15 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. 47:1-47:14 - Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. 48:1-48:16 - Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. 49:1-49:14 - Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura:
Dynamic Dominators and Low-High Orders in DAGs. 50:1-50:18 - Daniel Gibney, Sharma V. Thankachan:
On the Hardness and Inapproximability of Recognizing Wheeler Graphs. 51:1-51:16 - Lars Gottesbüren, Michael Hamann, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. 52:1-52:17 - Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese:
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. 53:1-53:16 - Fabrizio Grandoni, Andreas Wiese:
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. 54:1-54:14 - Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Engineering Negative Cycle Canceling for Wind Farm Cabling. 55:1-55:16 - Arash Haddadan, Alantha Newman:
Towards Improving Christofides Algorithm for Half-Integer TSP. 56:1-56:12 - Yael Hitron, Merav Parter:
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. 57:1-57:17 - Michael Hoffmann, Boris Klemz:
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. 58:1-58:14 - Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. 59:1-59:24 - John Iacono, Riko Jacob, Konstantinos Tsakalidis:
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. 60:1-60:14 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. 61:1-61:15 - Klaus Jansen, Malin Rau:
Closing the Gap for Pseudo-Polynomial Strip Packing. 62:1-62:14 - Michael Jünger, Sven Mallach:
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. 63:1-63:13 - Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. 64:1-64:14 - Adam Karczmarz, Jakub Lacki:
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. 65:1-65:15 - Adam Karczmarz, Piotr Sankowski:
Min-Cost Flow in Unit-Capacity Planar Graphs. 66:1-66:17 - Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk:
Global Curve Simplification. 67:1-67:14 - Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Trace Reconstruction: Generalized and Parameterized. 68:1-68:25 - Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. 69:1-69:15 - Stefano Leucci, Chih-Hung Liu, Simon Meierhans:
Resilient Dictionaries for Randomly Unreliable Memory. 70:1-70:16 - Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. 71:1-71:14 - Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. 72:1-72:13 - Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. 73:1-73:16 - Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup:
Hardness of Bichromatic Closest Pair with Jaccard Similarity. 74:1-74:13 - Harald Räcke, Stefan Schmid:
Compact Oblivious Routing. 75:1-75:14 - Marcel Radermacher, Ignaz Rutter:
Geometric Crossing-Minimization - A Scalable Randomized Approach. 76:1-76:16 - M. S. Ramanujan:
An Approximate Kernel for Connected Feedback Vertex Set. 77:1-77:14 - R. Ravi, Oleksandr Rudenko:
Multicommodity Multicast, Wireless and Fast. 78:1-78:20 - Jonathan Rollin, Lena Schlipf, André Schulz:
Recognizing Planar Laman Graphs. 79:1-79:12 - Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. 80:1-80:15 - Barna Saha, Sanjay Subramanian:
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost. 81:1-81:17 - Roy Schwartz, Ran Yeheskel:
Graph Balancing with Orientation Costs. 82:1-82:15 - Elena Farahbakhsh Touli, Yusu Wang:
FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees. 83:1-83: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 2024-09-13 00:29 CEST 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:
