Table of Contents

• On Maximizing Sums of Non-Monotone Submodular and Linear FunctionsBenjamin Qi. [doi]
• Entropy Matters: Understanding Performance of Sparse Random EmbeddingsMaciej Skorski. [doi]
• Package Delivery Using Drones with Restricted Movement AreasThomas Erlebach, Kelin Luo, Frits C. R. Spieksma. [doi]
• One-Face Shortest Disjoint Paths with a Deviation TerminalYusuke Kobayashi 0001, Tatsuya Terao. [doi]
• Hierarchical Categories in Colored SearchingPeyman Afshani, Rasmus Killmann, Kasper Green Larsen. [doi]
• On Algorithmic Self-Assembly of Squares by Co-Transcriptional FoldingSzilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi. [doi]
• On the Cop Number of String GraphsSandip Das 0001, Harmender Gahlawat. [doi]
• Optimizing Quantum Circuit Parameters via SDPEunou Lee. [doi]
• Nested Active-Time SchedulingNairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh. [doi]
• Parameterized Approximation Algorithms for TSPJianqi Zhou, Peihua Li, Jiong Guo. [doi]
• Simple Order-Isomorphic Matching Index with Expected Compact SpaceSung-Hwan Kim, Hwan-Gue Cho. [doi]
• Graph Product Structure for h-Framed GraphsMichael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann 0001. [doi]
• Segment Visibility Counting Queries in PolygonsKevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov 0001, Marcel Roeloffzen, Frank Staals. [doi]
• On Graphs Coverable by k Shortest PathsMaël Dumas, Florent Foucaud, Anthony Perez 0001, Ioan Todinca. [doi]
• Efficiently Reconfiguring a Connected Swarm of Labeled RobotsSándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, Arne Schmidt 0001. [doi]
• Super-Cubic Lower Bound for Generalized Karchmer-Wigderson GamesArtur Ignatiev, Ivan Mihajlin, Alexander Smal. [doi]
• Partial and Simultaneous Transitive Orientations via Modular DecompositionsMiriam Münch, Ignaz Rutter, Peter Stumpf. [doi]
• Integer Complexity and Mixed Binary-Ternary RepresentationKazuyuki Amano. [doi]
• Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSPZachary Friggstad, Ramin Mousavi. [doi]
• Algorithms for Coloring Reconfiguration Under Recolorability DigraphsSoichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki. [doi]
• External-Memory Dictionaries with Worst-Case Update CostRathish Das, John Iacono, Yakov Nekrich. [doi]
• Range Updates and Range Sum Queries on Multidimensional Points with Monoid WeightsShangqi Lu, Yufei Tao 0001. [doi]
• Simon's Congruence Pattern MatchingSungmin Kim, Sang-Ki Ko, Yo-Sub Han. [doi]
• Improving the Bounds of the Online Dynamic Power Management ProblemYa-Chun Liang, Kazuo Iwama, Chung-Shou Liao. [doi]
• Lower Bounds on Retroactive Data StructuresLily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. [doi]
• Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a SurvivorProsenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer. [doi]
• Space-Efficient Graph Coarsening with Applications to Succinct Planar EncodingsFrank Kammer, Johannes Meintrup. [doi]
• On Reverse Shortest Paths in Geometric Proximity GraphsPankaj K. Agarwal, Matthew J. Katz, Micha Sharir. [doi]
• Shortest Beer Path Queries in Interval GraphsRathish Das, Meng He 0001, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu. [doi]
• Multi-Robot Motion Planning for Unit Discs with Revolving AreasPankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor 0002. [doi]
• Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and BeyondDibyayan Chakraborty, Antoine Dailly, Sandip Das 0001, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh. [doi]
• Computing Palindromes on a Trie in Linear TimeTakuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga. [doi]
• Hardness of Approximation for H-Free Edge Modification Problems: Towards a DichotomyTatiana Belova, Ivan Bliznets. [doi]
• Algorithms for Landmark Hub LabelingSabine Storandt. [doi]
• Locally Checkable Problems Parameterized by Clique-WidthNarmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl. [doi]
• On Finding Short Reconfiguration Sequences Between Independent SetsAkanksha Agrawal, Soumita Hait, Amer E. Mouawad. [doi]
• On the Complexity of Tree Edit Distance with VariablesTatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, Thomas N. Sato. [doi]
• Clustering with Faulty CentersKyle Fox, Hongyao Huang, Benjamin Raichel. [doi]
• Minimizing the Maximum Flow Time in the Online Food Delivery ProblemXiangyu Guo, Kelin Luo, Shi Li 0001, Yuhao Zhang 0001. [doi]
• A Local Search Algorithm for the Min-Sum Submodular Cover ProblemLisa Hellerstein, Thomas Lidbetter, R. Teal Witter. [doi]
• How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?Junbin Fang, Dominique Unruh, Jun Yan, Dehua Zhou. [doi]
• List Locally Surjective Homomorphisms in Hereditary Graph ClassesPavel Dvorák, Tomás Masarík, Jana Novotná 0001, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk. [doi]
• Computation of Cycle Bases in Surface Embedded GraphsKyle Fox, Thomas Stanley. [doi]
• Extended MSO Model Checking via Small Vertex IntegrityTatsuya Gima, Yota Otachi. [doi]
• Proportional Allocation of Indivisible Goods up to the Least Valued Good on AverageYusuke Kobayashi 0001, Ryoga Mahara. [doi]
• Finding Matching Cuts in H-Free GraphsFelicia Lucke, Daniël Paulusma, Bernard Ries. [doi]
• Succinct List Indexing in Optimal TimeWilliam L. Holland. [doi]
• Minimum Link FencingSujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu. [doi]
• Approximating the Minimum Logarithmic Arrangement ProblemJulián Mestre, Sergey Pupyrev. [doi]
• Evacuation from a Disk for Robots with Asymmetric CommunicationKonstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis. [doi]
• Subquadratic Weighted Matroid Intersection Under Rank OraclesTa-Wei Tu. [doi]
• On the Parameterized Intractability of Determinant MaximizationNaoto Ohsaka. [doi]
• Popular Edges with Critical NodesKushagra Chatterjee, Prajakta Nimbhorkar. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• The Dispersive Art Gallery ProblemChristian Rieck, Christian Scheffer. [doi]
• Succinct Representations of Graphs (Invited Talk)Kunihiko Sadakane. [doi]
• On Constrained Intersection Representations of Graphs and DigraphsFerdinando Cicalese, Clément Dallard, Martin Milanic. [doi]
• Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis ProblemsJoel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid. [doi]
• Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long ClawsMichal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski. [doi]
• On the Complexity of Rainbow Vertex Colouring Diametral Path GraphsJakob Dyrseth, Paloma T. Lima. [doi]
• An Optimal Oracle Separation of Classical and Quantum Hybrid SchemesAtsuya Hasegawa, François Le Gall. [doi]
• Budgeted Out-Tree Maximization with Submodular PrizesGianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert. [doi]
• Polynomial Threshold Functions for Decision ListsVladimir V. Podolskii, Nikolay V. Proskurin. [doi]
• Combinatorial and Algorithmic Aspects of Monadic StabilityJan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny. [doi]
• Distortion-Oblivious Algorithms for Scheduling on Multiple MachinesYossi Azar, Eldad Peretz, Noam Touitou. [doi]
• Improved Compression of the Okamura-Seymour MetricShay Mozes, Nathan Wallheimer, Oren Weimann. [doi]
• The Tragedy of Being Almost but Not Quite Planar (Invited Talk)Jeff Erickson 0001. [doi]