Abstract is missing.
- Drawing Planar GraphsMd. Saidur Rahman 0001, Md. Rezaul Karim. 3-14 [doi]
- Space Efficient Separator Algorithms for Planar GraphsOsamu Watanabe. 15-21 [doi]
- Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic NetworksLouxin Zhang. 22-27 [doi]
- Optimum Algorithm for the Mutual Visibility ProblemSubhash Bhagat. 31-42 [doi]
- Routing in HistogramsMan-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert. 43-54 [doi]
- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic ChipsMiguel Coviello Gonzalez, Marek Chrobak. 55-68 [doi]
- Shortest Covers of All Cyclic Shifts of a StringMaxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. 69-80 [doi]
- Packing Trees into 1-Planar GraphsFelice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath. 81-93 [doi]
- Angle Covers: Algorithms and ComplexityWilliam S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff 0001. 94-106 [doi]
- Fast Multiple Pattern Cartesian Tree MatchingGeonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park. 107-119 [doi]
- Generalized Dictionary Matching Under Substring Consistent Equivalence RelationsDiptarama Hendrian. 120-132 [doi]
- Reconfiguring k-path Vertex CoversDuc A. Hoang, Akira Suzuki, Tsuyoshi Yagita. 133-145 [doi]
- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal PolygonsChuzo Iwamoto, Tatsuaki Ibusuki. 146-157 [doi]
- Maximum Bipartite Subgraph of Geometric Intersection GraphsSatyabrata Jana, Anil Maheshwari, Saeed Mehrabi 0001, Sasanka Roy. 158-169 [doi]
- The Stub Resolution of 1-Planar GraphsMichael Kaufmann 0001, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr. 170-182 [doi]
- Dispersion of Mobile Robots on GridsAjay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma. 183-197 [doi]
- Packing and Covering with SegmentsJoseph S. B. Mitchell, Supantha Pandit. 198-210 [doi]
- Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph EnumerationYu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato. 211-222 [doi]
- Partitioning a Graph into Complementary SubgraphsJulliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter. 223-235 [doi]
- On the Maximum Edge-Pair Embedding Bipartite MatchingCam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath. 236-248 [doi]
- Packing Arc-Disjoint Cycles in Bipartite TournamentsAjay Saju Jacob, R. Krithika 0001. 249-260 [doi]
- Matching Random Colored Points with RectanglesJosué Corujo, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara. 261-272 [doi]
- Designing Survivable Networks with Zero-Suppressed Binary Decision DiagramsHirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato. 273-285 [doi]
- Approximability of the Independent Feedback Vertex Set Problem for Bipartite GraphsYuma Tamura, Takehiro Ito, Xiao Zhou. 286-295 [doi]
- Efficient Enumeration of Non-isomorphic Ptolemaic GraphsDat Hoang Tran, Ryuhei Uehara. 296-307 [doi]
- Faster Privacy-Preserving Computation of Edit Distance with MovesYohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto. 308-320 [doi]
- Parameterized Algorithms for the Happy Set ProblemYuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru. 323-328 [doi]
- An Experimental Study of a 1-Planarity Testing and Embedding AlgorithmCarla Binucci, Walter Didimo, Fabrizio Montecchiani. 329-335 [doi]
- Trichotomy for the Reconfiguration Problem of Integer Linear SystemsKei Kimura, Akira Suzuki. 336-341 [doi]
- Train Scheduling: Hardness and AlgorithmsChristian Scheffer. 342-347 [doi]