| POET: a portable approach to minimizing energy under soft real-time constraints C Imes, DHK Kim, M Maggio, H Hoffmann 21st IEEE Real-Time and Embedded Technology and Applications Symposium, 75-86, 2015 | 154 | 2015 |
| Racing and pacing to idle: Theoretical and empirical analysis of energy optimization heuristics DHK Kim, C Imes, H Hoffmann 2015 IEEE 3rd international conference on cyber-physical systems, networks …, 2015 | 81 | 2015 |
| New hardness results for routing on disjoint paths J Chuzhoy, DHK Kim, R Nimavat Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 42 | 2017 |
| Improved approximation for node-disjoint paths in planar graphs J Chuzhoy, DHK Kim, S Li Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 29 | 2016 |
| On approximating node-disjoint paths in grids J Chuzhoy, DHK Kim Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 28 | 2015 |
| Almost polynomial hardness of node-disjoint paths in grids J Chuzhoy, DHK Kim, R Nimavat Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 25 | 2018 |
| Deletion without rebalancing in binary search trees S Sen, RE Tarjan, DHK Kim ACM Transactions on Algorithms (TALG) 12 (4), 1-31, 2016 | 15 | 2016 |
| Improved approximation for node-disjoint paths in grids with sources on the boundary J Chuzhoy, DHK Kim, R Nimavat arXiv preprint arXiv:1805.09956, 2018 | 12 | 2018 |
| Approximation algorithms for scheduling with resource and precedence constraints G Demirci, H Hoffmann, DHK Kim 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018 | 10 | 2018 |
| Portable multicore resource management for applications with performance constraints C Imes, DHK Kim, M Maggio, H Hoffmann 2016 IEEE 10th International Symposium on Embedded Multicore/Many-core …, 2016 | 9 | 2016 |
| Racing and pacing to idle: Minimizing energy under performance constraints DHK Kim, H Hoffmann Tech. Rep. TR-2014-10, 2014 | 4 | 2014 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015) F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | 2 | 2015 |
| Improved approximation algorithm for node-disjoint paths in grid graphs with sources on grid boundary J Chuzhoy, DHK Kim, R Nimavat Unpublished Manuscript, 2017 | 1 | 2017 |
| 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) B Salvy, M Mahajan, D Pous, GJ Woeginger, A Adamaszek, A Antoniadis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
