David H. K. Kim

According to our database1, David H. K. Kim authored at least 10 papers between 2015 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
New Hardness Results for Routing on Disjoint Paths.
SIAM J. Comput., 2022

2021
Almost Polynomial Hardness of Node-Disjoint Paths in Grids.
Theory Comput., 2021

2018
Approximation Algorithms for Scheduling with Resource and Precedence Constraints.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
Deletion Without Rebalancing in Binary Search Trees.
ACM Trans. Algorithms, 2016

Improved approximation for node-disjoint paths in planar graphs.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Portable Multicore Resource Management for Applications with Performance Constraints.
Proceedings of the 10th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip, 2016

2015
POET: a portable approach to minimizing energy under soft real-time constraints.
Proceedings of the 21st IEEE Real-Time and Embedded Technology and Applications Symposium, 2015

Racing and Pacing to Idle: Theoretical and Empirical Analysis of Energy Optimization Heuristics.
Proceedings of the 2015 IEEE 3rd International Conference on Cyber-Physical Systems, 2015

On Approximating Node-Disjoint Paths in Grids.
Proceedings of the Approximation, 2015


  Loading...