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
2026
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
Christian Komusiewicz
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
Mária Bieliková
Rusins Freivalds
Ryo Yoshinaka
Shunsuke Inenaga
Stephen G. Kobourov
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
automata
complexity
current
data
graph
graphs
model
networks
practice
problem
problems
software
systems
theory
time
trends
using
web
SOFSEM (sofsem)
Editions
Publications
Viewing Publication 1 - 100 from 1476
2026
Clique-Free t-Matchings in Degree-Bounded Graphs
Katarzyna E. Paluch 0001
,
Mateusz Wasylkiewicz
.
sofsem 2026
:
563-577
[doi]
On the Complexity of Constrained Reconfiguration and Motion Planning
Nicolas Bousquet 0001
,
Remy El Sabeh
,
Amer E. Mouawad
,
Naomi Nishimura
.
sofsem 2026
:
1-15
[doi]
A Quadratic Lower Bound for 2dfas Against One-Way Liveness
Kehinde Adeogun
,
Christos Kapoutsis
.
sofsem 2026
:
104-116
[doi]
Edge-Constrained Hamiltonian Paths on a Point Set
Todor Antic
,
Aleksa Dzuklevski
,
Jirí Fiala 0001
,
Jan Kratochvíl
,
Giuseppe Liotta
,
Morteza Saghafian
,
Maria Saumell
,
Johannes Zink 0001
.
sofsem 2026
:
532-546
[doi]
Quantified Colouring and H-Free Algorithmics
Kristina Asimi
,
Tala Eagling-Vose
,
Santiago Guzmán-Pro
,
Barnaby Martin
,
Yiming Qiu
.
sofsem 2026
:
447-460
[doi]
Counting Large Patterns in Degenerate Graphs
Christine Awofeso
,
Patrick Greaves
,
Oded Lachish
,
Felix Reidl
.
sofsem 2026
:
607-620
[doi]
A Practical Algorithm for 3-Admissibility
Christine Awofeso
,
Patrick Greaves
,
Oded Lachish
,
Felix Reidl
.
sofsem 2026
:
203-215
[doi]
Efficient Trace Frequency Queries in Sparse Graphs
Christine Awofeso
,
Pål Grønås Drange
,
Patrick Greaves
,
Oded Lachish
,
Felix Reidl
.
sofsem 2026
:
593-606
[doi]
Overlapping Biclustering
Matthias Bentert
,
Pål Grønås Drange
,
Erlend Haugen
.
sofsem 2026
:
288-302
[doi]
Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm
Therese Biedl
.
sofsem 2026
:
491-504
[doi]
Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
Therese Biedl
,
Prashant Gokhale
.
sofsem 2026
:
216-230
[doi]
Exploiting Low Scanwidth to Resolve Soft Polytomies
Sebastian Bruchhold
,
Mathias Weller
.
sofsem 2026
:
332-346
[doi]
Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction
Nader H. Bshouty
.
sofsem 2026
:
31-45
[doi]
Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
Kunanon Burathep
,
Thomas Erlebach
,
William K. Moses Jr.
.
sofsem 2026
:
361-375
[doi]
On the Order-Diameter Ratio of Girth-Diameter Cages
Stijn Cambie
,
Jan Goedgebeur
,
Jorik Jooken
,
Tibo Van den Eede
.
sofsem 2026
:
144-156
[doi]
Complexity Aspects of Homomorphisms of Ordered Graphs
Michal Certík
,
Andreas Emil Feldmann
,
Jaroslav Nesetril
,
Pawel Rzazewski
.
sofsem 2026
:
416-431
[doi]
Private Graph Colouring with Limited Defectiveness
Aleksander B. G. Christiansen
,
Eva Rotenberg
,
Teresa Anna Steiner
,
Juliette Vlieghe
.
sofsem 2026
:
404-415
[doi]
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
Sabine Cornelsen
,
Henry Förster
,
Siddharth Gupta 0002
,
Stephen G. Kobourov
,
Johannes Zink 0001
.
sofsem 2026
:
517-531
[doi]
Minimum Length Word-Representants of Treelike Permutation Graphs
Tithi Dwary
,
Kanduru V. Krishna
.
sofsem 2026
:
90-103
[doi]
Pinwheel Scheduling with Real Periods
Hiroshi Fujiwara
,
Kota Miyagi
,
Katsuhisa Ouchi
.
sofsem 2026
:
621-633
[doi]
Sublinear Work Parallel Quantum Algorithms for Computational Geometry
Shion Fukuzawa
,
Michael T. Goodrich
,
Sandy Irani
.
sofsem 2026
:
231-245
[doi]
Parameterized Algorithms for Locally Minimal Defensive Alliance
Ajinkya Gaikwad
,
Soumen Maity
,
Saket Saurabh 0001
.
sofsem 2026
:
317-331
[doi]
Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting
Adam Ganczorz
,
Tomasz Jurdzinski
.
sofsem 2026
:
648-662
[doi]
On Strictly Output-Sensitive Color Frequency Reporting
Erwin Glazenburg
,
Frank Staals
.
sofsem 2026
:
246-259
[doi]
Bounds and Hardness Results for Conflict-Free Choosability
Shiwali Gupta
,
Rogers Mathew
.
sofsem 2026
:
461-474
[doi]
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
Niklas Haas
,
Sören Schmitt
,
Rob van Stee
.
sofsem 2026
:
678-692
[doi]
Finding a HIST: Chordality, Structural Parameters, and Diameter
Tesshu Hanaka
,
Hironori Kiya
,
Hirotaka Ono 0001
.
sofsem 2026
:
303-316
[doi]
k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs
Petr Hlinený
,
Jan Jedelský
.
sofsem 2026
:
505-516
[doi]
Asymptotically Optimal Representation of Palindromic Structure
Michael Itzhaki
.
sofsem 2026
:
128-143
[doi]
Towards an Algebraic Approach to the Reconfiguration CSP
Kei Kimura
.
sofsem 2026
:
46-60
[doi]
Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries
Souta Kobayashi
,
Dominik Köppl
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
sofsem 2026
:
16-30
[doi]
Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes
Toranosuke Kokai
,
Akira Suzuki 0001
,
Takahiro Suzuki 0002
,
Yuma Tamura
,
Xiao Zhou 0001
.
sofsem 2026
:
578-592
[doi]
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
Christian Komusiewicz
,
Diptapriyo Majumdar
.
sofsem 2026
:
172-186
[doi]
SOFSEM 2026: Theory and Practice of Computer Science - 51st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2026, Kraków, Poland, February 9-13, 2026, Proceedings
Jakub Kozik
,
Alexander Wolff 0001
, editors,
Volume 16448 of
Lecture Notes in Computer Science
, Springer,
2026.
[doi]
Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations
Yosuke Kusano
.
sofsem 2026
:
634-647
[doi]
Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
Nicolas El Maalouly
,
Kostas Lakis
.
sofsem 2026
:
274-287
[doi]
Mutually Abelian-Bordered Binary Words
Anuran Maity
,
Kanduru V. Krishna
.
sofsem 2026
:
75-89
[doi]
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
Nadym Mallek
,
Kirill Simonov
.
sofsem 2026
:
547-562
[doi]
On the Sprague-Grundy Values of Games with a Pass
Hikaru Manabe
,
Ryohei Miyadera
,
Koki Suetsugu
.
sofsem 2026
:
376-389
[doi]
Enumeration With Nice Roman Domination Properties
Kevin Mann
.
sofsem 2026
:
157-171
[doi]
Reverse Mathematics for Neural Networks
Yoshihiro Maruyama
.
sofsem 2026
:
390-403
[doi]
Algorithms and Complexity Results for K-Theoretic Persistent Homology
Yoshihiro Maruyama
.
sofsem 2026
:
61-74
[doi]
The Rectilinear Steiner Forest Arborescence
Lukasz Mielewczyk
,
Leonidas Palios
,
Pawel Zylinski
.
sofsem 2026
:
475-490
[doi]
On the Complexity of Capacitated Vehicle Routing with Order Restrictions
Steven Miltenburg
,
Tim Oosterwijk
,
René Sitters
.
sofsem 2026
:
260-273
[doi]
Vertical-Horizontal Full Compatibility of One-Dimensional Subshifts
Arthur Mittelstaedt
,
Gaétan Richard
.
sofsem 2026
:
117-127
[doi]
Distribution Testing Meets Sum Estimation
Sampriti Roy
.
sofsem 2026
:
663-677
[doi]
Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
Rin Saito
,
Anouk Sommer
,
Tatsuhiro Suga
,
Takahiro Suzuki 0002
,
Yuma Tamura
.
sofsem 2026
:
432-446
[doi]
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
Jannik Schestag
.
sofsem 2026
:
187-202
[doi]
Maintaining a Kingdom in a Tournament
Oren Weimann
,
Raphael Yuster
.
sofsem 2026
:
347-360
[doi]
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]
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]
Sign in
or
sign up
to see more results.