[PDF][PDF] ETH-tight algorithms for geometric network problems

S Kisfaludi-Bak - 2019 - research.tue.nl
I always wanted to be a scientist. What could be more interesting than nding out new things
about the world? Not only that, but nding out before anyone else? After graduating with my
Master's and failing to do stimulating research for years, I had to re-evaluate where I was
going with my childhood dreams. I was still not ready to give up on them. I applied for a PhD
position in Eindhoven, in the eld of computational geometry: the area that has in its name my
two main interests. I told myself that if I am not hired, then I can just go and get a “regular …

[引用][C] ETH-tight algorithms for geometric network problems using geometric separators

M de Berg - … Conference on Computational Geometry, CCCG 2019, 2019 - research.tue.nl
ETH-tight algorithms for geometric network problems using geometric separators —
Eindhoven University of Technology research portal … Algorithms, Geometry and
Applications … Publication status
以上显示的是最相近的搜索结果。 查看全部搜索结果