- E-mailr.sharma@uib.no
- Visitor AddressHIB - Thormøhlens gate 555006 Bergen
- Postal AddressPostboks 78035020 Bergen
Academic article
- (2023). Structural Parameterizations of b-Coloring. Leibniz International Proceedings in Informatics. 40:1-40:14.
- (2023). Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 3229-3244.
- (2021). Parameterized Complexity of Directed Spanner Problems. Algorithmica. 17 pages.
- (2020). Quick separation in chordal and split graphs. Leibniz International Proceedings in Informatics. 70:1-70:14.
- (2020). On the parameterized complexity of deletion to H-free strong components. Leibniz International Proceedings in Informatics. 75:1-75:13.
- (2020). Fault tolerant subgraphs with applications in kernelization. Leibniz International Proceedings in Informatics. 47:1-47:22.
- (2018). Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. Leibniz International Proceedings in Informatics. 1-19.
- (2018). Parameterised Algorithms for Deletion to Classes of DAGs. Theory of Computing Systems. 1880-1909.
- (2018). Kernels for deletion to classes of acyclic digraphs. Journal of computer and system sciences. 9-21.
- (2017). Improved algorithms and combinatorial bounds for independent Feedback Vertex Set. Leibniz International Proceedings in Informatics. 1-14.
- (2016). Kernels for deletion to classes of acyclic digraphs. Leibniz International Proceedings in Informatics. 6.1-6.12.
More information in national current research information system (CRIStin)