BibTeX records: David H. K. Kim

download as .bib file

@article{DBLP:journals/siamcomp/ChuzhoyKN22,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  title        = {New Hardness Results for Routing on Disjoint Paths},
  journal      = {{SIAM} J. Comput.},
  volume       = {51},
  number       = {2},
  pages        = {17--189},
  year         = {2022},
  url          = {https://doi.org/10.1137/17m1146580},
  doi          = {10.1137/17M1146580},
  timestamp    = {Mon, 27 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChuzhoyKN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChuzhoyKN21,
  author       = {Julia Chuzhoy and
                  David Hong Kyun Kim and
                  Rachit Nimavat},
  title        = {Almost Polynomial Hardness of Node-Disjoint Paths in Grids},
  journal      = {Theory Comput.},
  volume       = {17},
  pages        = {1--57},
  year         = {2021},
  url          = {https://theoryofcomputing.org/articles/v017a006/},
  timestamp    = {Tue, 07 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/ChuzhoyKN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChuzhoyKN18,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  editor       = {Ioannis Chatzigiannakis and
                  Christos Kaklamanis and
                  D{\'{a}}niel Marx and
                  Donald Sannella},
  title        = {Improved Approximation for Node-Disjoint Paths in Grids with Sources
                  on the Boundary},
  booktitle    = {45th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  series       = {LIPIcs},
  volume       = {107},
  pages        = {38:1--38:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2018.38},
  doi          = {10.4230/LIPICS.ICALP.2018.38},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/ChuzhoyKN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DemirciHK18,
  author       = {G{\"{o}}kalp Demirci and
                  Henry Hoffmann and
                  David H. K. Kim},
  editor       = {Rolf Niedermeier and
                  Brigitte Vall{\'{e}}e},
  title        = {Approximation Algorithms for Scheduling with Resource and Precedence
                  Constraints},
  booktitle    = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2018, February 28 to March 3, 2018, Caen, France},
  series       = {LIPIcs},
  volume       = {96},
  pages        = {25:1--25:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2018.25},
  doi          = {10.4230/LIPICS.STACS.2018.25},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DemirciHK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyKN18,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  editor       = {Ilias Diakonikolas and
                  David Kempe and
                  Monika Henzinger},
  title        = {Almost polynomial hardness of node-disjoint paths in grids},
  booktitle    = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages        = {1220--1233},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3188745.3188772},
  doi          = {10.1145/3188745.3188772},
  timestamp    = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChuzhoyKN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-09956,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  title        = {Improved Approximation for Node-Disjoint Paths in Grids with Sources
                  on the Boundary},
  journal      = {CoRR},
  volume       = {abs/1805.09956},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.09956},
  eprinttype    = {arXiv},
  eprint       = {1805.09956},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-09956.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyKN17,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {New hardness results for routing on disjoint paths},
  booktitle    = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages        = {86--99},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3055399.3055411},
  doi          = {10.1145/3055399.3055411},
  timestamp    = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChuzhoyKN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01980,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  title        = {Almost Polynomial Hardness of Node-Disjoint Paths in Grids},
  journal      = {CoRR},
  volume       = {abs/1711.01980},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.01980},
  eprinttype    = {arXiv},
  eprint       = {1711.01980},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-01980.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SenTK16,
  author       = {Siddhartha Sen and
                  Robert E. Tarjan and
                  David Hong Kyun Kim},
  title        = {Deletion Without Rebalancing in Binary Search Trees},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {12},
  number       = {4},
  pages        = {57:1--57:31},
  year         = {2016},
  url          = {https://doi.org/10.1145/2903142},
  doi          = {10.1145/2903142},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/SenTK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mcsoc/ImesKMH16,
  author       = {Connor Imes and
                  David H. K. Kim and
                  Martina Maggio and
                  Henry Hoffmann},
  title        = {Portable Multicore Resource Management for Applications with Performance
                  Constraints},
  booktitle    = {10th {IEEE} International Symposium on Embedded Multicore/Many-core
                  Systems-on-Chip, {MCSOC} 2016, Lyon, France, September 21-23, 2016},
  pages        = {305--312},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/MCSoC.2016.10},
  doi          = {10.1109/MCSOC.2016.10},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mcsoc/ImesKMH16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyKL16,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Shi Li},
  editor       = {Daniel Wichs and
                  Yishay Mansour},
  title        = {Improved approximation for node-disjoint paths in planar graphs},
  booktitle    = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages        = {556--569},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2897518.2897538},
  doi          = {10.1145/2897518.2897538},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChuzhoyKL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChuzhoyKL16,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Shi Li},
  title        = {Improved Approximation for Node-Disjoint Paths in Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/1603.05520},
  year         = {2016},
  url          = {http://arxiv.org/abs/1603.05520},
  eprinttype    = {arXiv},
  eprint       = {1603.05520},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChuzhoyKL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChuzhoyKN16,
  author       = {Julia Chuzhoy and
                  David H. K. Kim and
                  Rachit Nimavat},
  title        = {New Hardness Results for Routing on Disjoint Paths},
  journal      = {CoRR},
  volume       = {abs/1611.05429},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.05429},
  eprinttype    = {arXiv},
  eprint       = {1611.05429},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChuzhoyKN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChuzhoyK15,
  author       = {Julia Chuzhoy and
                  David H. K. Kim},
  editor       = {Naveen Garg and
                  Klaus Jansen and
                  Anup Rao and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Approximating Node-Disjoint Paths in Grids},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
                  NJ, {USA}},
  series       = {LIPIcs},
  volume       = {40},
  pages        = {187--211},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.187},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2015.187},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChuzhoyK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpsna/KimIH15,
  author       = {David H. K. Kim and
                  Connor Imes and
                  Henry Hoffmann},
  title        = {Racing and Pacing to Idle: Theoretical and Empirical Analysis of Energy
                  Optimization Heuristics},
  booktitle    = {2015 {IEEE} 3rd International Conference on Cyber-Physical Systems,
                  Networks, and Applications, {CPSNA} 2015, Kowloon, Hong Kong, China,
                  August 19-21, 2015},
  pages        = {78--85},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/CPSNA.2015.23},
  doi          = {10.1109/CPSNA.2015.23},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cpsna/KimIH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtas/ImesKMH15,
  author       = {Connor Imes and
                  David H. K. Kim and
                  Martina Maggio and
                  Henry Hoffmann},
  title        = {{POET:} a portable approach to minimizing energy under soft real-time
                  constraints},
  booktitle    = {21st {IEEE} Real-Time and Embedded Technology and Applications Symposium,
                  Seattle, WA, USA, April 13-16, 2015},
  pages        = {75--86},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/RTAS.2015.7108419},
  doi          = {10.1109/RTAS.2015.7108419},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/rtas/ImesKMH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics