default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID49th SOFSEM 2024: Cochem, Germany
- Henning Fernau
, Serge Gaspers, Ralf Klasing:
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. Lecture Notes in Computer Science 14519, Springer 2024, ISBN 978-3-031-52112-6
Invited Paper
- Markus L. Schmid:
The Information Extraction Framework of Document Spanners - A Very Informal Survey. 3-22
Contributed Papers
- Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
Generalized Distance Polymatrix Games. 25-39 - Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. 40-54 - Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. 55-68 - Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee:
Fractional Bamboo Trimming and Distributed Windows Scheduling. 69-81 - Sebastian Berndt, Matthias Mnich, Tobias Stamm:
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. 82-95 - Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. 96-110 - Ivan Bliznets, Jesper Nederlof:
Exact and Parameterized Algorithms for Choosability. 111-124 - Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. 125-138 - Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Row-Column Combination of Dyck Words. 139-153 - Annalisa De Bonis:
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. 154-168 - Jorke M. de Vlas:
On the Parameterized Complexity of the Perfect Phylogeny Problem. 169-182 - Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz:
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles. 183-197 - William S. Evans, Kassian Köck, Stephen G. Kobourov:
Visualization of Bipartite Graphs in Limited Window Size. 198-210 - Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. 211-225 - Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. 226-239 - Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Morphing Graph Drawings in the Presence of Point Obstacles. 240-254 - Pamela Fleischmann, Lukas Haschke, Tim Löck, Dirk Nowotka:
Word-Representable Graphs from a Word's Perspective. 255-268 - Janosch Fuchs, Christoph Grüne, Tom Janßen:
The Complexity of Online Graph Games. 269-282 - Laurent Gourvès, Aris Pagourtzis:
Removable Online Knapsack with Bounded Size Items. 283-296 - Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. 297-310 - Stefan Hoffmann:
Automata Classes Accepting Languages Whose Commutative Closure is Regular. 311-325 - Jan Janousek, Stepán Plachý:
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. 326-339 - Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. 340-354 - 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. 355-368 - Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. 369-382 - Caroline Mattes, Alexander Ushakov, Armin Weiß:
Complexity of Spherical Equations in Finite Groups. 383-397 - S. Mahmoud Mousawi, Sandra Zilles:
Positive Characteristic Sets for Relational Pattern Languages. 398-412 - Jesper Nederlof, Krisztina Szilágyi:
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. 413-426 - Andreea-Teodora Nász:
The Weighted HOM-Problem Over Fields. 427-441 - Kévin Perrot, Sylvain Sené, Léah Tapin:
Combinatorics of Block-Parallel Automata Networks. 442-455 - M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard:
On the Piecewise Complexity of Words and Periodic Words. 456-470 - Arseny M. Shur, Mikhail Rubinchik:
Distance Labeling for Families of Cycles. 471-484 - Rustem Takhanov:
On the Induced Problem for Fixed-Template CSPs. 485-499
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 01:25 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:
