Current path analysis for electrostatic discharge protection. - Hung-Yi Liu; Chung-Wei Lin; Szu-Jui Chou; Wei-Ting Tu; Chih-Hung Liu 001; Yao-Wen Chang; Sy-Yen Kuo (ICCAD, 2006)

Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree. - Chih-Hung Liu 001; Yao-Hsin Chou; Shih-Yi Yuan; Sy-Yen Kuo (ISPD, 2008)

An Efficient Graph-Based Algorithm for ESD Current Path Analysis. - Chih-Hung Liu 001; Hung-Yi Liu; Chung-Wei Lin; Szu-Jui Chou; Yao-Wen Chang; Sy-Yen Kuo; Shih-Yi Yuan; Yu-Wei Chen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008)

An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction. - Chih-Hung Liu 001; Shih-Yi Yuan; Sy-Yen Kuo; Yao-Hsin Chou (DAC, 2009)

Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection. - Chih-Hung Liu 001; Shih-Yi Yuan; Sy-Yen Kuo; Jung-Hung Weng (ICCAD, 2009)

High-performance obstacle-avoiding rectilinear steiner tree construction. - Chih-Hung Liu 001; Shih-Yi Yuan; Sy-Yen Kuo; Szu-Chi Wang (ACM Trans. Design Autom. Electr. Syst., 2009)

An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. - Chih-Hung Liu 001; Evanthia Papadopoulou; D. T. Lee (ESA, 2011)

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. - Chih-Hung Liu 001; I-Che Chen; D. T. Lee (DAC, 2012)

Higher Order City Voronoi Diagrams. - Andreas Gemsa; D. T. Lee; Chih-Hung Liu 001; Dorothea Wagner (SWAT, 2012)

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. - Chih-Hung Liu 001; Sy-Yen Kuo; D. T. Lee; Chun-Syun Lin; Jung-Hung Weng; Shih-Yi Yuan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2012)

Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. - Chih-Hung Liu 001; D. T. Lee (SODA, 2013)

Forest-Like Abstract Voronoi Diagrams in Linear Time. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (CCCG, 2014)

An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. - Chun-Xun Lin; Chih-Hung Liu 001; I-Che Chen; D. T. Lee; Tsung-Yi Ho (DAC, 2014)

Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction. - Chih-Hung Liu 001; Chun-Xun Lin; I-Che Chen; D. T. Lee; Ting-Chi Wang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014)

The k-Nearest-Neighbor Voronoi Diagram Revisited. - Chih-Hung Liu 001; Evanthia Papadopoulou; Der-Tsai Lee (Algorithmica, 2015)

On the complexity of higher order abstract Voronoi diagrams. - Cecilia Bohler; Panagiotis Cheilaris; Rolf Klein; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2015)

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. - Cecilia Bohler; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2016)

Sorting with Recurrent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ISAAC, 2017)

Abstract Voronoi Diagrams from Closed Bisecting Curves. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (Int. J. Comput. Geom. Appl., 2017)

Minimizing the Diameter of a Spanning Tree for Imprecise Points. - Chih-Hung Liu 001; Sandro Montanari (Algorithmica, 2018)

Forest-like abstract Voronoi diagrams in linear time. - Cecilia Bohler; Rolf Klein; Andrzej Lingas; Chih-Hung Liu 001 (Comput. Geom., 2018)

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon. - Chih-Hung Liu 001 (CoRR, 2018)

A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. - Stefano Leucci 001; Chih-Hung Liu 001 (CoRR, 2018)

On k Nearest Neighbor Queries in the Plane for General Distance Functions. - Chih-Hung Liu 001 (CoRR, 2018)

Resilient Dictionaries for Randomly Unreliable Memory. - Stefano Leucci 001; Chih-Hung Liu 001; Simon Meierhans (ESA, 2019)

Optimal Sorting with Persistent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ESA, 2019)

Dual-Mode Greedy Algorithms Can Save Energy. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna; Guido Proietti (ISAAC, 2019)

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (Algorithmica, 2019)

Simple Topological Drawings of k-Planar Graphs. - Michael Hoffmann 001; Chih-Hung Liu 001; Meghana M. Reddy; Csaba D. Tóth (GD, 2020)

Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions. - Chih-Hung Liu 001 (SODA, 2020)

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. - Chih-Hung Liu 001 (Algorithmica, 2020)

Optimal Dislocation with Persistent Errors in Subquadratic Time. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (Theory Comput. Syst., 2020)

Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. - Tommaso d'Orsi; Chih-Hung Liu 001; Rajai Nasser; Gleb Novikov; David Steurer; Stefan Tiegel (NeurIPS, 2021)

Proximity in the plane for general distance functions - Chih-Hung Liu 001 (2021)

Fast algorithm for overcomplete order-3 tensor decomposition. - Jingqiu Ding; Tommaso d'Orsi; Chih-Hung Liu 001; David Steurer; Stefan Tiegel (COLT, 2022)

Approximate Minimum Selection with Unreliable Comparisons. - Stefano Leucci 001; Chih-Hung Liu 001 (Algorithmica, 2022)

Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions. - Chih-Hung Liu 001 (SIAM J. Comput., 2022)

Approximate Selection with Unreliable Comparisons in Optimal Expected Time. - Shengyu Huang; Chih-Hung Liu 001; Daniel Rutschmann (STACS, 2023)

Robust Sparse Regression with Non-Isotropic Designs. - Chih-Hung Liu 001; Gleb Novikov (NeurIPS, 2024)

Private Graphon Estimation via Sum-of-Squares. - Hongjie Chen 004; Jingqiu Ding; Tommaso d'Orsi; Yiding Hua; Chih-Hung Liu 001; David Steurer (STOC, 2024)

Approximate selection with unreliable comparisons in sublinear time. - Shengyu Huang; Chih-Hung Liu 001; Daniel Rutschmann (J. Comput. Syst. Sci., 2026)