default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th WALCOM 2021: Virtual Event / Yangon, Myanmar
- Ryuhei Uehara
, Seok-Hee Hong, Subhas C. Nandy:
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1
Invited Talks
- Mohammad Kaykobad, Franz J. M. Salzborn:
Majority Spanning Trees, Cotrees and Their Applications. 3-12 - Tetsuo Asano:
A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. 13-24
Long Papers
- Haitao Wang, Yiming Zhao:
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. 27-39 - Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth:
On Short Fastest Paths in Temporal Graphs. 40-51 - Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. 52-64 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. 65-77 - Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone:
Efficient Generation of a Card-Based Uniformly Distributed Random Derangement. 78-89 - Bireswar Das, Shivdutt Sharma:
Compact Data Structures for Dedekind Groups and Finite Rings. 90-102 - Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. 103-115 - Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. 116-128 - Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
On the Geometric Red-Blue Set Cover Problem. 129-141 - Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. 142-153 - Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. 154-165 - Mahdi Belbasi, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. 166-181 - Frank Gurski, Dominique Komander, Marvin Lindemann:
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. 182-194 - Alessio Conte, Etsuji Tomita:
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. 195-207 - Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. 208-220 - Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. 221-233 - Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. 234-246 - Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta:
2-Colored Point-Set Embeddings of Partial 2-Trees. 247-259 - Ahmad Biniaz:
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. 260-271 - Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh:
APX-Hardness and Approximation for the k-Burning Number Problem. 272-283 - Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara:
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. 284-295 - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Ripple Effect. 296-307 - Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. 308-320 - Ko Minamisawa, Ryuhei Uehara, Masao Hara:
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. 321-332
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 2025-04-24 21:13 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
