ETH-tight algorithms for geometric network problems

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

LanguageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • Department of Mathematics and Computer Science
Supervisors/Advisors
  • de Berg, Mark, Promotor
  • Bodlaender, Hans, Promotor
Award date27 Jun 2019
Place of PublicationEindhoven
Publisher
Print ISBNs978-90-386-4803-3
StatePublished - 27 Jun 2019

Bibliographical note

Proefschrift

Cite this

Kisfaludi-Bak, S. (2019). ETH-tight algorithms for geometric network problems Eindhoven: Technische Universiteit Eindhoven
Kisfaludi-Bak, Sándor. / ETH-tight algorithms for geometric network problems. Eindhoven : Technische Universiteit Eindhoven, 2019. 196 p.
@phdthesis{ffe89dd3cf3049a38815c46a85276e2f,
title = "ETH-tight algorithms for geometric network problems",
author = "S{\'a}ndor Kisfaludi-Bak",
note = "Proefschrift",
year = "2019",
month = "6",
day = "27",
language = "English",
isbn = "978-90-386-4803-3",
series = "IPA Dissertation Series",
publisher = "Technische Universiteit Eindhoven",
school = "Department of Mathematics and Computer Science",

}

Kisfaludi-Bak, S 2019, 'ETH-tight algorithms for geometric network problems', Doctor of Philosophy, Department of Mathematics and Computer Science, Eindhoven.

ETH-tight algorithms for geometric network problems. / Kisfaludi-Bak, Sándor.

Eindhoven : Technische Universiteit Eindhoven, 2019. 196 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

TY - THES

T1 - ETH-tight algorithms for geometric network problems

AU - Kisfaludi-Bak,Sándor

N1 - Proefschrift

PY - 2019/6/27

Y1 - 2019/6/27

M3 - Phd Thesis 1 (Research TU/e / Graduation TU/e)

SN - 978-90-386-4803-3

T3 - IPA Dissertation Series

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Kisfaludi-Bak S. ETH-tight algorithms for geometric network problems. Eindhoven: Technische Universiteit Eindhoven, 2019. 196 p. (IPA Dissertation Series).