Ivo Vigan
M.Sc. Theoretical Computer Science, ETH Zürich
Contact: ivigan "at" gc.cuny.edu
Office: A201
Office Hours: Thursday 3.30pm - 4.30pm
I am a Ph.D. candidate in the Computer Science Department at The Graduate Center
of The City University of New York (CUNY) under the supervision of Professor Dr. Peter Braß.
Research
My general research interest is Discrete and Computational Geometry.
Publications
- On Separating Families of Bipartition
Discrete Mathematics 313(3) 286-292, 2013
joint work with Takahisa Toda.
- Range-Aggregate Queries for Geometric Extent Problems
Proceedings of the 19th Computing: The Australasian Theory Symposium (CATS), 2013
joint work with Peter Braß, Christian Knauer, Chan-Su Shin and Michiel Smid.
- On Separating Convex Points with Lines
Proceedings of the Forty-Third Southeastern International Conference on Combinatorics, Graph Theory and Computing.
Congr. Numer. 214 143-153, 2012
joint work with Takahisa Toda.
Preprints / Under Submission
- Packing Three-Space with Thin Tori, 2013
under submission
- Point Set Isolation Using Unit Disks is NP-complete, 2013
joint work with Rainer Penninger.
- Shortest Path Planning for a Tethered Robot, 2012
under submission
joint work with Peter Braß and Ning Xu
- Understanding Belief Propagation Dialects and their Application to Optimization Problems, 2009
Master Thesis, supervised by Angelika Steger.
Current Teaching (SS 2013)
CS212 Object Oriented Java (Labs)
Talks
- Packing and Covering Polygons with Geodesic Disks, Poly-theory seminar, NYU:poly, 2013
- Point Isolation Using Unit Disks is NP-complete, 22nd Annual Fall Workshop on Computational Geometry, 2012
- Sublinear Algorithms and Property Testing, CUNY algorithms seminar
- On Separating Points with Lines, 43rd Southeastern International Conference on Combinatorics, Graph Theory and Computing
- VC-Dimension and Epsilon Nets, CUNY algorithms seminar
- Determining the Area of a Convex Hull Using Window Queries, 2011 School of Information Theory