Magdalene G. Borgelt

According to our database, Magdalene G. Borgelt authored at least 9 papers between 2004 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Geodesic Disks and Clustering in a Simple Polygon.

Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo

Int. J. Comput. Geom. Appl., 2011

2009

Planar bichromatic minimum spanning trees.

Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi

J. Discrete Algorithms, 2009

2008

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.

Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos

Int. J. Comput. Geom. Appl., 2008

2006

Covering a Set of Points with a Minimum Number of Lines.

Magdalene Grantson, Christos Levcopoulos

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Minimum Weight Triangulation by Cutting Out Triangles.

Magdalene Grantson, Christian Borgelt, Christos Levcopoulos

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Bi-chromatic minimum spanning trees.

Magdalene Grantson, Henk Meijer, David Rappaport

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Bounds on optimally triangulating connected subsets of the minimum weight convex partition.

Magdalene Grantson, Christos Levcopoulos

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Tight Time Bounds for the Minimum Local Convex Partition Problem.

Magdalene Grantson, Christos Levcopoulos

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.

Magdalene Grantson, Christos Levcopoulos

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004