default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID50th SOFSEM 2025: Bratislava, Slovak Republic - Part II
- Rastislav Královic
, Vera Kurková:
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. Lecture Notes in Computer Science 15539, Springer 2025, ISBN 978-3-031-82696-2
Contributed Papers
- Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Problems for Unary Regular Languages. 3-16 - Janosch Fuchs, Christoph Grüne, Tom Janßen:
The Complexity of Graph Exploration Games. 17-30 - Jan Gutleben, Arne Meier:
A SUBSET-SUM Characterisation of the A-Hierarchy. 31-44 - Pyry Herva, Jarkko Kari:
On the Periodic Decompositions of Multidimensional Configurations. 45-57 - Kamil Khadiev, Danil Serov:
Quantum Algorithm for the Multiple String Matching Problem. 58-69 - Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher:
Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. 70-84 - Antonio Lauerbach, Kendra Reiter, Marie Schmidt:
The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem. 85-98 - Tetiana Lavynska:
Colorful 3-Rainbow Domination. 99-111 - Bruce M. Kapron, Koosha Samieefar:
The Computational Complexity of Equilibria with Strategic Constraints. 112-127 - Guillaume Malod:
Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity. 128-141 - Kevin Mann, Henning Fernau:
Roman Hitting Set. 142-156 - Wouter Meulemans, Arjen Simons, Kevin Verbeek:
Visual Complexity of Point Set Mappings. 157-171 - Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama:
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. 172-183 - Grzegorz P. Mika, Amel Bouzeghoub, Katarzyna Wegrzyn-Wolska, Yessin M. Neggaz:
Knowledge Neurons in the Knowledge Graph-based Link Prediction Models. 184-197 - Angelo Monti, Blerina Sinaimeri:
Disjoint Covering of Bipartite Graphs with s-clubs. 198-210 - Yutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. 211-224 - Christian Ortlieb:
Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs. 225-237 - Pál András Papp, Georg Anegg, Albert-Jan Yzelman:
DAG Scheduling in the BSP Model. 238-253 - Eric Rivals:
Incremental Computation of the Set of Period Sets. 254-268 - Sampriti Roy, Yadu Vasudev:
Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints. 269-283 - Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga:
Packed Acyclic Deterministic Finite Automata. 284-297 - Dániel Szabó, Simon Apers:
Holey Graphs: Very Large Betti Numbers are Testable. 298-310 - Reuben Tate, Stephan J. Eidenbenz:
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere. 311-323 - Rick van de Bovenkamp, Alison Hsiang-Hsuan Liu:
Online Busy Time Scheduling with Untrusted Prediction. 324-336 - Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama:
Maximal α-Gapped Repeats in a Fibonacci String. 337-350
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
