| Publication | Date of Publication | Type |
|---|
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
(available as arXiv preprint) | N/A | Paper |
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
Discrete Optimization | 2026-08-06 | Paper |
The burning game on graphs
Discrete Mathematics | 2026-02-16 | Paper |
Patrolling cop vs omniscient robber
(available as arXiv preprint) | 2026-01-01 | Paper |
On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products
(available as arXiv preprint) | 2026-01-01 | Paper |
| The simultaneous interval number: a new width parameter that measures the similarity to interval graphs | 2025-12-02 | Paper |
Sandwich Monotonicity and the Recognition of Weighted Graph Classes
(available as arXiv preprint) | 2025-01-01 | Paper |
On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Burning game
(available as arXiv preprint) | 2024-01-01 | Paper |
Fair allocation algorithms for indivisible items under structured conflict constraints
Computational and Applied Mathematics | 2023-10-02 | Paper |
Allocation of indivisible items with individual preference graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
Fair allocation of indivisible items with conflict graphs
Algorithmica | 2023-04-28 | Paper |
Allocating indivisible items with minimum dissatisfaction on preference graphs
(available as arXiv preprint) | 2023-03-31 | Paper |
| Edge elimination and weighted graph classes | 2022-12-21 | Paper |
Strong cliques in diamond-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Fair Packing of Independent Sets
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Strong cliques in diamond-free graphs
Theoretical Computer Science | 2021-02-03 | Paper |
Fair allocation of indivisible items with conflict graphs
(available as arXiv preprint) | 2020-03-25 | Paper |
New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
Theoretical Computer Science | 2019-10-18 | Paper |
Linear separation of connected dominating sets in graphs
Ars Mathematica Contemporanea | 2019-07-25 | Paper |
| Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs | 2018-08-17 | Paper |
On matching extendability of lexicographic products
RAIRO - Operations Research | 2018-02-23 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Equistarable bipartite graphs
Discrete Mathematics | 2016-04-27 | Paper |
On a class of graphs between threshold and total domishold graphs
Discrete Applied Mathematics | 2015-09-21 | Paper |
Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
Discrete Applied Mathematics | 2014-12-03 | Paper |
Linear separation of total dominating sets in graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
