Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. - Therese Biedl; Karthik Murali 001 (CoRR, 2021)

On Computing the Vertex Connectivity of 1-Plane Graphs. - Therese Biedl; Karthik Murali 001 (ICALP, 2023)

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. - Therese Biedl; Prosenjit Bose; Karthik Murali 001 (ESA, 2024)

Cops and Robbers for Graphs on Surfaces with Crossings. - Prosenjit Bose; Pat Morin; Karthik Murali 001 (MFCS, 2025)

On 1-planar graphs with bounded cop-number. - Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Karthik Murali 001 (Theor. Comput. Sci., 2025)

Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths. - Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis; Karthik Murali 001 (J. Graph Theory, 2025)