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

This page contains an index consisting of author-provided keywords.

$
$s$-club	Disjoint covering of bipartite graphs with $s$-clubs
3
3-connected planar graph	Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
A
A-Hierarchy	A SUBSET-SUM Characterisation of the A-Hierarchy
ablation study	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Active learning	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
acyclic DFA	Packed Acyclic Deterministic Finite Automata
adaptive strategy	Online Busy Time Scheduling with Untrusted Prediction
Aho–Corasick Algorithm	Quantum Algorithm for the Multiple String Matching Problem
algebraic branching programs	Exact characterizations of non-commutative algebraic complexity without homogeneity
algebraic complexity	Exact characterizations of non-commutative algebraic complexity without homogeneity
Algorithms	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds Fast Practical Compression of Deterministic Finite Automata
Alternation	A SUBSET-SUM Characterisation of the A-Hierarchy
annihilator	On the periodic decompositions of multidimensional configurations
Approximation Algorithm	Forest Covers and Bounded Forest Covers
approximation algorithms	Massively Parallel Maximum Coverage Revisited
APX-hard	DAG Scheduling in the BSP Model
arithmetic circuits	Exact characterizations of non-commutative algebraic complexity without homogeneity
autocorrelation	Incremental computation of the set of period sets
B
b-matching	Online $b$-Matching with Stochastic Rewards
Betti number	Holey graphs: very large Betti numbers are testable
Beyond planarity	Outer-(ap)RAC Graphs
bipartite graph	Disjoint covering of bipartite graphs with $s$-clubs Colorful 3-Rainbow Domination
Bulk Synchronous Parallel	DAG Scheduling in the BSP Model
C
Canonical construction path method	Generation of Cycle Permutation Graphs and Permutation Snarks
clique-width	On the Complexity of Minimum Membership Dominating Set
closed strings	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Combinatorial Optimization	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
combinatorics	Incremental computation of the set of period sets
Computational Completeness	On Computational Completeness of Semi-Conditional Matrix Grammars
Computational Complexity	The Computational Complexity of Equilibria with Strategic Constraints On Pumping Problems for Unary Regular Languages The Complexity of Graph Exploration Games
consistency	Online Busy Time Scheduling with Untrusted Prediction
Constrained equilibrium	The Computational Complexity of Equilibria with Strategic Constraints
Context-free languages	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Cycle permutation graphs	Generation of Cycle Permutation Graphs and Permutation Snarks
D
Data Compression	Fast Practical Compression of Deterministic Finite Automata
defective coloring	On the Structural Parameterized Complexity of Defective Coloring
Density	Outer-(ap)RAC Graphs
depth	Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
Descriptional Complexity	On Pumping Problems for Unary Regular Languages On Computational Completeness of Semi-Conditional Matrix Grammars
Dial-a-Ride Problem	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Directed Acyclic Graph	DAG Scheduling in the BSP Model
Disk	Multi-Agent Search-Type Problems on Polygons
Distance Domination	Distance Vector Domination
distance to cluster	On the Complexity of Minimum Membership Dominating Set
Distribution testing	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
Distributional learning	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
dominating set	On the Complexity of Minimum Membership Dominating Set
domination	Colorful 3-Rainbow Domination
Drawing algorithm	Outer-(ap)RAC Graphs
Dual Fitting	Forest Covers and Bounded Forest Covers
E
Edge Dominating Set	Parameterized Complexity of Generalizations of Edge Dominating Set
Enumeration	Roman Hitting Set
ETH	On Pumping Problems for Unary Regular Languages
ETR-hardness	Representing Hypergraphs by Point-Line Incidences
Evacuation	Multi-Agent Search-Type Problems on Polygons
Exhaustive generation	Generation of Cycle Permutation Graphs and Permutation Snarks
Expected Density	Expected Density of Random Minimizers
Explainable AI	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
F
facility location problem	Colorful 3-Rainbow Domination
Feedback vertex set	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Fibonacci strings	Maximal $\alpha$-gapped Repeats in a Fibonacci String
Finite Automata	Fast Practical Compression of Deterministic Finite Automata
Forest Cover	Forest Covers and Bounded Forest Covers
formal series	Exact characterizations of non-commutative algebraic complexity without homogeneity
foundational models	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
FPT	Parameterized Complexity of Generalizations of Edge Dominating Set Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
G
Game theory	The Computational Complexity of Equilibria with Strategic Constraints
geometric thickness	Pathways to Tractability for Geometric Thickness
graph containment	Sufficient conditions for polynomial-time detection of induced minors
graph covering	Disjoint covering of bipartite graphs with $s$-clubs
Graph Exploration	The Complexity of Graph Exploration Games
Graph orientation	Shortest Longest-Path Graph Orientations for Trees
Graph Transformers	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Group Translations	Visual Complexity of Point Set Mappings
guided masking	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
H
Hardness results	The Computational Complexity of Equilibria with Strategic Constraints
hashing	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Hitting Set	Roman Hitting Set
Hypergraph	Parameterized Complexity of Generalizations of Edge Dominating Set
Hypergraph visualization	Representing Hypergraphs by Point-Line Incidences
I
image-text matching	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
inapproximability	On Pumping Problems for Unary Regular Languages
induced minors	Sufficient conditions for polynomial-time detection of induced minors
Induced path	Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
Infinite alphabets	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
instractability	On Pumping Problems for Unary Regular Languages
Integer Linear Programming	DAG Scheduling in the BSP Model
interval graph	Colorful 3-Rainbow Domination
K
Kernel	Parameterized Complexity of Generalizations of Edge Dominating Set
Kernelization	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Knowledge Extraction	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Knowledge Graphs	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
L
liDARP	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Linear Programming	Forest Covers and Bounded Forest Covers
Link Prediction	Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Longest path	Shortest Longest-Path Graph Orientations for Trees
Lower Bound	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
lower bounds	Exact characterizations of non-commutative algebraic complexity without homogeneity
LP Rounding	Forest Covers and Bounded Forest Covers
M
massively parallel	Massively Parallel Maximum Coverage Revisited
maximal gapped repeats	Maximal $\alpha$-gapped Repeats in a Fibonacci String
maximum coverage	Massively Parallel Maximum Coverage Revisited
maximum degree	On the Complexity of Minimum Membership Dominating Set
minimal pumping constants	On Pumping Problems for Unary Regular Languages
Minimizer	Expected Density of Random Minimizers
Minimum $k$-directional monotone spanning tree	Minimum Monotone Spanning Trees
Minimum spanning tree	Minimum Monotone Spanning Trees
Mobile Agents	Multi-Agent Search-Type Problems on Polygons
Modular-width	Distance Vector Domination
Monotone drawings	Minimum Monotone Spanning Trees
multidimensional symbolic dynamics	On the periodic decompositions of multidimensional configurations
multimodal transformer models	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
multiple string matching	Quantum Algorithm for the Multiple String Matching Problem
N
Nash equilibrium	The Computational Complexity of Equilibria with Strategic Constraints
neighborhood diversity	Distance Vector Domination On the Structural Parameterized Complexity of Defective Coloring
Non-hamiltonian	Generation of Cycle Permutation Graphs and Permutation Snarks
NP-complete	Colorful 3-Rainbow Domination DAG Scheduling in the BSP Model
NP-hardness	The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
O
online algorithms	Online $b$-Matching with Stochastic Rewards The Complexity of Graph Exploration Games
Online Algorithms Complexity	The Complexity of Graph Exploration Games
online busy time scheduling	Online Busy Time Scheduling with Untrusted Prediction
Optimization	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Orderly generation	Generation of Cycle Permutation Graphs and Permutation Snarks
Orienteering	Orienteering (with Time Windows) on Restricted Graph Classes
overlap	Incremental computation of the set of period sets
P
packed string	Packed Acyclic Deterministic Finite Automata
Parameterized Algorithms	Reachability in temporal graphs under perturbation
parameterized complexity	Distance Vector Domination On the Structural Parameterized Complexity of Defective Coloring The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem Pathways to Tractability for Geometric Thickness
Parameterized Complexity Theory	A SUBSET-SUM Characterisation of the A-Hierarchy
pattern matching	Incremental computation of the set of period sets
pattern searching	Packed Acyclic Deterministic Finite Automata
period	Incremental computation of the set of period sets
periodic decomposition	On the periodic decompositions of multidimensional configurations
periodicity	On the periodic decompositions of multidimensional configurations
periodizer	On the periodic decompositions of multidimensional configurations
Permutation snarks	Generation of Cycle Permutation Graphs and Permutation Snarks
Point Sets	Visual Complexity of Point Set Mappings
Point-line incidence	Representing Hypergraphs by Point-Line Incidences
Polygons	Multi-Agent Search-Type Problems on Polygons
polynomial algorithms	Sufficient conditions for polynomial-time detection of induced minors
prefix minimum	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
primal-dual analysis	Online $b$-Matching with Stochastic Rewards
Priority Evacuation	Multi-Agent Search-Type Problems on Polygons
probing	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Property testing	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints Holey graphs: very large Betti numbers are testable
PSPACE-completeness	The Complexity of Graph Exploration Games
pumping lemmata	On Pumping Problems for Unary Regular Languages
pumping problem	On Pumping Problems for Unary Regular Languages
Q
quantum algorithms	Quantum Algorithm for the Multiple String Matching Problem Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Quantum Approximate Optimization Algorithm	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Quantum Computing	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
query complexity	Quantum Algorithm for the Multiple String Matching Problem
Query learning	Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
R
RAC	Outer-(ap)RAC Graphs
rainbow domination	Colorful 3-Rainbow Domination
Random Minimizer	Expected Density of Random Minimizers
randomization	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Randomized Algorithm	Forest Covers and Bounded Forest Covers
range minimum queries	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Reachability	Reachability in temporal graphs under perturbation
regular preserving operations	On Pumping Problems for Unary Regular Languages
repetitive structures	Maximal $\alpha$-gapped Repeats in a Fibonacci String
Restricted graph classes	Orienteering (with Time Windows) on Restricted Graph Classes
robustness	Online Busy Time Scheduling with Untrusted Prediction
Roman Domination	Roman Hitting Set
S
Scheduling	DAG Scheduling in the BSP Model
Schnyder wood	Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
search in strings	Quantum Algorithm for the Multiple String Matching Problem
Semiconditional and Matrix Grammars	On Computational Completeness of Semi-Conditional Matrix Grammars
Series-parallel graphs	Outer-(ap)RAC Graphs
Simplicial matroid	Holey graphs: very large Betti numbers are testable
sliding suffix trees	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
solution extension	Pathways to Tractability for Geometric Thickness
Spider	Shortest Longest-Path Graph Orientations for Trees
split graph	Colorful 3-Rainbow Domination
split graphs	On the Structural Parameterized Complexity of Defective Coloring
stochastic benchmark	Online $b$-Matching with Stochastic Rewards
stochastic rewards	Online $b$-Matching with Stochastic Rewards
Streaming	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
string	Incremental computation of the set of period sets
string algorithms	Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
string matching	Quantum Algorithm for the Multiple String Matching Problem
strings	Quantum Algorithm for the Multiple String Matching Problem
SUBSET-SUM	A SUBSET-SUM Characterisation of the A-Hierarchy
T
Temporal Graphs	Reachability in temporal graphs under perturbation
Time windows	Orienteering (with Time Windows) on Restricted Graph Classes
Tree	Colorful 3-Rainbow Domination Shortest Longest-Path Graph Orientations for Trees
Treewidth	Distance Vector Domination
twin-cover	On the Structural Parameterized Complexity of Defective Coloring
Two-Player Games	The Complexity of Graph Exploration Games
U
ultra-wide word RAM model	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
unary regular language	On Pumping Problems for Unary Regular Languages
understanding	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
untrusted prediction	Online Busy Time Scheduling with Untrusted Prediction
unweighted matching	Online $b$-Matching with Stochastic Rewards
V
variable vertex capacities	Online $b$-Matching with Stochastic Rewards
Variational Quantum Algorithms	Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Vector Domination	Distance Vector Domination
verb phrases	Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Vertex cover	Forest Covers and Bounded Forest Covers
vertex-weighted matching	Online $b$-Matching with Stochastic Rewards
Visual Complexity	Visual Complexity of Point Set Mappings
W
Wireless Model	Multi-Agent Search-Type Problems on Polygons

Disclaimer | Powered by EasyChair Smart Program