SOFSEM 2025: 50TH INTERNATIONAL CONFERENCE ON CURRENT TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE

A
Abhinav, Ankit	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Albers, Susanne	Online $b$-Matching with Stochastic Rewards
Anegg, Georg	DAG Scheduling in the BSP Model
Apers, Simon	Holey graphs: very large Betti numbers are testable
Asahiro, Yuichi	Shortest Longest-Path Graph Orientations for Trees
Aute, Shubhada	Parameterized Complexity of Generalizations of Edge Dominating Set
B
Bentert, Matthias	On the Complexity of Minimum Membership Dominating Set
Beňová, Ivana	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Bhyravarapu, Sriram	On the Structural Parameterized Complexity of Defective Coloring On the Complexity of Minimum Membership Dominating Set
Bille, Philip	Fast Practical Compression of Deterministic Finite Automata Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Bouzeghoub, Amel	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Buchin, Kevin	Orienteering (with Time Windows) on Restricted Graph Classes
Bui, Thai	Massively Parallel Maximum Coverage Revisited
C
Cordasco, Gennaro	Distance Vector Domination
D
Dallard, Clément	Sufficient conditions for polynomial-time detection of induced minors
Depian, Thomas	Pathways to Tractability for Geometric Thickness
Dhayanchand, Karthika	On the Complexity of Minimum Membership Dominating Set
Di Giacomo, Emilio	Minimum Monotone Spanning Trees
Didimo, Walter	Minimum Monotone Spanning Trees
Dobler, Alexander	Representing Hypergraphs by Point-Line Incidences
Dumas, Maël	Sufficient conditions for polynomial-time detection of induced minors
E
Eidenbenz, Stephan	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Enright, Jessica	Reachability in temporal graphs under perturbation
F
Fernau, Henning	On Computational Completeness of Semi-Conditional Matrix Grammars Roman Hitting Set
Fink, Simon Dominik	Pathways to Tractability for Geometric Thickness
Firbas, Alexander	Pathways to Tractability for Geometric Thickness
Flocchini, Paola	Distributed Computing by Mobile Robots: Exploring the Computational Landscape
Fuchs, Janosch	The Complexity of Graph Exploration Games
Förster, Henry	Outer-(ap)RAC Graphs
G
Ganian, Robert	Pathways to Tractability for Geometric Thickness
Gargano, Luisa	Distance Vector Domination
Gaur, Daya	Forest Covers and Bounded Forest Covers
Georgiou, Konstantinos	Multi-Agent Search-Type Problems on Polygons
Goedgebeur, Jan	Generation of Cycle Permutation Graphs and Permutation Snarks
Golan, Shay	Expected Density of Random Minimizers
Goodrich, Michael	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Gorain, Barun	Forest Covers and Bounded Forest Covers
Gregor, Michal	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Gruber, Hermann	On Pumping Problems for Unary Regular Languages
Grüne, Christoph	The Complexity of Graph Exploration Games
Gutleben, Jan	A SUBSET-SUM Characterisation of the A-Hierarchy
Gørtz, Inge Li	Fast Practical Compression of Deterministic Finite Automata Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
H
Hagedoorn, Mart	Orienteering (with Time Windows) on Restricted Graph Classes
Herva, Pyry	On the periodic decompositions of multidimensional configurations
Hilaire, Claire	Sufficient conditions for polynomial-time detection of induced minors
Holzer, Markus	On Pumping Problems for Unary Regular Languages
Horiyama, Takashi	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees Maximal $\alpha$-gapped Repeats in a Fibonacci String
I
Inenaga, Shunsuke	Packed Acyclic Deterministic Finite Automata
Ishihata, Masakazu	Packed Acyclic Deterministic Finite Automata
J
Jana, Satyabrata	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Jansson, Jesper	Shortest Longest-Path Graph Orientations for Trees
Janßen, Tom	The Complexity of Graph Exploration Games
Jones, Caleb	Multi-Agent Search-Type Problems on Polygons
K
Kari, Jarkko	On the periodic decompositions of multidimensional configurations
Katheder, Julia	Outer-(ap)RAC Graphs
Katsanou, Eleni	Minimum Monotone Spanning Trees
Kawasaki, Yoshito	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Khadiev, Kamil	Quantum Algorithm for the Multiple String Matching Problem
Kitagawa, Ryuto	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Kobourov, Stephen	Representing Hypergraphs by Point-Line Incidences
Košecká, Jana	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Kumar, Pankaj	On the Structural Parameterized Complexity of Defective Coloring
Kuppusamy, Lakshmanan	On Computational Completeness of Semi-Conditional Matrix Grammars
L
Larios-Jones, Laura	Reachability in temporal graphs under perturbation
Lauerbach, Antonio	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Lavynska, Tetiana	Colorful 3-Rainbow Domination
Li, Guangping	Orienteering (with Time Windows) on Restricted Graph Classes
Liu, Hsiang-Hsuan	Online Busy Time Scheduling with Untrusted Prediction
Lopez, Maximo Perez	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Lucier, Jesse	Multi-Agent Search-Type Problems on Polygons
M
M. Kapron, Bruce	The Computational Complexity of Equilibria with Strategic Constraints
Malod, Guillaume	Exact characterizations of non-commutative algebraic complexity without homogeneity
Mann, Kevin	Roman Hitting Set
Meeks, Kitty	Reachability in temporal graphs under perturbation
Meier, Arne	A SUBSET-SUM Characterisation of the A-Hierarchy
Melkman, Avraham A.	Shortest Longest-Path Graph Orientations for Trees
Mertzios, George	Temporal Graph Realization Problems
Meulemans, Wouter	Visual Complexity of Point Set Mappings
Mieno, Takuya	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Mika, Grzegorz P.	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Mitzenmacher, Michael	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Miyano, Eiji	Shortest Longest-Path Graph Orientations for Trees
Mondal, Debajyoti	Representing Hypergraphs by Point-Line Incidences
Monti, Angelo	Disjoint covering of bipartite graphs with $s$-clubs
N
Nakashima, Yuto	Maximal $\alpha$-gapped Repeats in a Fibonacci String
Neggaz, Yessin M.	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Numaya, Yutaro	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Nöllenburg, Martin	Pathways to Tractability for Geometric Thickness Representing Hypergraphs by Point-Line Incidences
O
Ono, Hirotaka	Shortest Longest-Path Graph Orientations for Trees
Ortali, Giacomo	Outer-(ap)RAC Graphs
Ortlieb, Christian	Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
P
Panolan, Fahad	Parameterized Complexity of Generalizations of Edge Dominating Set
Papp, Pál András	DAG Scheduling in the BSP Model
Patra, Shaswati	Forest Covers and Bounded Forest Covers
Pedersen, Max	Fast Practical Compression of Deterministic Finite Automata
Perez, Anthony	Sufficient conditions for polynomial-time detection of induced minors
Pettersson, William	Reachability in temporal graphs under perturbation
Purohit, Nidhi	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
R
Rajamanickam, Muthucumaraswamy	On the Complexity of Minimum Membership Dominating Set
Raman, Indhumathi	On Computational Completeness of Semi-Conditional Matrix Grammars
Rauch, Christian	On Pumping Problems for Unary Regular Languages
Rehs, Carolin	Orienteering (with Time Windows) on Restricted Graph Classes
Reiter, Kendra	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Renders, Jarne	Generation of Cycle Permutation Graphs and Permutation Snarks
Rescigno, Adele	Distance Vector Domination
Rivals, Eric	Incremental computation of the set of period sets
Roy, Sampriti	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
S
Saha, Souvik	Parameterized Complexity of Generalizations of Edge Dominating Set
Sahu, Abhishek	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Samieefar, Koosha	The Computational Complexity of Equilibria with Strategic Constraints
Saurabh, Saket	On the Structural Parameterized Complexity of Defective Coloring Parameterized Complexity of Generalizations of Edge Dominating Set On the Complexity of Minimum Membership Dominating Set Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Schlipf, Lena	Minimum Monotone Spanning Trees
Schmidt, Marie	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Schubert, Sebastian	Online $b$-Matching with Stochastic Rewards
Seetharaman, Sanjay	On the Complexity of Minimum Membership Dominating Set
Serov, Danil	Quantum Algorithm for the Multiple String Matching Problem
Seto, Kazuhisa	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees Maximal $\alpha$-gapped Repeats in a Fibonacci String
Shibata, Hiroki	Packed Acyclic Deterministic Finite Automata
Shinohara, Ayumi	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Shur, Arseny	Expected Density of Random Minimizers
Simons, Arjen	Visual Complexity of Point Set Mappings
Sinaimeri, Blerina	Disjoint covering of bipartite graphs with $s$-clubs
Singh, Rishi Ranjan	Forest Covers and Bounded Forest Covers
Spirakis, Paul	Temporal Graph Realization Problems
Stordalen, Tord	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Symvonis, Antonios	Minimum Monotone Spanning Trees
Szabó, Dániel	Holey graphs: very large Betti numbers are testable
T
Takahashi, Shun	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Tamajka, Martin	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Tate, Reuben	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Tyukin, Ivan	The challenge of stability, accuracy and robustness in data-driven AI
U
Upasana, Anannya	Parameterized Complexity of Generalizations of Edge Dominating Set
V
van de Bovenkamp, Rick	Online Busy Time Scheduling with Untrusted Prediction
van Leeuwen, Erik Jan	Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs
Vasudev, Yadu	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
Verbeek, Kevin	Visual Complexity of Point Set Mappings
Veselý, Marcel	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Vu, Hoa	Massively Parallel Maximum Coverage Revisited
W
Wolff, Alexander	Minimum Monotone Spanning Trees
Węgrzyn-Wolska, Katarzyna	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
X
Xue, Quan	Shortest Longest-Path Graph Orientations for Trees
Y
Yamane, Kazuma	Maximal $\alpha$-gapped Repeats in a Fibonacci String
Yano, Yoshichika	Shortest Longest-Path Graph Orientations for Trees
Yoshinaka, Ryo	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Yzelman, Albert-Jan N.	DAG Scheduling in the BSP Model
Z
Zakov, Shay	Shortest Longest-Path Graph Orientations for Trees
Š
Šimko, Marián	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking

Disclaimer | Powered by EasyChair Smart Program