Abstract is missing.
- The Complexity of Finding TanglesOksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff 0001, Johannes Zink. 3-17 [doi]
- A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection GraphsFilippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. 18-32 [doi]
- Solving Cut-Problems in Quadratic Time for Graphs with Bounded TreewidthHauke Brinkop, Klaus Jansen. 33-46 [doi]
- More Effort Towards Multiagent KnapsackSushmita Gupta, Pallavi Jain 0001, Sanjay Seetharaman. 47-62 [doi]
- Dominance Drawings for DAGs with Bounded Modular WidthGiacomo Ortali, Ioannis G. Tollis. 65-79 [doi]
- Morphing Planar Graph Drawings Through 3DKevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff 0001. 80-95 [doi]
- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species TreesJonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff 0001. 96-110 [doi]
- Parameterized Approaches to Orthogonal CompactionWalter Didimo, Siddharth Gupta 0002, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff 0001, Meirav Zehavi. 111-125 [doi]
- Hardness of Bounding Influence via Graph ModificationRobert D. Barish, Tetsuo Shibuya. 129-143 [doi]
- Heuristics for Opinion Diffusion via Local ElectionsRica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon. 144-158 [doi]
- On the Parameterized Complexity of s-club Cluster Deletion ProblemsFabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini. 159-173 [doi]
- Balanced Substructures in Bicolored GraphsP. S. Ardra, R. Krithika 0001, Saket Saurabh 0001, Roohani Sharma. 177-191 [doi]
- On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical MachinesKlaus Jansen, Kai Kahler. 192-206 [doi]
- On the 2-Layer Window Width Minimization ProblemMichael A. Bekos, Henry Förster, Michael Kaufmann 0001, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf. 209-221 [doi]
- Sequentially Swapping Tokens: Further on Graph ClassesHironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi. 222-235 [doi]
- On the Preservation of Properties When Changing Communication ModelsOlav Bunte, Louis C. M. van Gool, Tim A. C. Willemse. 239-253 [doi]
- Introduction to Routing Problems with Mandatory TransitionsChristian Laforest, Timothée Martinod. 254-266 [doi]
- Payment Scheduling in the Interval Debt ModelTom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan. 267-282 [doi]
- Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal GraphsEmmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf 0002. 283-297 [doi]
- Lower Bounds for Monotone q-Multilinear Boolean CircuitsAndrzej Lingas. 301-312 [doi]
- A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI ConstraintsPiotr Wojciechowski 0002, K. Subramani. 313-327 [doi]
- Quantum Complexity for Vector Domination ProblemAndris Ambainis, Ansis Zvirbulis. 328-341 [doi]
- Learning Through Imitation by Using Formal VerificationAvraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina, Hillel Kugler. 342-355 [doi]
- Delivery to Safety with Two Cooperating RobotsJared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce. 359-371 [doi]
- Space-Efficient STR-IC-LCS ComputationYuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. 372-384 [doi]
- The k-Centre Problem for Classes of Cyclic WordsDuncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov. 385-400 [doi]