default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID50th SOFSEM 2025: Bratislava, Slovak Republic - Part I
- 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 I. Lecture Notes in Computer Science 15538, Springer 2025, ISBN 978-3-031-82669-6
Invited Talks
- Paola Flocchini:
Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract). 3-7 - Erik Jan van Leeuwen:
Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs. 8-20
Contributed Papers
- Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. 23-36 - Susanne Albers, Sebastian Schubert:
Online b-Matching with Stochastic Rewards. 37-50 - Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov:
Shortest Longest-Path Graph Orientations for Trees. 51-64 - Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Complexity of Generalizations of Edge Dominating Set. 65-79 - Ivana Benová, Jana Kosecka, Michal Gregor, Martin Tamajka, Marcel Veselý, Marián Simko:
Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking. 80-93 - D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman:
On the Complexity of Minimum Membership Dominating Set. 94-107 - Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh:
On the Structural Parameterized Complexity of Defective Coloring. 108-121 - Philip Bille, Inge Li Gørtz, Máximo Pérez López, Tord Stordalen:
Dynamic Range Minimum Queries on the Ultra-wide Word RAM. 122-135 - Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen:
Fast Practical Compression of Deterministic Finite Automata. 136-150 - Kevin Buchin, Mart Hagedoorn, Guangping Li, Carolin Rehs:
Orienteering (with Time Windows) on Restricted Graph Classes. 151-165 - Thai Bui, Hoa T. Vu:
Massively Parallel Maximum Coverage Revisited. 166-178 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Distance Vector Domination. 179-194 - Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez:
Sufficient Conditions for Polynomial-Time Detection of Induced Minors. 195-208 - Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg:
Pathways to Tractability for Geometric Thickness. 209-224 - Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff:
Minimum Monotone Spanning Trees. 225-240 - Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg:
Representing Hypergraphs by Point-Line Incidences. 241-254 - Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson:
Reachability in Temporal Graphs Under Perturbation. 255-269 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Computational Completeness of Semi-Conditional Matrix Grammars. 270-283 - Henry Förster, Julia Katheder, Giacomo Ortali:
Outer-(ap)RAC Graphs. 284-299 - Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh:
Forest Covers and Bounded Forest Covers. 300-313 - Konstantinos Georgiou, Caleb Jones, Jesse Lucier:
Multi-agent Search-Type Problems on Polygons - (Extended Abstract). 314-332 - Jan Goedgebeur, Jarne Renders:
Generation of Cycle Permutation Graphs and Permutation Snarks. 333-346 - Shay Golan, Arseny M. Shur:
Expected Density of Random Minimizers. 347-360
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-04-04 23:32 CEST 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:
