default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th WALCOM 2025: Chengdu, China
- Shin-ichi Nakano
, Mingyu Xiao:
WALCOM: Algorithms and Computation - 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025, Proceedings. Lecture Notes in Computer Science 15411, Springer 2025, ISBN 978-981-96-2844-5 - Ryoto Ando, Kei Kimura, Taiki Todo, Makoto Yokoo:
Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs. 1-15 - Narmina Baghirova, Antoine Castillon:
Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases. 16-31 - Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier:
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. 32-46 - Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci:
On the Approximability of Graph Visibility Problems. 47-61 - Lotte Blank, Kien C. Huynh, Kelin Luo, Anurag Murty Naredla:
Algorithms for the Collaborative Delivery Problem with Monitored Constraints. 62-78 - Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang:
A Piecewise Approach for the Analysis of Exact Algorithms. 79-93 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Parameterized Complexity of (d, r)-Domination via Modular Decomposition. 94-110 - Sandip Das, Sk Samim Islam:
Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic Graphs. 111-126 - Samir Datta, Chetan Gupta:
Evaluating Monotone Circuits on Surfaces. 127-142 - Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani:
Ranking and Unranking of the Planar Embeddings of a Planar Graph. 143-159 - Simon Dreyer, Antoine Genitrini, Mehdi Naima:
Optimal Uniform Shortest Path Sampling. 160-179 - Mohammad Tamimul Ehsan, Sk. Sabit Bin Mosaddek, Mohammad Saifur Rahman:
An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets Using Suffix Automata. 180-195 - Steven Ge, Toshiya Itoh:
Popularity on the 3D-Euclidean Stable Roommates. 196-214 - Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa:
Independent Set Reconfiguration Under Bounded-Hop Token Jumping. 215-228 - Mengyuan Hu, An Zhang, Yong Chen, Mingyang Gong, Guohui Lin:
Approximation Algorithms for Non-sequential Star Packing Problems. 229-243 - Jan Matyás Kristan, Jakub Svoboda:
Reconfiguration Using Generalized Token Jumping. 244-265 - Jingyi Liu, Xian Chen, Yicheng Zheng, Jianxin Wang, Feng Shi:
Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems. 266-280 - Bar Menashe, Meirav Zehavi:
Min-Sum Disjoint Paths on Subclasses of Chordal Graphs. 281-295 - Yuan Qiu, Joe Sawada, Aaron Williams:
Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings. 296-311 - Suthee Ruangwises:
NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger. 312-325 - Thomas Selig, Haoyue Zhu:
Abelian and Stochastic Sandpile Models on Complete Bipartite Graphs. 326-345 - Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. 346-360 - Kenjiro Takazawa:
A Unified Model of Congestion Games with Priorities - Two-Sided Markets with Ties, Finite and Non-affine Delay Functions, and Pure Nash Equilibria. 361-376 - Piotr Wojciechowski, K. Subramani:
Dag-Like Unit Refutations in UTVPI Constraint Systems. 377-392 - Toru Yoshinaga, Yasushi Kawase:
Online Contention Resolution Schemes for Size-Stochastic Knapsacks. 393-408 - Jingru Zhang:
The Connected k-Vertex One-Center Problem on Graphs. 409-423
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-28 23:26 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.
