| Publication | Date of Publication | Type |
|---|
Combining crown structures for vulnerability measures
Algorithmica | 2025-11-25 | Paper |
| Dense graph partitioning on sparse and dense graphs | 2024-05-27 | Paper |
| Applying skeletons to speed up the Arc-Flags routing algorithm | 2024-05-24 | Paper |
| Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs | 2024-05-03 | Paper |
scientific article; zbMATH DE number 7829255 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Shortest distances as enumeration problem
Discrete Applied Mathematics | 2024-01-24 | Paper |
Fine-Grained Complexity of Regular Path Queries
Logical Methods in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7768372 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
scientific article; zbMATH DE number 7740881 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Extension of some edge graph problems: standard, parameterized and approximation complexity
Discrete Applied Mathematics | 2023-09-14 | Paper |
From symmetry to asymmetry: generalizing TSP approximations by parametrization
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
Discrete & Computational Geometry | 2023-05-12 | Paper |
Zeros and approximations of holant polynomials on the complex plane
Computational Complexity | 2022-09-02 | Paper |
Graph and string parameters: connections between pathwidth, cutwidth and the locality number
(available as arXiv preprint) | 2022-07-21 | Paper |
From symmetry to asymmetry: generalizing TSP approximations by parametrization
(available as arXiv preprint) | 2022-05-20 | Paper |
On the complexity of solution extension of optimization problems
Theoretical Computer Science | 2022-02-01 | Paper |
| Resolving conflicts for lower-bounded clustering | 2021-08-04 | Paper |
On the complexity of the smallest grammar problem over fixed alphabets
Theory of Computing Systems | 2021-06-24 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
(available as arXiv preprint) | 2020-05-26 | Paper |
Domination chain: characterisation, classical complexity, parameterised complexity and approximability
Discrete Applied Mathematics | 2020-05-18 | Paper |
Extension of Vertex Cover and Independent Set in some classes of graphs
(available as arXiv preprint) | 2020-02-06 | Paper |
| Extension of Vertex Cover and Independent Set in some classes of graphs | 2020-02-06 | Paper |
| Extension of some edge graph problems: standard and parameterized complexity | 2020-01-30 | Paper |
Complexity of independency and cliquy trees
Discrete Applied Mathematics | 2019-12-30 | Paper |
Clustering with lower-bounded sizes. A general graph-theoretic framework
Algorithmica | 2018-07-26 | Paper |
| scientific article; zbMATH DE number 6861937 (Why is no real title available?) | 2018-04-19 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
| On the complexity of grammar-based compression over fixed alphabets | 2017-12-19 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
On the complexity landscape of the domination chain
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Weak total resolvability in graphs
Discussiones Mathematicae Graph Theory | 2016-01-26 | Paper |
A fixed-parameter approach for privacy-protection with global recoding
Frontiers in Algorithmics | 2014-09-02 | Paper |
