| Publication | Date of Publication | Type |
|---|
Improved bounds on the domatic numbers of queens graphs
DML. Discrete Mathematics Letters | 2025-12-30 | Paper |
Upper bounding rainbow connection number by forest number
Discrete Mathematics | 2022-05-17 | Paper |
| Exact defective colorings of graphs | 2021-09-11 | Paper |
| Rainbow vertex coloring bipartite graphs and chordal graphs | 2021-08-04 | Paper |
Complexity of fall coloring for restricted graph classes
Theory of Computing Systems | 2021-06-11 | Paper |
Exact defective colorings of graphs
(available as arXiv preprint) | 2021-01-01 | Paper |
| Engineering motif search for large motifs | 2020-12-16 | Paper |
Perfect Italian domination on planar and regular graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
Parameterized complexity of happy coloring problems
Theoretical Computer Science | 2020-08-17 | Paper |
NP-completeness results for partitioning a graph into total dominating sets
Theoretical Computer Science | 2020-04-07 | Paper |
Complexity of fall coloring for restricted graph classes
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Upper Bounding Rainbow Connection Number by Forest Number
(available as arXiv preprint) | 2020-01-01 | Paper |
Engineering Motif Search for Large Graphs
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
On the complexity of restoring corrupted colorings
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Computing minimum rainbow and strong rainbow colorings of block graphs
(available as arXiv preprint) | 2018-12-10 | Paper |
| Computing minimum rainbow and strong rainbow colorings of block graphs | 2018-12-10 | Paper |
On the fine-grained complexity of rainbow coloring
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
On the complexity of rainbow coloring problems
Discrete Applied Mathematics | 2018-06-27 | Paper |
On the fine-grained complexity of rainbow coloring
(available as arXiv preprint) | 2018-03-02 | Paper |
NP-completeness results for partitioning a graph into total dominating sets
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Complexity of rainbow vertex connectivity problems for restricted graph classes
Discrete Applied Mathematics | 2017-01-23 | Paper |
| The square of the 9-hypercube is 14-colorable | 2016-05-24 | Paper |
On finding rainbow and colorful paths
Theoretical Computer Science | 2016-04-13 | Paper |
On the complexity of rainbow coloring problems
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Further hardness results on rainbow and strong rainbow connectivity
Discrete Applied Mathematics | 2016-02-04 | Paper |
The square of the 9-hypercube is 14-colorable
(available as arXiv preprint) | 2016-01-01 | Paper |
