1. Parameterized Complexity of List Coloring and Max Coloring;Computer Science – Theory and Applications;2022
2. On Algorithms to Find p-ordering;Algorithms and Discrete Applied Mathematics;2021
3. The Parameterized Complexity of the
k
-Biclique Problem;Journal of the ACM;2018-09-18
4. Deterministic Truncation of Linear Matroids;ACM Transactions on Algorithms;2018-06-04
5. Irreducibility and Deterministic r-th Root Finding over Finite Fields;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23