Benny K. Nielsen

According to our database, Benny K. Nielsen authored at least 7 papers between 2002 and 2009.

Collaborative distances:

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

2009

A novel approach to phylogenetic trees: <i>d</i>-Dimensional geometric Steiner trees.

Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen

Networks, 2009

Translational packing of arbitrary polytopes.

Jens Egeblad, Benny K. Nielsen, Marcus Brazil

Comput. Geom., 2009

2007

Fast neighborhood search for two- and three-dimensional nesting problems.

Jens Egeblad, Benny K. Nielsen, Allan Odgaard

Eur. J. Oper. Res., 2007

An efficient solution method for relaxed variants of the nesting problem.

Benny K. Nielsen

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2004

Rotationally optimal spanning and Steiner trees in uniform orientation metrics.

Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Comput. Geom., 2004

2002

On the location of Steiner points in uniformly-oriented Steiner trees.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Inf. Process. Lett., 2002

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Proceedings of the Algorithms, 2002