Current Trends in Theory and Practice of Computer Science
SOFSEM
B
CORE rank
CORE rank (raw)
B
Fields of research
Information and Computing Sciences (general)
Papers indexed
1,439
1995–2026
Papers per year
199592 peak2026
Most published authors
SOFSEM papers
1,439 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2025 | Minimum Monotone Spanning Trees. | Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff |
| 2025 | Multi-agent Search-Type Problems on Polygons - (Extended Abstract). | Konstantinos Georgiou, Caleb Jones, Jesse Lucier |
| 2025 | Forest Covers and Bounded Forest Covers. | Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh |
| 2025 | The Complexity of Graph Exploration Games. | Janosch Fuchs, Christoph Grne, Tom Janen |
| 2025 | Outer-(ap)RAC Graphs. | Henry Frster, Julia Katheder, Giacomo Ortali |
| 2025 | Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract). | Paola Flocchini |
| 2025 | On Computational Completeness of Semi-Conditional Matrix Grammars. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2025 | Reachability in Temporal Graphs Under Perturbation. | Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson |
| 2025 | Representing Hypergraphs by Point-Line Incidences. | Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nllenburg |
| 2025 | Pathways to Tractability for Geometric Thickness. | Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nllenburg |
| 2025 | Sufficient Conditions for Polynomial-Time Detection of Induced Minors. | Clment Dallard, Mal Dumas, Claire Hilaire, Anthony Perez |
| 2025 | Distance Vector Domination. | Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2025 | Massively Parallel Maximum Coverage Revisited. | Thai Bui, Hoa T. Vu |
| 2025 | Orienteering (with Time Windows) on Restricted Graph Classes. | Kevin Buchin, Mart Hagedoorn, Guangping Li, Carolin Rehs |
| 2025 | Online Busy Time Scheduling with Untrusted Prediction. | Rick van de Bovenkamp, Alison Hsiang-Hsuan Liu |
| 2025 | Fast Practical Compression of Deterministic Finite Automata. | Philip Bille, Inge Li Grtz, Max Rishj Pedersen |
| 2025 | Dynamic Range Minimum Queries on the Ultra-wide Word RAM. | Philip Bille, Inge Li Grtz, Mximo Prez Lpez, Tord Stordalen |
| 2025 | On the Structural Parameterized Complexity of Defective Coloring. | Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh |
| 2025 | Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking. | Ivana Benov, Jana Kosecka, Michal Gregor, Martin Tamajka, Marcel Vesel, Marin Simko |
| 2025 | Parameterized Complexity of Generalizations of Edge Dominating Set. | Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | Shortest Longest-Path Graph Orientations for Trees. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov |
| 2025 | Online b-Matching with Stochastic Rewards. | Susanne Albers, Sebastian Schubert |
| 2025 | Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. | Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh |
| 2024 | On the Parameterized Complexity of the Perfect Phylogeny Problem. | Jorke M. de Vlas |
| 2024 | On the Induced Problem for Fixed-Template CSPs. | Rustem Takhanov |
76–100 of 1,439← PreviousNext →