WALCOM B

34 papers

YearTitle / Authors
20221-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2022An Optimal Tester for k-Linear.
Nader H. Bshouty
2022Approximating the Bundled Crossing Number.
Alan Arroyo, Stefan Felsner
2022Aspect Ratio Universal Rectangular Layouts.
Stefan Felsner, Andrew Nathenson, Csaba D. Tóth
2022Counting and Sampling Orientations on Chordal Graphs.
Ivona Bezáková, Wenbo Sun
2022Finding Geometric Representations of Apex Graphs is NP-Hard.
Dibyayan Chakraborty, Kshitij Gajjar
2022Finding Popular Branchings in Vertex-Weighted Digraphs.
Kei Natsui, Kenjiro Takazawa
2022From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability.
Hans L. Bodlaender
2022Happy Set Problem on Subclasses of Co-comparability Graphs.
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2022Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
Oksana Firman, Joachim Spoerhase
2022Invitation to Combinatorial Reconfiguration.
Takehiro Ito
2022Isomorphism Testing for T-graphs in FPT.
Deniz Agaoglu Çagirici, Petr Hlinený
2022Machine Learning Advised Ski Rental Problem with a Discount.
Arghya Bhattacharya, Rathish Das
2022Minimum t-Spanners on Subcubic Graphs.
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
2022Morphing Tree Drawings in a Small 3D Grid.
Aleksandra Istomina, Elena Arseneva, Rahul Gangopadhyay
2022On Approximating Shortest Paths in Weighted Triangular Tessellations.
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira
2022On the Harmless Set Problem Parameterized by Treewidth.
Ajinkya Gaikwad, Soumen Maity
2022Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.
Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
2022Parameterized Complexity of Immunization in the Threshold Model.
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
2022Parameterized Complexity of Minimum Membership Dominating Set.
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2022Parameterized Complexity of Reconfiguration of Atoms.
Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura
2022Path Cover Problems with Length Cost.
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
2022Reconfiguration of Regular Induced Subgraphs.
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2022Reverse Shortest Path Problem in Weighted Unit-Disk Graphs.
Haitao Wang, Yiming Zhao
2022Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk).
Tiziana Calamoneri, Blerina Sinaimeri
2022StreamTable: An Area Proportional Visualization for Tables with Flowing Streams.
Jared Espenant, Debajyoti Mondal
2022Structural Parameterizations of Budgeted Graph Coloring.
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2022The Complexity of L(p, q)-Edge-Labelling.
Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2022The Polygon Burning Problem.
William S. Evans, Rebecca Lin
2022Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets.
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022Traversability, Reconfiguration, and Reachability in the Gadget Framework.
Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022Vertex-Weighted Graphs: Realizable and Unrealizable Domains.
Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2022Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard.
Chuzo Iwamoto, Tatsuaki Ibusuki
2022WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings
Petra Mutzel, Md. Saidur Rahman, Slamin