| Publication | Date of Publication | Type |
|---|
Polynomial-delay generation of functional digraphs up to isomorphism
Discrete Applied Mathematics | 2024-09-26 | Paper |
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Sparse graphs without long induced paths
Journal of Combinatorial Theory. Series B | 2024-03-14 | Paper |
On the hardness of inclusion-wise minimal separators enumeration
Information Processing Letters | 2024-03-13 | Paper |
scientific article; zbMATH DE number 7803599 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | Paper |
| Local certification of geometric graph classes | 2023-11-28 | Paper |
| Enumerating minimal solution sets for metric graph problems | 2023-09-29 | Paper |
scientific article; zbMATH DE number 7650296 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
On Vizing's edge colouring question
Journal of Combinatorial Theory. Series B | 2023-01-04 | Paper |
| On digraphs without onion star immersions | 2022-11-28 | Paper |
On objects dual to tree-cut decompositions
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
| Enumerating Minimal Dominating Sets in Triangle-Free Graphs | 2022-07-18 | Paper |
Translating between the representations of a ranked convex geometry
Discrete Mathematics | 2021-06-14 | Paper |
On the dualization in distributive lattices and related problems
Discrete Applied Mathematics | 2021-06-07 | Paper |
Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Avoidable paths in graphs
The Electronic Journal of Combinatorics | 2020-12-13 | Paper |
| Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets | 2020-04-15 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Dualization in lattices given by implicational bases
Theoretical Computer Science | 2020-03-12 | Paper |
Dualization in lattices given by implicational bases
Lecture Notes in Computer Science | 2020-02-11 | Paper |
On the dualization in distributive lattices and related problems
(available as arXiv preprint) | 2019-02-19 | Paper |
Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs
(available as arXiv preprint) | 2018-05-07 | Paper |
| Infinite time busy beavers | 2017-08-04 | Paper |
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
(available as arXiv preprint) | N/A | Paper |
Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
(available as arXiv preprint) | N/A | Paper |
On the enumeration of signatures of XOR-CNF's
(available as arXiv preprint) | N/A | Paper |
