On Approximating Node-Disjoint Paths in Grids. - Julia Chuzhoy; David H. K. Kim (APPROX-RANDOM, 2015)

Racing and Pacing to Idle: Theoretical and Empirical Analysis of Energy Optimization Heuristics. - David H. K. Kim; Connor Imes; Henry Hoffmann (CPSNA, 2015)

POET: a portable approach to minimizing energy under soft real-time constraints. - Connor Imes; David H. K. Kim; Martina Maggio; Henry Hoffmann (RTAS, 2015)

Portable Multicore Resource Management for Applications with Performance Constraints. - Connor Imes; David H. K. Kim; Martina Maggio; Henry Hoffmann (MCSoC, 2016)

Improved approximation for node-disjoint paths in planar graphs. - Julia Chuzhoy; David H. K. Kim; Shi Li 001 (STOC, 2016)

Deletion Without Rebalancing in Binary Search Trees. - Siddhartha Sen 001; Robert E. Tarjan; David Hong Kyun Kim (ACM Trans. Algorithms, 2016)

Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. - Julia Chuzhoy; David H. K. Kim; Rachit Nimavat (ICALP, 2018)

Approximation Algorithms for Scheduling with Resource and Precedence Constraints. - Gökalp Demirci; Henry Hoffmann; David H. K. Kim (STACS, 2018)

Almost Polynomial Hardness of Node-Disjoint Paths in Grids. - Julia Chuzhoy; David Hong Kyun Kim; Rachit Nimavat (Adv. Math. Commun., 2021)

New Hardness Results for Routing on Disjoint Paths. - Julia Chuzhoy; David H. K. Kim; Rachit Nimavat (SIAM J. Comput., 2022)