Skip to content

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

SOFSEM papers

1,439 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2011Cooperative Query Answering by Abstract Interpretation.Raju Halder, Agostino Cortesi
2011A Structured Codesign Approach to Many-Core Architectures for Embedded Systems.Jrg Gutknecht
2011Upward Point-Set Embeddability.Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2011OnAndreas Gemsa, Martin Nllenburg, Thomas Pajor, Ignaz Rutter
2011In-Place Sorting.Viliam Geffert, Jozef Gajdos
2011New Results on the Complexity of the Max- and Min-Rep Problems.Robert Ganian
2011White Space Regions.Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli
2011Bandwidth Constrained Multi-interface Networks.Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011Min-Max Coverage in Multi-interface Networks.Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011Collisionless Gathering of Robots with an Extent.Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Mrtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch
2011One-Reversal Counter Machines and Multihead Automata: Revisited.Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki
2011Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions.Igor Chikalov, Shahid Hussain, Mikhail Moshkov
2011Integrity and Consistency for Untrusted Services - (Extended Abstract).Christian Cachin
2011GreedyMAX-type Algorithms for the Maximum Independent Set Problem.Piotr Borowiecki, Frank Gring
2011Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.Beate Bollig, Marc Gill
2011On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2011Combining Traditional Map Labeling with Boundary Labeling.Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis
2011Tracking the Evolution of Code Clones.Tibor Bakota
2011Liquidsoap: A High-Level Programming Language for Multimedia Streaming.David Baelde, Romain Beauxis, Samuel Mimram
2011The Straight-Line RAC Drawing Problem Is NP-Hard.Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
2010Vertex Ranking with Capacity.Ruben van der Zwaan
2010Taming the Complexity of Inductive Logic Programming.Filip Zelezn, Ondrej Kuzelka
2010Finding and Certifying Loops.Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
2010Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining.Danuta Zakrzewska
2010Multilanguage Debugger Architecture.Jan Vran, Michal Pse
701725 of 1,439← PreviousNext →