| Publication | Date of Publication | Type |
|---|
| The tape reconfiguration problem and its consequences for dominating set reconfiguration | 2026-08-31 | Paper |
| Polynomial delay algorithm for minimal chordal completions | 2024-06-24 | Paper |
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Discrete Applied Mathematics | 2024-01-09 | Paper |
A general framework for enumerating equivalence classes of solutions
Algorithmica | 2023-10-06 | Paper |
| A general framework for enumerating equivalence classes of solutions | 2023-09-20 | Paper |
| Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations | 2023-07-24 | Paper |
The Perfect Matching Reconfiguration Problem
(available as arXiv preprint) | 2022-07-21 | Paper |
Efficient enumeration of solutions produced by closure operations
(available as arXiv preprint) | 2019-08-01 | Paper |
| Efficient enumeration of solutions produced by closure operations | 2019-08-01 | Paper |
Reconfiguration of graphs with connectivity constraints
(available as arXiv preprint) | 2019-01-15 | Paper |
Reconfiguration of graphs with connectivity constraints
(available as arXiv preprint) | 2018-09-14 | Paper |
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
SIAM Journal on Discrete Mathematics | 2018-04-20 | Paper |
scientific article; zbMATH DE number 6829393 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-24 | Paper |
Token jumping in minor-closed classes
(available as arXiv preprint) | 2017-11-22 | Paper |
Algorithms for k-meet-semidistributive lattices
Theoretical Computer Science | 2017-02-06 | Paper |
A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On maximal chain subgraphs and covers of bipartite graphs
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Polynomial delay algorithm for listing minimal edge dominating sets in graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Incremental complexity of a bi-objective hypergraph transversal problem
Fundamentals of Computation Theory | 2015-09-29 | Paper |
An average study of hypergraphs and their minimal transversals
Theoretical Computer Science | 2015-07-24 | Paper |
On the enumeration of minimal dominating sets and related notions
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
On the enumeration and counting of minimal dominating sets in interval and permutation graphs
Algorithms and Computation | 2014-01-14 | Paper |
On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
Algorithms and Computation | 2013-03-21 | Paper |
Enumeration of minimal dominating sets and variants
Fundamentals of Computation Theory | 2011-08-19 | Paper |
