E-LIB Suche - Ergebnisse für: Liu, Chih-Hung

1

Private Graphon Estimation via Sum-of-Squares:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Chen, Hongjie ; Ding, Jingqiu ; D'Orsi, Tommaso... - p. 172-182 , 2024

Link: https://dl.acm.org/doi/1..

2

Nearly Optimal Planar $k$ Nearest Neighbors Queries under G..:

Liu, Chih-Hung
SIAM Journal on Computing. 51 (2022) 3 - p. 723-765 , 2022

Link: https://doi.org/10.1137/..

3

Approximate Minimum Selection with Unreliable Comparisons:

Leucci, Stefano ; Liu, Chih-Hung
Algorithmica. 84 (2021) 1 - p. 60-84 , 2021

Link: https://doi.org/10.1007/..

4

Nearly optimal planar k nearest neighbors queries under gen..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Liu, Chih-Hung - p. 2842-2859 , 2020

Link: https://dl.acm.org/doi/1..

5

Simple Topological Drawings of k-Planar Graphs:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,

Hoffmann, Michael ; Liu, Chih-Hung ; Reddy, Meghana M.. - p. 390-402 , 2020

Link: https://doi.org/10.1007/..

6

Optimal Dislocation with Persistent Errors in Subquadratic ..:

Geissmann, Barbara ; Leucci, Stefano ; Liu, Chih-Hung.
Theory of Computing Systems. 64 (2019) 3 - p. 508-521 , 2019

Link: https://doi.org/10.1007/..

7

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram..:

Liu, Chih-Hung
Algorithmica. 82 (2019) 4 - p. 915-937 , 2019

Link: https://doi.org/10.1007/..

8

An Efficient Randomized Algorithm for Higher-Order Abstract..:

Bohler, Cecilia ; Klein, Rolf ; Liu, Chih-Hung
Algorithmica. 81 (2018) 6 - p. 2317-2345 , 2018

Link: https://doi.org/10.1007/..

9

Forest-like abstract Voronoi diagrams in linear time:

Bohler, Cecilia ; Klein, Rolf ; Lingas, Andrzej.
Computational Geometry. 68 (2018) - p. 134-145 , 2018

Link: https://doi.org/10.1016/..

10

Minimizing the Diameter of a Spanning Tree for Imprecise Po..:

Liu, Chih-Hung ; Montanari, Sandro
Algorithmica. 80 (2017) 2 - p. 801-826 , 2017

Link: https://doi.org/10.1007/..

11

A randomized divide and conquer algorithm for higher-order ..:

Bohler, Cecilia ; Liu, Chih-Hung ; Papadopoulou, Evanthia.
Computational Geometry. 59 (2016) - p. 26-38 , 2016

Link: https://doi.org/10.1016/..

12

On the complexity of higher order abstract Voronoi diagrams:

Bohler, Cecilia ; Cheilaris, Panagiotis ; Klein, Rolf...
Computational Geometry. 48 (2015) 8 - p. 539-551 , 2015

Link: https://doi.org/10.1016/..

13

An Efficient Bi-criteria Flow Channel Routing Algorithm For..:

, In: Proceedings of the 51st Annual Design Automation Conference,

Lin, Chun-Xun ; Liu, Chih-Hung ; Chen, I-Che.. - p. 1-6 , 2014

Link: https://dl.acm.org/doi/1..

14

The k-Nearest-Neighbor Voronoi Diagram Revisited:

Liu, Chih-Hung ; Papadopoulou, Evanthia ; Lee, Der-Tsai
Algorithmica. 71 (2013) 2 - p. 429-449 , 2013

Link: https://doi.org/10.1007/..

15

Higher-order geodesic Voronoi diagrams in a polygonal domai..:

, In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms,

Liu, Chih-Hung ; Lee, D. T. - p. 1633-1645 , 2013

Link: https://dl.acm.org/doi/1..