| Publication | Date of Publication | Type |
|---|
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
Algorithmica | 2024-10-24 | Paper |
Counting subgraphs in somewhere dense graphs
SIAM Journal on Computing | 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
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| Making life more confusing for firefighters | 2024-05-16 | Paper |
Edge exploration of temporal graphs
Algorithmica | 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
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
A new temporal interpretation of cluster editing
(available as arXiv preprint) | 2022-08-30 | Paper |
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
SIAM Journal on Computing | 2022-07-22 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2022-07-21 | Paper |
The complexity of finding optimal subgraphs to represent spatial correlation
(available as arXiv preprint) | 2022-06-29 | Paper |
Edge exploration of temporal graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Edge exploration of temporal graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
A New Temporal Interpretation of Cluster Editing
(available as arXiv preprint) | 2022-02-02 | Paper |
| scientific article; zbMATH DE number 7456192 (Why is no real title available?) | 2022-01-12 | Paper |
Improved inference for areal unit count data using graph-based optimisation
Statistics and Computing | 2021-12-09 | Paper |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
Journal of Computer and System Sciences | 2021-11-25 | Paper |
scientific article; zbMATH DE number 7378595 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Approximately counting and sampling small witnesses using a colourful decision oracle
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The interactive sum choice number of graphs
Discrete Applied Mathematics | 2021-02-01 | Paper |
Assigning times to minimise reachability in temporal graphs
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Solving hard stable matching problems involving groups of similar agents
Theoretical Computer Science | 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
Algorithmica | 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 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Extremal properties of flood-filling games
(available as arXiv preprint) | 2019-08-01 | Paper |
| Extremal properties of flood-filling games | 2019-08-01 | Paper |
Randomised enumeration of small witnesses using a decision oracle
Algorithmica | 2019-02-14 | Paper |
The parameterised complexity of counting even and odd induced subgraphs
Combinatorica | 2019-02-01 | Paper |
The parameterised complexity of counting even and odd induced subgraphs
Combinatorica | 2019-02-01 | Paper |
The parameterised complexity of computing the maximum modularity of a graph
(available as arXiv preprint) | 2018-07-18 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Algorithmica | 2018-06-01 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Algorithmica | 2018-06-01 | Paper |
On the complexity of finding and counting solution-free sets of integers
Discrete Applied Mathematics | 2018-05-24 | Paper |
Randomised enumeration of small witnesses using a decision oracle
(available as arXiv preprint) | 2018-04-10 | Paper |
The interactive sum choice number of graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
The interactive sum choice number of graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
The parameterised complexity of list problems on graphs of bounded treewidth
Information and Computation | 2016-11-18 | Paper |
Some hard families of parameterized counting problems
ACM Transactions on Computation Theory | 2016-11-10 | Paper |
Some hard families of parameterized counting problems
ACM Transactions on Computation Theory | 2016-11-10 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
The challenges of unbounded treewidth in parameterised subgraph counting problems
Discrete Applied Mathematics | 2015-12-07 | Paper |
The parameterised complexity of counting connected subgraphs and graph motifs
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Spanning trees and the complexity of flood-filling games
Theory of Computing Systems | 2015-01-21 | Paper |
Spanning trees and the complexity of flood-filling games
Theory of Computing Systems | 2015-01-21 | Paper |
The complexity of free-flood-it on \(2\times n\) boards
Theoretical Computer Science | 2013-12-19 | Paper |
The complexity of flood-filling games on graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
Tangled Paths: A Random Graph Model from Mallows Permutations
(available as arXiv preprint) | N/A | Paper |
Structural Parameters for Dense Temporal Graphs
(available as arXiv preprint) | N/A | Paper |
Reachability in temporal graphs under perturbation
(available as arXiv preprint) | N/A | Paper |
