default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th WALCOM 2020: Singapore
- M. Sohel Rahman
, Kunihiko Sadakane, Wing-Kin Sung:
WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings. Lecture Notes in Computer Science 12049, Springer 2020, ISBN 978-3-030-39880-4
Invited Talks
- Md. Saidur Rahman, Md. Rezaul Karim:
Drawing Planar Graphs. 3-14 - Osamu Watanabe:
Space Efficient Separator Algorithms for Planar Graphs. 15-21 - Louxin Zhang:
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks. 22-27
Long Papers
- Subhash Bhagat:
Optimum Algorithm for the Mutual Visibility Problem. 31-42 - Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert:
Routing in Histograms. 43-54 - Miguel Coviello Gonzalez, Marek Chrobak:
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. 55-68 - Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest Covers of All Cyclic Shifts of a String. 69-80 - Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-Planar Graphs. 81-93 - William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. 94-106 - Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. 107-119 - Diptarama Hendrian:
Generalized Dictionary Matching Under Substring Consistent Equivalence Relations. 120-132 - Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita:
Reconfiguring k-path Vertex Covers. 133-145 - Chuzo Iwamoto, Tatsuaki Ibusuki:
Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. 146-157 - Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. 158-169 - Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-Planar Graphs. 170-182 - Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots on Grids. 183-197 - Joseph S. B. Mitchell, Supantha Pandit:
Packing and Covering with Segments. 198-210 - Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato:
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. 211-222 - Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. 223-235 - Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath:
On the Maximum Edge-Pair Embedding Bipartite Matching. 236-248 - Ajay Saju Jacob, R. Krithika:
Packing Arc-Disjoint Cycles in Bipartite Tournaments. 249-260 - Josué Corujo, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
Matching Random Colored Points with Rectangles. 261-272 - Hirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato:
Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. 273-285 - Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. 286-295 - Dat Hoang Tran, Ryuhei Uehara:
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. 296-307 - Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Faster Privacy-Preserving Computation of Edit Distance with Moves. 308-320
Short Papers
- Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized Algorithms for the Happy Set Problem. 323-328 - Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. 329-335 - Kei Kimura, Akira Suzuki:
Trichotomy for the Reconfiguration Problem of Integer Linear Systems. 336-341 - Christian Scheffer:
Train Scheduling: Hardness and Algorithms. 342-347
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 2024-12-26 00:34 CET 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:
