Abstract is missing.
- Graph Balancing with Orientation CostsRoy Schwartz, Ran Yeheskel. [doi]
- Triangles and Girth in Disk Graphs and Transmission GraphsHaim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir. [doi]
- Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with ApplicationsMartin Dietzfelbinger, Stefan Walzer. [doi]
- Correlation Clustering with Same-Cluster Queries Bounded by Optimal CostBarna Saha, Sanjay Subramanian. [doi]
- FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between TreesElena Farahbakhsh Touli, Yusu Wang. [doi]
- Dense Peelable Random Uniform HypergraphsMartin Dietzfelbinger, Stefan Walzer. [doi]
- On Computing Centroids According to the p-Norms of Hamming Distance VectorsJiehua Chen, Danny Hermelin, Manuel Sorge. [doi]
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric KnapsackFabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese. [doi]
- A Constant Approximation for Colorful k-CenterSayan Bandyapadhyay, Tanmay Inamdar 0002, Shreyas Pai, Kasturi R. Varadarajan. [doi]
- Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable ClassErik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel. [doi]
- Quantum Walk Sampling by Growing Seed SetsSimon Apers. [doi]
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) MusketeersHugo 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. [doi]
- An Approximate Kernel for Connected Feedback Vertex SetM. S. Ramanujan. [doi]
- Evaluation of a Flow-Based Hypergraph Bipartitioning AlgorithmLars Gottesbüren, Michael Hamann, Dorothea Wagner. [doi]
- Global Curve SimplificationMees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk. [doi]
- Non-Cooperative Rational Interactive ProofsJing Chen 0017, Samuel McCauley, Shikha Singh 0002. [doi]
- Fragile Complexity of Comparison-Based AlgorithmsPeyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer 0001, Manuel Penschuck, Nodari Sitchinava. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Obviously Strategyproof Mechanisms for Machine SchedulingDiodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre. [doi]
- Multicommodity Multicast, Wireless and FastR. Ravi 0001, Oleksandr Rudenko. [doi]
- Online Bin Covering with Limited MigrationSebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder. [doi]
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed GraphsAdam Karczmarz, Jakub Lacki. [doi]
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random GraphsThomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Ulrich Meyer 0001, Manuel Penschuck, Christopher Weyand. [doi]
- Engineering Negative Cycle Canceling for Wind Farm CablingSascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf 0004. [doi]
- Resilient Dictionaries for Randomly Unreliable MemoryStefano Leucci 0001, Chih-Hung Liu, Simon Meierhans. [doi]
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin ProblemHuan Li, He Sun 0001, Luca Zanetti. [doi]
- On the Hardness and Inapproximability of Recognizing Wheeler GraphsDaniel Gibney, Sharma V. Thankachan. [doi]
- Constant-Factor FPT Approximation for Capacitated k-MedianMarek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed M. Meesum, Michal Wlodarczyk 0001. [doi]
- Geometric Crossing-Minimization - A Scalable Randomized ApproachMarcel Radermacher, Ignaz Rutter. [doi]
- On the Complexity of Anchored Rectangle PackingAntonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke. [doi]
- Towards Improving Christofides Algorithm for Half-Integer TSPArash Haddadan, Alantha Newman. [doi]
- Compact Oblivious RoutingHarald Räcke, Stefan Schmid 0001. [doi]
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite ProgramsKhaled M. Elbassioni, Kazuhisa Makino. [doi]
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSPÉdouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik. [doi]
- Computing k-Modal Embeddings of Planar DigraphsJuan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich. [doi]
- Building a Nest by an AutomatonJurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc. [doi]
- Robustness of Randomized Rumour SpreadingRami Daknama, Konstantinos Panagiotou, Simon Reisser. [doi]
- Packing Directed Circuits Quarter-IntegrallyTomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge. [doi]
- Packing Cars into Narrow Roads: PTASs for Limited Supply HighwayFabrizio Grandoni 0001, Andreas Wiese. [doi]
- Longest Common Substring Made Fully DynamicAmihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski. [doi]
- Repetition Detection in a Dynamic StringAmihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky. [doi]
- Generalized Assignment via Submodular Optimization with Reserved CapacityAriel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. [doi]
- PUFFINN: Parameterless and Universally Fast FInding of Nearest NeighborsMartin Aumüller 0001, Tobias Christiani, Rasmus Pagh, Michael Vesterli. [doi]
- External Memory Priority Queues with Decrease-Key and Applications to Graph AlgorithmsJohn Iacono, Riko Jacob, Konstantinos Tsakalidis. [doi]
- Bisection of Bounded Treewidth Graphs by ConvolutionsEduard Eiben, Daniel Lokshtanov, Amer E. Mouawad. [doi]
- Consistent Digital Curved Rays and Pseudoline ArrangementsJinhee Chun, Kenya Kikuchi, Takeshi Tokuyama. [doi]
- Linear Transformations Between Colorings in Chordal GraphsNicolas Bousquet, Valentin Bartier. [doi]
- Group Activity Selection with Few Agent TypesRobert Ganian, Sebastian Ordyniak, C. S. Rahul. [doi]
- Bidirectional Text Compression in External MemoryPatrick Dinklage, Jonas Ellert, Johannes Fischer 0001, Dominik Köppl, Manuel Penschuck. [doi]
- Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and BeyondGeorgios Birmpas, Evangelos Markakis, Guido Schäfer. [doi]
- UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient SolutionMoritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf. [doi]
- Trace Reconstruction: Generalized and ParameterizedAkshay Krishnamurthy, Arya Mazumdar, Andrew McGregor 0001, Soumyabrata Pal. [doi]
- Patching Colors with TensorsCornelius Brand. [doi]
- Parallel Weighted Random SamplingLorenz Hübschle-Schneider, Peter Sanders 0001. [doi]
- Bayesian Generalized Network DesignYuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi. [doi]
- More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity ConstraintsBenjamin Bergougnoux, Mamadou Moustapha Kanté. [doi]
- Equal-Subset-Sum Faster Than the Meet-in-the-MiddleMarcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki. [doi]
- Randomized Incremental Construction of Delaunay Triangulations of Nice Point SetsJean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse. [doi]
- Quantum Algorithms for Classical Probability DistributionsAleksandrs Belovs. [doi]
- Optimal Sorting with Persistent Comparison ErrorsBarbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu, Paolo Penna. [doi]
- Improved Bounds for the Excluded-Minor Approximation of TreedepthWojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk. [doi]
- Counting to Ten with Two Fingers: Compressed Counting with Spiking NeuronsYael Hitron, Merav Parter. [doi]
- Shortest Reconfiguration of Perfect Matchings via Alternating CyclesTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. [doi]
- Hardness of Bichromatic Closest Pair with Jaccard SimilarityRasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup. [doi]
- Online Multistage Subset Maximization ProblemsEvripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller. [doi]
- On Geometric Set Cover for OrthantsKarl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen. [doi]
- Recognizing Planar Laman GraphsJonathan Rollin, Lena Schlipf, André Schulz 0001. [doi]
- Stronger ILPs for the Graph Genus ProblemMarkus Chimani, Tilo Wiedera. [doi]
- Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar GraphsVincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk. [doi]
- Online Disjoint Set Cover Without Prior KnowledgeYuval Emek, Adam Goldbraikh, Erez Kantor. [doi]
- Closing the Gap for Pseudo-Polynomial Strip PackingKlaus Jansen, Malin Rau. [doi]
- Parametrized Complexity of Expansion HeightUlrich Bauer, Abhishek Rathod, Jonathan Spreer. [doi]
- Going Far From DegeneracyFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Streaming and Massively Parallel Algorithms for Edge ColoringSoheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh. [doi]
- k-Coloring in Hereditary Classes of GraphsMaria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong. [doi]
- Odd-Cycle Separation for Maximum Cut and Binary Quadratic OptimizationMichael Jünger, Sven Mallach. [doi]
- Min-Cost Flow in Unit-Capacity Planar GraphsAdam Karczmarz, Piotr Sankowski. [doi]
- Simultaneous Representation of Proper and Unit Interval GraphsIgnaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer. [doi]
- Triconnected Planar Graphs of Maximum Degree Five are SubhamiltonianMichael Hoffmann 0001, Boris Klemz. [doi]
- Constructing Light Spanners Deterministically in Near-Linear TimeStephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen. [doi]
- Simpler and Better Algorithms for Minimum-Norm Load BalancingDeeparnab Chakrabarty, Chaitanya Swamy. [doi]
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset ConstructionHu Ding, Haikuo Yu, Zixiu Wang. [doi]
- Dynamic Dominators and Low-High Orders in DAGsLoukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura. [doi]
- Bilu-Linial Stability, Certified Algorithms and the Independent Set ProblemHaris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan. [doi]