| Publication | Date of Publication | Type |
|---|
| Mortality and Edge-to-Edge Reachability are Decidable on Surfaces | 2024-02-21 | Paper |
| Learning from positive and negative examples: new proof for binary alphabets | 2023-10-12 | Paper |
| Order Reconfiguration under Width Constraints | 2023-09-20 | Paper |
| Synthesis and Analysis of Petri Nets from Causal Specifications | 2022-12-07 | Paper |
| Second-Order Finite Automata | 2022-10-19 | Paper |
| On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection | 2022-10-13 | Paper |
| Learning from positive and negative examples: dichotomies and parameterized algorithms | 2022-08-30 | Paper |
| Second-order finite automata | 2022-07-26 | Paper |
| Computing the zig-zag number of directed graphs | 2022-03-24 | Paper |
| Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory | 2022-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028434 | 2022-02-09 | Paper |
| Succinct certification of monotone circuits | 2021-10-06 | Paper |
| Succinct monotone circuit certification: planarity and parameterized complexity | 2021-04-21 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-11-06 | Paper |
| Representations of monotone Boolean functions by linear programs | 2020-05-26 | Paper |
| On supergraphs satisfying CMSO properties | 2020-05-26 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-05-25 | Paper |
| On the width of regular classes of finite structures | 2020-03-10 | Paper |
| Representations of monotone Boolean functions by linear programs | 2019-12-16 | Paper |
| Intersection non-emptiness and hardness within polynomial time | 2018-11-22 | Paper |
| Graph amalgamation under logical constraints | 2018-11-22 | Paper |
| On weak isomorphism of rooted vertex-colored graphs | 2018-11-22 | Paper |
| Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth | 2018-04-10 | Paper |
| A near-quadratic lower bound for the size of quantum circuits of constant treewidth | 2018-03-15 | Paper |
| Size-treewidth tradeoffs for circuits computing the element distinctness function | 2018-03-01 | Paper |
| Parameterized provability in equational logic | 2018-02-02 | Paper |
| Size-treewidth tradeoffs for circuits computing the element distinctness function | 2018-01-24 | Paper |
| On the satisfiability of quantum circuits of small treewidth | 2017-10-20 | Paper |
| A slice theoretic approach for embedding problems on digraphs | 2016-10-21 | Paper |
| Causality in bounded Petri nets is MSO definable | 2016-09-09 | Paper |
| Satisfiability via smooth pictures | 2016-09-05 | Paper |
| An algorithmic metatheorem for directed treewidth | 2016-04-07 | Paper |
| MSO logic and the partial order semantics of place/transition-nets | 2016-02-25 | Paper |
| On the satisfiability of quantum circuits of small treewidth | 2015-10-20 | Paper |
| Reachability in graph transformation systems and slice languages | 2015-09-22 | Paper |
| Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs | 2013-12-10 | Paper |
| Canonizable partial order generators | 2012-06-08 | Paper |
| Hasse diagram generators and Petri nets | 2011-03-28 | Paper |
| Hasse Diagram Generators and Petri Nets | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439708 | 2007-05-29 | Paper |
