| Publication | Date of Publication | Type |
|---|
| On the parallel parameterized complexity of MaxSAT variants | 2024-07-12 | Paper |
| On the satisfaction probability of \(k\)-CNF formulas | 2024-07-05 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192475 | 2024-02-12 | Paper |
| On the parallel parameterized complexity of MaxSAT variants | 2023-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059165 | 2023-11-02 | Paper |
| Dynamic kernels for hitting sets and set packing | 2022-10-27 | Paper |
| On the Descriptive Complexity of Color Coding | 2022-07-18 | Paper |
| Work-sensitive dynamic complexity of formal languages | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009475 | 2021-08-04 | Paper |
| Computing Hitting Set Kernels By AC^0-Circuits | 2020-08-05 | Paper |
| Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits | 2020-04-15 | Paper |
| Towards Work-Efficient Parallel Parameterized Algorithms | 2019-10-15 | Paper |
| A gentle introduction to applications of algorithmic metatheorems for space and circuit classes | 2019-03-26 | Paper |
| Parallel Multivariate Meta-Theorems | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363777 | 2017-09-29 | Paper |
| Where First-Order and Monadic Second-Order Logic Coincide | 2017-07-13 | Paper |
| Where First-Order and Monadic Second-Order Logic Coincide | 2017-05-16 | Paper |
| Offline Drawing of Dynamic Trees: Algorithmics and Document Integration | 2017-02-21 | Paper |
| Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification | 2017-01-24 | Paper |
| On the space and circuit complexity of parameterized problems: classes and completeness | 2015-05-04 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| Drawing graphs with TikZ: in the beginning was the path | 2014-07-04 | Paper |
| Completeness Results for Parameterized Space Classes | 2013-12-10 | Paper |
| Graph drawing in Ti\(k\)Z | 2013-08-13 | Paper |
| Graph Drawing in TikZ | 2013-04-03 | Paper |
| On the Space Complexity of Parameterized Problems | 2013-01-07 | Paper |
| Algorithmic meta theorems for circuit classes of constant and logarithmic depth | 2012-08-23 | Paper |
| Influence of tree topology restrictions on the complexity of haplotyping with missing data | 2012-06-25 | Paper |
| Phylogeny- and parsimony-based haplotype inference with constraints | 2012-05-24 | Paper |
| Phylogeny- and Parsimony-Based Haplotype Inference with Constraints | 2010-07-26 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| On the complexity of kings | 2010-02-09 | Paper |
| On the complexity of SNP block partitioning under the perfect phylogeny model | 2009-12-15 | Paper |
| Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data | 2009-06-03 | Paper |
| Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems | 2009-02-03 | Paper |
| Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise | 2009-02-03 | Paper |
| Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs | 2008-04-24 | Paper |
| On the Complexity of Kings | 2008-02-26 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Logspace optimization problems and their approximability properties | 2007-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439687 | 2007-05-29 | Paper |
| Haplotyping with missing data via perfect path phylogenies | 2007-04-18 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Weak cardinality theorems | 2006-01-16 | Paper |
| Context-free languages can be accepted with absolutely no space overhead | 2006-01-10 | Paper |
| The Complexity of Finding Paths in Graphs with Bounded Independence Number | 2005-09-16 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| On the reducibility of sets inside NP to sets with low information content | 2005-02-23 | Paper |
| Comparing verboseness for finite automata and Turing machines | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808678 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736863 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452073 | 2004-02-11 | Paper |
| Query complexity of membership comparable sets. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708609 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785453 | 2003-02-25 | Paper |
