Daniel Paul-Pena and C. Seshadhri. A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
Ambar Pal, Rajiv Raman, Karamjeet Singh and Saurabh Ray. A fast algorithm for computing a planar support for non-piercing rectangles
Ashwin Jacob, Diptapriyo Majumdar and Meirav Zehavi. A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
Qian Li, Minghui Ouyang and Yuyi Wang. A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
Joachim Gudmundsson, Tiancheng Mai and Sampson Wong. Approximating the Fréchet distance when only one curve is c-packed
Jingyang Zhao and Mingyu Xiao. Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada and Rin Saito. Basis sequence reconfiguration in the union of matroids
Vadim Lozin, Barnaby Martin, Sukanya Pandey, Daniel Paulusma, Mark Siggers, Siani Smith and Erik Jan van Leeuwen. Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the ``H''-graphs
Bodo Manthey, Nils Morawietz, Jesse van Rhijn and Frank Sommer. Complexity of Local Search for Euclidean Clustering Problems
Susumu Kubo, Kazuhisa Makino and Souta Sakamoto. Composition Orderings for Linear Functions and Matrix Multiplication Orderings
Michał Włodarczyk. Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
Thomas Depian, Martin Nöllenburg, Soeren Terziadis and Markus Wallinger. Constrained Boundary Labeling
Taehoon Ahn and Sang Won Bae. Constrained Two-Line Center Problems
Tesshu Hanaka, Noleen Köhler and Michael Lampis. Core Stability in Additively Separable Hedonic Games of Low Treewidth
Petr Hlineny and Liana Khazaliya. Crossing Number is NP-hard for Constant Path-width (and Tree-width)
Ivor van der Hoog, Eva Rotenberg and Sampson Wong. Data Structures for Approximate Fréchet Distance for Realistic Curves
Michał Włodarczyk. Does Subset Sum Admit Short Proofs?
Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin and Chanho Song. Dynamic Parameterized Problems on Unit Disk Graphs
Mit Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock and Zixiang Zhou. Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs
Sankardeep Chakraborty, Kunihiko Sadakane and Wiktor Zuba. Enhancing Generalized Compressed Suffix Trees, with Applications
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak and Meirav Zehavi. Exact Algorithms for Clustered Planarity with Linear Saturators
Keerti Choudhary, Shivam Bansal, Harkirat Dhanoa and Harsh Wardhan. Fault-Tolerant Bounded Flow Preservers
Lena Jasmin Carta, Lukas Drexler, Annika Hennes, Clemens Rösner and Melanie Schmidt. FPT Approximations for Fair k-Min-Sum-Radii
Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch and Dániel Marx. From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
Petr Gregor, Hung Hoang, Arturo Merino and Ondřej Mička. Generating all invertible matrices by row operations
Shunhua Jiang, Victor Lecomte, Omri Weinstein and Sorrachai Yingchareonthawornchai. Hardness Amplification for Dynamic Binary Search Trees
Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi and Siebertz Sebastian. Kernelization complexity for solution discovery problems
Palash Dey, Ashlesha Hota, Sudeshna Kolay and Sipra Singh. Knapsack with Vertex Cover, Set Cover, and Hitting Set
Sunny Atalig, Alexandar Hickerson, Arrdya Srivastav, Tingting Zheng and Marek Chrobak. Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
Sándor Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck and Christian Scheffer. Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
Kyungjin Cho and Eunjin Oh. Mimicking Networks for Constrained Multicuts in Hypergraphs
Hugo Akitaya, Ahmad Biniaz, Erik Demaine, Linda Kleist, Frederick Stock and Csaba Toth. Minimum Plane Bichromatic Spanning Trees
Emily Clark, Chloe Georgiou, Katelyn Poon and Marek Chrobak. On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
Alexander Firbas and Manuel Sorge. On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
Hyung-Chan An and Mong-Jen Kao. On the Connected Minimum Sum of Radii Problem
Neeldhara Misra, Harshil M. and Ashutosh Rai. On the Parameterized Complexity of DiverseSAT
Prosenjit Bose, Darryl Hill, Michiel Smid and Tyler Tuttle. On the Spanning and Routing Ratios of the Yao-Four Graph
Mathieu Mari, Michał Pawłowski, Runtian Ren and Piotr Sankowski. Online Multi-level Aggregation with Delays and Stochastic Arrivals
Thore Thießen and Jan Vahrenhold. Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
Koustav Bhanja. Optimal Sensitivity Oracle for Steiner Mincut
Samuel Bismuth, Vladislav Makarov, Erel Segal-Halevi and Dana Shapira. Partitioning Problems with Splittings and Interval Targets
Naonori Kakimura and Yuta Mishima. Reconfiguration of Labeled Matchings in Triangular Grid Graphs
Lin Chen, Yixiong Gao, Minming Li, Guohui Lin and Kai Wang. Revisit the Scheduling Problem with Calibrations
Erwin Glazenburg, Thijs van der Horst, Frank Staals, Tom Peters and Bettina Speckmann. Robust Bichromatic Classification using Two Lines
Erwin Glazenburg, Frank Staals and Marc van Kreveld. Robust Classification of Dynamic Bichromatic Point Sets in R2
John Stuart, Prosenjit Bose and Jean-Lou De Carufel. Routing from Pentagon to Octagon Delaunay graphs
Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani and Ignaz Rutter. Simple Realizability of Abstract Topological Graphs
Kengo Nakamura, Masaaki Nishino and Shuhei Denzumi. Single Family Algebra Operation on BDDs and ZDDs Leads To Exponential Blow-Up
Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas and Timo Specht. Subsequence Matching and Analysis Problems for Formal Languages
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim and Kunihiko Sadakane. Succinct Data Structures for Baxter Permutation and Related Families
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti and Alessandro Straziota. Temporal queries for dynamic temporal forests
Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals and Jules Wulms. The Complexity of Geodesic Spanners using Steiner Points
Markus Bläser, Julian Dörfler, Maciej Liskiewicz and Benito van der Zander. The Existential Theory of the Reals with Summation Operators
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
William Lochet and Roohani Sharma. Uniform Polynomial Kernel for Deletion to $K_{2,p}$ Minor-Free Graphs
Jaroslav Garvardt, Nils Morawietz and Christian Komusiewicz. When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?