Accepted Paper List

Sándor Fekete, Peter Kramer, Christian Rieck, Christian Scheffer and Arne Schmidt. Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno and Thomas N. Sato. On the Complexity of Tree Edit Distance with Variables
Paul Lapey and Aaron Williams. Pop & push: Ordered tree iteration in O(1)-time
Shay Mozes, Nathan Wallheimer and Oren Weimann. Improved Compression of the Okamura-Seymour Metric
Yusuke Kobayashi and Tatsuya Terao. One-Face Shortest Disjoint Paths with a Deviation Terminal
Zachary Friggstad and Ramin Mousavi. Bi-criteria Approximation Algorithms for Bounded-Degree Subset TSP
Julian Mestre and Sergey Pupyrev. Approximating the Minimum Logarithmic Arrangement Problem
William Holland. Succinct List Indexing in Optimal Time
Gianlorenzo D'Angelo, Esmaeil Delfaraz and Hugo Gilbert. Budgeted Out-tree Maximization with Submodular Prizes
Johannes Meintrup and Frank Kammer. Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
Maël Dumas, Florent Foucaud, Anthony Perez and Ioan Todinca. On graphs coverable by k shortest paths
Michał Dębski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk and Paweł Rzążewski. Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
Lisa Hellerstein, Thomas Lidbetter and R. Teal Witter. A Local Search Algorithm for the Min-Sum Submodular Cover Problem
Shangqi Lu and Yufei Tao. Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights
Thomas Erlebach, Kelin Luo and Frits C.R. Spieksma. Package Delivery Using Drones with Restricted Movement Areas
Benjamin Qi. On Maximizing Sums of Non-monotone Submodular and Linear Functions
Xiangyu Guo, Shi Li, Kelin Luo and Yuhao Zhang. Minimizing the Maximum Flow Time in the Online Food Delivery Problem
Tatsuya Gima and Yota Otachi. Extended MSO Model Checking via Small Vertex Integrity
Jun Yan, Dominique Unruh, Junbin Fang and Dehua Zhou. How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? (Extended Abstract)
Konstantinos Georgiou, Nikolaos Giachoudis and Evangelos Kranakis. Evacuation from a Disk for Robots with Asymmetric Communication
Pankaj Agarwal, Matthew Katz and Micha Sharir. On Reverse Shortest Paths in Geometric Proximity Graphs
Rathish Das, Meng He, Eitan Kondratovsky, Ian Munro, Anurag Murty Naredla and Kaiyu Wu. Shortest Beer Path Queries in Interval Graphs
Eunou Lee. A quantum SDP rounding algorithm for a quantum optimization problem
Kazuyuki Amano. Integer Complexity and Mixed Binary-Ternary Representation
Felicia Lucke, Daniel Paulusma and Bernard Ries. Finding Matching Cuts in H-Free Graphs
Naoto Ohsaka. On the Parameterized Intractability of Determinant Maximization
Jianqi Zhou, Jiong Guo and Peihua Li. Parameterized Approximation Algorithms for TSP
Nairen Cao, Katina Russell, Jeremy Fineman, Shi Li, Julian Mestre and Seeun Umboh. Nested Active-Time Scheduling
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz and Alexandre Vigny. Combinatorial and Algorithmic Aspects of Monadic Stability
Joel Day, Maria Kosche, Florin Manea and Markus L. Schmid. Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Christian Rieck and Christian Scheffer. The Dispersive Art Gallery Problem
Atsuya Hasegawa and Francois Le Gall. An optimal oracle separation of classical and quantum hybrid schemes
Soichiro Fujii, Yuni Iwamasa, Kei Kimura and Akira Suzuki. Algorithms for coloring reconfiguration under recolorability digraphs
Prosenjit Bose, Jean-Lou De Carufel and Thomas Shermer. Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor
Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski and Aneta Żuk. List Locally Surjective Homomorphisms in Hereditary Graph Classes
Nikolay Proskurin and Vladimir Podolskii. Polynomial Threshold Functions for Decision Lists
Ta-Wei Tu. Subquadratic Weighted Matroid Intersection under Rank Oracles
Jakob Dyrseth and Paloma de Lima. On the complexity of rainbow vertex colouring diametral path graphs
Yossi Azar, Eldad Peretz and Noam Touitou. Distortion-Oblivious Algorithms for Scheduling on Multiple Machines
Kyle Fox, Hongyao Huang and Benjamin Raichel. Clustering with Faulty Centers
Michael Bekos, Giordano Da Lozzo, Michael Kaufmann and Petr Hlineny. Graph Product Structure for h-Framed Graphs
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries and David Schindl. Locally checkable problems parameterized by clique-width
Rathish Das, John Iacono and Yakov Nekrich. External-memory dictionaries with worst-case update cost
Kyle Fox and Thomas Stanley. Computation of cycle bases in surface embedded graphs
Lily Chung, Erik D. Demaine, Dylan Hendrickson and Jayson Lynch. Lower Bounds on Retroactive Data Structures
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat and Subir Ghosh. Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
Tatiana Belova and Ivan Bliznets. Hardness of Approximation for H-free Edge Modification Problems: Towards a Dichotomy
Artur Ignatiev, Ivan Mikhailin and Alexander Smal. Super-cubic lower bound for generalized Karchmer-Wigderson games
Sabine Storandt. Algorithms for Landmark Hub Labeling
Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen and Frank Staals. Segment Visibility Counting Queries in Polygons
Ferdinando Cicalese, Clement Dallard and Martin Milanič. On constrained intersection representations of graphs and digraphs
Pankaj Agarwal, Tzvika Geft, Dan Halperin and Erin Taylor. Multi-Robot Motion Planning for Unit Discs with Revolving Areas
Sung-Hwan Kim and Hwan-Gue Cho. Simple Order-isomorphic Matching Index with Expected Compact Space
Takuya Mieno, Mitsuru Funakoshi and Shunsuke Inenaga. Computing palindromes on a trie in linear time
Akanksha Agrawal, Soumita Hait and Amer Mouawad. On finding short reconfiguration sequences between independent sets
Miriam Münch, Ignaz Rutter and Peter Stumpf. Partial and Simultaneous Transitive Orientations via Modular Decompositions
Yusuke Kobayashi and Ryoga Mahara. Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average
Ya-Chun Liang, Kazuo Iwama and Chung-Shou Liao. Improving the Bounds of the Online Dynamic Power Management Problem
Szilárd Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki and Hinano Takeuchi. On Algorithmic Self-Assembly of Squares by Co-transcriptional Folding
Sujoy Bhore, Fabian Klute, Maarten Löffler, Soeren Nickel, Martin Nöllenburg and Anaïs Villedieu. Minimum Link Fencing
Rasmus Killmann, Peyman Afshani and Kasper Green Larsen. Hierarchical Categories in Colored Range Searching
Sandip Das and Harmender Gahlawat. On the Cop Number of String Graphs
Kushagra Chatterjee and Prajakta Nimbhorkar. Popular Edges with Critical Nodes
Sungmin Kim, Sang-Ki Ko and Yo-Sub Han. Simon's Congruence Pattern Matching
Maciej Skorski. Entropy Matters: Understanding Performance of Sparse Random Embeddings