Skip to main content
Springer Nature Link
Log in

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

  • Conference proceedings
  • © 2025

Overview

Editors:
  1. Rastislav Královič

    1. Comenius University in Bratislava, Bratislava, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Věra Kůrková

    1. Czech Academy of Sciences, Prague, Czech Republic

    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 15538)

Included in the following conference series:

Conference proceedings info: SOFSEM 2025.

  • 410 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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 109 submissions. They include original research from all areas of foundations of computer science and artificial intelligence focusing on AI-based algorithms and techniques, nature-inspired computing, machine learning theory, multi-agent algorithms and games, neural network theory, parallel and distributed computing, quantum computing, computability, decidability, classical and non-classical models of computation, computational complexity, computational learning, cryptographic techniques and security, data compression, data and pattern mining methods, discrete combinatorial optimization, automata, languages, machine models, rewriting systems, efficient data structures, graph structure and algorithms, logics of computation, robotics, and other relevant theory topics in computing and AI.

Keywords

Table of contents (25 papers)

  1. Front Matter

    Pages i-xxv
    Download chapter PDF

  3. Contributed Papers

    1. Front Matter

      Pages 21-21
      Download chapter PDF

    2. Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints

      • Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh
      Pages 23-36

    3. Online b-Matching with Stochastic Rewards

      • Susanne Albers, Sebastian Schubert
      Pages 37-50

    4. Shortest Longest-Path Graph Orientations for Trees

      • Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue et al.
      Pages 51-64

    5. Parameterized Complexity of Generalizations of Edge Dominating Set

      • Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana
      Pages 65-79

    6. Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking

      • Ivana Beová, Jana Koecká, Michal Gregor, Martin Tamajka, Marcel Veselý, Marián Šimko
      Pages 80-93

    7. On the Complexity of Minimum Membership Dominating Set

      • D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman
      Pages 94-107

    8. On the Structural Parameterized Complexity of Defective Coloring

      • Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh
      Pages 108-121

    9. Dynamic Range Minimum Queries on the Ultra-wide Word RAM

      • Philip Bille, Inge Li Gørtz, Máximo Pérez López, Tord Stordalen
      Pages 122-135

    10. Fast Practical Compression of Deterministic Finite Automata

      • Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen
      Pages 136-150

    11. Orienteering (with Time Windows) on Restricted Graph Classes

      • Kevin Buchin, Mart Hagedoorn, Guangping Li, Carolin Rehs
      Pages 151-165

    12. Massively Parallel Maximum Coverage Revisited

      • Thai Bui, Hoa T. Vu
      Pages 166-178

    13. Distance Vector Domination

      • Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
      Pages 179-194

    14. Sufficient Conditions for Polynomial-Time Detection of Induced Minors

      • Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez
      Pages 195-208

    15. Pathways to Tractability for Geometric Thickness

      • Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg
      Pages 209-224

    16. Minimum Monotone Spanning Trees

      • Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff
      Pages 225-240
Back to top

Other volumes

  1. SOFSEM 2025: Theory and Practice of Computer Science

  2. SOFSEM 2025: Theory and Practice of Computer Science

Editors and Affiliations

  • Comenius University in Bratislava, Bratislava, Slovakia

    Rastislav Královič

  • Czech Academy of Sciences, Prague, Czech Republic

    Věra Kůrková

Bibliographic Information

Publish with us

Policies and ethics

Back to top