| Publication | Date of Publication | Type |
|---|
| Maximizing Social Welfare in Score-Based Social Distance Games | 2024-02-28 | Paper |
| Hedonic diversity games: a complexity picture with more than two colors | 2023-12-14 | Paper |
| Testing upward planarity of partial 2-trees | 2023-08-16 | Paper |
| Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts | 2023-05-05 | Paper |
| Group activity selection with few agent types | 2023-04-28 | Paper |
| Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF | 2023-04-26 | Paper |
| On the parameterized complexity of clustering problems for incomplete data | 2023-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874284 | 2023-02-07 | Paper |
| Parameterized complexity of envy-free resource allocation in social networks | 2023-01-04 | Paper |
| Algorithmic Applications of Tree-Cut Width | 2022-11-15 | Paper |
| Parameterized Algorithms for Queue Layouts | 2022-11-14 | Paper |
| Threshold Treewidth and Hypertree Width | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092404 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089197 | 2022-07-18 | Paper |
| On Strict (Outer-)Confluent Graphs | 2022-06-28 | Paper |
| On Covering Segments with Unit Intervals | 2022-06-03 | Paper |
| Sum-of-Products with Default Values: Algorithms and Complexity Results | 2022-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075791 | 2022-05-11 | Paper |
| On Existential MSO and Its Relation to ETH | 2022-03-07 | Paper |
| An efficient algorithm for counting Markov equivalent DAGs | 2022-03-02 | Paper |
| Parameterized Algorithms for Queue Layouts | 2021-12-01 | Paper |
| New width parameters for SAT and \#SAT | 2021-11-02 | Paper |
| The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints | 2021-11-02 | Paper |
| Measuring what matters: a hybrid approach to dynamic programming with treewidth | 2021-07-06 | Paper |
| Graphs with at most two moplexes | 2021-06-18 | Paper |
| On structural parameterizations of the edge disjoint paths problem | 2021-06-11 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2021-04-19 | Paper |
| The power of cut-based parameters for computing edge-disjoint paths | 2021-03-26 | Paper |
| On structural parameterizations of the bounded-degree vertex deletion problem | 2021-02-01 | Paper |
| Parameterized Algorithms for Book Embedding Problems | 2020-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136255 | 2020-11-25 | Paper |
| On strict (outer-)confluent graphs | 2020-10-26 | Paper |
| Parameterized algorithms for book embedding problems | 2020-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304126 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304132 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111250 | 2020-05-26 | Paper |
| Using decomposition-parameters for QBF: mind the prefix! | 2020-03-13 | Paper |
| The power of cut-based parameters for computing edge disjoint paths | 2020-02-24 | Paper |
| Integer programming and incidence treedepth | 2020-02-06 | Paper |
| SAT-Encodings for Treecut Width and Treedepth | 2019-09-13 | Paper |
| On Strict (Outer-)Confluent Graphs | 2019-08-14 | Paper |
| On the complexity landscape of connected \(f\)-factor problems | 2019-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625695 | 2019-02-25 | Paper |
| Parameterized complexity of asynchronous border minimization | 2019-01-11 | Paper |
| Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting | 2018-11-05 | Paper |
| Meta-kernelization using well-structured modulators | 2018-09-17 | Paper |
| A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | 2018-09-07 | Paper |
| Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting | 2018-07-16 | Paper |
| On the complexity of rainbow coloring problems | 2018-06-27 | Paper |
| The complexity landscape of decompositional parameters for ILP | 2018-05-16 | Paper |
| Model checking existential logic on partially ordered sets | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636635 | 2018-04-19 | Paper |
| Solving problems on graphs of high rank-width | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608593 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608602 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608603 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606310 | 2018-03-02 | Paper |
| Backdoor treewidth for SAT | 2017-11-15 | Paper |
| New width parameters for model counting | 2017-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363765 | 2017-09-29 | Paper |
| Model checking existential logic on partially ordered sets | 2017-07-12 | Paper |
| Shrub-depth: Capturing Height of Dense Graphs | 2017-07-02 | Paper |
| On the complexity of rainbow coloring problems | 2016-04-04 | Paper |
| Quantified conjunctive queries on partially ordered sets | 2016-02-18 | Paper |
| FO Model Checking of Interval Graphs | 2016-01-07 | Paper |
| Are there any good digraph width measures? | 2015-12-11 | Paper |
| Meta-kernelization with structural parameters | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455032 | 2015-12-03 | Paper |
| Community Structure Inspired Algorithms for SAT and #SAT | 2015-11-20 | Paper |
| Solving Problems on Graphs of High Rank-Width | 2015-10-30 | Paper |
| Parameterized complexity of asynchronous border minimization | 2015-09-30 | Paper |
| Algorithmic Applications of Tree-Cut Width | 2015-09-16 | Paper |
| Quantified Conjunctive Queries on Partially Ordered Sets | 2015-09-15 | Paper |
| Digraph width measures in parameterized algorithmics | 2014-04-02 | Paper |
| Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking | 2014-01-28 | Paper |
| Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes | 2014-01-17 | Paper |
| Meta-kernelization with Structural Parameters | 2013-09-20 | Paper |
| FO Model Checking of Interval Graphs | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298910 | 2013-06-25 | Paper |
| Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width | 2013-04-18 | Paper |
| A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width | 2013-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917312 | 2012-09-28 | Paper |
| When Trees Grow Low: Shrubs and Fast MSO1 | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908838 | 2012-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904773 | 2012-08-23 | Paper |
| Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113705 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104253 | 2011-12-19 | Paper |
| Thread Graphs, Linear Rank-Width and Their Algorithmic Applications | 2011-05-19 | Paper |
| New Results on the Complexity of the Max- and Min-Rep Problems | 2011-02-15 | Paper |
| Are There Any Good Digraph Width Measures? | 2010-12-07 | Paper |
| On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width | 2010-05-25 | Paper |
| New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes | 2010-01-28 | Paper |
| On Digraph Width Measures in Parameterized Algorithmics | 2010-01-14 | Paper |
| Better Polynomial Algorithms on Graphs of Bounded Rank-Width | 2009-12-11 | Paper |
