David H. K. Kim

14 papers A* 4A 2Journal 5Unranked 3
YearRankTypeTitle / Venue / Authors
2022 J jnl
New Hardness Results for Routing on Disjoint Paths.
SIAM J. Comput.
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2018 A* conf
Almost polynomial hardness of node-disjoint paths in grids.
STOC
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2018 A conf
Approximation Algorithms for Scheduling with Resource and Precedence Constraints.
STACS
Gökalp Demirci, Henry Hoffmann, David H. K. Kim
2018 A* conf
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary.
ICALP
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2018 J jnl
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary.
CoRR
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2017 J jnl
Almost Polynomial Hardness of Node-Disjoint Paths in Grids.
CoRR
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2017 A* conf
New hardness results for routing on disjoint paths.
STOC
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2016 J jnl
Improved Approximation for Node-Disjoint Paths in Planar Graphs.
CoRR
Julia Chuzhoy, David H. K. Kim, Shi Li
2016 A* conf
Improved approximation for node-disjoint paths in planar graphs.
STOC
Julia Chuzhoy, David H. K. Kim, Shi Li
2016 J jnl
New Hardness Results for Routing on Disjoint Paths.
CoRR
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
2016 — conf
Portable Multicore Resource Management for Applications with Performance Constraints.
MCSoC
Connor Imes, David H. K. Kim, Martina Maggio, Henry Hoffmann
2015 — conf
On Approximating Node-Disjoint Paths in Grids.
APPROX-RANDOM
Julia Chuzhoy, David H. K. Kim
2015 A conf
POET: a portable approach to minimizing energy under soft real-time constraints.
RTAS
Connor Imes, David H. K. Kim, Martina Maggio, Henry Hoffmann
2015 — conf
Racing and Pacing to Idle: Theoretical and Empirical Analysis of Energy Optimization Heuristics.
CPSNA
David H. K. Kim, Connor Imes, Henry Hoffmann