Man-Kwun Chiu

Orcid: 0000-0001-7435-1020

According to our database1, Man-Kwun Chiu authored at least 21 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Drawings of Complete Multipartite Graphs up to Triangle Flips.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
A Generalization of Self-Improving Algorithms.
ACM Trans. Algorithms, 2022

Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays.
Discret. Comput. Geom., 2022

Coloring circle arrangements: New 4-chromatic planar graphs.
CoRR, 2022

2021
Rectilinear link diameter and radius in a rectilinear polygonal domain.
Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.
Comput. Geom., 2021

2020
On the Average Complexity of the k-Level.
J. Comput. Geom., 2020

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard.
CoRR, 2020

Balanced line separators of unit disk graphs.
Comput. Geom., 2020

Routing in polygonal domains.
Comput. Geom., 2020

Routing in Histograms.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Computational Complexity of the α-Ham-Sandwich Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

New Results in Sona Drawing: Hardness and TSP Separation.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Implicit Manifold Reconstruction.
Discret. Comput. Geom., 2019

A note on self-improving sorting with hidden partitions.
CoRR, 2019

2018
High Dimensional Consistent Digital Segments.
SIAM J. Discret. Math., 2018

2017
Hanabi is NP-hard, even for cheaters who look at their cards.
Theor. Comput. Sci., 2017

Navigating Weighted Regions with Scattered Skinny Tetrahedra.
Int. J. Comput. Geom. Appl., 2017

2016
Tangent Estimation from Point Samples.
Discret. Comput. Geom., 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2009
Dimension detection via slivers.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009


  Loading...