Till Tantau
About
In The Last Decade
Till Tantau
29 papers receiving 117 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 78
- Artificial Intelligence 42
- Molecular Biology 28
- Genetics 27
- Computer Networks and Communications 14
Countries citing papers authored by Till Tantau
This map shows the geographic impact of Till Tantau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Till Tantau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Till Tantau more than expected).
Fields of papers citing papers by Till Tantau
This network shows the impact of papers produced by Till Tantau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Till Tantau. The network helps show where Till Tantau may publish in the future.
Co-authorship network of co-authors of Till Tantau
This figure shows the co-authorship network connecting the top 25 collaborators of Till Tantau. A scholar is included among the top collaborators of Till Tantau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Till Tantau. Till Tantau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | On the Parallel Parameterized Complexity of MaxSAT Variants | Journal of Artificial Intelligence Research | Till Tantau et al. | 1 |
| 2 | Dynamic Kernels for Hitting Sets and Set Packing | Algorithmica | Rüdiger Reischuk, Till Tantau et al. | 0 |
| 3 | Parallel Multivariate Meta-Theorems | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Till Tantau et al. | 4 |
| 4 | Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Till Tantau | 1 |
| 5 | Fast Parallel Fixed-parameter Algorithms via Color Coding | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Till Tantau et al. | 1 |
| 6 | Influence of tree topology restrictions on the complexity of haplotyping with missing data | Theoretical Computer Science | Till Tantau et al. | 0 |
| 7 | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Till Tantau et al. | 7 |
| 8 | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth | HAL (Le Centre pour la Communication Scientifique Directe) | Till Tantau et al. | 5 |
| 9 | Smoothed analysis of left-to-right maxima with applications | ACM Transactions on Algorithms | Bodo Manthey, Friedhelm Meyer auf der Heide et al. | 3 |
| 10 | On the complexity of SNP block partitioning under the perfect phylogeny model | Discrete Mathematics | Jens Gramm, Tzvika Hartman et al. | 3 |
| 11 | Fixed-Parameter Algorithms in Phylogenetics | Methods in molecular biology | Jens Gramm, Till Tantau et al. | 13 |
| 12 | Haplotyping with missing data via perfect path phylogenies | Discrete Applied Mathematics | Jens Gramm, Roded Sharan et al. | 6 |
| 13 | Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Till Tantau et al. | 2 |
| 14 | Aggregates with Component Size One Characterize Polynomial Space | Electronic colloquium on computational complexity | Till Tantau et al. | 2 |
| 15 | On the reducibility of sets inside NP to sets with low information content | Journal of Computer and System Sciences | Mitsunori Ogihara, Till Tantau | 1 |
| 16 | Logspace Optimisation Problems and their Approximation Properties | Electronic colloquium on computational complexity | Till Tantau | 2 |
| 17 | Query complexity of membership comparable sets | Theoretical Computer Science | Till Tantau | 1 |
| 18 | A Note on the Power of Extra Queries to Membership Comparable Sets | Electronic colloquium on computational complexity | Till Tantau | 1 |
| 19 | A Note on the Complexity of the Reachability Problem for Tournaments | Electronic colloquium on computational complexity | Till Tantau | 10 |
| 20 | On the Power of Extra Queries to Selective Languages | Electronic colloquium on computational complexity | Till Tantau | 2 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.