Skip to main content
SpringerLink
Log in

SOFSEM 2024: Theory and Practice of Computer Science

49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings

  • Conference proceedings
  • © 2024

Access provided by Autonomous University of Puebla

Download book PDF
Download book EPUB

Overview

Editors:
  1. Henning Fernau

    1. University of Trier, Trier, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Serge Gaspers

    1. UNSW Sydney, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ralf Klasing

    1. CNRS and University of Bordeaux, Talence, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14519)

Included in the following conference series:

Conference proceedings info: SOFSEM 2024.

Buy print copy

Softcover Book USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

About this book

This book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. 
The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. 

They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.




Keywords

Table of contents (35 papers)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  3. Contributed Papers

    1. Front Matter

      Pages 23-23
      Download chapter PDF

    2. Generalized Distance Polymatrix Games

      • Alessandro Aloisio, Michele Flammini, Cosimo Vinci
      Pages 25-39
      Download chapter PDF

    3. Relaxed Agreement Forests

      • Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matúš Mihalák, Georgios Stamoulis
      Pages 40-54
      Download chapter PDF

    4. On the Computational Complexity of Generalized Common Shape Puzzles

      • Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
      Pages 55-68
      Download chapter PDF

    5. Fractional Bamboo Trimming and Distributed Windows Scheduling

      • Arash Beikmohammadi, William Evans, Seyed Ali Tabatabaee
      Pages 69-81
      Download chapter PDF

    6. New Support Size Bounds and Proximity Bounds for Integer Linear Programming

      • Sebastian Berndt, Matthias Mnich, Tobias Stamm
      Pages 82-95
      Download chapter PDF

    7. On the Parameterized Complexity of Minus Domination

      • Sriram Bhyravarapu, Lawqueen Kanesh, A Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
      Pages 96-110
      Download chapter PDF

    8. Exact and Parameterized Algorithms for Choosability

      • Ivan Bliznets, Jesper Nederlof
      Pages 111-124
      Download chapter PDF

    9. Parameterized Algorithms for Covering by Arithmetic Progressions

      • Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
      Pages 125-138
      Download chapter PDF

    10. Row-Column Combination of Dyck Words

      • Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro
      Pages 139-153
      Download chapter PDF

    11. Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures

      • Annalisa De Bonis
      Pages 154-168
      Download chapter PDF

    12. On the Parameterized Complexity of the Perfect Phylogeny Problem

      • Jorke M. de Vlas
      Pages 169-182
      Download chapter PDF

    13. Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles

      • Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz
      Pages 183-197
      Download chapter PDF

    14. Visualization of Bipartite Graphs in Limited Window Size

      • William Evans, Kassian Köck, Stephen Kobourov
      Pages 198-210
      Download chapter PDF

    15. Outerplanar and Forest Storyplans

      • Jiří Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
      Pages 211-225
      Download chapter PDF

    16. The Complexity of Cluster Vertex Splitting and Company

      • Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu et al.
      Pages 226-239
      Download chapter PDF

    17. Morphing Graph Drawings in the Presence of Point Obstacles

      • Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff et al.
      Pages 240-254
      Download chapter PDF
Back to top

Other volumes

  1. SOFSEM 2024: Theory and Practice of Computer Science

Editors and Affiliations

  • University of Trier, Trier, Germany

    Henning Fernau

  • UNSW Sydney, Sydney, Australia

    Serge Gaspers

  • CNRS and University of Bordeaux, Talence, France

    Ralf Klasing

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation