Andrea Francke

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

2009

1 Andrea Francke, Michael Hoffmann: The Euclidean degree-4 minimum spanning tree problem is NP-hard. Symposium on Computational Geometry 2009: 179-188

	2009
1		Andrea Francke, Michael Hoffmann: The Euclidean degree-4 minimum spanning tree problem is NP-hard. Symposium on Computational Geometry 2009: 179-188

Coauthor Index