‪Andrea Francke‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	25	7
h-index	3	2
i10-index	1	0

0

4

2

20092010201120122013201420152016201720182019202020211 3 4 2 3 1 3 1 2 4 1

Co-authors

Michael HoffmannETH ZürichVerified email at inf.ethz.ch
Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu

Andrea Francke

Andrea Francke

Verified email at google.com

Computational Geometry Approximation Algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The Euclidean degree-4 minimum spanning tree problem is NP-hard A Francke, M Hoffmann Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009	17	2009
A doubly exponentially crumbled cake T Christ, A Francke, H Gebauer, J Matoušek, T Uno Electronic Notes in Discrete Mathematics 38, 265-271, 2011	5	2011
A Census of Plane Graphs with Polyline Edges A Francke, CD Tóth SOCG'14 - Thirtieth annual symposium on Computational geometry, 242:242--242:250, 2014	3	2014
A census of plane graphs with polyline edges A Francke, CD Tóth SIAM Journal on Discrete Mathematics 31 (2), 1174-1195, 2017		2017
A Quasioptimum for Linear Programs A Francke		2009
Related Work Search Tool A Francke, D Kind		2007
In Search of the Boundaries of Intractability for Euclidean Degree-k MST Problems A Francke

The system can't perform the operation now. Try again later.

Articles 1–7