Numbers

Bibliography of the person, including all types of documents, not only theses.

PhD theses (1)

1. David Gajser: Verifying time complexity of Turing machines

MSc theses (3)

1. Gregor Sušelj: Neučinkovitost ravnovesja
2. Lazar Milinković: Implementacija algoritmov za probleme najkrajših poti v presečnih grafih enotskih krogov
3. Blaž Rojc: Indeksna struktura za učinkovito vzporedno iskanje in vstavljanje točk v večdimenzionalnem prostoru

BSc theses (11)

1. Miha Vučkovič: Računanje Fréchetove razdalje med krivuljama
2. Katja Mavsar: Voronojeva igra
3. Gregor Fabjan: Kombinatorične dražbe
4. Nik Pletikos: Enostavni modeli pokra in njihova analiza s teorijo iger
5. Talmaj Marinč: Adaptive algorithm for selecting profitable keywords
6. Erik Grabljevec: Iskanje v posebnih matrikah
7. Luka Avbreht: Algoritmi za pozicioniranje v brezžičnih mrežah
8. Marcel Čampa: Algoritem potisni-povišaj za iskanje maksimalnih pretokov
9. Klementina Pirc: Računanje notranjega obsega ravninskih grafov
10. Staš Kotar Celarc: Aproksimacijski algoritmi za računanje povprečne razdalje med točkami
11. Luka Lajovic: Najkrajša pot in pot z najmanj ovinki

Other documents (14)

1. Sergio Cabello: Faster distance-based representative skyline and k-center along pareto front in the plane
2. Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer: Maximum matchings in geometric intersection graphs
3. Sergio Cabello, David Gajser: Connectivity with uncertainty regions given as line segments
4. Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek: A note on the 2-colored rectilinear crossing number of random point sets in the unit square
5. Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff: Eliminating crossings in ordered graphs
6. Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer: Geometric matching and bottleneck problems
7. Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee: Finding a largest-area triangle in a terrain in near-linear time
8. Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup: Connected matchings
9. Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec: Long plane trees
10. Sergio Cabello, Alexander Dobler, Gašper Fijavž, Thekla Hamm, Mirko H. Wagner: A dichotomy for 1-planarity with restricted crossing types parameterized by treewidth
11. Helmut Alt, Sergio Cabello, Otfried Cheong, Ji-won Park, Nadja Seiferth: Packing $d$-dimensional balls into a $d + 1$-dimensional container
12. Sergio Cabello: Testing whether a subgraph is convex or isometric
13. Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira: Algorithms for distance problems in continuous graphs
14. Sergio Cabello, Timothy M. Chan, Panos Giannopoulos: Delaunay triangulations with predictions