SOFSEM 2025: Theory and Practice of Computer Science 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I /
This book constitutes the proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, held in Bratislava, Slovak Republic, during January 20-23, 2025. The 48 full papers presented in this book were carefully reviewed and selected from 1...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Vydání: | 1st ed. 2025. |
| Edice: | Lecture Notes in Computer Science,
15538 |
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-031-82670-2 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- Invited talks
- Distributed Computing by Mobile Robots: Exploring the Computational Landscape
- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs
- Contributed Papers
- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
- Online b-Matching with Stochastic Rewards
- Shortest Longest-Path Graph Orientations for Trees
- Parameterized Complexity of Generalizations of Edge Dominating Set
- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
- On the Complexity of Minimum Membership Dominating Set
- On the Structural Parameterized Complexity of Defective Coloring
- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
- Fast Practical Compression of Deterministic Finite Automata
- Orienteering (with Time Windows) on Restricted Graph Classes
- Massively Parallel Maximum Coverage Revisited
- Distance Vector Domination
- Sufficient conditions for polynomial-time detection of induced minors
- Pathways to Tractability for Geometric Thickness
- Minimum Monotone Spanning Trees
- Symvonis and Alexander Wol Representing Hypergraphs by Point-Line Incidences
- Reachability in temporal graphs under perturbation
- On Computational Completeness of Semi-Conditional Matrix Grammars
- Outer-(ap)RAC Graphs
- Forest Covers and Bounded Forest Covers
- Multi-Agent Search-Type Problems on Polygons
- Generation of Cycle Permutation Graphs and Permutation Snarks
- Expected Density of Random Minimizers.