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