researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
[-]
OR
AND
NOT
1
1995
1996
1997
1998
1999
2000
2001
2002
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2023
2024
2025
Filter by Tag
[+]
OR
AND
NOT
1
C++
Meta-Environment
XML
XML Schema
analysis
architecture
data-flow
database
design
e-science
graph-rewriting
logic
meta-model
meta-objects
mobile
optimization
rewriting
rule-based
search
systematic-approach
Filter by Author
[+]
OR
AND
NOT
1
Alexander Wolff 0001
Andris Ambainis
Ayumi Shinohara
Costas S. Iliopoulos
Evangelos Kranakis
Friedrich Otto
Henning Fernau
Hideo Bannai
Jirí Síma
Jirí Wiedermann
Juraj Hromkovic
Kazuyuki Narisawa
Klaus Jansen
Marián Simko
Martin Kutrib
Mária Bieliková
Rusins Freivalds
Ryo Yoshinaka
Shunsuke Inenaga
Stephen G. Kobourov
Filter by Top terms
[+]
OR
AND
NOT
1
algorithms
automata
complexity
current
data
graph
graphs
model
networks
practice
problem
problems
sofsem
software
systems
theory
time
trends
using
web
SOFSEM (sofsem)
Editions
Publications
Viewing Publication 1 - 100 from 1427
2025
Expected Density of Random Minimizers
Shay Golan 0001
,
Arseny M. Shur
.
sofsem 2025
:
347-360
[doi]
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Ankit Abhinav
,
Satyabrata Jana
,
Nidhi Purohit
,
Abhishek Sahu
,
Saket Saurabh 0001
.
sofsem 2025
:
23-36
[doi]
Online b-Matching with Stochastic Rewards
Susanne Albers
,
Sebastian Schubert
.
sofsem 2025
:
37-50
[doi]
Shortest Longest-Path Graph Orientations for Trees
Yuichi Asahiro
,
Jesper Jansson 0001
,
Avraham A. Melkman
,
Eiji Miyano
,
Hirotaka Ono 0001
,
Quan Xue
,
Yoshichika Yano
,
Shay Zakov
.
sofsem 2025
:
51-64
[doi]
Parameterized Complexity of Generalizations of Edge Dominating Set
Shubhada Aute
,
Fahad Panolan
,
Souvik Saha 0002
,
Saket Saurabh 0001
,
Anannya Upasana
.
sofsem 2025
:
65-79
[doi]
Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking
Ivana Benová
,
Jana Kosecka
,
Michal Gregor
,
Martin Tamajka
,
Marcel Veselý
,
Marián Simko
.
sofsem 2025
:
80-93
[doi]
On the Structural Parameterized Complexity of Defective Coloring
Sriram Bhyravarapu
,
Pankaj Kumar
,
Saket Saurabh 0001
.
sofsem 2025
:
108-121
[doi]
Fast Practical Compression of Deterministic Finite Automata
Philip Bille
,
Inge Li Gørtz
,
Max Rishøj Pedersen
.
sofsem 2025
:
136-150
[doi]
Dynamic Range Minimum Queries on the Ultra-wide Word RAM
Philip Bille
,
Inge Li Gørtz
,
Máximo Pérez López
,
Tord Stordalen
.
sofsem 2025
:
122-135
[doi]
Orienteering (with Time Windows) on Restricted Graph Classes
Kevin Buchin
,
Mart Hagedoorn
,
Guangping Li 0001
,
Carolin Rehs
.
sofsem 2025
:
151-165
[doi]
Massively Parallel Maximum Coverage Revisited
Thai Bui
,
Hoa T. Vu
.
sofsem 2025
:
166-178
[doi]
Distance Vector Domination
Gennaro Cordasco
,
Luisa Gargano
,
Adele A. Rescigno
.
sofsem 2025
:
179-194
[doi]
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
Clément Dallard
,
Maël Dumas
,
Claire Hilaire
,
Anthony Perez 0001
.
sofsem 2025
:
195-208
[doi]
Pathways to Tractability for Geometric Thickness
Thomas Depian
,
Simon Dominik Fink
,
Alexander Firbas
,
Robert Ganian
,
Martin Nöllenburg
.
sofsem 2025
:
209-224
[doi]
Representing Hypergraphs by Point-Line Incidences
Alexander Dobler
,
Stephen G. Kobourov
,
Debajyoti Mondal
,
Martin Nöllenburg
.
sofsem 2025
:
241-254
[doi]
Reachability in Temporal Graphs Under Perturbation
Jessica A. Enright
,
Laura Larios-Jones
,
Kitty Meeks
,
William Pettersson
.
sofsem 2025
:
255-269
[doi]
On Computational Completeness of Semi-Conditional Matrix Grammars
Henning Fernau
,
Lakshmanan Kuppusamy
,
Indhumathi Raman
.
sofsem 2025
:
270-283
[doi]
Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract)
Paola Flocchini
.
sofsem 2025
:
3-7
[doi]
The Complexity of Graph Exploration Games
Janosch Fuchs
,
Christoph Grüne
,
Tom Janßen
.
sofsem 2025
:
17-30
[doi]
Outer-(ap)RAC Graphs
Henry Förster
,
Julia Katheder
,
Giacomo Ortali
.
sofsem 2025
:
284-299
[doi]
Forest Covers and Bounded Forest Covers
Daya Ram Gaur
,
Barun Gorain
,
Shaswati Patra
,
Rishi Ranjan Singh
.
sofsem 2025
:
300-313
[doi]
Multi-agent Search-Type Problems on Polygons - (Extended Abstract)
Konstantinos Georgiou
,
Caleb Jones
,
Jesse Lucier
.
sofsem 2025
:
314-332
[doi]
Minimum Monotone Spanning Trees
Emilio Di Giacomo
,
Walter Didimo
,
Eleni Katsanou
,
Lena Schlipf
,
Antonios Symvonis
,
Alexander Wolff 0001
.
sofsem 2025
:
225-240
[doi]
Generation of Cycle Permutation Graphs and Permutation Snarks
Jan Goedgebeur
,
Jarne Renders
.
sofsem 2025
:
333-346
[doi]
Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Michael T. Goodrich
,
Ryuto Kitagawa
,
Michael Mitzenmacher
.
sofsem 2025
:
70-84
[doi]
On Pumping Problems for Unary Regular Languages
Hermann Gruber
,
Markus Holzer 0001
,
Christian Rauch 0001
.
sofsem 2025
:
3-16
[doi]
A SUBSET-SUM Characterisation of the A-Hierarchy
Jan Gutleben
,
Arne Meier
.
sofsem 2025
:
31-44
[doi]
On the Periodic Decompositions of Multidimensional Configurations
Pyry Herva
,
Jarkko Kari
.
sofsem 2025
:
45-57
[doi]
The Computational Complexity of Equilibria with Strategic Constraints
Bruce M. Kapron
,
Koosha Samieefar
.
sofsem 2025
:
112-127
[doi]
On the Complexity of Minimum Membership Dominating Set
D. Karthika
,
R. Muthucumaraswamy
,
Matthias Bentert
,
Sriram Bhyravarapu
,
Saket Saurabh 0001
,
Sanjay Seetharaman
.
sofsem 2025
:
94-107
[doi]
Quantum Algorithm for the Multiple String Matching Problem
Kamil Khadiev
,
Danil Serov
.
sofsem 2025
:
58-69
[doi]
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 II
Rastislav Královic
,
Vera Kurková
, editors,
Volume 15539 of
Lecture Notes in Computer Science
, Springer,
2025.
[doi]
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
Rastislav Královic
,
Vera Kurková
, editors,
Volume 15538 of
Lecture Notes in Computer Science
, Springer,
2025.
[doi]
The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Antonio Lauerbach
,
Kendra Reiter
,
Marie Schmidt
.
sofsem 2025
:
85-98
[doi]
Colorful 3-Rainbow Domination
Tetiana Lavynska
.
sofsem 2025
:
99-111
[doi]
Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity
Guillaume Malod
.
sofsem 2025
:
128-141
[doi]
Roman Hitting Set
Kevin Mann
,
Henning Fernau
.
sofsem 2025
:
142-156
[doi]
Visual Complexity of Point Set Mappings
Wouter Meulemans
,
Arjen Simons
,
Kevin Verbeek
.
sofsem 2025
:
157-171
[doi]
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno
,
Shun Takahashi
,
Kazuhisa Seto
,
Takashi Horiyama
.
sofsem 2025
:
172-183
[doi]
Knowledge Neurons in the Knowledge Graph-based Link Prediction Models
Grzegorz P. Mika
,
Amel Bouzeghoub
,
Katarzyna Wegrzyn-Wolska
,
Yessin M. Neggaz
.
sofsem 2025
:
184-197
[doi]
Disjoint Covering of Bipartite Graphs with s-clubs
Angelo Monti
,
Blerina Sinaimeri
.
sofsem 2025
:
198-210
[doi]
Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
Yutaro Numaya
,
Yoshito Kawasaki
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
sofsem 2025
:
211-224
[doi]
Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
Christian Ortlieb
.
sofsem 2025
:
225-237
[doi]
DAG Scheduling in the BSP Model
Pál András Papp
,
Georg Anegg
,
Albert-Jan Yzelman
.
sofsem 2025
:
238-253
[doi]
Incremental Computation of the Set of Period Sets
Eric Rivals
.
sofsem 2025
:
254-268
[doi]
Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
Sampriti Roy
,
Yadu Vasudev
.
sofsem 2025
:
269-283
[doi]
Packed Acyclic Deterministic Finite Automata
Hiroki Shibata
,
Masakazu Ishihata
,
Shunsuke Inenaga
.
sofsem 2025
:
284-297
[doi]
Holey Graphs: Very Large Betti Numbers are Testable
Dániel Szabó
,
Simon Apers
.
sofsem 2025
:
298-310
[doi]
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Reuben Tate
,
Stephan J. Eidenbenz
.
sofsem 2025
:
311-323
[doi]
Online Busy Time Scheduling with Untrusted Prediction
Rick van de Bovenkamp
,
Alison Hsiang-Hsuan Liu
.
sofsem 2025
:
324-336
[doi]
Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs
Erik Jan van Leeuwen
.
sofsem 2025
:
8-20
[doi]
Maximal α-Gapped Repeats in a Fibonacci String
Kazuma Yamane
,
Yuto Nakashima 0001
,
Kazuhisa Seto
,
Takashi Horiyama
.
sofsem 2025
:
337-350
[doi]
2024
Automata Classes Accepting Languages Whose Commutative Closure is Regular
Stefan Hoffmann 0001
.
sofsem 2024
:
311-325
[doi]
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
Sebastian Berndt 0001
,
Matthias Mnich
,
Tobias Stamm
.
sofsem 2024
:
82-95
[doi]
Outerplanar and Forest Storyplans
Jirí Fiala 0001
,
Oksana Firman
,
Giuseppe Liotta
,
Alexander Wolff 0001
,
Johannes Zink 0001
.
sofsem 2024
:
211-225
[doi]
Generalized Distance Polymatrix Games
Alessandro Aloisio
,
Michele Flammini
,
Cosimo Vinci
.
sofsem 2024
:
25-39
[doi]
On the Computational Complexity of Generalized Common Shape Puzzles
Mutsunori Banbara
,
Shin-ichi Minato
,
Hirotaka Ono 0001
,
Ryuhei Uehara
.
sofsem 2024
:
55-68
[doi]
Fractional Bamboo Trimming and Distributed Windows Scheduling
Arash Beikmohammadi
,
William S. Evans
,
Seyed Ali Tabatabaee
.
sofsem 2024
:
69-81
[doi]
On the Parameterized Complexity of Minus Domination
Sriram Bhyravarapu
,
Lawqueen Kanesh
,
A. Mohanapriya
,
Nidhi Purohit
,
N. Sadagopan
,
Saket Saurabh 0001
.
sofsem 2024
:
96-110
[doi]
Parameterized Algorithms for Covering by Arithmetic Progressions
Ivan Bliznets
,
Jesper Nedelof
,
Krisztina Szilágyi
.
sofsem 2024
:
125-138
[doi]
Exact and Parameterized Algorithms for Choosability
Ivan Bliznets
,
Jesper Nederlof
.
sofsem 2024
:
111-124
[doi]
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
Annalisa De Bonis
.
sofsem 2024
:
154-168
[doi]
Row-Column Combination of Dyck Words
Stefano Crespi-Reghizzi
,
Antonio Restivo
,
Pierluigi San Pietro
.
sofsem 2024
:
139-153
[doi]
On the Parameterized Complexity of the Perfect Phylogeny Problem
Jorke M. de Vlas
.
sofsem 2024
:
169-182
[doi]
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles
Jona Dirks
,
Enna Gerhard
,
Mario Grobler
,
Amer E. Mouawad
,
Sebastian Siebertz
.
sofsem 2024
:
183-197
[doi]
Visualization of Bipartite Graphs in Limited Window Size
William Evans
,
Kassian Köck
,
Stephen G. Kobourov
.
sofsem 2024
:
198-210
[doi]
SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings
Henning Fernau
,
Serge Gaspers
,
Ralf Klasing
, editors,
Volume 14519 of
Lecture Notes in Computer Science
, Springer,
2024.
[doi]
The Complexity of Cluster Vertex Splitting and Company
Alexander Firbas
,
Alexander Dobler
,
Fabian Holzer
,
Jakob Schafellner
,
Manuel Sorge
,
Anaïs Villedieu
,
Monika Wißmann
.
sofsem 2024
:
226-239
[doi]
Morphing Graph Drawings in the Presence of Point Obstacles
Oksana Firman
,
Tim Hegemann
,
Boris Klemz
,
Felix Klesen
,
Marie Diana Sieper
,
Alexander Wolff 0001
,
Johannes Zink 0001
.
sofsem 2024
:
240-254
[doi]
Word-Representable Graphs from a Word's Perspective
Pamela Fleischmann
,
Lukas Haschke
,
Tim Löck
,
Dirk Nowotka
.
sofsem 2024
:
255-268
[doi]
The Complexity of Online Graph Games
Janosch Fuchs
,
Christoph Grüne
,
Tom Janßen
.
sofsem 2024
:
269-282
[doi]
Removable Online Knapsack with Bounded Size Items
Laurent Gourvès
,
Aris Pagourtzis
.
sofsem 2024
:
283-296
[doi]
Faster Winner Determination Algorithms for (Colored) Arc Kayles
Tesshu Hanaka
,
Hironori Kiya
,
Michael Lampis
,
Hirotaka Ono 0001
,
Kanae Yoshiwatari
.
sofsem 2024
:
297-310
[doi]
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
Jan Janousek
,
Stepán Plachý
.
sofsem 2024
:
326-339
[doi]
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
Yoshito Kawasaki
,
Diptarama Hendrian
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
sofsem 2024
:
340-354
[doi]
Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode
Christian Laußmann
,
Jörg Rothe
,
Tessa Seeger
.
sofsem 2024
:
355-368
[doi]
Local Certification of Majority Dynamics
Diego Maldonado
,
Pedro Montealegre 0001
,
Martín Ríos Wilson
,
Guillaume Theyssier
.
sofsem 2024
:
369-382
[doi]
Relaxed Agreement Forests
Virginia Ardévol Martínez
,
Steven Chaplick
,
Steven Kelk
,
Ruben Meuwese
,
Matús Mihalák
,
Georgios Stamoulis
.
sofsem 2024
:
40-54
[doi]
Complexity of Spherical Equations in Finite Groups
Caroline Mattes
,
Alexander Ushakov
,
Armin Weiß
.
sofsem 2024
:
383-397
[doi]
Positive Characteristic Sets for Relational Pattern Languages
S. Mahmoud Mousawi
,
Sandra Zilles
.
sofsem 2024
:
398-412
[doi]
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
Jesper Nederlof
,
Krisztina Szilágyi
.
sofsem 2024
:
413-426
[doi]
The Weighted HOM-Problem Over Fields
Andreea-Teodora Nász
.
sofsem 2024
:
427-441
[doi]
Combinatorics of Block-Parallel Automata Networks
Kévin Perrot
,
Sylvain Sené
,
Léah Tapin
.
sofsem 2024
:
442-455
[doi]
On the Piecewise Complexity of Words and Periodic Words
M. Praveen
,
Philippe Schnoebelen
,
Julien Veron
,
Isa Vialard
.
sofsem 2024
:
456-470
[doi]
The Information Extraction Framework of Document Spanners - A Very Informal Survey
Markus L. Schmid
.
sofsem 2024
:
3-22
[doi]
Distance Labeling for Families of Cycles
Arseny M. Shur
,
Mikhail Rubinchik
.
sofsem 2024
:
471-484
[doi]
On the Induced Problem for Fixed-Template CSPs
Rustem Takhanov
.
sofsem 2024
:
485-499
[doi]
2023
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints
Piotr Wojciechowski 0002
,
K. Subramani
.
sofsem 2023
:
313-327
[doi]
Quantum Complexity for Vector Domination Problem
Andris Ambainis
,
Ansis Zvirbulis
.
sofsem 2023
:
328-341
[doi]
On the 2-Layer Window Width Minimization Problem
Michael A. Bekos
,
Henry Förster
,
Michael Kaufmann 0001
,
Stephen G. Kobourov
,
Myroslav Kryven
,
Axel Kuckuk
,
Lena Schlipf
.
sofsem 2023
:
209-221
[doi]
Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth
Hauke Brinkop
,
Klaus Jansen
.
sofsem 2023
:
33-46
[doi]
On the Preservation of Properties When Changing Communication Models
Olav Bunte
,
Louis C. M. van Gool
,
Tim A. C. Willemse
.
sofsem 2023
:
239-253
[doi]
SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings
Leszek Gasieniec
, editor,
Volume 13878 of
Lecture Notes in Computer Science
, Springer,
2023.
[doi]
Heuristics for Opinion Diffusion via Local Elections
Rica Gonen
,
Martin Koutecký
,
Roei Menashof
,
Nimrod Talmon
.
sofsem 2023
:
144-158
[doi]
More Effort Towards Multiagent Knapsack
Sushmita Gupta
,
Pallavi Jain 0001
,
Sanjay Seetharaman
.
sofsem 2023
:
47-62
[doi]
On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines
Klaus Jansen
,
Kai Kahler
.
sofsem 2023
:
192-206
[doi]
Introduction to Routing Problems with Mandatory Transitions
Christian Laforest
,
Timothée Martinod
.
sofsem 2023
:
254-266
[doi]
Lower Bounds for Monotone q-Multilinear Boolean Circuits
Andrzej Lingas
.
sofsem 2023
:
301-312
[doi]
Learning Through Imitation by Using Formal Verification
Avraham Raviv
,
Eliya Bronshtein
,
Or Reginiano
,
Michelle Aluf-Medina
,
Hillel Kugler
.
sofsem 2023
:
342-355
[doi]
Space-Efficient STR-IC-LCS Computation
Yuuki Yonemoto
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
.
sofsem 2023
:
372-384
[doi]
Sign in
or
sign up
to see more results.