SOFSEM 2024: Theory and Practice of Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The Information Extraction Framework of Document Spanners - A Very Informal Survey
3. Altmetric Badge
   Chapter 2 Generalized Distance Polymatrix Games
4. Altmetric Badge
   Chapter 3 Relaxed Agreement Forests
5. Altmetric Badge
   Chapter 4 On the Computational Complexity of Generalized Common Shape Puzzles
6. Altmetric Badge
   Chapter 5 Fractional Bamboo Trimming and Distributed Windows Scheduling
7. Altmetric Badge
   Chapter 6 New Support Size Bounds and Proximity Bounds for Integer Linear Programming
8. Altmetric Badge
   Chapter 7 On the Parameterized Complexity of Minus Domination
9. Altmetric Badge
   Chapter 8 Exact and Parameterized Algorithms for Choosability
10. Altmetric Badge
    Chapter 9 Parameterized Algorithms for Covering by Arithmetic Progressions
11. Altmetric Badge
    Chapter 10 Row-Column Combination of Dyck Words
12. Altmetric Badge
    Chapter 11 Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
13. Altmetric Badge
    Chapter 12 On the Parameterized Complexity of the Perfect Phylogeny Problem
14. Altmetric Badge
    Chapter 13 Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles
15. Altmetric Badge
    Chapter 14 Visualization of Bipartite Graphs in Limited Window Size
16. Altmetric Badge
    Chapter 15 Outerplanar and Forest Storyplans
17. Altmetric Badge
    Chapter 16 The Complexity of Cluster Vertex Splitting and Company
18. Altmetric Badge
    Chapter 17 Morphing Graph Drawings in the Presence of Point Obstacles
19. Altmetric Badge
    Chapter 18 Word-Representable Graphs from a Word’s Perspective
20. Altmetric Badge
    Chapter 19 The Complexity of Online Graph Games
21. Altmetric Badge
    Chapter 20 Removable Online Knapsack with Bounded Size Items
22. Altmetric Badge
    Chapter 21 Faster Winner Determination Algorithms for (Colored) Arc Kayles
23. Altmetric Badge
    Chapter 22 Automata Classes Accepting Languages Whose Commutative Closure is Regular
24. Altmetric Badge
    Chapter 23 Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
25. Altmetric Badge
    Chapter 24 Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
26. Altmetric Badge
    Chapter 25 Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode
27. Altmetric Badge
    Chapter 26 Local Certification of Majority Dynamics
28. Altmetric Badge
    Chapter 27 Complexity of Spherical Equations in Finite Groups
29. Altmetric Badge
    Chapter 28 Positive Characteristic Sets for Relational Pattern Languages
30. Altmetric Badge
    Chapter 29 Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
31. Altmetric Badge
    Chapter 30 The Weighted HOM-Problem Over Fields
32. Altmetric Badge
    Chapter 31 Combinatorics of Block-Parallel Automata Networks
33. Altmetric Badge
    Chapter 32 On the Piecewise Complexity of Words and Periodic Words
34. Altmetric Badge
    Chapter 33 Distance Labeling for Families of Cycles
35. Altmetric Badge
    Chapter 34 On the Induced Problem for Fixed-Template CSPs