SOFSEM 2023: Theory and Practice of Computer Science

1. Front Matter

   Pages i-xi

   PDF

2. Graphs Problems and Optimisation

   1. Front Matter

      Pages 1-1

      PDF

   2. The Complexity of Finding Tangles

      • Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink

      Pages 3-17

   3. A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs

      • Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis

      Pages 18-32

   4. Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth

      • Hauke Brinkop, Klaus Jansen

      Pages 33-46

   5. More Effort Towards Multiagent Knapsack

      • Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman

      Pages 47-62

3. Graph Drawing and Visualization

   1. Front Matter

      Pages 63-63

      PDF

   2. Dominance Drawings for DAGs with Bounded Modular Width

      • Giacomo Ortali, Ioannis G. Tollis

      Pages 65-79

   3. Morphing Planar Graph Drawings Through 3D

      • Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders et al.

      Pages 80-95

   4. Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

      • Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff

      Pages 96-110

   5. Parameterized Approaches to Orthogonal Compaction

      • Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi

      Pages 111-125

4. NP-Hardness and Fixed Parameter Tractability

   1. Front Matter

      Pages 127-127

      PDF

   2. Hardness of Bounding Influence via Graph Modification

      • Robert D. Barish, Tetsuo Shibuya

      Pages 129-143

   3. Heuristics for Opinion Diffusion via Local Elections

      • Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon

      Pages 144-158

   4. On the Parameterized Complexity of s-club Cluster Deletion Problems

      • Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

      Pages 159-173

5. SOFSEM 2023 Best Papers

   1. Front Matter

      Pages 175-175

      PDF

   2. Balanced Substructures in Bicolored Graphs

      • P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma

      Pages 177-191

   3. On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines

      • Klaus Jansen, Kai Kahler

      Pages 192-206

6. SOFSEM 2023 Best Student Papers

   1. Front Matter

      Pages 207-207

      PDF

   2. On the 2-Layer Window Width Minimization Problem

      • Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen Kobourov, Myroslav Kryven, Axel Kuckuk et al.

      Pages 209-221

This book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023.

The 22 full papers presented together with 2 best papers and 2 best students papers in this book were carefully reviewed and selected from 43 submissions.

This workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings. 

• approximation algorithms
• approximation theory
• artificial intelligence
• combinatorial mathematics
• combinatorial optimization
• combinatorial problems
• computer hardware
• computer science
• computer systems
• directed graphs
• engineering
• graph g
• graph theory
• graphic methods
• internet
• mathematics
• optimization
• polynomial approximation
• signal processing
• theoretical computer science

• University of Liverpool, Liverpool, UK

  Leszek Gąsieniec

Policies and ethics