Chih-Hung Liu

Orcid: 0000-0001-9683-5982

Affiliations:
  • ETH Zürich, Switzerland
  • Academia Sinica, Taipei, Taiwan (former)
  • University of Bonn, Department of Computer Science, Germany (former)
  • National Taiwan University, Graduate Institute of Electronics Engineering, Taipei, Taiwan (PhD 2009)


According to our database1, Chih-Hung Liu authored at least 38 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Approximate Selection with Unreliable Comparisons in Optimal Expected Time.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions.
SIAM J. Comput., 2022

Approximate Minimum Selection with Unreliable Comparisons.
Algorithmica, 2022

Fast algorithm for overcomplete order-3 tensor decomposition.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Proximity in the plane for general distance functions
, 2021

Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Optimal Dislocation with Persistent Errors in Subquadratic Time.
Theory Comput. Syst., 2020

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon.
Algorithmica, 2020

Nearly Optimal Planar <i>k</i> Nearest Neighbors Queries under General Distance Functions.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Simple Topological Drawings of k-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams.
Algorithmica, 2019

Dual-Mode Greedy Algorithms Can Save Energy.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Optimal Sorting with Persistent Comparison Errors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Resilient Dictionaries for Randomly Unreliable Memory.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
On k Nearest Neighbor Queries in the Plane for General Distance Functions.
CoRR, 2018

A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons.
CoRR, 2018

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon.
CoRR, 2018

Forest-like abstract Voronoi diagrams in linear time.
Comput. Geom., 2018

Minimizing the Diameter of a Spanning Tree for Imprecise Points.
Algorithmica, 2018

2017
Abstract Voronoi Diagrams from Closed Bisecting Curves.
Int. J. Comput. Geom. Appl., 2017

Sorting with Recurrent Comparison Errors.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams.
Comput. Geom., 2016

2015
On the complexity of higher order abstract Voronoi diagrams.
Comput. Geom., 2015

The k-Nearest-Neighbor Voronoi Diagram Revisited.
Algorithmica, 2015

2014
Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014

An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips.
Proceedings of the 51st Annual Design Automation Conference 2014, 2014

Forest-Like Abstract Voronoi Diagrams in Linear Time.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2012

Higher Order City Voronoi Diagrams.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction.
Proceedings of the 49th Annual Design Automation Conference 2012, 2012

2011
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram.
Proceedings of the Algorithms - ESA 2011, 2011

2009
High-performance obstacle-avoiding rectilinear steiner tree construction.
ACM Trans. Design Autom. Electr. Syst., 2009

Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection.
Proceedings of the 2009 International Conference on Computer-Aided Design, 2009

An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction.
Proceedings of the 46th Design Automation Conference, 2009

2008
An Efficient Graph-Based Algorithm for ESD Current Path Analysis.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree.
Proceedings of the 2008 International Symposium on Physical Design, 2008

2006
Current path analysis for electrostatic discharge protection.
Proceedings of the 2006 International Conference on Computer-Aided Design, 2006


  Loading...