Abstract is missing.
- Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic TimeMatti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin. [doi]
- On Interference Among Moving Sensors and Related ProblemsJean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky. [doi]
- How Hard is it to Find (Honest) Witnesses?Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat. [doi]
- Incremental Exact Min-Cut in Poly-logarithmic Amortized Update TimeGramoz Goranci, Monika Henzinger, Mikkel Thorup. [doi]
- A Streaming Algorithm for the Undirected Longest Path ProblemLasse Kliemann, Christian Schielke, Anand Srivastav. [doi]
- Faster External Memory LCP Array ConstructionJuha Kärkkäinen, Dominik Kempa. [doi]
- Online Algorithms for Multi-Level AggregationMarcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Nguyen Kim Thang, Pavel Vesely. [doi]
- SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-CollapseTamal K. Dey, Dayu Shi, Yusu Wang. [doi]
- Approximation and Hardness of Token SwappingTillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno. [doi]
- On the Power of Advice and Randomization for Online Bipartite MatchingChristoph Dürr, Christian Konrad, Marc P. Renault. [doi]
- Think Eternally: Improved Algorithms for the Temp Secretary Problem and ExtensionsThomas Kesselheim, Andreas Tönnis. [doi]
- New Algorithms for Maximum Disjoint Paths Based on Tree-LikenessKrzysztof Fleszar, Matthias Mnich, Joachim Spoerhase. [doi]
- New Parameterized Algorithms for APSP in Directed GraphsEly Porat, Eduard Shahbazian, Roei Tov. [doi]
- On the Geodesic Centers of Polygonal DomainsHaitao Wang. [doi]
- New Algorithms, Better Bounds, and a Novel Model for Online Stochastic MatchingBrian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu. [doi]
- Counting Matchings with k Unmatched Vertices in Planar GraphsRadu Curticapean. [doi]
- Faster Worst Case Deterministic Dynamic ConnectivityCasper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup. [doi]
- Beating Ratio 0.5 for Weighted Oblivious Matching ProblemsMelika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu. [doi]
- Algorithms with Provable Guarantees for ClusteringOla Svensson. [doi]
- Cell-Probe Lower Bounds for Bit Stream ComputationRaphaël Clifford, Markus Jalsenius, Benjamin Sach. [doi]
- Hyperbolic Random Graphs: Separators and TreewidthThomas Bläsius, Tobias Friedrich, Anton Krohmer. [doi]
- Separation of Cycle Inequalities for the Periodic Timetabling ProblemRalf Borndörfer, Heide Hoppmann, Marika Karbstein. [doi]
- Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers [doi]
- On the Fine-Grained Complexity of Rainbow ColoringLukasz Kowalik, Juho Lauri, Arkadiusz Socala. [doi]
- Min-Sum Scheduling Under Precedence ConstraintsAndreas S. Schulz, José Verschae. [doi]
- Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load BalancingPetra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell. [doi]
- Probabilistic Routing for On-Street Parking SearchTobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich. [doi]
- Sublinear Distance LabelingStephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat. [doi]
- 2-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. [doi]
- BlockQuicksort: Avoiding Branch Mispredictions in QuicksortStefan Edelkamp, Armin Weiss. [doi]
- Counting Linear Extensions: Parameterizations by TreewidthEduard Eiben, Robert Ganian, Kustaa Kanga, Sebastian Ordyniak. [doi]
- Efficient Algorithms with Asymmetric Read and Write CostsGuy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu 0001, Julian Shun. [doi]
- Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link PathsMoritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner. [doi]
- epsilon-Kernel Coresets for Stochastic PointsLingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang. [doi]
- The Alternating Stock Size Problem and the Gasoline PuzzleAlantha Newman, Heiko Röglin, Johanna Seif. [doi]
- Strategic Contention Resolution with Limited FeedbackGeorge Christodoulou 0001, Martin Gairing, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. [doi]
- An ILP-based Proof System for the Crossing Number ProblemMarkus Chimani, Tilo Wiedera. [doi]
- A Note On Spectral ClusteringPavel Kolev, Kurt Mehlhorn. [doi]
- Compact and Fast Sensitivity Oracles for Single-Source DistancesDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. [doi]
- Homotopy Measures for Representative TrajectoriesErin W. Chambers, Irina Kostitsyna, Maarten Löffler, Frank Staals. [doi]
- Optimal Staged Self-Assembly of General ShapesCameron T. Chalk, Eric Martinez, Robert T. Schweller, Luis Vega, Andrew Winslow, Tim Wylie. [doi]
- Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type InvariantsClément Maria, Jonathan Spreer. [doi]
- Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant WorkspaceMikkel Abrahamsen, Bartosz Walczak. [doi]
- Finding Large Set Covers Faster via the Representation MethodJesper Nederlof. [doi]
- Solving k-SUM Using Few Linear QueriesJean Cardinal, John Iacono, Aurélien Ooms. [doi]
- Hardness of Bipartite ExpansionSubhash Khot, Rishi Saket. [doi]
- Mapping Polygons to the Grid with Small Hausdorff and Fréchet DistanceQuirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek. [doi]
- Exponential Time Paradigms Through the Polynomial Time LensAndrew Drucker, Jesper Nederlof, Rahul Santhanam. [doi]
- Fixed-Parameter Approximability of Boolean MinCSPsÉdouard Bonnet, László Egri, Dániel Marx. [doi]
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic PlaneThomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue. [doi]
- Packing and Covering with Non-Piercing RegionsSathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy. [doi]
- On the Lattice Distortion ProblemHuck Bennett, Daniel Dadush, Noah Stephens-Davidowitz. [doi]
- The Strongly Stable Roommates ProblemAdam Kunysz. [doi]
- The Power of Migration for Online Slack SchedulingChris Schwiegelshohn, Uwe Schwiegelshohn. [doi]
- Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on DualityGiorgio Lucarelli, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram. [doi]
- Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation AlgorithmsRiley Murray, Megan Chao, Samir Khuller. [doi]
- Fully Dynamic Spanners with Worst-Case Update TimeGreg Bodwin, Sebastian Krinninger. [doi]
- Online Budgeted Maximum CoverageDror Rawitz, Adi Rosén. [doi]
- A 7/3-Approximation for Feedback Vertex Sets in TournamentsMatthias Mnich, Virginia Vassilevska Williams, László A. Végh. [doi]
- Computing Equilibria in Markets with Budget-Additive UtilitiesXiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn. [doi]
- Almost All Even Yao-Yao Graphs Are SpannersJian Li, Wei Zhan. [doi]
- Distributed Signaling GamesMoran Feldman, Moshe Tennenholtz, Omri Weinstein. [doi]
- Graph Isomorphism for Unit Square GraphsDaniel Neuen. [doi]
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper EdgesChien-Chung Huang, Sebastian Ott. [doi]
- Hitting Set for Hypergraphs of Low VC-dimensionKarl Bringmann, László Kozma 0002, Shay Moran, N. S. Narayanaswamy. [doi]
- The Complexity of the k-means MethodTim Roughgarden, Joshua R. Wang. [doi]
- Streaming Property Testing of Visibly Pushdown LanguagesNathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre. [doi]
- Sampling-Based Bottleneck Pathfinding with Applications to Fréchet MatchingKiril Solovey, Dan Halperin. [doi]
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller ParameterStefan Kratsch. [doi]
- Every Property Is Testable on a Natural Class of Scale-Free MultigraphsHiro Ito. [doi]
- The Computational Complexity of Genetic DiversityRuta Mehta, Ioannis Panageas, Georgios Piliouras, Sadra Yazdanbod. [doi]
- A Constant Approximation Algorithm for Scheduling Packets on Line NetworksGuy Even, Moti Medina, Adi Rosén. [doi]
- Streaming Pattern Matching with d WildcardsShay Golan, Tsvi Kopelowitz, Ely Porat. [doi]
- Stochastic Streams: Sample Complexity vs. Space ComplexityMichael S. Crouch, Andrew McGregor, Gregory Valiant, David P. Woodruff. [doi]
- Incremental and Fully Dynamic Subgraph Connectivity For Emergency PlanningMonika Henzinger, Stefan Neumann. [doi]
- KADABRA is an ADaptive Algorithm for Betweenness via Random ApproximationMichele Borassi, Emanuele Natale. [doi]
- Parameterized Hardness of Art Gallery ProblemsÉdouard Bonnet, Tillmann Miltzow. [doi]
- Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth GraphsKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. [doi]
- On the Hardness of Learning Sparse ParitiesArnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket. [doi]