1. Maximum 0-1 timed matching on temporal graphs;Discrete Applied Mathematics;2022-10
2. Parameterized Complexity of Conflict-Free Matchings and Paths;Algorithmica;2020-02-10
3. 0-1 Timed Matching in Bipartite Temporal Graphs;Algorithms and Discrete Applied Mathematics;2020
4. Formulating graph covering problems for adiabatic quantum computers;Proceedings of the Australasian Computer Science Week Multiconference;2017-01-31
5. Uniform Workload Distribution Problems;Communications - Scientific letters of the University of Zilina;2016-03-31