| 2026 | MFCS | The Descriptive Complexity of Relation Modification Problems. | Florian Chudigiewitsch, Marlene Grndel, Christian Komusiewicz, Nils Morawietz, Till Tantau |
| 2024 | MFCS | On the Descriptive Complexity of Vertex Deletion Problems. | Max Bannach, Florian Chudigiewitsch, Till Tantau |
| 2024 | STACS | Faster Graph Algorithms Through DAG Compression. | Max Bannach, Florian Andreas Marwitz, Till Tantau |
| 2022 | CPM | An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. | Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau |
| 2022 | SAT | On the Parallel Parameterized Complexity of MaxSAT Variants. | Max Bannach, Malte Skambath, Till Tantau |
| 2021 | FOSSACS | Work-sensitive Dynamic Complexity of Formal Languages. | Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume |
| 2019 | STACS | On the Descriptive Complexity of Color Coding. | Max Bannach, Till Tantau |
| 2019 | WALCOM | Towards Work-Efficient Parallel Parameterized Algorithms. | Max Bannach, Malte Skambath, Till Tantau |
| 2018 | STACS | Computing Hitting Set Kernels By AC^0-Circuits. | Max Bannach, Till Tantau |
| 2017 | STACS | Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk). | Till Tantau |
| 2016 | GD | Offline Drawing of Dynamic Trees: Algorithmics and Document Integration. | Malte Skambath, Till Tantau |
| 2015 | STACS | Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification. | Till Tantau |
| 2012 | GD | Graph Drawing in TikZ. | Till Tantau |
| 2012 | LICS | Where First-Order and Monadic Second-Order Logic Coincide. | Michael Elberfeld, Martin Grohe, Till Tantau |
| 2012 | STACS | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2010 | CPM | Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. | Michael Elberfeld, Till Tantau |
| 2010 | FOCS | Logspace Versions of the Theorems of Bodlaender and Courcelle. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2009 | TAMC | Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. | Michael Elberfeld, Ilka Schnoor, Till Tantau |
| 2008 | MFCS | Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. | Michael Elberfeld, Till Tantau |
| 2008 | MFCS | Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. | Bodo Manthey, Till Tantau |
| 2007 | FCT | On the Complexity of Kings. | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe |
| 2006 | WABI | On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau |
| 2005 | FCT | Logspace Optimization Problems and Their Approximability Properties. | Till Tantau |
| 2004 | STACS | A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. | Till Tantau |
| 2003 | DLT | Computation with Absolutely No Space Overhead. | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau |
| 2003 | FCT | Weak Cardinality Theorems for First-Order Logic. | Till Tantau |
| 2002 | COCOON | On Reachability in Graphs with Bounded Independence Number. | Arfst Nickelsen, Till Tantau |
| 2002 | MFCS | Towards a Cardinality Theorem for Finite Automata. | Till Tantau |
| 2002 | STACS | Comparing Verboseness for Finite Automata and Turing Machines. | Till Tantau |
| 2001 | FCT | Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. | Arfst Nickelsen, Till Tantau |