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 |
|---|---|---|
| 2021 | Iterated Uniform Finite-State Transducers on Unary Languages. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2021 | A Normal Sequence Compressed by PPM | Liam Jordon, Philippe Moser |
| 2021 | Bike Assisted Evacuation on a Line. | Khaled Jawhar, Evangelos Kranakis |
| 2021 | Parameterized Complexity of d-Hitting Set with Quotas. | Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh |
| 2021 | Distributed Independent Sets in Interval and Segment Intersection Graphs. | Barun Gorain, Kaushik Mondal, Supantha Pandit |
| 2021 | Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. | Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptk, Nicola Prezza, Marinella Sciortino, Anna Toffanello |
| 2021 | The Balanced Satisfactory Partition Problem. | Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi |
| 2021 | Using the Metro-Map Metaphor for Drawing Hypergraphs. | Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff |
| 2021 | Blocksequences of k-local Words. | Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck |
| 2021 | Distance Hedonic Games. | Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio |
| 2021 | Clusters of Repetition Roots: Single Chains. | Szilrd Zsolt Fazekas, Robert Mercas |
| 2021 | Algorithms that Access the Input via Queries. | Thomas Erlebach |
| 2021 | Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. | Massimo Equi, Veli Mkinen, Alexandru I. Tomescu |
| 2021 | Hierarchical b-Matching. | Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks |
| 2021 | New Bounds on the Half-Duplex Communication Complexity. | Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov |
| 2021 | On the Redundancy of D-Ary Fano Codes. | Ferdinando Cicalese, Massimiliano Rossi |
| 2021 | Role-Based Access Control on Graph Databases. | Jacques Chabin, Cristina Dutra de Aguiar Ciferri, Mirian Halfeld Ferrari Alves, Carmem S. Hara, Raqueline R. M. Penteado |
| 2021 | Sorting by Multi-cut Rearrangements. | Laurent Bulteau, Guillaume Fertin, Graldine Jean, Christian Komusiewicz |
| 2021 | Drawing Two Posets. | Guido Brckner, Vera Chekan |
| 2021 | Complexity of Limit-Cycle Problems in Boolean Networks. | Florian Bridoux, Caroline Gaze-Maillot, Kvin Perrot, Sylvain Sen |
| 2021 | Semi-automatic Column Type Inference for CSV Table Understanding. | Sara Bonfitto, Luca Cappelletti, Fabrizio Trovato, Giorgio Valentini, Marco Mesiti |
| 2021 | Balanced Independent and Dominating Sets on Colored Interval Graphs. | Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nllenburg |
| 2021 | Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. | Sebastian Berndt, Klaus Jansen, Alexandra Lassota |
| 2021 | Predicting Tennis Match Outcomes with Network Analysis and Machine Learning. | Firas Bayram, Davide Garbarino, Annalisa Barla |
| 2021 | Towards Knowledge Exchange: State-of-the-Art and Open Problems. | Bahar Ghadiri Bashardoost, Kelly A. Lyons, Rene J. Miller |
176–200 of 1,439← PreviousNext →