Bar Moving Problem in Constraint Grid
Bee Geum
Exact Bounds for Chinese Postman Augmentation of Grid Spanning Trees
Bee Geum
Extremal List Gaps and Inapproximability in Additive Graph Labeling
Arash Ahadi and Sharareh Alipour
Evacuating from Eventually Emerging Targets on the Line
Konstantinos Georgiou, Caleb Jones and Liza Krupsky
Card-Based Zero-Knowledge Proofs for Fill-In
Anaïs Durand, Pascal Lafourcade, Daiki Miyahara, Maxime Puys and Kazumasa Shinagawa
Computing Independent Sets of Size Three in Disk Graphs
Anastasiia Tkachenko and Haitao Wang
A Linear Time Algorithm for Computing the Expected Number of Connected Vertices Parameterized by Treewidth
Kengo Nakamura, Masaaki Nishino and Ryoma Onaka
Parameterized Complexity of Spanner Problems with Independent Weights and Lengths
Marius Bächler, Markus Chimani and Henning Jasper
On the General Position Number of Cacti
Toshihiko Kimura, Yonghwan Kim and Yoshiaki Katayama
An Approximation Algorithm for Non-uniform Non-contiguous Translocation Distance
Maria Constantin, Adrian Miclaus and Alexandru Popa
Structural Complexity of Matching-Match: Dense and Sparse Graphs
Ilie Dumitru, Adrian Miclaus and Alexandru Popa
Online Conflict-free Coloring of Rectangles on the x-axis
Arash Beikmohammadi
Odd and Even Harder Problems on Cycle-Factors
Florian Hörsch, Csaba Király, Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó and Yutaro Yamaguchi
Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness
Arash Ahadi, Morteza Alimi, Sharareh Alipour and Shayan Tayefeh
Generating 2-Gray Codes for Bounded Excursions and Łukasiewicz Paths in Constant Amortized Time
Dennis Wong and Liang Xu
Contiguous Monotone Moldable Job Scheduling
Bennet Edler, Klaus Jansen and Felix Ohnesorge
Compiling Sets of Subgraphs into Tree Decision Diagrams
Kengo Nakamura, Masaaki Nishino and Ryoma Onaka
Breadth-First Search in Succinct Planar Graphs
Johannes Meintrup
Crossing Numbers of Beyond Outer-Planar Graphs
Markus Chimani and Mirko H. Wagner
Tighter Upper Bounds on Distinct k-Powers via Left Lyndon Trees
Eitatsu Tomita, Peaker Guo and Tomohiro I
Connected Majorities on Vertex-Labeled Graphs
Naohito Matsumoto, Masashi Kiyomi, Takeaki Uno and Kunihiro Wasa
Zero Forcing Sets in Temporal Graphs
Mikaël Rabie, Julien Baste, Clara Marcille, Simon Dreyer and Ronan Toullec Streicher
Maximum Edge Open Packing on AT-Free, Chordal, and Convex Bipartite Graphs
Gautam K. Das and Kamal Santra
Smooth Path Drawings of Planar Graphs
Peter Eades, Xiaohan Han, Patrick Healy and Seok-Hee Hong
A Complete Classification of Overlap in Edge Unfoldings of Regular Prisms with Arbitrary Height
Tonan Kamata, Jason S. Ku, Takumi Shiota and Ryuhei Uehara
The Euclidean Minimum Spanning Tree Extension Problem and its Approximation
Emilio Di Giacomo, Giuseppe Liotta, Daniel Perz and Morteza Saghafian
Mixed Cycle Cover Problem with Required-Edge Constraints
Kosuke Susukita and Junichi Teruyama
k-Defensive Domination in Tournaments and Bipartite Tournaments
Pragya Arora and Neeldhara Misra
Counting Holes in Near-Quadratic Time
Bhaswar Bhattacharya, Sandip Das, Sk Samim Islam, Aashirwad Mohapatra and Saumya Sen
Simple Polygons and 1.5D Terrains with Many Critical Visibilities
Maria Saumell and Pavel Valtr
The Optimal Questionnaire Problem
Marco Faella
Solving Vertex Integrity Faster than 2^n
Sandip Das, Sweta Das, Sk Samim Islam, Ritam Manna Mitra, Aashirwad Mohapatra and Arkaprava Paul
The Complexity of Restricted Approximate Longest Common Substring on Multiple Strings
Hamed Hasibi, Neerja Mhaskar and William F. Smyth
Online Geometric Spanners with Small Chromatic Number
Theodore Fung, Oscar Guevara Viveros, Marcus Shaw and Csaba Tóth
On the Complexity of $r$-Multipacking
Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M Mitra and Bodhayan Roy
Exact Enumeration of Floorplans with a Given $HV$-Word
Rohit Lohani, Ravi Suthar and Krishnendra Shekhawat
Attribute-Carrying Endpoints: Card-Based Zero-Knowledge Proofs for Yosenabe and Satogaeri
Anaïs Durand, Pascal Lafourcade, Daiki Miyahara and Maxime Puys
Rank-Two Binary Identification: Matching Equivalences
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai and Ting-An Wu