Publications

(2019). On the complexity of restoring corrupted colorings. Journal of Combinatorial Optimization, 37(4), pp. 1150-1169.

PDF DOI

(2019). Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1.

(2018). On the complexity of rainbow coloring problems. Discrete Applied Mathematics 219, 2017, pp. 132-146.

PDF DOI

(2018). NP-completeness results for partitioning a graph into total dominating sets. Theoretical Computer Science, in press.

PDF DOI

(2018). Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, United Kingdom, August 27-31, pp. 83:1-83:13, 2018.

PDF DOI

(2018). On the Fine-Grained Complexity of Rainbow Coloring. SIAM Journal on Discrete Mathematics, 32(3), pp. 1672-1705.

PDF DOI

(2018). Engineering Motif Search for Large Motifs. In Proceedings of the 17th International Symposium on Experimental Algorithms, SEA 2018, L’Aquila, Italy, June 27-29, pp. 28:1-28:19, 2018.

PDF DOI

(2018). Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs. Discrete Mathematics & Theoretical Computer Science 20(1), 2018.

PDF DOI

(2017). Algorithms and hardness results for happy coloring problems. arXiv:1705.08282.

PDF

(2017). Complexity of rainbow vertex connectivity problems for restricted graph classes. Discrete Applied Mathematics 219, 2017, pp. 132-146.

PDF DOI

(2017). NP-completeness Results for Partitioning a Graph into Total Dominating Sets. In Proceedings of the 23rd Annual International Computing and Combinatorics Conference, COCOON 2017, Hong Kong, China, August 3-5, pp. 333-345, 2017.

PDF DOI

(2016). Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds. Doctoral thesis, Tampere University of Technology, 1428, pp. 1459-2045.

PDF Erratum

(2016). The square of the 9-hypercube is 14-colorable. arXiv:1605.07613.

PDF

(2016). On finding rainbow and colorful paths. Theoretical Computer Science 628, 2016, pp. 110-114.

PDF DOI

(2016). Further hardness results on rainbow and strong rainbow connectivity. Discrete Applied Mathematics 201, 2016, pp. 191-200.

PDF DOI

(2016). On the Fine-Grained Complexity of Rainbow Coloring. In Proceedings of the 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, August 22-24, pp. 58:1-58:16, 2016.

PDF DOI

(2015). On the complexity of rainbow coloring problems. In Proceedings of the 26th International Workshop on Combinatorial Algorithms, IWOCA 2015, Verona, Italy, October 5-7, pp. 209-220, 2015.

PDF DOI

(2015). Engineering Motif Search for Large Graphs. In Proceedings of the 17th Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, California, USA, January 5, pp. 104-118, 2015.

PDF DOI

(2014). Rainbow Coloring and Connectivity Problems on Families of Perfect Graphs. Master’s thesis, Tampere University of Technology.

Award