HOME cs.uu.nl home education contact library calendar search UU.NL
about us research people archive services jobs

publications by dr. S. Cabello Justo

Sergio  Cabello Justo

dr. S. Cabello Justo

some publications

Cabello Justo, S., Kreveld, M.J. van, Liotta, G., Meijer, H., Speckmann, B. & Verbeek, K. (2011). Geometric simultaneous embeddings of a graph and a matching. Journal of Graph Algorithms and Applications, 15, 79-96.

Cabello, S., Haverkort, H.J., Kreveld, M.J. van & Speckmann, B. (2010). Algorithmic Aspects of Proportional Symbol Maps. Algorithmica, 58(3), 543-565.

Buchin, K.A., Cabello, S., Gudmundsson, J., Loeffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B. & Wolle, T. (2009). Detecting Hotspots in Geographic Networks. In M. Sester, L. Bernard & V. Paelke (Eds.), Advances in GIScience, Proc.\ 12th AGILE International Conference on Geographic Information Science (pp. 217-231). Springer.

Buchin, K.A., Cabello, S., Gudmundsson, J., L\"offler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B. & Wolle, T. (2009). Detecting Hotspots in Geographic Networks. In M. Sester, L. Bernard & V. Paelke (Eds.), Advances in GIScience, Proc.\ 12th AGILE International Conference on Geographic Information Science (pp. 217-231). Springer.

Cabello, S., Berg, M. van den, Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2009). Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion. International Journal of Computational Geometry and Applications, 533-556.

Cabello, S., Haverkort, H., Kreveld, M.J. van & Speckmann, B. (2008). Algorithmic Aspects of Proportional Symbol Maps. (UU-CS 2008-008). onbekend: UU WINFI Informatica en Informatiekunde.

Cabello, S., Haverkort, H., Kreveld, M.J. van & Speckmann, B. (2006). Algorithmic Aspects of Proportional Symbol Maps. In Proc. 14th Europ. Symp. on Algorithms (pp. 720-731). Berlin: Springer.

Bose, J., Cabello, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2006). Area-preserving approximations of polygonal paths. J. of Discrete Algorithms, 4, 554-566.

Cabello, S., Berg, M.T. de & Kreveld, M.J. van (2005). Schematization of networks. Comput. Geom. Theory & Appl., 30, 223-238.

Bose, P., Cabello Justo, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2004). Area-Preserving Approximations of Polygonal Paths. (UU-CS 2004-043). Utrecht: Utrecht University: Information and Computing Sciences.

Cabello Justo, S. (2004, March 29). Geometric problems in cartographic networks. UU Universiteit Utrecht (134 pag.). Prom./coprom.: prof. dr. M.H. Overmars & Prof.dr. M.J. van Kreveld.

Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In A. Márquez (Ed.), Abstracts of the 20th European Workshop on Computational Geometry (pp. 73-76). Universidad de Sevilla.

Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In T. Hagerup & J. Katajainen (Eds.), Algorithm Theory, Proc. 9th Scandinavian Workshop (SWAT 2004) (pp. 138-149). Springer-Verlag.

Berg, M.T. de, Cabello Justo, S., Giannopoulos, P. & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. (UU-CS 2004-014). Utrecht: Utrecht University: Information and Computing Sciences.

Cabello, S. & Kreveld, M.J. van (2003). Approximation Algorithms for Aligning Points. Algorithmica, 37, 211-232.

Cabello, S. & Kreveld, M.J. van (2004). Approximation Algorithms for Aligning Points. In Proc. 19th ACM Symp. on Computational Geometry Algorithmica (pp. 20-28).

Cabello, S. (2003). Approximation Algorithms for Spreading Points. (UU-CS 2003-040). Utrecht: Utrecht University: Information and Computing Sciences.

Cabello Justo, S. & Kreveld, M.J. van (2003). Approximation algorithms for aligning points. (UU-CS 2003-003). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Cabello, S. (2003). Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. (UU-CS 2003-031). Utrecht: Utrecht University: Information and Computing Sciences.

Cabello Justo, S. & Kreveld, M.J. van (2002). Schematic Networks: an Algorithm and it's Implementation. In D.E. Richardson & P. van Oosterom (Eds.), 10 International Symposium on Spatial Data Handling (SDH) (pp. 475-486). Ottawa, USA.

Cabello Justo, S., Padro, C. & Saez, G. (2002). Secret sharing schemes with detection of cheaters for a general access structure. Designs, codes and cryptography, 25, 175-188.

Cabello Justo, S., Liu, Y., Mantler, A. & Snoeyink, J. (2002). Testing Homotopy for Paths in the Plane. In Proceedings of the 18th ACM Symposium on Computational Geometry (pp. 160-169). Barcelona, Spain.

Cabello Justo, S., Berg, M.T. de, Dijk, S.F. van, Kreveld, M.J. van & Strijk, T.W. (2001). Schematization of Road Networks. In Proc. 17th ACM Symp. on Computational Geometry (pp. 33-39). New York, U.S.A.: ACM Press.


valid-html401 webmaster@cs.uu.nl, Tue, 18 Jun 2013 08:05:23 +0200 ← Departement Informatica, Universiteit Utrecht