People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Connecting Two Trees with Optimal Routing Cost
Kao, Mong-Jen
,
Katz, Bastian
,
Krug, Marcus
,
Lee, D. T.
,
Martin Nöllenburg
,
Rutter, Ignaz
,
Wagner, Dorothea
January 2011
PDF
Cite
Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.
Cite
×