Abstract is missing.
- Majority Spanning Trees, Cotrees and Their ApplicationsMohammad Kaykobad, Franz J. M. Salzborn. 3-12 [doi]
- A New Transportation Problem on a Graph with Sending and Bringing-Back OperationsTetsuo Asano. 13-24 [doi]
- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting TreesHaitao Wang 0001, Yiming Zhao. 27-39 [doi]
- On Short Fastest Paths in Temporal GraphsUmesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, M. Srikanth. 40-51 [doi]
- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric WeightsTetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni. 52-64 [doi]
- The Bike Sharing ProblemJurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov. 65-77 [doi]
- Efficient Generation of a Card-Based Uniformly Distributed Random DerangementSoma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone. 78-89 [doi]
- Compact Data Structures for Dedekind Groups and Finite RingsBireswar Das, Shivdutt Sharma. 90-102 [doi]
- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi GameThomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist. 103-115 [doi]
- Faster Multi-sided One-Bend Boundary LabellingProsenjit Bose, Saeed Mehrabi 0001, Debajyoti Mondal. 116-128 [doi]
- On the Geometric Red-Blue Set Cover ProblemRaghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit. 129-141 [doi]
- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph ClassesToshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender. 142-153 [doi]
- r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASesSoh Kumabe, Takanori Maehara. 154-165 [doi]
- An Improvement of Reed's Treewidth ApproximationMahdi Belbasi, Martin Fürer. 166-181 [doi]
- Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel DigraphsFrank Gurski, Dominique Komander, Marvin Lindemann. 182-194 [doi]
- Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch AlgorithmsAlessio Conte, Etsuji Tomita. 195-207 [doi]
- Computing L(p, 1)-Labeling with Combined ParametersTesshu Hanaka, Kazuma Kawai, Hirotaka Ono. 208-220 [doi]
- On Compatible MatchingsOswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber. 221-233 [doi]
- Upward Point Set Embeddings of Paths and TreesElena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi 0001, Irene Parada, Pavel Valtr. 234-246 [doi]
- 2-Colored Point-Set Embeddings of Partial 2-TreesEmilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta. 247-259 [doi]
- Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free GraphsAhmad Biniaz. 260-271 [doi]
- APX-Hardness and Approximation for the k-Burning Number ProblemDebajyoti Mondal, N. Parthiban, V. Kavitha 0003, Indra Rajasingh. 272-283 [doi]
- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic GraphsKazuaki Yamazaki, Mengze Qian, Ryuhei Uehara. 284-295 [doi]
- Physical Zero-Knowledge Proof for Ripple EffectSuthee Ruangwises, Toshiya Itoh. 296-307 [doi]
- Cyclic Shift Problems on GraphsKwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta. 308-320 [doi]
- Mathematical Characterizations and Computational Complexity of Anti-slide PuzzlesKo Minamisawa, Ryuhei Uehara, Masao Hara. 321-332 [doi]