Abstract is missing.
- Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk)Tiziana Calamoneri, Blerina Sinaimeri. 3-14 [doi]
- From the W-hierarchy to XNLP - Classes of Fixed Parameter IntractabilityHans L. Bodlaender. 15-25 [doi]
- Invitation to Combinatorial ReconfigurationTakehiro Ito. 26-31 [doi]
- Reconfiguration of Regular Induced SubgraphsHiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa. 35-46 [doi]
- Traversability, Reconfiguration, and Reachability in the Gadget FrameworkJoshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. 47-58 [doi]
- 1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular GridsRahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides. 59-70 [doi]
- Aspect Ratio Universal Rectangular LayoutsStefan Felsner, Andrew Nathenson, Csaba D. Tóth. 73-84 [doi]
- Morphing Tree Drawings in a Small 3D GridAleksandra Istomina, Elena Arseneva, Rahul Gangopadhyay. 85-96 [doi]
- StreamTable: An Area Proportional Visualization for Tables with Flowing StreamsJared Espenant, Debajyoti Mondal. 97-108 [doi]
- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-HardChuzo Iwamoto, Tatsuaki Ibusuki. 111-122 [doi]
- The Polygon Burning ProblemWilliam Evans, Rebecca Lin. 123-134 [doi]
- Reverse Shortest Path Problem in Weighted Unit-Disk GraphsHaitao Wang 0001, Yiming Zhao. 135-146 [doi]
- Happy Set Problem on Subclasses of Co-comparability GraphsHiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura. 149-160 [doi]
- Finding Geometric Representations of Apex Graphs is NP-HardDibyayan Chakraborty, Kshitij Gajjar. 161-174 [doi]
- The Complexity of L(p, q)-Edge-LabellingGaetan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith. 175-186 [doi]
- Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output GadgetsJoshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. 187-198 [doi]
- An Optimal Tester for k-LinearNader H. Bshouty. 201-212 [doi]
- Machine Learning Advised Ski Rental Problem with a DiscountArghya Bhattacharya, Rathish Das. 213-224 [doi]
- On the Harmless Set Problem Parameterized by TreewidthAjinkya Gaikwad, Soumen Maity. 227-238 [doi]
- Isomorphism Testing for T-graphs in FPTDeniz Agaoglu Çagirici, Petr Hlinený. 239-250 [doi]
- Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex LeafageCelina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva 0001. 251-262 [doi]
- Parameterized Complexity of Reconfiguration of AtomsAlexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura. 263-274 [doi]
- Parameterized Complexity of Immunization in the Threshold ModelGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 275-287 [doi]
- Parameterized Complexity of Minimum Membership Dominating SetAkanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi. 288-299 [doi]
- Finding Popular Branchings in Vertex-Weighted DigraphsKei Natsui, Kenjiro Takazawa. 303-314 [doi]
- Vertex-Weighted Graphs: Realizable and Unrealizable DomainsAmotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz. 315-327 [doi]
- Hypergraph Representation via Axis-Aligned Point-Subspace CoverOksana Firman, Joachim Spoerhase. 328-339 [doi]
- Structural Parameterizations of Budgeted Graph ColoringSusobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman 0001. 340-351 [doi]
- Counting and Sampling Orientations on Chordal GraphsIvona Bezáková, Wenbo Sun. 352-364 [doi]
- Minimum t-Spanners on Subcubic GraphsRenzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi. 365-380 [doi]
- Approximating the Bundled Crossing NumberAlan Arroyo, Stefan Felsner. 383-395 [doi]
- Path Cover Problems with Length CostKenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita. 396-408 [doi]
- On Approximating Shortest Paths in Weighted Triangular TessellationsProsenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira. 409-421 [doi]