David H. Kim

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Almost polynomial hardness of node-disjoint paths in grids Theory of Computing	2021-10-25	Paper
Improved approximation for node-disjoint paths in grids with sources on the boundary (available as arXiv preprint)	2021-07-28	Paper
New hardness results for routing on disjoint paths SIAM Journal on Computing	2021-01-13	Paper
Approximation algorithms for scheduling with resource and precedence constraints	2020-08-05	Paper
Almost polynomial hardness of node-disjoint paths in grids Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
Deletion without rebalancing in binary search trees ACM Transactions on Algorithms	2018-11-05	Paper
Improved approximation for node-disjoint paths in planar graphs Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
On approximating node-disjoint paths in grids	2017-08-31	Paper
New hardness results for routing on disjoint paths Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing	2017-08-17	Paper
The kinematic and dynamic analysis of crowned spur gear drive Computer Methods in Applied Mechanics and Engineering	2001-06-26	Paper

Research outcomes over time

This page was built for person: David H. Kim