SOFSEM

Keyphrases

Publications

2024

Ivan Bliznets, Jesper Nedelof, Krisztina Szilágyi
Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM (2024)
Janosch Fuchs, Christoph Grüne, Tom Janßen
The Complexity of Online Graph Games. SOFSEM (2024)
Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
Morphing Graph Drawings in the Presence of Point Obstacles. SOFSEM (2024)
Pamela Fleischmann, Lukas Haschke, Tim Löck, Dirk Nowotka
Word-Representable Graphs from a Word's Perspective. SOFSEM (2024)
Ivan Bliznets, Jesper Nederlof
Exact and Parameterized Algorithms for Choosability. SOFSEM (2024)
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM (2024)
Jan Janousek, Stepán Plachý
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. SOFSEM (2024)
Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. SOFSEM (2024)
Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. SOFSEM (2024)
Andreea-Teodora Nász
The Weighted HOM-Problem Over Fields. SOFSEM (2024)
Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee
Fractional Bamboo Trimming and Distributed Windows Scheduling. SOFSEM (2024)
Caroline Mattes, Alexander Ushakov, Armin Weiß
Complexity of Spherical Equations in Finite Groups. SOFSEM (2024)
Christian Laußmann, Jörg Rothe, Tessa Seeger
Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. SOFSEM (2024)
Stefan Hoffmann
Automata Classes Accepting Languages Whose Commutative Closure is Regular. SOFSEM (2024)
Markus L. Schmid
The Information Extraction Framework of Document Spanners - A Very Informal Survey. SOFSEM (2024)
Kévin Perrot, Sylvain Sené, Léah Tapin
Combinatorics of Block-Parallel Automata Networks. SOFSEM (2024)
Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
On the Parameterized Complexity of Minus Domination. SOFSEM (2024)
Jorke M. de Vlas
On the Parameterized Complexity of the Perfect Phylogeny Problem. SOFSEM (2024)
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM (2024)
S. Mahmoud Mousawi, Sandra Zilles
Positive Characteristic Sets for Relational Pattern Languages. SOFSEM (2024)
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
The Complexity of Cluster Vertex Splitting and Company. SOFSEM (2024)
William Evans, Kassian Köck, Stephen G. Kobourov
Visualization of Bipartite Graphs in Limited Window Size. SOFSEM (2024)
Jesper Nederlof, Krisztina Szilágyi
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. SOFSEM (2024)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Row-Column Combination of Dyck Words. SOFSEM (2024)
Laurent Gourvès, Aris Pagourtzis
Removable Online Knapsack with Bounded Size Items. SOFSEM (2024)
Rustem Takhanov
On the Induced Problem for Fixed-Template CSPs. SOFSEM (2024)
Annalisa De Bonis
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. SOFSEM (2024)
Diego Maldonado, Pedro Montealegre, Martín Ríos Wilson, Guillaume Theyssier
Local Certification of Majority Dynamics. SOFSEM (2024)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. SOFSEM (2024)
Sebastian Berndt, Matthias Mnich, Tobias Stamm
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM (2024)
Arseny M. Shur, Mikhail Rubinchik
Distance Labeling for Families of Cycles. SOFSEM (2024)
Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles. SOFSEM (2024)
Alessandro Aloisio, Michele Flammini, Cosimo Vinci
Generalized Distance Polymatrix Games. SOFSEM (2024)
M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard
On the Piecewise Complexity of Words and Periodic Words. SOFSEM (2024)

volume 14519, 2024

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 SOFSEM 14519 (2024)

2023

volume 13878, 2023

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 SOFSEM 13878 (2023)