1. Jannik Schestag and Norbert Zeh. Orienting Unrooted Binary Networks Faster: Focus on the Generator
2. Florent Foucaud, Yan Gerard, Christian Laforest and Vu Pham. Full-Cover and Non-Overlapping Uni-domination in Graphs: Bounds and Complexity
3. Sotiris Kanellopoulos, Ioannis Koutras and Aris Pagourtzis. The Complexity of Computing Class Probabilities in BID Probabilistic Databases
4. Tesshu Hanaka, Nicolás Honorato-Droguett, Hirotaka Ono, Samuel Wolf and Alexander Wolff. Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
5. Joanne Dumont, Edouard Nemery, Anthony Perez and Florian Sikora. Broadcasting Without Interference: Parameterized Complexity and Approximation
6. Vasco Cruz and Ana Paula Tomás. Complete Rectangulations are no Easier to Guard
7. Gautam Kumar Das and Siddhartha Sarkar. Geometric Discriminating and Identifying Codes Revisited: Unit Intervals Are in RP
8. Jannik Schestag and Mathias Weller. Ultrametric Network Phylogenetic Diversity and the Greedy Algorithm
9. Michalis Xefteris. From Estimates to Schedules: Learning-Augmented Restricted Assignment
10. Tatsuya Gima, Yasuaki Kobayashi, Hiraku Morimoto and Yota Otachi. On the Complexity of Forcing and Anti-Forcing Minimum Cuts
11. Shunsuke Hamada, Hiraku Morimoto and Hirotaka Ono. Computational Complexity of the Bondage Problem
12. Todor Antić, Therese Biedl, Matthias Pfretzschner, Alexander Wolff and Johannes Zink. Orthogonal Weak Dominance Drawings
13. Eleni Katsanou and Alexander Wolff. Drawings of Trees and Outerplanar Graphs with Few Directions of Monotonicity
14. Waseem Akram and Takuya Mieno. String Indexing for Maximal Gap-Bounded Occurrence Clusters
15. Priyanshu Pant and Ranveer Singh. An Odd Pfaffian Number
16. Soumen Mandal and Ashutosh Rai. Improved Exact Algorithms and Parameterized Results for Monopolar Graph Problems
17. Simon Apers and Marin Costes. Optimizing Both Checking and Update Costs in Random Walk Search
18. Palash Dey, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay and Aritra Mitra. Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
19. Tim Hegemann, Dominik Jilg, Marie Diana Sieper and Samuel Wolf. A Combinatorial Framework for Narrow Graph Drawings
20. Daniel Babický and Michal Opler. Exploration of Infinite Triangular and Hexagonal Grids by Synchronous Robots without Chirality
21. Jakub Binięda, Michał Dębski, Grzegorz Gutowski and Mateusz Milewski. How to Construct High Barrycades
22. Cipriyano Simoes, Jasine Babu and Pratik Ghosal. Eternal Vertex Cover Problem on Halin Graphs
23. Stephen Kobourov, William Lenhart, Giuseppe Liotta, Daniel Perz, Pavel Valtr and Johannes Zink. On Simultaneous Embeddings of Two Paths on the Grid
24. Arash Ahadi and Sharareh Alipour. Multiset Colorings of Random Graphs Across Density Regimes
25. Yiyang Chen, Kohei Hatano and Eiji Takimoto. Online Learning for Minimizing Maximum Tardiness in Single-Machine Scheduling
26. Maike Buchin, Jona Handzsuj and Wolf Kissler. Discrete Fréchet Distance of Partially Ordered Point Sets
27. Emilio Di Giacomo, Carolina Haase, Philipp Kindermann and Giuseppe Liotta. Planar Unit-disk Obstacle Number of Trees
28. Madhumita Kundu, Soumi Nandi, Ashutosh Rai, Sahiba Sahiba, Saket Saurabh and Roopam Saxena. Parameterized Algorithms for Obstruction Hitting with Exact Weight Constraint
29. Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma and Siani Smith. Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
30. Nader Bshouty and George Haddad. Classes Testable with $O(1/\epsilon)$ Queries for $\epsilon$ Below an $n$-Independent Threshold
31. Parth Gor, Sourya Roy and Kasturi Varadarajan. Near-Optimal Online Metric Matching on \(\Delta\)-ary HST
32. Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad and Naomi Nishimura. On the complexity of the single-move labeled token routing problem
33. László Kozma, Jongseo Lee and Michal Opler. Fast and simple multiplication of bounded twin-width matrices
34. Tristan Cam, Cyril Gavoille, Yvan Le Borgne and Simon Martiel. Entanglement from Expansion: Deterministic Graphs of Large Rank-Width
35. Grzegorz Gutowski, Dominik Jilg, Antonio Lauerbach and Mikołaj Rams. Decomposing Directed Graphs into Partial Orders is Hard
36. Kenta Komoto, Kazuhiro Kurita and Hirotaka Ono. The Complexity of Maximal and Closed Frequent Tree Mining on Bounded Height Trees
37. Priyanshu Pant and Ranveer Singh. Structural Classes for Chollet's Permanent Conjecture
38. Mehmet Utkan Gezer. Constant-Coin Complete-Information Debates for P with Arbitrarily Small Strong Error
39. Daniela Ceban and Christian Rosenke. Linear-Time Optimal Leaf Roots beyond 3-Leaf Powers
40. Satyabrata Jana, Debabrata Pal and Sasanka Roy. Faster Parameterized Algorithms for Covering Points with Non-Crossing Segments
41. Eric Decker and Sebastian Siebertz. On the Parameterized Complexity of Coloring Discovery
42. Avi Kadria and Liam Roditty. A Faster Undirected Single-Source Shortest Path Algorithm
43. Utkarsh Tiwari, Utkarsh Thanvi, Neeldhara Misra, Armaan Sethi and Aalok Thakkar. Hardness of "Infinite Energy" Puzzles
44. Tom Janßen and Christoph Grüne. Continuous Defensive Domination Problems
45. Hans L. Bodlaender, Tatsuya Gima, Yasuaki Kobayashi, Futaba Mizuno, Yuto Okada and Yota Otachi. On the Complexity of Orientable Domination
46. Shubhada Aute, Noleen Köhler and Fahad Panolan. Parameterized Algorithms for Minimum Sum Vertex Cover on Dense Graphs
47. Yuriy Dementiev, Artur Ignatiev, Anna Kogan, Ivan Mihajlin, Timofey Moskalenko, Varvara Prozorova, Anastasiia Salimova, Lev Shpraidun, Alexander Smal and Tatiana Valinurova. Improved Bounds on the Half-Duplex Communication Complexity
48. Volker Turau. Minimum Conversion Sets of f-reversible Processes on Paths
49. Aleksey Upirvitskiy and Aleksandr Levin. Fast Leaf-to-Ancestor Minimum Query In The Oracle Model
50. Henning Fernau, Kevin Mann, Arne Meier and Heribert Vollmer. Parameterized Enumeration of Minimal Defensive Alliances
51. Michał Szyfelbein. Min-Sum Set Cover on Parallel Machines
52. Naoki Kitamura, Seitaro Kawaguchi, Yuya Terashima, Yota Otachi and Taisuke Izumi. Connected Components Reconfiguration on Trees: Hardness and Algorithms
53. Maike Buchin and Lea Thiel. Computing Optimal Graph Mappings
54. Thomas van Dijk, Wolf Kißler, Lukas Plätz, Marena Richter and Jonathan Rollin. Optimizing Diameter of r-Gather under Connectivity Constraints from Convex to Connected
55. Thekla Hamm, Fabian Klute, Miriam Münch, Irene Parada and Ignaz Rutter. Deletion Distance of Planar Embeddings
56. Klara Jacobsen, Klaus Jansen, Lis Pirotton and Björn Schumacher. New Insights into the Parameterized Complexity of Cutwidth
57. S. Mahmoud Mousawi, Pierluigi San Pietro and Sandra Zilles. Learning Shuffle Ideals with Membership Queries and Contrastive Examples
58. Rajiv Raman and Suryendu Dalal. Near-Linear-Time Plane Intersection Supports for Non-Piercing Rectangles
59. Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Antonio Lauerbach and Alexander Wolff. Modelling Network Resilience: The Complexity of Some Graph Division Games
60. Lukas Bachmann, Lucas Meijer, Tillmann Miltzow, Rosna Paul, Soeren Terziadis and Sofia Vazquez Alferez. What can you draw with one coin? ER-completeness of Penny-Arrangements.
61. Xiaobin Ren and Hans L. Bodlaender. The Parameterized Complexity of Problems on Outer k-Planar Graphs
62. Amotz Bar-Noy, Igor Kalinichev, David Peleg and Dror Rawitz. Bi-sequence Degree Realization with a Minimum Dominating Set
63. Kehinde Adeogun and Christos Kapoutsis. Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
64. Kien Huynh and Joseph Mitchell. Collaborative Package Delivery in the Plane
65. Vincent Klimmer, Dietrich Kuske and Sebastian Pfau. Complexity of the Infinity Quantifier in Automatic Structures
66. Ido Borenstein and Tami Tamir. Coordination Mechanisms with Time-Dependent Processing Times
