Abstract is missing.
- Computing Beyond-Planar Crossing Numbers via Forbidden Crossing PatternsMarkus Chimani, Mirko H. Wagner. 3-18 [doi]
- Minimum-Weight Outerplane Laman GraphsOswin Aichholzer, Yuya Higashikawa, Joachim Orthaber, Daniel Perz, Birgit Vogtenhuber, Alexandra Weinberger. 19-32 [doi]
- Minimizing Vertical Length in Linked Bar ChartsSteven van den Broek, Marc J. van Kreveld, Wouter Meulemans, Arjen Simons. 33-48 [doi]
- On Compaction and Realizability of Almost Convex Octilinear RepresentationsHenry Förster, Giacomo Ortali, Lena Schlipf. 49-63 [doi]
- Hardness and Parameterized Tractability of the Weak Graph DistanceMaike Buchin, Wolf Kißler, Fabian Kubon. 64-78 [doi]
- Hardness and Approximation Results for Extending Unique Neighborhood NetworksSiam Habib, Debajyoti Mondal, Sadia Sharmin, Md. Saidur Rahman 0001. 81-95 [doi]
- Approximating the Average-Case Graph Search Problem with Non-uniform CostsMichal Szyfelbein. 96-109 [doi]
- Linear Time Small Coresets for k-Mean Clustering of Segments with ApplicationsDavid Denisov, Shlomi Dolev, Dan Feldman, Michael Segal 0001. 110-124 [doi]
- Cartesian Forest MatchingBastien Auvray, Julien David, Richard Groult, Thierry Lecroq. 125-139 [doi]
- Streaming Algorithms for Products of ProbabilitiesMarkus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol. 140-153 [doi]
- Finding Order-Preserving SubgraphsHaruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden. 157-171 [doi]
- Finding a Maximum Common (Induced) Subgraph: Structural Parameters RevisitedTesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk. 172-186 [doi]
- Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar GraphsMarco D'Elia, Fabrizio Frati. 187-202 [doi]
- Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree GraphsUrszula Bednarz, Jan Kratochvíl, Adrian Michalski. 203-214 [doi]
- A Complexity Analysis of the c-Closed Vertex Deletion ProblemLisa Lehner, Christian Komusiewicz, Luca Pascal Staus. 217-231 [doi]
- On the Computational Complexity of Covering Multi-Interface NetworksCristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer. 232-246 [doi]
- Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and LocallyJan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková. 247-262 [doi]
- Space Efficient Algorithms for Parameterised ProblemsSheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip. 263-275 [doi]
- Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent SetsMalory Marin. 276-290 [doi]
- Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-KaylesKyle Burke, Antoine Dailly, Nacim Oijid. 293-307 [doi]
- Can One Flip Spoil it All?Pragya Arora, Palash Dey, Neeldhara Misra. 308-322 [doi]
- Computing Power Indices in Weighted Majority Games with Formal Power SeriesNaonori Kakimura, Yoshihiko Terai. 323-336 [doi]
- How to Reconfigure Your AlliancesHenning Fernau, Kevin Mann. 337-352 [doi]
- Graph Irregularity via Edge DeletionsJulien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid. 353-367 [doi]
- Forcing a Unique Minimum Spanning Tree and a Unique Shortest PathTatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato. 371-385 [doi]
- On the MST-Ratio: Theoretical Bounds and Complexity of Finding the MaximumAfrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian. 386-401 [doi]
- Disjoint Tours and the Price of DiversityMark de Berg, Andrés López-Martínez, Frits C. R. Spieksma. 402-417 [doi]
- Shortcutting the Diameter of a PolygonTaekang Eom, Taehoon Ahn 0001, Minju Song, Hee-Kap Ahn. 418-431 [doi]
- Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest PathsRin Saito, Takehiro Ito. 432-447 [doi]
- Further Results on Rendering Geometric Intersection Graphs Sparse by DispersionNicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono 0001, Alexander Wolff 0001. 451-466 [doi]
- Fundamentals of Computing Continuous Dynamic Time Warping in 2D Under Different NormsKevin Buchin, Maike Buchin, Jan Erik Swiadek, Sampson Wong. 467-482 [doi]
- The Gate-Cover ProblemEsther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvíl, Joseph S. B. Mitchell, Ariel Rosenberg. 483-498 [doi]
- Trajectory Visibility at First SightMohammad Ali Abam, Mohammad Ghodsi, Seyed Mohammad Hussein Kazemi. 499-511 [doi]
- Tile Reconfiguration by a Finite AutomatonJonas Friemel, David Liedtke, Christian Scheffer. 512-526 [doi]
- Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision DiagramsRyohei Okuda, Jun Kawahara, Shin-ichi Minato. 529-544 [doi]
- Engineering Algorithms for ℓ-Isolated Maximal Clique EnumerationMarco D'Elia, Irene Finocchi, Maurizio Patrignani. 545-559 [doi]
- On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed HypergraphsKazuhiro Kurita, Kevin Mann. 560-575 [doi]
- Enumeration of Bases in Matroid with Exponentially Large Ground SetYuki Nishimura, Kazuya Haraguchi. 576-590 [doi]