Abstract is missing.
- Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract)Paola Flocchini. 3-7 [doi]
- Open Problems and Recent Developments on a Complexity Framework for Forbidden SubgraphsErik Jan van Leeuwen. 8-20 [doi]
- Parameterized Complexity of Feedback Vertex Set with Connectivity ConstraintsAnkit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh 0001. 23-36 [doi]
- Online b-Matching with Stochastic RewardsSusanne Albers, Sebastian Schubert. 37-50 [doi]
- Shortest Longest-Path Graph Orientations for TreesYuichi Asahiro, Jesper Jansson 0001, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono 0001, Quan Xue, Yoshichika Yano, Shay Zakov. 51-64 [doi]
- Parameterized Complexity of Generalizations of Edge Dominating SetShubhada Aute, Fahad Panolan, Souvik Saha 0002, Saket Saurabh 0001, Anannya Upasana. 65-79 [doi]
- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided MaskingIvana Benová, Jana Kosecka, Michal Gregor, Martin Tamajka, Marcel Veselý, Marián Simko. 80-93 [doi]
- On the Complexity of Minimum Membership Dominating SetD. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh 0001, Sanjay Seetharaman. 94-107 [doi]
- On the Structural Parameterized Complexity of Defective ColoringSriram Bhyravarapu, Pankaj Kumar, Saket Saurabh 0001. 108-121 [doi]
- Dynamic Range Minimum Queries on the Ultra-wide Word RAMPhilip Bille, Inge Li Gørtz, Máximo Pérez López, Tord Stordalen. 122-135 [doi]
- Fast Practical Compression of Deterministic Finite AutomataPhilip Bille, Inge Li Gørtz, Max Rishøj Pedersen. 136-150 [doi]
- Orienteering (with Time Windows) on Restricted Graph ClassesKevin Buchin, Mart Hagedoorn, Guangping Li 0001, Carolin Rehs. 151-165 [doi]
- Massively Parallel Maximum Coverage RevisitedThai Bui, Hoa T. Vu. 166-178 [doi]
- Distance Vector DominationGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 179-194 [doi]
- Sufficient Conditions for Polynomial-Time Detection of Induced MinorsClément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez 0001. 195-208 [doi]
- Pathways to Tractability for Geometric ThicknessThomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg. 209-224 [doi]
- Minimum Monotone Spanning TreesEmilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff 0001. 225-240 [doi]
- Representing Hypergraphs by Point-Line IncidencesAlexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg. 241-254 [doi]
- Reachability in Temporal Graphs Under PerturbationJessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson. 255-269 [doi]
- On Computational Completeness of Semi-Conditional Matrix GrammarsHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. 270-283 [doi]
- Outer-(ap)RAC GraphsHenry Förster, Julia Katheder, Giacomo Ortali. 284-299 [doi]
- Forest Covers and Bounded Forest CoversDaya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh. 300-313 [doi]
- Multi-agent Search-Type Problems on Polygons - (Extended Abstract)Konstantinos Georgiou, Caleb Jones, Jesse Lucier. 314-332 [doi]
- Generation of Cycle Permutation Graphs and Permutation SnarksJan Goedgebeur, Jarne Renders. 333-346 [doi]
- Expected Density of Random MinimizersShay Golan 0001, Arseny M. Shur. 347-360 [doi]