Łukasz Mielewczyk, Leonidas Palios and Paweł Żyliński. The Rectilinear Steiner Forest Arborescence
Nicolas El Maalouly and Kostas Lakis. Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad and Naomi Nishimura. On the complexity of constrained reconfiguration and motion planning
Aleksander B. G. Christiansen, Teresa Anna Steiner, Eva Rotenberg and Juliette Marie Victoire Vlieghe. Private Graph Colouring with Limited Defectiveness
Oren Weimann and Raphael Yuster. Maintaining a Kingdom in a Tournament
Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka and Ayumi Shinohara. Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries
Therese Biedl. Face-hitting dominating sets in plane graphs: Alternative proof and linear-time algorithm
Therese Biedl and Prashant Gokhale. Using ray-shooting queries for sublinear algorithms for dominating sets in RDV graphs
Nader Bshouty. Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction
Nadym Mallek and Kirill Simonov. Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
Hiroshi Fujiwara, Kota Miyagi and Katsuhisa Ouchi. Pinwheel Scheduling with Real Periods
Kunanon Burathep, Thomas Erlebach and William K. Moses Jr.. Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
Petr Hlineny and Jan Jedelský. k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs
Kei Kimura. Towards an algebraic approach to the reconfiguration CSP
Matthias Bentert, Pål Grønås Drange and Erlend Haugen. Overlapping Biclustering
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil and Paweł Rzążewski. Complexity Aspects of Homomorphisms of Ordered Graphs
Katarzyna Paluch and Mateusz Wasylkiewicz. Clique-free t-matchings in degree-bounded graphs
Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki and Yuma Tamura. Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura and Xiao Zhou. Spanning Trees with a Small Vertex Cover the Complexity on Specific Graph Classes
Tesshu Hanaka, Hironori Kiya and Hirotaka Ono. Finding a HIST: Chordality, Structural Parameters, and Diameter
Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen Kobourov and Johannes Zink. Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
Stijn Cambie, Jan Goedgebeur, Jorik Jooken and Tibo Van den Eede. On the order-diameter ratio of girth-diameter cages
Ajinkya Gaikwad, Soumen Maity and Saket Saurabh. Parameterized Algorithms for Locally Minimal Defensive Alliance
Shion Fukuzawa, Michael Goodrich and Sandy Irani. Sublinear Work Parallel Quantum Algorithms for Computational Geometry
Yosuke Kusano. Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations
Adam Gańczorz and Tomasz Jurdzinski. Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
Todor Antić, Aleksa Džuklevski, Jiří Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell and Johannes Zink. Edge-Constrained Hamiltonian Paths in a Point Set
Anuran Maity and Venkata Krishna Kanduru. Mutually Abelian-Bordered Binary Words
Kevin Mann. Enumeration With Nice Roman Domination Properties
Sampriti Roy. Distribution Testing Meets Sum Estimation
Christian Komusiewicz and Diptapriyo Majumdar. Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
Tithi Dwary and Venkata Krishna Kanduru. Minimum Length Word-Representants of Treelike Permutation Graphs
Kehinde Adeogun and Christos Kapoutsis. A quadratic lower bound for 2DFAs against one-way liveness
Sebastian Bruchhold and Mathias Weller. Exploiting Low Scanwidth to Resolve Soft Polytomies
Arthur Mittelstaedt and Gaétan Richard. Vertical-Horizontal Full Compatibility of one-dimensional Subshifts
Erwin Glazenburg and Frank Staals. On strictly output sensitive color frequency reporting
Yoshihiro Maruyama. Algorithms and Complexity Results for K-theoretic Persistent Homology
Rene Sitters, Tim Oosterwijk and Steven Miltenburg. On the complexity of capacitated vehicle routing with order restrictions
Jannik Schestag. Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
Niklas Haas, Sören Schmitt and Rob van Stee. The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish and Felix Reidl. Efficient trace frequency queries in sparse graphs
Christine Awofeso, Patrick Greaves, Oded Lachish and Felix Reidl. A practical algorithm for 3-admissibility
Christine Awofeso, Patrick Greaves, Oded Lachish and Felix Reidl. Counting large patterns in degenerate graphs
Hikaru Manabe, Ryohei Miyadera and Koki Suetsugu. On the Sprague-Grundy values of games with a pass
Kamil Khadiev, Vladislav Remidovskiy, Timur Bikmullin and Aliya Khadieva. Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
Kristina Asimi, Tala Eagling-Vose, Santiago Guzman Pro, Barnaby Martin and Yiming Qiu. Quantified Colouring and H-free Algorithmics
Shiwali Gupta and Rogers Mathew. Bounds and Hardness Results for Conflict-free Choosability
Michael Itzhaki. Asymptotically Optimal Representation of Palindromic Structure
Yoshihiro Maruyama. Reverse Mathematics for Neural Networks
