Accepted Papers

• Maike Buchin, Wolf Kißler and Fabian Kubon. Hardness and Parameterized Tractability of the Weak Graph Distance
• Malory Marin. Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
• Henning Fernau and Kevin Mann. How to Reconfigure Your Alliances
• Siam Habib, Debajyoti Mondal, Sadia Sharmin and Md. Saidur Rahman. Hardness and Approximation Results for Extending Unique Neighborhood Networks
• Nacim Oijid, Antoine Dailly and Kyle Burke. Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
• Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono and Alexander Wolff. Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
• Pragya Arora, Palash Dey and Neeldhara Misra. Can One Flip Spoil It All?
• Jan Kratochvil, Urszula Bednarz and Adrian Michalski. Complexity of perfect (1,2)-dominating sets in low-degree graphs
• Ryohei Okuda, Shin-Ichi Minato and Jun Kawahara. Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision Diagrams
• Henry Förster, Giacomo Ortali and Lena Schlipf. On Compaction and Realizability of Almost Convex Octilinear Representations
• Tesshu Hanaka, Yuto Okada, Yota Otachi and Lena Volk. Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
• Kazuhiro Kurita and Kevin Mann. On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
• Yuki Nishimura and Kazuya Haraguchi. Enumeration of Bases in Matroid with Exponentially Large Ground Set
• Steven van den Broek, Marc van Kreveld, Wouter Meulemans and Arjen Simons. Minimizing Vertical Length in Linked Bar Charts
• Taekang Eom, Taehoon Ahn, Minju Song and Hee-Kap Ahn. Shortcutting the diameter of a polygon
• Cristina Bazgan, Morgan Chopin, André Nichterlein and Camille Richer. On the Computational Complexity of Covering Multi-Interface Networks
• Oswin Aichholzer, Yuya Higashikawa, Joachim Orthaber, Daniel Perz, Birgit Vogtenhuber and Alexandra Weinberger. Minimum-Weight Outerplane Laman Graphs
• Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka and Tom van der Zanden. Finding Order-Preserving Subgraphs
• Jonas Friemel, David Liedtke and Christian Scheffer. Tile Reconfiguration by a Finite Automaton
• Lisa Lehner, Christian Komusiewicz and Luca Pascal Staus. A Complexity Analysis of the c-Closed Vertex Deletion Problem
• Naonori Kakimura and Yoshihiko Terai. Computing Power Indices in Weighted Majority Games with Formal Power Series
• David Denisov, Shlomi Dolev, Dan Felmdan and Michael Segal. Linear time small coresets for k-mean clustering of segments with applications
• Marco D'Elia, Irene Finocchi and Maurizio Patrignani. Engineering Algorithms for L-Isolated Maximal Clique Enumeration
• Markus Chimani and Mirko H. Wagner. Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns
• Sheikh Shakil Akhtar, Pranabendu Misra and Geevarghese Philip. Space Efficient algorithms for parameterised problems
• Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille and Nacim Oijid. Graph Irregularity via Edge Deletions
• Seyed Mohammad Hussein Kazemi, Mohammad Ali Abam and Mohammad Ghodsi. Trajectory Visibility at First Sight
• Bastien Auvray, Julien David, Richard Groult and Thierry Lecroq. Cartesian Forest Matching
• Andrés López Martínez, Mark de Berg and Frits Spieksma. Disjoint Tours and the Price of Diversity
• Marco D'Elia and Fabrizio Frati. Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
• Jan Bok, Avinandan Das, Anna Gujgiczer and Nikola Jedličková. Generalizing Brooks' Theorem via Partial Coloring is Hard Classically and Locally
• Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi and Takumi Sato. Forcing a unique minimum spanning tree and a unique shortest path
• Afrouz Jabal Ameli, Faezeh Motiei and Morteza Saghafian. On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
• Ariel Rosenberg, Esther Arkin, Alon Efrat, Omrit Filtser, Stephen Kobourov, Jan Kratochvíl and Joseph Mitchell. The Gate-Cover Problem
• Rin Saito and Takehiro Ito. Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
• Michał Szyfelbein. Approximating the Average-case Graph Search Problem with Non-uniform Costs
• Kevin Buchin, Maike Buchin, Jan Erik Swiadek and Sampson Wong. Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
• Markus Lohrey, Leon Rische, Louisa Seelbach Benkner and Julio Xochitemol. Streaming algorithms for products of probabilities