- Karthekeyan Chandrasekaran, Weihang Wang:
ℓp-Norm Multiway Cut. ESA 2021: 29:1-29:15 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. ESA 2021: 30:1-30:17 - Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. ESA 2021: 31:1-31:16 - Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14 - Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA 2021: 34:1-34:17 - Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov:
Minimum Common String Partition: Exact Algorithms. ESA 2021: 35:1-35:16 - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA 2021: 36:1-36:15 - Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. ESA 2021: 37:1-37:15 - Hu Ding:
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. ESA 2021: 38:1-38:19 - Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. ESA 2021: 39:1-39:15 - Zdenek Dvorák, Abhiruk Lahiri:
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA 2021: 40:1-40:10 - Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA 2021: 41:1-41:16 - Hendrik Fichtenberger, Monika Henzinger, Lara Ost:
Differentially Private Algorithms for Graphs Under Continual Observation. ESA 2021: 42:1-42:16 - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ESA 2021: 43:1-43:13 - Alejandro Flores-Velazco, David M. Mount:
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ESA 2021: 44:1-44:15 - Moses Ganardi:
Compression by Contracting Straight-Line Programs. ESA 2021: 45:1-45:16 - Younan Gao, Meng He:
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. ESA 2021: 46:1-46:17 - Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA 2021: 47:1-47:17 - Lukas Glomb, Benno Hoch, Frauke Liers, Florian Rösel:
Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). ESA 2021: 1:1-1:3 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. ESA 2021: 48:1-48:17 - Yassine Hamoudi:
Quantum Sub-Gaussian Mean Estimator. ESA 2021: 50:1-50:17 - Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. ESA 2021: 51:1-51:15 - Zhiyang He, Jason Li, Magnus Wahlström:
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA 2021: 52:1-52:14 - Klaus Jansen, Malin Rau:
Closing the Gap for Single Resource Constraint Scheduling. ESA 2021: 53:1-53:15 - Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ESA 2021: 54:1-54:19 - Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. ESA 2021: 55:1-55:17 - Dominik Kempa, Ben Langmead:
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. ESA 2021: 56:1-56:14 - Boris Klemz:
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. ESA 2021: 57:1-57:15 - Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. ESA 2021: 58:1-58:15 - Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. ESA 2021: 59:1-59:17