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 |
|---|---|---|
| 2024 | Parameterized Algorithms for Covering by Arithmetic Progressions. | Ivan Bliznets, Jesper Nederlof, Krisztina Szilgyi |
| 2024 | Exact and Parameterized Algorithms for Choosability. | Ivan Bliznets, Jesper Nederlof |
| 2024 | On the Parameterized Complexity of Minus Domination. | Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh |
| 2024 | New Support Size Bounds and Proximity Bounds for Integer Linear Programming. | Sebastian Berndt, Matthias Mnich, Tobias Stamm |
| 2024 | Fractional Bamboo Trimming and Distributed Windows Scheduling. | Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee |
| 2024 | On the Computational Complexity of Generalized Common Shape Puzzles. | Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara |
| 2024 | Generalized Distance Polymatrix Games. | Alessandro Aloisio, Michele Flammini, Cosimo Vinci |
| 2023 | Space-Efficient STR-IC-LCS Computation. | Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. | Piotr Wojciechowski, K. Subramani |
| 2023 | Learning Through Imitation by Using Formal Verification. | Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina, Hillel Kugler |
| 2023 | Dominance Drawings for DAGs with Bounded Modular Width. | Giacomo Ortali, Ioannis G. Tollis |
| 2023 | On the Parameterized Complexity of s-club Cluster Deletion Problems. | Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini |
| 2023 | Lower Bounds for Monotone q-Multilinear Boolean Circuits. | Andrzej Lingas |
| 2023 | Introduction to Routing Problems with Mandatory Transitions. | Christian Laforest, Timothe Martinod |
| 2023 | Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. | Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff |
| 2023 | Sequentially Swapping Tokens: Further on Graph Classes. | Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2023 | On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. | Klaus Jansen, Kai Kahler |
| 2023 | More Effort Towards Multiagent Knapsack. | Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman |
| 2023 | Heuristics for Opinion Diffusion via Local Elections. | Rica Gonen, Martin Kouteck, Roei Menashof, Nimrod Talmon |
| 2023 | Payment Scheduling in the Interval Debt Model. | Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan |
| 2023 | The Complexity of Finding Tangles. | Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink |
| 2023 | Parameterized Approaches to Orthogonal Compaction. | Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi |
| 2023 | Delivery to Safety with Two Cooperating Robots. | Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2023 | A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. | Filippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2023 | On the Preservation of Properties When Changing Communication Models. | Olav Bunte, Louis C. M. van Gool, Tim A. C. Willemse |
126–150 of 1,439← PreviousNext →