A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem. - Kartik Krishnan; John E. Mitchell 001 (Comput. Optim. Appl., 2006)

A unifying framework for several cutting plane methods for semidefinite programming. - Kartik Krishnan; John E. Mitchell 001 (Optim. Methods Softw., 2006)

Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). - Erich L. Kaltofen; Bin Li; Kartik Sivaramakrishnan; Zhengfeng Yang; Lihong Zhi (SNC, 2007)

A parallel interior point decomposition algorithm for block angular semidefinite programs. - Kartik Krishnan Sivaramakrishnan (Comput. Optim. Appl., 2010)

Lodestar: Supporting Independent Learning and Rapid Experimentation Through Data-Driven Analysis Recommendations. - Deepthi Raghunandan; Zhe Cui 001; Kartik Krishnan; Segen Tirfe; Shenzhi Shi; Tejaswi Darshan Shrestha; Leilani Battle; Niklas Elmqvist (CoRR, 2022)

Lodestar: Supporting rapid prototyping of data science workflows through data-driven analysis recommendations. - Deepthi Raghunandan; Zhe Cui 001; Kartik Krishnan; Segen Tirfe; Shenzhi Shi; Tejaswi Darshan Shrestha; Leilani Battle; Niklas Elmqvist (Inf. Vis., 2024)