Sergio Cabello

1. CABELLO, Sergio, PADRÓ, Carles, SÁEZ, Germán. Secret sharing schemes with detection of cheaters for a general access structure. V: CIOBANU, Gabriel (ur.), PAUN, Gheorghe (ur.). Fundamentals of computation theory : 12th International Symposium, FCT '99, Iaşi, Romania, August 30 - September 3, 1999 : proceedings. 12th International Symposium on Fundamentals of Computation Theory, Iaşi, Romania, August 30 - September 3, 1999. Berlin [etc.]: Springer, 1999. Str. 185-193. Lecture notes in computer science, 1684. ISBN 3-540-66412-2. ISSN 0302-9743. [COBISS.SI-ID 13352537]

2. CABELLO, Sergio, BERG, Mark de, DIJK, Steven van, KREVELD, Marc van, STRIJK, Tycho. Schematization of road networks. V: Proceedings of the Seventeenth Annual Symposium on Computational Geometry (SCG '01) : June 3-5, 2001, Medford, Massachusetts, USA. New York: ACM Press, 2001. Str. 33-39. ISBN 1-58113-357-X. http://portal.acm.org/toc.cfm?id=378583&idx=SERIES361&type=proceeding&coll=portal&dl=ACM&part=series&WantType=Proceedings&title=Annual%20Symposium%20on%20Computational%20Geometry. [COBISS.SI-ID 13360217]

3. CABELLO, Sergio, KREVELD, Marc van. Schematic networks : an algorithm and its implementation. V: Advances in spatial data handling : 10th International Symposium on Spatial Data Handling. Berlin; New York: Springer, 2002. Str. 475-486. ISBN 3-540-43802-5. [COBISS.SI-ID 13359705]

4. CABELLO, Sergio, PADRÓ, Carles, SÁEZ, Germán. Secret sharing schemes with detection of cheaters for a general access structure. Designs, codes and cryptography. 2002, vol. 25, no. 2, str. 175-188. ISSN 0925-1022. http://dx.doi.org/10.1023/A:1013856431727. [COBISS.SI-ID 13352281]

5. CABELLO, Sergio, LIU, Yuanxin, MANTLER, Andrea, SNOEYINK, Jack. Testing homotopy for paths in the plane. V: Proceedings of the Eighteenth Annual Symposium on Computational Geometry (SCG '02) : June 5-7, 2002, Barcelona, Spain. New York: ACM Press, 2002. Str. 160-169. ISBN 1-58113-504-1. http://portal.acm.org/toc.cfm?id=513400&idx=SERIES361&type=proceeding&coll=portal&dl=ACM&part=series&WantType=Proceedings&title=SCG. [COBISS.SI-ID 13356121]

6. CABELLO, Sergio, KREVELD, Marc van. Approximation algorithms for aligning points. Algorithmica. 2003, vol. 37, no. 3, str. 211-232. ISSN 0178-4617. http://www.springerlink.com/app/home/issue.asp?wasp=9agwvwurxq3b85k3jmfk&referrer=parent&backto=journal,19,105;linkingpublicationresults,1:100117,1. [COBISS.SI-ID 13352793]

7. CABELLO, Sergio, KREVELD, Marc van. Approximation algorithms for aligning points. V: Proceedings of the Nineteenth Annual Symposium on Computational Geometry (SCG '03) : June 8-10, 2003, San Diego, California, USA. New York: ACM Press, 2003. Str. 20-28. ISBN 1-58113-663-3. http://portal.acm.org/toc.cfm?id=777792&idx=SERIES361&type=proceeding&coll=portal&dl=ACM&part=series&WantType=Proceedings&title=SCG. [COBISS.SI-ID 13353305]

8. BOSE, Prosenjit, CABELLO, Sergio, CHEONG, Otfried, GUDMUNDSSON, Joachim, KREVELD, Marc van, SPECKMANN, Bettina. Area-preserving approximations of polygonal paths. Preprint series. 2004, vol. 42, št. 942, str. 1-10. ISSN 1318-4865. [COBISS.SI-ID 13251673]

9. CABELLO, Sergio, DEVOS, Matt, MOHAR, Bojan. Expected case for projecting points. V: HERIČKO, Marjan (ur.), et al. Zbornik D 7. mednarodne multikonference Informacijska družba IS 2004, 9. do 15. oktober 2004 = Proceedings D of the 7th International Multiconference Information Society IS 2004, 9-15th October 2004, Ljubljana, Slovenia. Ljubljana: Institut "Jožef Stefan", 2004. Str. 152-155. Informacijska družba. ISBN 961-6303-65-1. ISSN 1581-9973. [COBISS.SI-ID 13221721]

10. BERG, Mark de, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, OOSTRUM, René van, WELTKAMP, Remco C. Maximizing the area of overlap of two unions of disks under rigid motion. V: 20th European Workshop on Computational Geometry : March 24-26, 2004 Seville, Spain : preliminary program. Sevilla: Universidad de Sevilla, 2004. Str. 73-76. http://eurocg.org/www.us.es/ewcg04/program.htm. [COBISS.SI-ID 13554777]

11. BERG, Mark de, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, OOSTRUM, René van, WELTKAMP, Remco C. Maximizing the area of overlap of two unions of disks under rigid motion. V: Algorithm theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004 : proceedings. Berlin; New York: Springer, 2004. Str. 138-149. Lecture notes in computer science, 3111. ISBN 3-540-22339-8. ISSN 0302-9743. http://www.springerlink.com/app/home/issue.asp?wasp=bn42d3whqj1utm5pulft&referrer=parent&backto=journal,282,1931;linkingpublicationresults,1:105633,1. [COBISS.SI-ID 13358425]

12. CABELLO, Sergio. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. V: 20th European Workshop on Computational Geometry : March 24-26, 2004 Seville, Spain : preliminary program. Sevilla: Universidad de Sevilla, 2004. Str. 53-56. http://eurocg.org/www.us.es/ewcg04/program.htm. [COBISS.SI-ID 13555033]

13. CABELLO, Sergio, DEMAINE, Erik D., ROTE, Günter. Planar embeddings of graphs with specified edge lengths. V: Graph drawing : 11th international symposium, GD 2003, Perugia, Italy, September 21-24, 2003 : revised papers. Berlin; New York: Springer, 2004. Str. 283-294. Lecture notes in computer science, 2912. ISBN 3-540-20831-3. ISSN 0302-9743. http://www.springerlink.com/app/home/contribution.asp?wasp=p3d6f5hcwr1wqgdf5brl&referrer=parent&backto=issue,26,55;journal,475,1931;linkingpublicationresults,1:105633,1. [COBISS.SI-ID 13358937]

14. CABELLO, Sergio, LIU, Yuanxin, MANTLER, Andrea, SNOEYINK, Jack. Testing homotopy for paths in the plane. Discrete & computational geometry. 2004, vol. 31, no. 1, str. 61-81. ISSN 0179-5376. http://www.springerlink.com/app/home/issue.asp?wasp=h07c75whyh7wukbgnt2l&referrer=parent&backto=journal,12,75;linkingpublicationresults,1:100356,1. [COBISS.SI-ID 13353561]

15. CABELLO, Sergio. Approximation algorithms for spreading points. V: Approximation and Online Algorithms : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : selected revised papers. Berlin; New York: Springer, 2005. Str. 83-96. Lecture notes in computer science, 3351. ISBN 3-540-24574-X. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-540-31833-0_9. [COBISS.SI-ID 13367129]

16. CABELLO, Sergio, BERG, Mark de, GOAOC, Xavier, SCHRODERS, Mark. Cache-oblivious linear programming. V: Workshop on Massive Geometric Data Sets (Massive2005). Münster: Universiät Münster, 2005. Str. 21. Angewandte Mathematik und Informatik, 02/05 - I. http://cs.uni-muenster.de/u/jan/IOWorkshop/TR_02_05-I.pdf. [COBISS.SI-ID 13769561]

17. CABELLO, Sergio, SELLARÈS, J. Antoni. Computing a center-transversal line. V: XI Encuentros de Geometría Computacional : Santander, del 27 al 29 de junio de 2005. Santander: Servicio de Publicaciones de la Universidad de Cantabria, 2005. Str. 133-140. ISBN 84-8102-963-7. [COBISS.SI-ID 13614425]

18. CABELLO, Sergio, DEVOS, Matt, MOHAR, Bojan. Expected case for projecting points. Preprint series. 2005, vol. 43, št. 966, str. 1-11. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/00966.pdf. [COBISS.SI-ID 13403481]

19. CABELLO, Sergio, MOHAR, Bojan. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. V: Algorithms - Esa 2005 : 13th annual European symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings. Berlin; New York: Springer, 2005. Str. 131-142. Lecture notes in computer science, 3669. ISBN 3-540-29118-0. ISSN 0302-9743. http://dx.doi.org/10.1007/11561071_14. [COBISS.SI-ID 13768025]

20. CABELLO, Sergio, MOHAR, Bojan. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Preprint series. 2005, vol. 43, št. 993, str. 1-20. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/00993.pdf. [COBISS.SI-ID 13805657]

21. CABELLO, Sergio, MOHAR, Bojan, ŽITNIK, Arjana. Homotopic spanners. V: 21st European Workshop on Computational Geometry and Spring School : March 9-11, 2005, Eindhoven : program. Eindhoven: Technische Universiteit, 2005. Str. 25-28. http://eurocg.org/www.win.tue.nl/EWCG2005/Proceedings/7.pdf. [COBISS.SI-ID 13552729]

22. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. V: Algorithms - Esa 2005 : 13th annual European symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings. Berlin; New York: Springer, 2005. Str. 520-531. Lecture notes in computer science, 3669. ISBN 3-540-29118-0. ISSN 0302-9743. http://dx.doi.org/10.1007/11561071_47. [COBISS.SI-ID 13768537]

23. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. V: 21st European Workshop on Computational Geometry and Spring School : March 9-11, 2005, Eindhoven : program. Eindhoven: Technische Universiteit, 2005. Str. 57-60. http://eurocg.org/www.win.tue.nl/EWCG2005/Proceedings/15.pdf. [COBISS.SI-ID 13553497]

24. CABELLO, Sergio, DEMAINE, Erik D., ROTE, Günter. Planar embeddings of graphs with specified edge lengths. Preprint series. 2005, vol. 43, št. 986, str. 1-16. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/00986.pdf. [COBISS.SI-ID 13780057]

25. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, LANGERMAN, Stefan, SEARA, Carlos, VENTURA, Inma. Reverse facility location problems. V: 17th Canadian Conference on Computational Geometry : August 10-12, 2005, University of Windsor. Windsor: University of Windsor, 2005. 4 str. http://www.cccg.ca/proceedings/2005/24.pdf. [COBISS.SI-ID 13769049]

26. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, LANGERMAN, Stefan, SEARA, Carlos, VENTURA, Inma. Reverse facility location problems. V: XI Encuentros de Geometría Computacional : Santander, del 27 al 29 de junio de 2005. Santander: Servicio de Publicaciones de la Universidad de Cantabria, 2005. Str. 263-270. ISBN 84-8102-963-7. [COBISS.SI-ID 13614937]

27. CABELLO, Sergio, BERG, Mark de, KREVELD, Marc van. Schematization of networks. Computational geometry. [Print ed.]. 2005, vol. 30, iss. 3, str. 223-238. ISSN 0925-7721. http://www.sciencedirect.com/science/journal/09257721. [COBISS.SI-ID 13551449]

28. CABELLO, Sergio, HAVERKORT, Herman Johannes, KREVELD, Marc van, SPECKMANN, Bettina. Algorithmic aspects of proportional symbol maps. V: Algorithms - Esa 2006 : 14th Annual European Symposium, Zürich, Switzerland, September 11-13, 2006, : proceedings. Berlin; Heidelberg; New York: Springer, 2006. Str. 720-731. Lecture notes in computer science, 4168. ISBN 3-540-38875-3, ISBN 978-3-540-38875-3. ISSN 0302-9743. [COBISS.SI-ID 14090841]

29. BOSE, Prosenjit, CABELLO, Sergio, CHEONG, Otfried, GUDMUNDSSON, Joachim, KREVELD, Marc van, SPECKMANN, Bettina. Area-preserving approximations of polygonal paths. Journal of discrete algorithms. 2006, vol. 4, iss. 4, str. 554-566. ISSN 1570-8667. http://dx.doi.org/10.1016/j.jda.2005.06.008. [COBISS.SI-ID 14143833]

30. AGARWAL, Pankaj K., CABELLO, Sergio, SELLARÈS, J. Antoni, SHARIR, Micha. Computing a center-transversal line. V: FSTTCS 2006: foundations of software technology and theoretical computer science : 26th International Conference, Kolkata, India, December 13-15, 2006 : proceedings. Berlin; New York: Springer, 2006. Str. 93-104. Lecture notes in computer science, 4337. ISBN 3-540-49994-6, ISBN 978-3-540-49994-7. ISSN 0302-9743. [COBISS.SI-ID 14225753]

31. AGARWAL, Pankaj K., CABELLO, Sergio, SELLARÈS, J. Antoni, SHARIR, Micha. Computing a center-transversal line. Preprint series. 2006, vol. 44, št. 1015, str. 1-14. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01015.pdf. [COBISS.SI-ID 14261081]

32. BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. V: Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers. Berlin; New York: Springer, 2006. Str. 55-68. Lecture notes in computer science, 4368. ISBN 3-540-69513-3, ISBN 978-3-540-69513-4. ISSN 0302-9743. http://dx.doi.org/10.1007/11970125_5. [COBISS.SI-ID 14224473]

33. BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. Preprint series. 2006, vol. 44, št. 1026, str. 1-24. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01026.pdf. [COBISS.SI-ID 14788185]

34. CABELLO, Sergio, CHAMBERS, Erin W. Distances in embedded graphs. V: MOHAR, Bojan (ur.). Topological graph theory and crossing numbers : October 21-26, 2006. Banff: Banff International Research Station for Mathematical Innovation and Discovery, 2006. Str. 10. http://www.birs.ca/workshops/2006/06w5067/report06w5067.pdf. [COBISS.SI-ID 15230297]

35. CABELLO, Sergio, DEVOS, Matt, MOHAR, Bojan. Expected case for projecting points. Informatica : an international journal of computing and informatics. [Tiskana izd.]. 2006, vol. 30, no. 3, str. 289-293. ISSN 0350-5596. http://www.informatica.si/, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 20378919]

36. CABELLO, Sergio. Many distances in planar graphs. V: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM; Philadelphia: SIAM, 2006. Str. 1213-1220. Proceedings in Applied Mathematics, 122. ISBN 0-89871-605-5, ISBN 978-0-898716-05-4. http://doi.acm.org/10.1145/1109557.1109691. [COBISS.SI-ID 14090329]

37. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. Ljubljana: Institute of Mathematics, Physics and Mechanics, Department of Mathematics, 2006. 21 str., ilustr. Preprint series, vol. 44 (2006), 1003. ISSN 1318-4865. [COBISS.SI-ID 16016899]

38. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. V: ANŽIČ, Tina (ur.), et al. Complex objects visualization - COV 2005 : proceedings. Ljubljana: Jožef Stefan Institute: IMFM - Institute of Mathematics, Physics and Mechanics; Koper: UP - PINT, 2006. 8 str. ISBN 961-6303-84-8, ISBN 978-961-6303-84-2. [COBISS.SI-ID 14188633]

39. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. Preprint series. 2006, vol. 44, št. 1003, str. 1-21. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01003.pdf. [COBISS.SI-ID 13899353]

40. BERG, Mark de, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, OOSTRUM, René van, WELTKAMP, Remco C. Maximizing the area of overlap of two unions of disks under rigid motion. Preprint series. 2006, vol. 44, št. 1019, str. 1-20. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01019.pdf. [COBISS.SI-ID 14786649]

41. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. On the parameterized complexity of ▫$d$▫-dimensional point set pattern matching. V: Parametrized and exact computation : Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings. Berlin; Heidelberg; New York: Springer, 2006. Str. 175-183. Lecture notes in computer science, 4169. ISBN 3-540-39098-7, ISBN 978-3-540-39098-5. ISSN 0302-9743. [COBISS.SI-ID 14091609]

42. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. On the parameterized complexity of ▫$d$▫-dimensional point set pattern matching. Preprint series. 2006, vol. 44, št. 1018, str. 1-8. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01018.pdf. [COBISS.SI-ID 14600537]

43. CABELLO, Sergio. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Journal of graph algorithms and applications. 2006, vol. 10, no. 2, str. 353-363. ISSN 1526-1719. http://jgaa.info/accepted/2006/Cabello2006.10.2.pdf. [COBISS.SI-ID 14297945]

44. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, LANGERMAN, Stefan, SEARA, Carlos, VENTURA, Inma. Reverse facility location problems. Ljubljana: Institute of Mathematics, Physics and Mechanics, Department of Mathematics, 2006. 15 str., ilustr. Preprint series, vol. 44 (2006), 1002. ISSN 1318-4865. [COBISS.SI-ID 16018947]

45. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, LANGERMAN, Stefan, SEARA, Carlos, VENTURA, Inma. Reverse facility location problems. Preprint series. 2006, vol. 44, št. 1002, str. 1-15. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01002.pdf. [COBISS.SI-ID 13899097]

46. CABELLO, Sergio. Approximation algorithms for spreading points. Journal of algorithms. 2007, vol. 62, no. 2, str. 49-73. ISSN 0196-6774. http://dx.doi.org/10.1016/j.jalgor.2004.06.009. [COBISS.SI-ID 14298201]

47. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, SEARA, Carlos, SELLARÈS, J. Antoni, URRUTIA, Jorge, VENTURA, Inma. Covering point sets with two disjoint disks or squares. Preprint series. 2007, vol. 45, št. 1027, str. 1-14. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01027.pdf. [COBISS.SI-ID 14718553]

48. CABELLO, Sergio, MOHAR, Bojan. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Discrete & computational geometry. 2007, vol. 37, no. 2, str. 213-235. ISSN 0179-5376. http://dx.doi.org/10.1007/s00454-006-1292-5. [COBISS.SI-ID 14223449]

49. CABELLO, Sergio, CHAMBERS, Erin W. Multiple source shortest paths in a genus g graph. V: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM; Philadelphia: SIAM, 2007. Str. 89-97. Proceedings in Applied Mathematics, 125. ISBN 978-0-898716-24-5. [COBISS.SI-ID 14229337]

50. CABELLO, Sergio, ROTE, Günter. Obnoxious centers in graphs. V: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM; Philadelphia: SIAM, 2007. Str. 99-107. Proceedings in Applied Mathematics, 125. ISBN 978-0-898716-24-5. [COBISS.SI-ID 14230105]

51. CABELLO, Sergio, DEMAINE, Erik D., ROTE, Günter. Planar embeddings of graphs with specified edge lengths. Journal of graph algorithms and applications. 2007, vol. 11, no. 1, str. 259-276. ISSN 1526-1719. http://www.jgaa.info/accepted/2007/CabelloDemaineRote2007.11.1.pdf. [COBISS.SI-ID 14426969]

52. CABELLO, Sergio. Wiener index, orthogonal range searching, and treewidth. V: PISANSKI, Tomaž (ur.), et al. Abstracts of the 6th Slovenian International Conference on Graph Theory, Bled'07, Bled, Slovenia, 24-30 June 2007. Ljubljana: DMFA - založništvo, 2007. Str. 54. ISBN 978-961-212-198-3. [COBISS.SI-ID 14389593]

53. CABELLO, Sergio, HAVERKORT, Herman Johannes, KREVELD, Marc van, SPECKMANN, Bettina. Algorithmic aspects of proportional symbol maps. Preprint series. 2008, vol. 46, št. 1042, str. 1-18. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01042.pdf. [COBISS.SI-ID 14705241]

54. CABELLO, Sergio, KNAUER, Christian. Algorithms for graphs of bounded treewidth via orthogonal range searching. Preprint series. 2008, vol. 46, št. 1039, str. 1-13. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01039.pdf. [COBISS.SI-ID 14704473]

55. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, SEARA, Carlos, SELLARÈS, J. Antoni, URRUTIA, Jorge, VENTURA, Inma. Covering point sets with two disjoint disks or squares. Computational geometry. [Print ed.]. 2008, vol. 40, iss. 3, str. 195-206. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2007.10.001. [COBISS.SI-ID 14646873]

56. MOHAR, Bojan, CABELLO, Sergio, DEVOS, Matt, ŠÁMAL, Robert. Crossing numbers of graphs on the plane and on other surfaces. V: TGT20 : abstracts. The 20th Workshop on Topological Graph Theory in Yokohama, Nov. 25 to 28, 2008. Yokohama: Yokohama Publishers, 2008. Str. 60-66. [COBISS.SI-ID 14994009]

57. AICHHOLZER, Oswin, CABELLO, Sergio, FABILA-MONROY, Ruy, FLORES-PEÑALOZA, David, HACKL, Thomas, HUEMER, Clemens, HURTADO, F., WOOD, David Richard. Edge-removal and non-crossing configurations in geometric graphs. Preprint series. 2008, vol. 46, št. 1052, str. 1-11. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01052.pdf. [COBISS.SI-ID 14731353]

58. CABELLO, Sergio, DEVOS, Matt, ERICKSON, Jeff, MOHAR, Bojan. Finding one tight cycle. V: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms 2008. 19th ACM-SIAM Symposium on Discrete Algorithms, January 20-22, 2008, San Francisco, California. New York: ACM, 2008. Str. 527-531. ACM Digital Library. http://portal.acm.org/citation.cfm?id=1347140&jmp=abstract&coll=GUIDE&dl=GUIDE&CFID=://cobiss2.izum.si/scripts/cobiss?id=0840266676113280&CFTOKEN=cobiss2.izum.si/scripts/cobiss?id=0840266676113280#abstract. [COBISS.SI-ID 14658649]

59. CABELLO, Sergio, DEVOS, Matt, ERICKSON, Jeff, MOHAR, Bojan. Finding one tight cycle. Preprint series. 2008, vol. 46, št. 1047, str. 1-12. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01047.pdf. [COBISS.SI-ID 14609241]

60. CABELLO, Sergio. Finding shortest contractible and shortest separating cycles in embedded graphs. Preprint series. 2008, vol. 46, št. 1063, str. 1-16. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01063.pdf. [COBISS.SI-ID 14978905]

61. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, MARX, Dániel, ROTE, Günter. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. Preprint series. 2008, vol. 46, št. 1057, str. 1-9. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01057.pdf. [COBISS.SI-ID 14912089]

62. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. V: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms 2008. 19th ACM-SIAM Symposium on Discrete Algorithms, January 20-22, 2008, San Francisco, California. New York: ACM, 2008. Str. 836-843. ACM Digital Library. http://portal.acm.org/citation.cfm?id=1347174&jmp=abstract&coll=GUIDE&dl=GUIDE&CFID=://cobiss2.izum.si/scripts/cobiss?id=0840266676113280&CFTOKEN=cobiss2.izum.si/scripts/cobiss?id=0840266676113280#abstract. [COBISS.SI-ID 14658905]

63. CABELLO, Sergio, FORT, Marta, SELLARÈS, J. Antoni. Higher-order Voronoi diagrams on triangulated surfaces. Preprint series. 2008, vol. 46, št. 1056, str. 1-9. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01056.pdf. [COBISS.SI-ID 14911833]

64. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, Günter. Matching point sets with respect to the Earth Mover's Distance. Computational geometry. [Print ed.]. 2008, vol. 39, iss. 2, str. 118-133. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2006.10.001. [COBISS.SI-ID 14450521]

65. CABELLO, Sergio, ROTE, Günter. Obnoxious centers in graphs. Preprint series. 2008, vol. 46, št. 1048, str. 1-19. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01048.pdf. [COBISS.SI-ID 14624089]

66. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. On the parameterized complexity of ▫$d$▫-dimensional point set pattern matching. Information processing letters. [Print ed.]. 2008, vol. 105, issue 2, str. 73-77. ISSN 0020-0190. http://dx.doi.org/10.1016/j.ipl.2007.08.003, DOI: 10.1016/j.ipl.2007.08.003. [COBISS.SI-ID 14450009]

67. CABELLO, Sergio. Algorithms for graphs embedded on surfaces. V: XIII Encuentros de Geometría Computacional : Zaragoza, del 29 de junio al 1 de julio de 2009. Zaragoza: Prensas Universitarias de Zaragoza, 2009. Str. 35-41. ISBN 978-84-92774-11-1. [COBISS.SI-ID 15555929]

68. CABELLO, Sergio, KNAUER, Christian. Algorithms for graphs of bounded treewidth via orthogonal range searching. Computational geometry. [Print ed.]. 2009, vol. 42, iss. 9, str. 815-824. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2009.02.001, DOI: 10.1016/j.comgeo.2009.02.001. [COBISS.SI-ID 15160409]

69. BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. Theory of computing systems. 2009, vol. 45, no. 3, str. 446-469. ISSN 1432-4350. http://dx.doi.org/10.1007/s00224-008-9135-9, DOI: 10.1007/s00224-008-9135-9. [COBISS.SI-ID 14900825]

70. CABELLO, Sergio, MOHAR, Bojan. Crossing and weighted crossing number of near-planar graphs. V: TOLLIS, Ioannis G. (ur.), PATRIGNANI, Maurizio (ur.). Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers. Berlin; Heidelberg: Springer, cop. 2009. Str. 38-49. Lecture notes in computer science, 5417. ISBN 3-642-00218-8, ISBN 978-3-642-00218-2. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-00219-9_5. [COBISS.SI-ID 15099225]

71. CABELLO, Sergio, MOHAR, Bojan. Crossing and weighted crossing number of near-planar graphs. Preprint series. 2009, vol. 47, št. 1068, str. 1-20. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01068.pdf. [COBISS.SI-ID 15047769]

72. BUCHIN, Kevin, CABELLO, Sergio, GUDMUNDSSON, Joachim, LÖFFLER, Maarten, LUO, Jun, ROTE, Günter, SILVEIRA, Rodrigo I., SPECKMANN, Bettina, WOLLE, Thomas. Detecting hotspots in geographic networks. V: SESTER, Monika (ur.), BERNARD, Lars (ur.), PAELKE, Volker (ur.). Advances in GIScience : proceedings of the 12th AGILE Conference. Berlin; Heidelberg: Springer, cop. 2009. Str. 217-231. Lecture notes in geoinformation and cartography (Print). ISBN 978-3-642-00317-2. ISSN 1863-2246. http://dx.doi.org/10.1007/978-3-642-00318-9_11. [COBISS.SI-ID 15154521]

73. CABELLO, Sergio, EPPSTEIN, David, KLAVŽAR, Sandi. The Fibonacci dimension of a graph. Preprint series. 2009, vol. 47, št. 1084, str. 1-20. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01084.pdf. [COBISS.SI-ID 15095129]

74. CABELLO, Sergio. Finding shortest contractible and shortest separating cycles in embedded graphs. V: MATHIEU, Claire (ur.). Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: Association for Computing Machinery, 2009. Str. 616-624. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. ISBN 0-89871-680-2, ISBN 978-0-89871-680-1. ISSN 1071-9040. http://www.siam.org/proceedings/soda/2009/SODA09_068_cabellos.pdf. [COBISS.SI-ID 15151705]

75. BUCHIN, Kevin, CABELLO, Sergio, GUDMUNDSSON, Joachim, LÖFFLER, Maarten, LUO, Jun, ROTE, Günter, SILVEIRA, Rodrigo I., SPECKMANN, Bettina, WOLLE, Thomas. Finding the most relevant fragments in networks. Preprint series. 2009, vol. 47, št. 1101, str. 1-21. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01101.pdf. [COBISS.SI-ID 15287897]

76. CABELLO, Sergio, KREVELD, Marc van, LIOTTA, Giuseppe, MEIJER, Henk, SPECKMANN, Bettina, VERBEEK, Kevin. Geometric simultaneous embeddings of a graph and a matching. Preprint series. 2009, vol. 47, št. 1106, str. 1-13. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01106.pdf. [COBISS.SI-ID 15332953]

77. CABELLO, Sergio, FORT, Marta, SELLARÈS, J. Antoni. Higher-order Voronoi diagrams on triangulated surfaces. Information processing letters. [Print ed.]. 2009, vol. 109, iss. 9, str. 440-445. ISSN 0020-0190. http://dx.doi.org/10.1016/j.ipl.2009.01.001. [COBISS.SI-ID 15160153]

78. CABELLO, Sergio. Many distances in planar graphs. Preprint series. 2009, vol. 47, št. 1089, str. 1-18. ISSN 1318-4865. http://www.imfm.si/preprinti/PDF/01089.pdf, Digitalna knjižnica Univerze v Mariboru – DKUM. [COBISS.SI-ID 15142233]

79. BERG, Mark de, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, OOSTRUM, René van, WELTKAMP, Remco C. Maximizing the area of overlap of two unions of disks under rigid motion. International journal of Computational geometry and applications. 2009, vol. 19, iss. 6, str. 533-556. ISSN 0218-1959. http://dx.doi.org/10.1142/S0218195909003118. [COBISS.SI-ID 15575641]

80. CABELLO, Sergio, MOHAR, Bojan. Adding one edge to planar graphs makes crossing number hard. V: Proceedings of the Twenty-Sixth Annual Symposium on Computational Geometry (SCG'10) : June 13-16, 2010, Snowbird, Utah, USA. New York: ACM, cop. 2010. Str. 68-76. ISBN 978-1-4503-0016-2. http://doi.acm.org/10.1145/1810959.1810972. [COBISS.SI-ID 15630681]

81. CABELLO, Sergio, HAVERKORT, Herman Johannes, KREVELD, Marc van, SPECKMANN, Bettina. Algorithmic aspects of proportional symbol maps. Algorithmica. 2010, vol. 58, no. 3, str. 543-565. ISSN 0178-4617. http://dx.doi.org/10.1007/s00453-009-9281-8, DOI: 10.1007/s00453-009-9281-8. [COBISS.SI-ID 15151193]

82. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Algorithms for the edge-width of an embedded graph. Preprint series. 2010, vol. 48, št. 1125, str. 1-16. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01125.pdf. [COBISS.SI-ID 15638617]

83. JAKOVAC, Marko. Barvanja grafov Sierpińskega in b-barvanja : doktorska disertacija. [Maribor: M. Jakovac], 2010. 86 str., ilustr. Digitalna knjižnica Univerze v Mariboru – DKUM, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 253571072]

84. BEREG, Sergey, CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, PÉREZ LANTERO, Pablo, SEARA, Carlos, VENTURA, Inma. The class cover problem with boxes. Preprint series. 2010, vol. 48, št. 1127, str. 1-19. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01127.pdf. [COBISS.SI-ID 15646297]

85. CABELLO, Sergio, LUKŠIČ, Primož. The complexity of obtaining a distance-balanced graph. Preprint series. 2010, vol. 48, št. 1122, str. 1-9. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01122.pdf. [COBISS.SI-ID 15631705]

86. AICHHOLZER, Oswin, CABELLO, Sergio, FABILA-MONROY, Ruy, FLORES-PEÑALOZA, David, HACKL, Thomas, HUEMER, Clemens, HURTADO, F., WOOD, David Richard. Edge-removal and non-crossing configurations in geometric graphs. Discrete mathematics & theoretical computer science. 2010, vol. 12, no. 1, str. 75-86. ISSN 1365-8050. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/985. [COBISS.SI-ID 15629145]

87. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, LANGERMAN, Stefan, SEARA, Carlos, VENTURA, Inma. Facility location problems in the plane based on reverse nearest neighbor queries. European journal of operational research. [Print ed.]. 2010, vol. 202, iss. 1, str. 99-106. ISSN 0377-2217. http://dx.doi.org/10.1016/j.ejor.2009.04.021, DOI: 10.1016/j.ejor.2009.04.021. [COBISS.SI-ID 15160921]

88. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Finding cycles with topological properties in embedded graphs. Preprint series. 2010, vol. 48, št. 1132, str. 1-16. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01132.pdf. [COBISS.SI-ID 15695705]

89. CABELLO, Sergio, DEVOS, Matt, ERICKSON, Jeff, MOHAR, Bojan. Finding one tight cycle. V: SODA 2008 : special issue. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, January 20-22, San Francisco, California. New York: Association for Computing Machinery, 2010. Article no. 61 (13 str.). ACM transactions on algorithms, Vol. 6, no. 4. ISSN 1549-6325. http://doi.acm.org/10.1145/1824777.1824781. [COBISS.SI-ID 15704153]

90. CABELLO, Sergio. Finding shortest contractible and shortest separating cycles in embedded graphs. V: SODA 2009 : special issue. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, New York. New York: Association for Computing Machinery, 2010. Article no.: 24 (18 str.). ACM transactions on algorithms, Vol. 6, iss. 2. ISSN 1549-6325. http://doi.acm.org/10.1145/1721837.1721840. [COBISS.SI-ID 15572057]

91. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Finding shortest non-trivial cycles in directed graphs on surfaces. V: Proceedings of the Twenty-Sixth Annual Symposium on Computational Geometry (SCG'10) : June 13-16, 2010, Snowbird, Utah, USA. New York: ACM, cop. 2010. Str. 156-165. ISBN 978-1-4503-0016-2. http://doi.acm.org/10.1145/1810959.1810988. [COBISS.SI-ID 15630169]

92. BUCHIN, Kevin, CABELLO, Sergio, GUDMUNDSSON, Joachim, LÖFFLER, Maarten, LUO, Jun, ROTE, Günter, SILVEIRA, Rodrigo I., SPECKMANN, Bettina, WOLLE, Thomas. Finding the most relevant fragments in networks. Journal of graph algorithms and applications. 2010, vol. 14, no. 2, str. 307-336. ISSN 1526-1719. http://jgaa.info/accepted/2010/Buchin+2010.14.2.pdf. [COBISS.SI-ID 15629401]

93. CABELLO, Sergio, KREVELD, Marc van, LIOTTA, Giuseppe, MEIJER, Henk, SPECKMANN, Bettina, VERBEEK, Kevin. Geometric simultaneous embeddings of a graph and a matching. V: EPPSTEIN, David (ur.), GANSNER, Emden R. (ur.). Graph drawing : 17th international symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009 : revised papers. Berlin; Heidelberg: Springer, cop. 2010. Str. 183-194. Lecture notes in computer science, 5849. ISBN 3-642-11804-6, ISBN 978-3-642-11804-3. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-11805-0_18. [COBISS.SI-ID 15574105]

94. LUKŠIČ, Primož, CABELLO, Sergio. NP-hardness of the distance-balanced edge addition problem. V: VUKIČEVIĆ, Damir (ur.). Visualization and modeling in chemistry : book of abstracts : dedicated to professor Ante Graovac in happy celebration of his 65th birthday. Bilateral Croatian-Slovenian Conference, Split, Croatia, October, 29-31, 2010. [S. l.: s. n.], 2010. Str. 18. [COBISS.SI-ID 15714393]

95. CABELLO, Sergio, ROTE, Günter. Obnoxious centers in graphs. SIAM journal on discrete mathematics. 2010, vol. 24, no. 4, str. 1713-1730. ISSN 0895-4801. http://dx.doi.org/10.1137/09077638X. [COBISS.SI-ID 15762265]

96. CABELLO, Sergio, JAKOVAC, Marko. On the b-chromatic number of regular graphs. Preprint series. 2010, vol. 48, št. 1131, str. 1-11. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01131.pdf. [COBISS.SI-ID 15695449]

97. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Output-sensitive algorithm for the edge-width of an embedded graph. V: Proceedings of the Twenty-Sixth Annual Symposium on Computational Geometry (SCG'10) : June 13-16, 2010, Snowbird, Utah, USA. New York: ACM, cop. 2010. Str. 147-155. ISBN 978-1-4503-0016-2. http://doi.acm.org/10.1145/1810959.1810987. [COBISS.SI-ID 15629913]

98. MOHAR, Bojan, CABELLO, Sergio, DVOŘÁK, Zdeněk. Two surprising results about crossing numbers : [invited lecture]. V: DIESTEL, Reinhard (ur.). Graph Theory : February 21st - February 27th, 2010. Oberwolfach: Mathematisches Forschungsinstitut, 2010. Str. 38-40. Oberwolfach reports, Workshops at Oberwolfach in 2010, no. 11/2010. [COBISS.SI-ID 15563609]

99. CABELLO, Sergio. Vaje iz alternativnih modelov računanja. 1. izd. V Ljubljani: samozal., 2010. 1 opt. disk (CD-ROM) [26 str.]. ISBN 978-961-276-042-7. http://www.fmf.uni-lj.si/~cabello/gradiva/vajeamr.pdf, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 253228544]

100. CABELLO, Sergio. Vaje iz računske geometrije. 1. izd. V Ljubljani: samozal., 2010. 1 opt. disk (CD-ROM) [35 str.]. ISBN 978-961-276-043-4. http://www.fmf.uni-lj.si/~cabello/gradiva/vajeracgeom.pdf, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 253228800]

101. CABELLO, Sergio. Vaje iz teorije iger. 1. izd. V Ljubljani: samozal., 2010. 1 opt. disk (CD-ROM) [24 str.]. ISBN 978-961-276-044-1. http://www.fmf.uni-lj.si/~cabello/gradiva/vajeteorijaiger.pdf, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 253229312]

102. CABELLO, Sergio, LUKŠIČ, Primož. The complexity of obtaining a distance-balanced graph. The Electronic journal of combinatorics. [Online ed.]. 2011, vol. 18, no. 1, p49 (10 str.). ISSN 1077-8926. http://www.combinatorics.org/Volume_18/PDF/v18i1p49.pdf. [COBISS.SI-ID 15832153]

103. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, PÉREZ LANTERO, Pablo. Covering a bichromatic point set with two disjoint monochromatic disks. Preprint series. 2011, vol. 49, št. 1138, str. 1-15. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01138.pdf. [COBISS.SI-ID 15824985]

104. CABELLO, Sergio, MOHAR, Bojan. Crossing number and weighted crossing number of near-planar graphs. Algorithmica. 2011, vol. 60, no. 3, str. 484-504. ISSN 0178-4617. http://dx.doi.org/10.1007/s00453-009-9357-5. [COBISS.SI-ID 15261785]

105. CABELLO, Sergio, EPPSTEIN, David, KLAVŽAR, Sandi. The Fibonacci dimension of a graph. The Electronic journal of combinatorics. [Online ed.]. 2011, vol. 18, no. 1, p55 (23 str.). ISSN 1077-8926. http://www.combinatorics.org/Volume_18/PDF/v18i1p55.pdf. [COBISS.SI-ID 15845465]

106. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Finding cycles with topological properties in embedded graphs. SIAM journal on discrete mathematics. 2011, vol. 25, no. 4, str. 1600-1614. ISSN 0895-4801. http://dx.doi.org/10.1137/100810794. [COBISS.SI-ID 16077145]

107. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, MARX, Dániel, ROTE, Günter. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. ACM transactions on algorithms. 2011, vol. 7, no. 4, article 43 (27 str.). ISSN 1549-6325. http://dx.doi.org/10.1145/2000807.2000811. [COBISS.SI-ID 16028761]

108. CABELLO, Sergio, KREVELD, Marc van, LIOTTA, Giuseppe, MEIJER, Henk, SPECKMANN, Bettina, VERBEEK, Kevin. Geometric simultaneous embeddings of a graph and a matching. V: Special Issue on Selected Papers from the Seventeenth International Symposium on Graph Drawing, GD 2009. Providence (R. I.): Brown University, Dept. of Computer Science, 2011. Str. 79-96. Journal of graph algorithms and applications, vol. 15, no. 1. ISSN 1526-1719. http://jgaa.info/accepted/2011/Cabello+2011.15.1.pdf. [COBISS.SI-ID 15846233]

109. ALT, Helmut, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. Minimum cell connection and separation in line segment arrangements. Preprint series. 2011, vol. 49, št. 1152, str. 1-22. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01152.pdf. [COBISS.SI-ID 15917145]

110. GAJSER, David. Naravna dokaza spodnje meje računske zahtevanosti : Prešernova nagrada študentom : diplomsko delo. Ljubljana: [D. Gajser], 2011. 56 str., ilustr. http://www.matknjiz.si/diplome/uni/u/2011/10668-756.pdf. [COBISS.SI-ID 16191065]

111. JAKOVAC, Marko, CABELLO, Sergio. On the b-chromatic number of regular graphs. V: KUTNAR, Klavdija (ur.), ŠPARL, Primož (ur.), KUZMAN, Boštjan (ur.). Abstracts of the 7th Slovenian international conference on graph theory, Bled, Slovenia, 19-25 June 2011. Koper: UP FAMNIT: UP PINT, 2011. Str. 69. http://osebje.famnit.upr.si/~bled.2011/Bled11-Abstracts.pdf. [COBISS.SI-ID 15958873]

112. CABELLO, Sergio, JAKOVAC, Marko. On the b-chromatic number of regular graphs. V: CID : colourings, independence and domination : abstracts. 14th Workshop on Graph Theory: Colourings, Independence and Domination, Szklarska Poręba 2011, September 18-23. Zielona Góra: Uniwersytet Zielonogórski, 2011. Str. 38. [COBISS.SI-ID 18664456]

113. CABELLO, Sergio, JAKOVAC, Marko. On the b-chromatic number of regular graphs. Discrete applied mathematics. [Print ed.]. 2011, vol. 159, iss. 13, str. 1303-1310. ISSN 0166-218X. http://dx.doi.org/10.1016/j.dam.2011.04.028, DOI: 10.1016/j.dam.2011.04.028. [COBISS.SI-ID 15914329]

114. BENDICH, Paul, CABELLO, Sergio, EDELSBRUNNER, Herbert. A point calculus for interlevel set homology. Preprint series. 2011, vol. 49, št. 1137, str. 1-11. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01137.pdf. [COBISS.SI-ID 15813465]

115. PESKOVIČ, Tilen. Stackelbergov model cenitve povezav na grafu : diplomsko delo. Ljubljana: [T. Peskovič], 2011. [55] f., ilustr. http://www.matknjiz.si/diplome/uni/u/2011/10668-755.pdf. [COBISS.SI-ID 16058969]

116. CABELLO, Sergio, MOHAR, Bojan. Adding one edge to planar graphs makes crossing number and 1-planarity hard. Preprint series. 2012, vol. 50, št. 1172, str. 1-27. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01172.pdf. [COBISS.SI-ID 16243545]

117. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Algorithms for the edge-width of an embedded graph. V: 26th Annual Symposium on Computation Geometry at Snowbird, Utah, USA : Special issue. 26th Annual Symposium on Computational Geometry, June 13th-16th, 2010, Snowbird, Utah. Amsterdam: Elsevier, 2012. Str. 215-224. Computational geometry, Vol. 45, iss. 5-6, 2012. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2011.12.002. [COBISS.SI-ID 16093017]

118. BUSARYEV, Oleksiy, CABELLO, Sergio, CHEN, Chao, DEY, Tamal Krishna, WANG, Yusu. Annotating simplices with a homology basis and its applications. V: FOMIN, Fedor V. (ur.), KASKI, Petteri (ur.). Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012 : proceedings. 13th Scandinavian Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 4-6 July 2012. Heidelberg: Springer, cop. 2012. Str. 189-200. Lecture notes in computer science, 7357. ISBN 978-3-642-31154-3, ISBN 978-3-642-31155-0. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-31155-0_17. [COBISS.SI-ID 16325721]

119. BEREG, Sergey, CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, PÉREZ LANTERO, Pablo, SEARA, Carlos, VENTURA, Inma. The class cover problem with boxes. Computational geometry. [Print ed.]. 2012, vol. 45, iss. 7, str. 294-304. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2012.01.014. [COBISS.SI-ID 16205657]

120. CABELLO, Sergio, CARDINAL, Jean, LANGERMAN, Stefan. The clique problem in ray intersection graphs. V: EPSTEIN, Leah (ur.), FERRAGINA, Paolo (ur.). Algorithms - ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012 : proceedings. 20th European Symposium on Algorithms - ESA 2012, September 10-12, Ljubljana, Slovenia. Heidelberg: Springer, cop. 2012. Str. 241-252. Lecture notes in computer science, 7501. ISBN 978-3-642-33089-6, ISBN 978-3-642-33090-2. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-33090-2_22. [COBISS.SI-ID 16378201]

121. FABJAN, Gregor. Kombinatorične dražbe : delo diplomskega seminarja. Ljubljana: [G. Fabjan], 2012. 29 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 16607321]

122. CABELLO, Sergio. Many distances in planar graphs. Algorithmica. 2012, vol. 62, no. 1-2, str. 361-381. ISSN 0178-4617. http://dx.doi.org/10.1007/s00453-010-9459-0. [COBISS.SI-ID 15702873]

123. CABELLO, Sergio, CHAMBERS, Erin W., ERICKSON, Jeff. Multiple-source shortest paths in embedded graphs. Preprint series. 2012, vol. 50, št. 1170, str. 1-24. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01170.pdf. [COBISS.SI-ID 16198745]

124. SUŠELJ, Gregor. Neučinkovitost ravnovesja : magistrsko delo. Ljubljana: [G. Sušelj], 2012. 61 str. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 16420697]

125. BENDICH, Paul, CABELLO, Sergio, EDELSBRUNNER, Herbert. A point calculus for interlevel set homology. Pattern recognition letters : an official publication of the International Association for Pattern Recognition. [Print ed.]. 2012, vol. 33, iss. 11, 1436-1444. ISSN 0167-8655. http://dx.doi.org/10.1016/j.patrec.2011.10.007. [COBISS.SI-ID 16059993]

126. CABELLO, Sergio. Stackelberg shortest path tree game, revisited. Preprint series. 2012, vol. 50, št. 1180, str. 1-13. ISSN 2232-2094. http://www.imfm.si/preprinti/PDF/01180.pdf. [COBISS.SI-ID 16333401]

127. MAVSAR, Katja. Voronojeva igra : delo diplomskega seminarja. Ljubljana: [K. Mavsar], 2012. 32 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 16617305]

128. CABELLO, Sergio, MOHAR, Bojan. Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM journal on computing. 2013, vol. 42, iss. 5, str. 1803-1829. ISSN 0097-5397. http://dx.doi.org/10.1137/120872310. [COBISS.SI-ID 16733017]

129. CABELLO, Sergio, CARDINAL, Jean, LANGERMAN, Stefan. The clique problem in ray intersection graphs. Discrete & computational geometry. 2013, vol. 50, iss. 3, str. 771-783. ISSN 0179-5376. http://dx.doi.org/10.1007/s00454-013-9538-5. [COBISS.SI-ID 16728921]

130. CABELLO, Sergio, GIANNOPOULOS, Panos. The complexity of separating points in the plane. V: Proceedings of the Twenty-nineth annual symposium on computational geometry, (SoCGʼ13). New York: ACM, cop. 2013. Str. 379-386. ISBN 978-1-4503-2031-3. [COBISS.SI-ID 16669273]

131. CABELLO, Sergio, CHIMANI, Markus, HLINĚNÝ, Petr. Computing the stretch of an embedded graph. V: Proceedings. XV Spanish Meeting on Computational Geometry, June 26-28, 2013, Sevilla, Spain. Sevilla: Universidad de Sevilla, 2013. Str. 39-42. http://congreso.us.es/ecgeometry/proceedingsECG2013.pdf. [COBISS.SI-ID 17075801]

132. CABELLO, Sergio, DÍAZ-BÁÑEZ, José Miguel, PÉREZ LANTERO, Pablo. Covering a bichromatic point set with two disjoint monochromatic disks. Computational geometry. [Print ed.]. 2013, vol. 46, iss. 3, str. 203-212. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2012.06.002. [COBISS.SI-ID 16326233]

133. PLETIKOS, Nik. Enostavni modeli pokra in njihova analiza s teorijo iger : delo diplomskega seminarja. Ljubljana: [N. Pletikos], 2013. 31 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 16944217]

134. CABELLO, Sergio. Hardness of approximation for crossing number. Discrete & computational geometry. 2013, vol. 49, iss. 2, str. 348-358. ISSN 0179-5376. http://dx.doi.org/10.1007/s00454-012-9440-6. [COBISS.SI-ID 16340313]

135. CABELLO, Sergio, CHAMBERS, Erin W., ERICKSON, Jeff. Multiple-source shortest paths in embedded graphs. SIAM journal on computing. 2013, vol. 42, no. 4, str. 1542-1571. ISSN 0097-5397. http://dx.doi.org/10.1137/120864271. [COBISS.SI-ID 16668761]

136. BANNISTER, Michael J., CABELLO, Sergio, EPPSTEIN, David. Parameterized complexity of 1-planarity. V: DEHNE, Frank (ur.). Algorithms and data structures : proceedings. 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Berlin; Heidelberg: Springer, cop. 2013. Str. 97-108. Lecture notes in computer science, 8037. ISBN 978-3-642-40103-9, ISBN 978-3-642-40104-6. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-40104-6_9. [COBISS.SI-ID 16669785]

137. BANNISTER, Michael J., CABELLO, Sergio, EPPSTEIN, David, Dagstuhl Seminar 13421 "Algorithms for Optimization Problems in Planar Graphs", Oct. 13 - 18, 2013. Parameterized complexity of 1-planarity. Dagstuhl reports. 2013, vol. 3, iss. 10, str. 42. ISSN 2192-5283. [COBISS.SI-ID 17074265]

138. CABELLO, Sergio, Geometric and Topological Graph Theory, Banff International Research Station for Mathematical Innovation and Discovery (Canada), 29th September to 4th October 2013. Parameterized complexity of 1-planarity. Banff: BIRS, 1. 10. 2013. [COBISS.SI-ID 17076825]

139. VUČKOVIČ, Miha. Računanje Fréchetove razdalje med krivuljama : diplomsko delo. Ljubljana: [M. Vučkovič], 2013. 67 str., ilustr. http://eprints.fri.uni-lj.si/1978/, Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 9693780]

140. CABELLO, Sergio. Stackelberg shortest path tree game, revisited. V: ZADNIK STIRN, Lidija (ur.), et al. SOR '13 proceedings. 12th International Symposium on Operational Research in Slovenia Dolenjske Toplice, Slovenia, September 25-27, 2013. Ljubljana: Slovenian Society Informatika, Section for Operational Research, 2013. Str. 123-128. ISBN 978-961-6165-40-2. [COBISS.SI-ID 16747353]

141. MARINČ, Talmaj. Adaptive algorithm for selecting profitable keywords : final project work. Berlin: [T. Marinč], 2014. 29 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 17268313]

142. CABELLO, Sergio, CHIMANI, Markus, HLINĚNÝ, Petr. Computing the stretch of an embedded graph. SIAM journal on discrete mathematics. 2014, vol. 28, no. 3, str. 1391-1401. ISSN 0895-4801. http://dx.doi.org/10.1137/130945636. [COBISS.SI-ID 17118297]

143. CABELLO, Sergio, CHEONG, Otfried, SCHLIPF, Lena. Finding largest rectangles in convex polygons. V: 30th European Workshop on Computational Geometry (EuroCG 2014) : Dead Sea, Israel, March 3-5, 2014. Beer-Sheva: Ben-Gurion University of the Negev. 2014, 4 str. http://www.cs.bgu.ac.il/~eurocg14/papers/paper_21.pdf. [COBISS.SI-ID 17075289]

144. GRABLJEVEC, Erik. Iskanje v posebnih matrikah : delo diplomskega seminarja. Ljubljana: [E. Grabljevec], 2014. 30 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 17261913]

145. CABELLO, Sergio, CIBULKA, Josef, KYNČL, Jan, SAUMELL, Maria, VALTR, Pavel. Peeling potatoes near-optimally in near-linear time. V: Proceedings of the thirtieth annual symposium on Computational geometry (SoCG'14). New York: ACM, cop. 2014. Str. 224-231. ISBN 978-1-4503-2594-3. http://dl.acm.org/authorize?6907409. [COBISS.SI-ID 17072729]

146. ZORKO, Robert. Različni Voronoijevi diagrami : diplomsko delo. Ljubljana: [R. Zorko], 2014. 42 str., ilustr. http://eprints.fri.uni-lj.si/2790/, Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 1536067779]

147. CABELLO, Sergio, JEJČIČ, Miha. Shortest paths in intersection graphs of unit disks. V: IX Jornadas de Matemática Discreta y Algorítmica : Tarragona, 7 al 9 de Julio de 2014. Tarragona: Universitat Rovira i Virgili, 2014. Str. 153-161. http://deim.urv.cat/~discrete-math/JMDA2014/Actas.pdf. [COBISS.SI-ID 17074777]

148. CABELLO, Sergio, MOHAR, Bojan, ŠÁMAL, Robert. Drawing a disconnected graph on the torus. V: NEŠETŘIL, Jaroslav (ur.). The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015. Piscataway: Elsevier, 2015. Str. 779-786. Electronic notes in discrete mathematics, Vol. 49. ISSN 1571-0653. http://dx.doi.org/10.1016/j.endm.2015.06.105. [COBISS.SI-ID 17784153]

149. BOKAL, Drago, CABELLO, Sergio, EPPSTEIN, David. Finding all maximal subsequences with hereditary properties. V: 31st International Symposium on Computational Geometry : SoCG'15, June 22-25, 2015, Eindhoven, The Netherlands. Saarbrücken: Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 215. Str. 240-254. Leibniz international proceedings in informatics, 34. ISBN 978-3-939897-83-5. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2015/5113/pdf/30.pdf, DOI: 10.4230/LIPIcs.SOCG.2015.240. [COBISS.SI-ID 17343577]

150. CABELLO, Sergio, PÉREZ LANTERO, Pablo. Interval selection in the streaming model. V: DEHNE, Frank (ur.). Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015 : proceedings. 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Cham [etc.]: Springer, cop. 2015. Str. 127-139. Lecture notes in computer science, 9214. ISBN 978-3-319-21839-7, ISBN 978-3-319-21840-3. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-319-21840-3_11. [COBISS.SI-ID 17392985]

151. CABELLO, Sergio, SAUMELL, Maria. A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discrete mathematics & theoretical computer science. 2015, vol. 17, no. 1, str. 1-12. ISSN 1365-8050. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2516/4642. [COBISS.SI-ID 17216857]

152. CABELLO, Sergio, KERBER, Michael. Semi-dynamic connectivity in the plane. V: DEHNE, Frank (ur.). Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015 : proceedings. 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Cham [etc.]: Springer, cop. 2015. Str. 115-126. Lecture notes in computer science, 9214. ISBN 978-3-319-21839-7, ISBN 978-3-319-21840-3. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-319-21840-3_10. [COBISS.SI-ID 17395801]

153. CABELLO, Sergio, JEJČIČ, Miha. Shortest paths in intersection graphs of unit disks. Computational geometry. [Print ed.]. 2015, vol. 48, iss. 4, str. 360-367. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2014.12.003. [COBISS.SI-ID 17194841]

154. CABELLO, Sergio, GAJSER, David. Simple PTAS's for families of graphs excluding a minor. Discrete applied mathematics. [Print ed.]. 2015, vol. 189, str. 41-48. ISSN 0166-218X. http://dx.doi.org/10.1016/j.dam.2015.03.004, DOI: 10.1016/j.dam.2015.03.004. [COBISS.SI-ID 17294169]

155. GAJSER, David. Verifying time complexity of Turing machines : doctoral thesis. Ljubljana: [D. Gajser], 2015. X, 120 str., ilustr. http://www.matknjiz.si/doktorati/2015/Gajser-14521-18.pdf, Repozitorij Univerze v Ljubljani – RUL, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 282124800]

156. CABELLO, Sergio, GIANNOPOULOS, Panos. The complexity of separating points in the plane. Algorithmica. 2016, vol. 74, iss. 2, str. 643-663. ISSN 0178-4617. http://dx.doi.org/10.1007/s00453-014-9965-6, DOI: 10.1007/s00453-014-9965-6. [COBISS.SI-ID 17195097]

157. CABELLO, Sergio, CHEONG, Otfried, KNAUER, Christian, SCHLIPF, Lena. Finding largest rectangles in convex polygons. Computational geometry. [Print ed.]. 2016, vol. 51, str. 67-74. ISSN 0925-7721. http://dx.doi.org/10.1016/j.comgeo.2015.08.001, DOI: 10.1016/j.comgeo.2015.08.001. [COBISS.SI-ID 17435481]

158. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric, LAZARUS, Francis. Finding shortest non-trivial cycles in directed graphs on surfaces. Journal of computational geometry. 2016, vol. 7, no. 1, str. 123-148. ISSN 1920-180X. http://jocg.org/index.php/jocg/article/view/225. [COBISS.SI-ID 17658201]

159. STRNIŠA, Barbara. Planiranje delovne iteracije po paradigmi ekstremnega programiranja z linearnim celoštevilskim programom : diplomsko delo. Ljubljana: [B. Strniša], 2016. XIV, 66 str., ilustr. http://www.matknjiz.si/diplome/uni/u/2016/10668-787.pdf. [COBISS.SI-ID 17720409]

160. CABELLO, Sergio, JEJČIČ, Miha. Refining the hierarchies of classes of geometric intersection graphs. V: MIER, Anna de (ur.), SERRA, Oriol (ur.). Discrete Mathematics Days - JMDA16. Piscataway: Elsevier, 2016. Str. 223-228. Electronic notes in discrete mathematics, Vol. 54. ISSN 1571-0653. http://dx.doi.org/10.1016/j.endm.2016.09.039. [COBISS.SI-ID 17904985]

161. SOVDAT, Blaž. Text mining via homology : master thesis. Ljubljana: [B. Sovdat], 2016. 95 str., ilustr. [COBISS.SI-ID 17719641]

162. MILINKOVIĆ, Lazar. Implementacija algoritmov za probleme najkrajših poti v presečnih grafih enotskih krogov : magistrsko delo. Ljubljana: [L. Milinković], 2017. 84 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 18074713]
nagrada: Fakultetna Prešernova nagrada za magistrsko delo, 2017

163. CABELLO, Sergio, PÉREZ LANTERO, Pablo. Interval selection in the streaming model. Theoretical computer science. Nov. 2017, vol. 702, str. 77-96. ISSN 0304-3975. http://doi.org/10.1016/j.tcs.2017.08.015, DOI: 10.1016/j.tcs.2017.08.015. [COBISS.SI-ID 18143065]

164. BRINGMANN, Karl, CABELLO, Sergio, EMMERICH, Michael. Maximum volume subset selection for anchored boxes. V: ARONOV, Boris (ur.), KATZ, Matthew J. (ur.). 33rd International Symposium on Computational Geometry : SoCG 2017, July 4-7, 2017, Brisbane, Australia. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June 2017. 15 str. Leibniz international proceedings in informatics, 77. ISBN 978-3-95977-038-5. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2017/7201/pdf/LIPIcs-SoCG-2017-22.pdf, DOI: 10.4230/LIPIcs.SoCG.2017.22. [COBISS.SI-ID 18144857]

165. ALT, Helmut, CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. Minimum cell connection in line segment arrangements. International journal of Computational geometry and applications. Sep. 2017, vol. 27, iss. 3, str. 159-176. ISSN 0218-1959. https://doi.org/10.1142/S0218195917500017, DOI: 10.1142/S0218195917500017. [COBISS.SI-ID 18231897]

166. BURTON, Benjamin, CABELLO, Sergio, KRATSCH, Stefan, PETTERSSON, William. The parameterized complexity of finding a 2-sphere in a simplicial complex. V: VOLLMER, Heribert (ur.), VALLÉE, Brigitte (ur.). 34th Symposium on Theoretical Aspects of Computer Science : STACS 2017, March 8-11, 2017, Hannover, Germany. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, March 2017. 14 str. Leibniz international proceedings in informatics, 66. ISBN 978-3-95977-028-6. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2017/7015/pdf/LIPIcs-STACS-2017-18.pdf, DOI: 10.4230/LIPIcs.STACS.2017.18. [COBISS.SI-ID 18143577]

167. CABELLO, Sergio, CIBULKA, Josef, KYNČL, Jan, SAUMELL, Maria, VALTR, Pavel. Peeling potatoes near-optimally in near-linear time. SIAM journal on computing. 2017, vol. 46, iss. 5, str. 1574-1602. ISSN 0097-5397. http://doi.org/10.1137/16M1079695, DOI: 10.1137/16M1079695. [COBISS.SI-ID 18142809]

168. CABELLO, Sergio, JEJČIČ, Miha. Refining the hierarchies of classes of geometric intersection graphs. The Electronic journal of combinatorics. [Online ed.]. 2017, vol. 24, iss. 1, p1.33 (19 str.). ISSN 1077-8926. http://www.combinatorics.org/ojs/index.php/eljc/article/download/v24i1p33/pdf. [COBISS.SI-ID 17905497]

169. CABELLO, Sergio. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. V: KLEIN, Philip N. (ur.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 28th ACM-SIAM Symposium on Discrete Algorithms, January 16-19, 2017, Barcelona. New York: ACM, 2017. Str. 2143-2152. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms (Online). ISBN 978-1-61197-478-2. ISSN 1557-9468. http://dx.doi.org/10.1137/1.9781611974782.139. [COBISS.SI-ID 17864281]

170. ČAMPA, Marcel. Algoritem potisni-povišaj za iskanje maksimalnih pretokov : delo diplomskega seminarja. Ljubljana: [M. Čampa], 2018. 35 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 18475609]

171. AVBREHT, Luka. Algoritmi za pozicioniranje v brezžičnih mrežah : delo diplomskega seminarja. Ljubljana: [L. Avbreht], 2018. 25 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 18437977]

172. Computational geometry. CABELLO, Sergio (gostujoči urednik 2018). [Print ed.]. Amsterdam; London; New York; Tokyo: Elsevier, 1991-. ISSN 0925-7721. [COBISS.SI-ID 14903301]

173. BRODNIK, Andrej, CABELLO, Sergio. Editorial : EuroCG2015. Computational geometry. [Print ed.]. Aug. 2018, vol. 73, str. 1. ISSN 0925-7721. https://www.sciencedirect.com/science/article/pii/S0925772118301020, DOI: 10.1016/j.comgeo.2018.06.010. [COBISS.SI-ID 1538260419]

174. BANNISTER, Michael J., CABELLO, Sergio, EPPSTEIN, David. Parameterized complexity of 1-planarity. Journal of graph algorithms and applications. 2018, vol. 22, no. 1, str. 23-49. ISSN 1526-1719. http://dx.doi.org/10.7155/jgaa.00457, DOI: 10.7155/jgaa.00457. [COBISS.SI-ID 18208345]

175. BAE, Sang Won, CABELLO, Sergio, CHEONG, Otfried, CHOI, Yoonsung, STEHN, Fabian, YOON, Sang Duk. The reverse Kakeya problem. V: SPECKMANN, Bettina (ur.), TÓTH, Csaba D. (ur.). 34th International Symposium on Computational Geometry : SoCG 2018, June 11-14, 2018, Budapest, Hungary. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June 2018. 13 str. Leibniz international proceedings in informatics, 99. ISBN 978-3-95977-066-8. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2018/8719/pdf/LIPIcs-SoCG-2018-6.pdf, DOI: 10.4230/LIPIcs.SoCG.2018.6. [COBISS.SI-ID 18408281]

176. CABELLO, Sergio, MILINKOVIĆ, Lazar. Two optimization problems for unit disks. Computational geometry. [Print ed.]. Feb. 2018, vol. 70-71, str. 1-12. ISSN 0925-7721. http://doi.org/10.1016/j.comgeo.2017.12.001, DOI: 10.1016/j.comgeo.2017.12.001. [COBISS.SI-ID 18208601]

177. CABELLO, Sergio (urednik), MOHAR, Bojan (urednik). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. 171 str. ISBN 978-961-92681-1-7. https://conferences.matheo.si/event/28/material/0/4.pdf, https://conferences.matheo.si/event/28/attachments/150/289/ALL_together_book_of_abstracts_webpage.pdf, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 300523520]

178. KOTAR CELARC, Staš. Aproksimacijski algoritmi za računanje povprečne razdalje med točkami : delo diplomskega seminarja. Ljubljana: [S. Kotar Celarc], 2019. 24 str. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 18723929]

179. CABELLO, Sergio, CHAN, Timothy M. Computing Shapley values in the plane. V: BAREQUET, Gill (ur.), WANG, Yusu (ur.). 35th International Symposium on Computational Geometry : SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, june 2019. 19 str. Leibniz international proceedings in informatics, 129. ISBN 978-3-95977-104-7. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2019/10424/pdf/LIPIcs-SoCG-2019-20.pdf, DOI: 10.4230/LIPIcs.SoCG.2019.20. [COBISS.SI-ID 18779481]

180. BERG, Mark de, CABELLO, Sergio, CHEONG, Otfried, EPPSTEIN, David, KNAUER, Christian. Covering many points with a small-area box. Journal of computational geometry. 2019, vol. 10, no. 1, str. 207-222. ISSN 1920-180X. https://doi.org/10.20382/jocg.v10i1a8, DOI: 10.20382/jocg.v10i1a8. [COBISS.SI-ID 18780249]

181. CHOI, Jongmin, CABELLO, Sergio, AHN, Hee-Kap. Maximizing dominance in the plane and its applications. V: FRIGGSTAD, Zachary (ur.), SACK, Jörg-Rüdiger (ur.), SALAVATIPOUR, Mohammad R. (ur.). Algorithms and data structures : proceedings. 6th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019. Cham: Springer, cop. 2019. Str. 325-338. Lecture notes in computer science, 11646. ISBN 978-3-030-24765-2, ISBN 978-3-030-24766-9. ISSN 0302-9743. https://doi.org/10.1007/978-3-030-24766-9_24, DOI: 10.1007/978-3-030-24766-9_24. [COBISS.SI-ID 18779993]

182. CABELLO, Sergio, MULZER, Wolfgang. Maximum matchings in geometric intersection graphs. V: CABELLO, Sergio (ur.), MOHAR, Bojan (ur.). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. Str. 62. ISBN 978-961-92681-1-7. [COBISS.SI-ID 18679641]

183. LAJOVIC, Luka. Najkrajša pot in pot z najmanj ovinki : delo diplomskega seminarja. Ljubljana: [L. Lajovic], 2019. 38 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 18771033]

184. BINIAZ, Ahmad, CABELLO, Sergio, CARMI, Paz, DE CARUFEL, Jean-Lou, MAHESHWARI, Anil, MEHRABI, Saeed, SMID, Michiel. On the minimum consistent subset problem. V: FRIGGSTAD, Zachary (ur.), SACK, Jörg-Rüdiger (ur.), SALAVATIPOUR, Mohammad R. (ur.). Algorithms and data structures : proceedings. 6th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019. Cham: Springer, cop. 2019. Str. 155-167. Lecture notes in computer science, 11646. ISBN 978-3-030-24765-2, ISBN 978-3-030-24766-9. ISSN 0302-9743. https://doi.org/10.1007/978-3-030-24766-9_12, DOI: 10.1007/978-3-030-24766-9_12. [COBISS.SI-ID 18779737]

185. BURTON, Benjamin, CABELLO, Sergio, KRATSCH, Stefan, PETTERSSON, William. The parameterized complexity of finding a 2-sphere in a simplicial complex. SIAM journal on discrete mathematics. 2019, vol. 33, no. 4, str. 2092-2110. ISSN 0895-4801. https://doi.org/10.1137/18M1168704, DOI: 10.1137/18M1168704. [COBISS.SI-ID 18779225]

186. SIAM journal on discrete mathematics. CABELLO, Sergio (urednik 2017-2019). Philadelphia, Pa.: SIAM, 1988-. ISSN 0895-4801. [COBISS.SI-ID 26388736]

187. CABELLO, Sergio. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM transactions on algorithms. May 2019, vol. 15, no. 2, art. 21 (38 str.). ISSN 1549-6325. https://doi.org/10.1145/3218821, DOI: 10.1145/3218821. [COBISS.SI-ID 18515545]

188. CABELLO, Sergio (urednik), CHEN, Danny Z. (urednik). 36th International Symposium on Computational Geometry : SoCG 2020, June 23-26, 2020, Zürich, Switzerland (Virtual Conference). Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June 2020. 1 spletni vir (1 datoteka PDF [1222 str.]). Leibniz international proceedings in informatics, 164. ISBN 978-3-95977-143-6. ISSN 1868-8969. http://www.dagstuhl.de/dagpub/978-3-95977-143-6, https://drops.dagstuhl.de/opus/volltexte/2020/12157/pdf/lipics-vol164-socg2020-complete.pdf, DOI: 10.4230/LIPIcs.SoCG.2020.0. [COBISS.SI-ID 20842243]

189. CABELLO, Sergio, COLIN DE VERDIÈRE, Éric. Hardness of minimum barrier shrinkage and minimum installation path. Theoretical computer science. Oct. 2020, vol. 835, str. 120-133. ISSN 0304-3975. https://doi.org/10.1016/j.tcs.2020.06.016, DOI: 10.1016/j.tcs.2020.06.016. [COBISS.SI-ID 20842499]

190. BONNET, Édouard, CABELLO, Sergio, MOHAR, Bojan, PÉREZ-ROSÉS, Hebert. The inverse Voronoi problem in graphs. I, Hardness. Algorithmica. Oct. 2020, vol. 82, iss. 10, str. 3018-3040. ISSN 0178-4617. https://doi.org/10.1007/s00453-020-00716-4, DOI: 10.1007/s00453-020-00716-4. [COBISS.SI-ID 20843267]

191. RIBIČ, Uroš. Iskanje ravninskih regij : magistrsko delo : magistrski študijski program druge stopnje Računalništvo in informatika. Ljubljana: [U. Ribič], 2020. 44 str., ilustr. https://repozitorij.uni-lj.si/IzpisGradiva.php?id=122368&lang=slv, Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 42017795]

192. BONNET, Édouard, CABELLO, Sergio, MULZER, Wolfgang. Maximum matchings in geometric intersection graphs. V: PAUL, Christophe (ur.), BLÄSER, Markus (ur.). 37th Symposium on Theoretical Aspects of Computer Science : STACS 2020, March 10-13, 2020, Montpellier, France. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, March 2020. 1 spletni vir (1 datoteka pdf (17 str.)). Leibniz international proceedings in informatics, 154. ISBN 978-3-95977-140-5. ISSN 1868-8969. https://drops.dagstuhl.de/opus/volltexte/2020/11892/pdf/LIPIcs-STACS-2020-31.pdf, https://drops.dagstuhl.de/opus/volltexte/2020/11892, DOI: 10.4230/LIPIcs.STACS.2020.31. [COBISS.SI-ID 12836611]

193. CABELLO, Sergio, JAIN, Kshitij, LUBIW, Anna, MONDAL, Debajyoti. Minimum shared-power edge cut. Networks. Apr. 2020, vol. 75, iss. 3, str. 321-333, ilustr. ISSN 0028-3045. https://doi.org/10.1002/net.21928, DOI: 10.1002/net.21928. [COBISS.SI-ID 12950019]

194. CABELLO, Sergio. Some open problems in computational geometry. V: ESPARZA, Javier (ur.), KRÁL', Daniel (ur.). 45th International Symposium on Mathematical Foundations of Computer Science : MFCS 2020, August 25-26, 2020, Prague, Czech Republic. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Aug. 2020. 1 spletni vir (1 datoteka pdf (6 str.)). Leibniz international proceedings in informatics, 170. ISBN 978-3-95977-159-7. ISSN 1868-8969. https://drops.dagstuhl.de/opus/volltexte/2020/12673/pdf/LIPIcs-MFCS-2020-2.pdf, https://drops.dagstuhl.de/opus/volltexte/2020/11892, DOI: 10.4230/LIPIcs.MFCS.2020.2. [COBISS.SI-ID 48564739]

195. BONNET, Édouard, CABELLO, Sergio. The complexity of mixed-connectivity. Annals of operations research. Dec. 2021, vol. 307, iss. 1-2, str. 25-35. ISSN 0254-5330. https://link.springer.com/article/10.1007/s10479-021-04330-7, DOI: 10.1007/s10479-021-04330-7. [COBISS.SI-ID 81273091]

196. CABELLO, Sergio, DAS, Arun Kumar, DAS, Sandip, MUKHERJEE, Joydeep. Finding a largest-area triangle in a terrain in near-linear time. V: LUBIW, Anna (ur.), SALAVATIPOUR, Mohammad R. (ur.). Algorithms and data structures : 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021 : proceedings. 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021. Cham: Springer Nature, cop. 2021. Str. 258-270, ilustr. Lecture notes in computer science, 12808. ISBN 978-3-030-83507-1, ISBN 978-3-030-83508-8. ISSN 0302-9743. https://link.springer.com/chapter/10.1007/978-3-030-83508-8_19, DOI: 10.1007/978-3-030-83508-8_19. [COBISS.SI-ID 101203459]

197. BONNET, Édouard, CABELLO, Sergio, MOHAR, Bojan, PÉREZ-ROSÉS, Hebert. The inverse Voronoi problem in graphs. II, Trees. Algorithmica. May 2021, vol. 83, iss. 5, str. 1165-1200. ISSN 0178-4617. https://doi.org/10.1007/s00453-020-00774-8, DOI: 10.1007/s00453-020-00774-8. [COBISS.SI-ID 38697987]

198. CHOI, Jongmin, CABELLO, Sergio, AHN, Hee-Kap. Maximizing dominance in the plane and its applications. Algorithmica. Nov. 2021, vol. 83, iss. 11, str. 3491-3513. ISSN 0178-4617. https://link.springer.com/article/10.1007%2Fs00453-021-00863-2, DOI: 10.1007/s00453-021-00863-2. [COBISS.SI-ID 76706563]

199. CABELLO, Sergio, MULZER, Wolfgang. Minimum cuts in geometric intersection graphs. Computational geometry. [Print ed.]. March 2021, vol. 94, art. 101720 (9 str.). ISSN 0925-7721. https://doi.org/10.1016/j.comgeo.2020.101720. [COBISS.SI-ID 38697219]

200. BINIAZ, Ahmad, CABELLO, Sergio, CARMI, Paz, DE CARUFEL, Jean-Lou, MAHESHWARI, Anil, MEHRABI, Saeed, SMID, Michiel. On the minimum consistent subset problem. Algorithmica. July 2021, vol. 83, iss. 7, str. 2273-2302. ISSN 0178-4617. https://link.springer.com/article/10.1007/s00453-021-00825-8, DOI: 10.1007/s00453-021-00825-8. [COBISS.SI-ID 76556291]

201. PIRC, Klementina. Računanje notranjega obsega ravninskih grafov : delo diplomskega seminarja. Ljubljana: [K. Pirc], 2021. 29 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 58400259]

202. BAE, Sang Won, CABELLO, Sergio, CHEONG, Otfried, CHOI, Yoonsung, STEHN, Fabian, YOON, Sang Duk. The reverse Kakeya problem. Advances in geometry. Jan. 2021, vol. 21, iss. 1, str. 75-84. ISSN 1615-715X. https://doi.org/10.1515/advgeom-2020-0030, DOI: 10.1515/advgeom-2020-0030. [COBISS.SI-ID 48386307]

203. CABELLO, Sergio (urednik), KRNC, Matjaž (urednik), MILANIČ, Martin (urednik). 10th Workshop on Graph Classes, Optimization, and Width Parameters : GROW 2022 : book of abstracts : 19-22 September 2022, Koper, Slovenia. Ljubljana: samozal. M. Krnc, 2022. 1 spletni vir (1 datoteka PDF (20 str.)). ISBN 978-961-07-1270-1. https://grow.famnit.upr.si/GROW-BOA.pdf, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 120360195]

204. CABELLO, Sergio (urednik), KRNC, Matjaž (urednik), MILANIČ, Martin (urednik). 10th Workshop on Graph Classes, Optimization, and Width Parameters : GROW 2022 : book of open problems : 19-22 September 2022, Koper, Slovenia. Version 1.0. Ljubljana: publisher M. Krnc, 2022. 1 spletni vir (1 datoteka PDF (18 str.)), ilustr. ISBN 978-961-07-1311-1. https://grow.famnit.upr.si/GROW-BOP.pdf, Digitalna knjižnica Slovenije - dLib.si, DOI: 10.5281/zenodo.7143192. [COBISS.SI-ID 124271875]

205. CABELLO, Sergio, CHAN, Timothy M. Computing Shapley values in the plane. Discrete & computational geometry. Apr. 2022, vol. 67, iss. 3, str. 843-881. ISSN 0179-5376. https://link.springer.com/article/10.1007/s00454-021-00368-3, DOI: 10.1007/s00454-021-00368-3. [COBISS.SI-ID 99467779]

206. CABELLO, Sergio. Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. ACM transactions on algorithms. Apr. 2022, vol. 18, no. 2, art. 14 (26 str.). ISSN 1549-6325. https://dl.acm.org/doi/pdf/10.1145/3501303, DOI: 10.1145/3501303. [COBISS.SI-ID 100648963]

207. Discrete & computational geometry. CABELLO, Sergio (gostujoči urednik 2022). New York; Berlin; Heidelberg; Tokyo: Springer, 1986-. ISSN 0179-5376. [COBISS.SI-ID 25342208]

208. CABELLO, Sergio, CHEN, Danny Z. Guest editors’ foreword. Discrete & computational geometry. Dec. 2022, vol. 68, iss. 4, str. 945-948. ISSN 0179-5376. https://link.springer.com/article/10.1007/s00454-022-00435-3, DOI: /10.1007/s00454-022-00435-3. [COBISS.SI-ID 131969027]

209. ROJC, Blaž. Indeksna stuktura za učinkovito vzporedno iskanje in vstavljanje točk v večdimenzijskem prostoru : magistrsko delo. Ljubljana: [B. Rojc], 2022. VII, 45 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 120760323]

210. CABELLO, Sergio, CHEONG, Otfried, DOBBINS, Michael Gene. The inverse Kakeya problem. Periodica mathematica Hungarica. March 2022, vol. 84, iss. 1, str. 70-75. ISSN 0031-5303. https://link.springer.com/article/10.1007%2Fs10998-021-00392-z, DOI: 10.1007/s10998-021-00392-z. [COBISS.SI-ID 76709379]

211. CABELLO, Sergio, HOFFMANN, Michael, KLOST, Katharina, MULZER, Wolfgang, TKADLEC, Josef. Long plane trees. V: GOAOC, Xavier (ur.), KERBER, Michael (ur.). 38th International Symposium on Computational Geometry : SoCG 2022, June 7-10, 2022, Berlin, Germany. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June 2022. 1 spletni vir (1 datoteka pdf (17 str.)). Leibniz international proceedings in informatics, 224. ISBN 978-3-95977-227-3. ISSN 1868-8969. https://drops.dagstuhl.de/opus/volltexte/2022/16031/pdf/LIPIcs-SoCG-2022-23.pdf, https://drops.dagstuhl.de/opus/volltexte/2022/16031, DOI: 10.4230/LIPIcs.SoCG.2022.23. [COBISS.SI-ID 133237763]

212. CABELLO, Sergio, FMF seminar za učitelje matematike, Fakulteta za matematiko in fiziko, Ljubljana, 9.-10. 9. 2022. Voronojevi diagrami : Ljubljana, 10. 9. 2022. [COBISS.SI-ID 126639363]

213. CABELLO, Sergio. Faster distance-based representative skyline and k-center along pareto front in the plane. Journal of global optimization. June 2023, vol. 86, iss. 2, str. 441-466. ISSN 0925-5001. https://link.springer.com/article/10.1007/s10898-023-01280-1, Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.1007/s10898-023-01280-1. [COBISS.SI-ID 145465859]

214. BONNET, Édouard, CABELLO, Sergio, MULZER, Wolfgang. Maximum matchings in geometric intersection graphs. Discrete & computational geometry. Oct. 2023, vol. 70, iss. 3, str. 550-579. ISSN 0179-5376. https://link.springer.com/article/10.1007/s00454-023-00564-3, Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.1007/s00454-023-00564-3. [COBISS.SI-ID 163998979]

215. MARINKO, Matej. Odpornost ovir na pravokotni domeni : magistrsko delo. Ljubljana: [M. Marinko], 2023. VI, 62 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 166764291]

216. CABELLO, Sergio, GIANNOPOULOS, Panos. On ▫$k$▫-means for segments and polylines. V: GØRTZ, Inge Li (ur.), et al. 31st Annual European Symposium on Algorithms : ESA 2023, September 4–6, 2023, Amsterdam, The Netherlands. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2023. 14 str. Leibniz international proceedings in informatics, vol. 274. ISBN 978-3-95977-295-2. ISSN 1868-8969. https://drops.dagstuhl.de/opus/volltexte/2023/18681/, DOI: 10.4230/LIPIcs.ESA.2023.28. [COBISS.SI-ID 164055811]

217. CABELLO, Sergio, FMF seminar za učitelje matematike, Fakulteta za matematiko in fiziko, Ljubljana, 20.-21. 1. 2023. Prekrižna števila grafov : Ljubljana, 21. 1. 2023. [COBISS.SI-ID 143288067]

218. AICHHOLZER, Oswin, CABELLO, Sergio, MÉSZÁROS, Viola, SOUKUP, Jan. Connected matchings. V: 40th European Workshop on Computational Geometry : booklet of abstracts : March 13-15, 2024, Ioannina, Greece. Ioannina: [s. n.], 2024. Str. 54:1-54:7, ilustr. https://eurocg2024.math.uoi.gr/data/uploads/EuroCG2024-booklet.pdf. [COBISS.SI-ID 218475267]

219. CABELLO, Sergio, GAJSER, David. Connectivity with uncertainty regions given as line segments. Algorithmica. May 2024, vol. 86, iss. 5, str. 1512-1544. ISSN 0178-4617. Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.1007/s00453-023-01200-5. [COBISS.SI-ID 180364547]
projekt: P1-0297 Teorija grafov; financer: ARIS
projekt: J1-1693 Sodobni in novi metrični koncepti v teoriji grafov; financer: ARIS
projekt: J1-2452 Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov; financer: ARIS
projekt: N1-0218 Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov; financer: ARIS
projekt: N1-0285 Metrični problemi v grafih in hipergrafih; financer: ARIS

220. CABELLO, Sergio, GIANNOPOULOS, Panos. Delaunay triangulation and convex polygons with predictions. V: 40th European Workshop on Computational Geometry : booklet of abstracts : March 13-15, 2024, Ioannina, Greece. Ioannina: [s. n.], 2024. Str. 57:1-57:7, ilustr. https://eurocg2024.math.uoi.gr/data/uploads/EuroCG2024-booklet.pdf. [COBISS.SI-ID 218477827]

221. AGRAWAL, Akanksha, CABELLO, Sergio, KAUFMANN, Michael, SAURABH, Saket, SHARMA, Roohani, UNO, Yushi, WOLFF, Alexander. Eliminating crossings in ordered graphs. V: BODLAENDER, Hans L. (ur.). 19th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2024, June 12-14, 2024, Helsinki, Finland. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik: Dagstuhl Publishing, 2024. 1:1-1:19 str., ilustr. LIPIcs - Leibniz International Proceedings in Informatics, vol. 294. ISBN 978-3-95977-318-8. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.1, Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.4230/LIPIcs.SWAT.2024.1. [COBISS.SI-ID 218342147]

222. CABELLO, Sergio, CHENG, Siu-Wing, CHEONG, Otfried, KNAUER, Christian. Geometric matching and bottleneck problems. V: MULZER, Wolfgang (ur.), PHILLIPS, Jeff M. (ur.). 40th International Symposium on Computational Geometry : SoCG 2024, June 11-14, 2024, Athens, Greece. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2024. Str. 31:1-31:15, graf. prikazi. Leibniz international proceedings in informatics, vol. 293. ISBN 978-3-95977-316-4. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.31, Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.4230/LIPIcs.SoCG.2024.31. [COBISS.SI-ID 218353667]

223. MILIVOJEVIĆ, Peter. Igre ustvarjanja omrežja : delo diplomskega seminarja. Ljubljana: [P. Milivojević], 2024. 32 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 208333827]

224. CABELLO, Sergio, CZABARKA, Éva, FABILA-MONROY, Ruy, HIGASHIKAWA, Yuya, SEIDEL, Raimund, SZÉKELY, László, TKADLEC, Josef, WESOLEK, Alexandra. A note on the 2-colored rectilinear crossing number of random point sets in the unit square. Acta mathematica Hungarica. Jun. 2024, vol. 173, iss. 1, str. 214-226, ilustr. ISSN 0236-5294. https://link.springer.com/article/10.1007/s10474-024-01436-9, Repozitorij Univerze v Ljubljani – RUL, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.1007/s10474-024-01436-9. [COBISS.SI-ID 206428931]

225. VELKAVERH, Jaka. Razširjanje zaupanja za lokalizacijo senzorskih omrežij : delo diplomskega seminarja. Ljubljana: [J. Velkaverh], 2024. 35 str., ilustr. Repozitorij Univerze v Ljubljani – RUL. [COBISS.SI-ID 208465155]

226. AICHHOLZER, Oswin, CABELLO, Sergio, MÉSZÁROS, Viola, SCHNIDER, Patrick, SOUKUP, Jan. Connected matchings. Computational geometry. [Print ed.]. Dec. 2025, vol. 129, [article no.] 102174, 15 str., ilustr. ISSN 0925-7721. https://www.sciencedirect.com/science/article/pii/S0925772125000124, Repozitorij Univerze v Ljubljani – RUL, DOI: 10.1016/j.comgeo.2025.102174. [COBISS.SI-ID 228691203]

227. Discrete mathematics & theoretical computer science. CABELLO, Sergio (področni urednik 2023-). Strasbourg: DMTCS, 2015-. ISSN 1365-8050. https://dmtcs.episciences.org/. [COBISS.SI-ID 8089433]

228. CABELLO, Sergio, DAS, Arun Kumar, DAS, Sandip, MUKHERJEE, Joydeep. Finding a largest-area triangle in a terrain in near-linear time. Computational geometry. [Print ed.]. Sep. 2025, vol. 128, [article no.] 102171, 13 str., ilustr. ISSN 0925-7721. https://www.sciencedirect.com/science/article/pii/S0925772125000094, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, Repozitorij Univerze v Ljubljani – RUL, DOI: 10.1016/j.comgeo.2025.102171. [COBISS.SI-ID 228678147]

229. Indian journal of discrete mathematics. CABELLO, Sergio (član uredniškega odbora 2021-). Mysore: Academy of Discrete Mathematics and its Applications, 2015-. ISSN 2455-5819. http://ijdm.adma.co.in/. [COBISS.SI-ID 25051656]

230. JCMCC. CABELLO, Sergio (urednik 2024-). Winnipeg (CAN): Charles Babbage Research Centre, 1987-. ISSN 0835-3026. http://www.combinatorialmath.ca/JCMCC/. [COBISS.SI-ID 7396697]

231. Journal of computational geometry. CABELLO, Sergio (gostujoči urednik 2021, član uredniškega odbora 2010-). Ottawa: Computational Geometry Lab, Carleton University, 2010-. ISSN 1920-180X. http://jocg.org/index.php/jocg/issue/archive. [COBISS.SI-ID 15571801]

Sergio Cabello

Osebna bibliografija za obdobje 1999-2025

1999

2001

2002

2003

2004

2005

2006

2007

2008

2009

2010

2011

2012

2013

2014

2015

2016

2017

2018

2019

2020

2021

2022

2023

2024

2025