| Publication | Date of Publication | Type |
|---|
| The complexity of finding and enumerating optimal subgraphs to represent spatial correlation | 2024-10-24 | Paper |
| Counting subgraphs in somewhere dense graphs | 2024-10-21 | Paper |
| Counting temporal paths | 2024-10-08 | Paper |
| Counting subgraphs in somewhere dense graphs | 2024-09-25 | Paper |
| A new temporal interpretation of cluster editing | 2024-07-01 | Paper |
| Making life more confusing for firefighters | 2024-05-16 | Paper |
| Edge exploration of temporal graphs | 2023-03-09 | Paper |
| Cops and Robbers on Multi-Layer Graphs | 2023-03-07 | Paper |
| Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes | 2022-12-07 | Paper |
| Reconstructing the degree sequence of a sparse graph from a partial deck | 2022-09-23 | Paper |
| A new temporal interpretation of cluster editing | 2022-08-30 | Paper |
| Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle | 2022-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092419 | 2022-07-21 | Paper |
| The complexity of finding optimal subgraphs to represent spatial correlation | 2022-06-29 | Paper |
| Edge exploration of temporal graphs | 2022-03-22 | Paper |
| A New Temporal Interpretation of Cluster Editing | 2022-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021292 | 2022-01-12 | Paper |
| Improved inference for areal unit count data using graph-based optimisation | 2021-12-09 | Paper |
| Efficiently enumerating hitting sets of hypergraphs arising in data profiling | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009471 | 2021-08-04 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2021-04-14 | Paper |
| Approximately counting and sampling small witnesses using a colourful decision oracle | 2021-02-02 | Paper |
| The interactive sum choice number of graphs | 2021-02-01 | Paper |
| Assigning times to minimise reachability in temporal graphs | 2020-10-23 | Paper |
| Solving hard stable matching problems involving groups of similar agents | 2020-10-21 | Paper |
| Directed branch-width: A directed analogue of tree-width | 2020-09-18 | Paper |
| The parameterised complexity of computing the maximum modularity of a graph | 2020-08-12 | Paper |
| Stable marriage with groups of similar agents | 2020-06-18 | Paper |
| Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling | 2019-09-13 | Paper |
| Extremal properties of flood-filling games | 2019-08-01 | Paper |
| Randomised enumeration of small witnesses using a decision oracle | 2019-02-14 | Paper |
| The parameterised complexity of counting even and odd induced subgraphs | 2019-02-01 | Paper |
| The parameterised complexity of computing the maximum modularity of a graph | 2018-07-18 | Paper |
| Deleting edges to restrict the size of an epidemic: a new application for treewidth | 2018-06-01 | Paper |
| On the complexity of finding and counting solution-free sets of integers | 2018-05-24 | Paper |
| Randomised enumeration of small witnesses using a decision oracle | 2018-04-10 | Paper |
| The interactive sum choice number of graphs | 2018-01-18 | Paper |
| The parameterised complexity of list problems on graphs of bounded treewidth | 2016-11-18 | Paper |
| Some hard families of parameterized counting problems | 2016-11-10 | Paper |
| Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth | 2016-02-05 | Paper |
| The challenges of unbounded treewidth in parameterised subgraph counting problems | 2015-12-07 | Paper |
| The parameterised complexity of counting connected subgraphs and graph motifs | 2015-02-20 | Paper |
| Spanning trees and the complexity of flood-filling games | 2015-01-21 | Paper |
| The complexity of free-flood-it on \(2\times n\) boards | 2013-12-19 | Paper |
| The complexity of flood-filling games on graphs | 2012-05-30 | Paper |
| Tangled Paths: A Random Graph Model from Mallows Permutations | N/A | Paper |
| Structural Parameters for Dense Temporal Graphs | N/A | Paper |
| Reachability in temporal graphs under perturbation | N/A | Paper |
