default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th WALCOM 2022: Jember, Indonesia
- Petra Mutzel
, Md. Saidur Rahman, Slamin:
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings. Lecture Notes in Computer Science 13174, Springer 2022, ISBN 978-3-030-96730-7
Invited Talks
- Tiziana Calamoneri, Blerina Sinaimeri:
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). 3-14 - Hans L. Bodlaender:
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. 15-25 - Takehiro Ito:
Invitation to Combinatorial Reconfiguration. 26-31
Combinatorial Reconfiguration
- Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. 35-46 - Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. 47-58 - Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. 59-70
Graph Drawing and Visualization
- Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. 73-84 - Aleksandra Istomina, Elena Arseneva, Rahul Gangopadhyay:
Morphing Tree Drawings in a Small 3D Grid. 85-96 - Jared Espenant, Debajyoti Mondal:
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams. 97-108
Computational Geometry
- Chuzo Iwamoto, Tatsuaki Ibusuki:
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard. 111-122 - William S. Evans, Rebecca Lin:
The Polygon Burning Problem. 123-134 - Haitao Wang, Yiming Zhao:
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs. 135-146
Computational Complexity
- Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. 149-160 - Dibyayan Chakraborty, Kshitij Gajjar:
Finding Geometric Representations of Apex Graphs is NP-Hard. 161-174 - Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith:
The Complexity of L(p, q)-Edge-Labelling. 175-186 - Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. 187-198
Online and Property Testing
- Nader H. Bshouty:
An Optimal Tester for k-Linear. 201-212 - Arghya Bhattacharya, Rathish Das:
Machine Learning Advised Ski Rental Problem with a Discount. 213-224
Parameterized Complexity
- Ajinkya Gaikwad, Soumen Maity:
On the Harmless Set Problem Parameterized by Treewidth. 227-238 - Deniz Agaoglu Çagirici, Petr Hlinený:
Isomorphism Testing for T-graphs in FPT. 239-250 - Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva:
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. 251-262 - Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. 263-274 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Parameterized Complexity of Immunization in the Threshold Model. 275-287 - Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. 288-299
Graph Algorithms
- Kei Natsui, Kenjiro Takazawa:
Finding Popular Branchings in Vertex-Weighted Digraphs. 303-314 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. 315-327 - Oksana Firman, Joachim Spoerhase:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. 328-339 - Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. 340-351 - Ivona Bezáková, Wenbo Sun:
Counting and Sampling Orientations on Chordal Graphs. 352-364 - Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Minimum t-Spanners on Subcubic Graphs. 365-380
Approximation Algorithms
- Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. 383-395 - Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita:
Path Cover Problems with Length Cost. 396-408 - Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. 409-421
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-21 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
