Abstract is missing.
- Recent Research Activities on Algorithmic Foundations for Social AdvancementShin-ichi Minato. 1-8 [doi]
- Reasons to Fall (More) in Love with Combinatorial ReconfigurationNaomi Nishimura. 9-14 [doi]
- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed AngleCsaba D. Tóth. 15-31 [doi]
- Quantum Graph Drawing [Best Student Paper]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista. 32-46 [doi]
- Simultaneous Drawing of Layered TreesJulia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister 0002, Johannes Zink 0001. 47-61 [doi]
- Fully Dynamic Algorithms for Euclidean Steiner TreeT.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue. 62-75 [doi]
- The Parameterized Complexity of Terminal Monitoring SetN. R. Aravind, Roopam Saxena. 76-90 [doi]
- Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing WordsDennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im. 91-102 [doi]
- On the Hardness of Gray Code Problems for Combinatorial ObjectsArturo I. Merino, Namrata, Aaron Williams. 103-117 [doi]
- On MAX-SAT with Cardinality ConstraintFahad Panolan, Hannane Yaghoubizade. 118-133 [doi]
- Minimizing Corners in Colored Rectilinear GridsThomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms. 134-148 [doi]
- On Layered Area-Proportional Rectangle Contact RepresentationsCarolina Haase, Philipp Kindermann. 149-162 [doi]
- Short Flip Sequences to Untangle Segments in the PlaneGuilherme Dias da Fonseca, Yan Gerard, Bastien Rivier. 163-178 [doi]
- Improved Approximation Algorithms for Cycle and Path PackingsJingyang Zhao 0001, Mingyu Xiao 0001. 179-193 [doi]
- Exact and Approximate Hierarchical Hub LabelingRuoying Li 0001, Sabine Storandt. 194-211 [doi]
- Reconfiguration of Multisets with Applications to Bin PackingJeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura. 212-226 [doi]
- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration RulesNaoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. 227-241 [doi]
- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical AnalysisYuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara. 242-256 [doi]
- A Bisection Approach to Subcubic Maximum Induced MatchingGordon Hoi, Sanjay Jain 0001, Ammar Fathin Sabili, Frank Stephan 0001. 257-272 [doi]
- Stable and Dynamic Minimum CutsMark de Berg, Andrés López-Martínez, Frits C. R. Spieksma. 273-287 [doi]
- Black Hole Search in Dynamic Cactus GraphAdri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal 0001. 288-303 [doi]
- Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-TimeDeniz Agaoglu Çagirici, Peter Zeman 0001. 304-318 [doi]
- Canonization of a Random Circulant Graph by Counting WalksOleg Verbitsky 0001, Maksim Zhukovskii 0001. 319-334 [doi]
- Counting Vanishing Matrix-Vector ProductsCornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica. 335-349 [doi]
- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar GraphsGiordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani. 350-364 [doi]
- (t, s)-Completely Independent Spanning TreesShin-Ichi Nakano. 365-376 [doi]
- Orientable Burning Number of GraphsJulien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi. 377-391 [doi]
- Dichotomies for Tree Minor Containment with Structural ParametersTatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi. 392-405 [doi]
- Structural Parameterizations of Vertex Integrity [Best Paper]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono 0001, Yota Otachi. 406-420 [doi]
- On the Complexity of List H-Packing for Sparse Graph ClassesTatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. 421-435 [doi]