The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Francisco Santos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
    On the Number of Pseudo-Triangulations of Certain Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:141-144 [Conf]
  2. Daciana Bochis, Francisco Santos
    Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedr. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos
    On bisectors for convex distance functions in 3-space. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  4. David Orden, Francisco Santos
    Asymptotically efficient triangulations of the d-cube. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:167-169 [Conf]
  5. Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
    Counting triangulations and pseudo-triangulations of wheels. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:149-152 [Conf]
  6. Francisco Santos
    On Delaunay oriented Matroids. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:195-200 [Conf]
  7. A. Corbalan, M. L. Mazón, Tomás Recio, Francisco Santos
    On the Topological Shape of Planar Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:109-115 [Conf]
  8. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
    Planar minimally rigid graphs and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:154-163 [Conf]
  9. Fernando Tadeo Rico, Teresa Alvarez, Yolanda Martin, Susana Pérez, Francisco Santos, Susana González, José Luis Arribas, Pastora Vega
    Classification of microorganisms using image processing techniques. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 2001, pp:329-332 [Conf]
  10. Fernando Tadeo, David Matia, David Laya, Francisco Santos, Teresa Alvarez, R. C. Gonzalez
    Detection of phases in sugar crystallization using wavelets. [Citation Graph (0, 0)][DBLP]
    ICIP (3), 2001, pp:178-181 [Conf]
  11. David Orden, Francisco Santos
    The polytope of non-crossing graphs on a planar point set. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:250-257 [Conf]
  12. Francisco Santos
    Triangulations of polytopes and algebraic geometry. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:2- [Conf]
  13. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
    Planar minimally rigid graphs and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:31-61 [Journal]
  14. M. Azaola, Francisco Santos
    The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:4, pp:489-536 [Journal]
  15. M. Azaola, Francisco Santos
    The Number of Triangulations of the Cyclic Polytope C (n, n-4). [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:1, pp:29-48 [Journal]
  16. Daciana Bochis, Francisco Santos
    On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:419-444 [Journal]
  17. Jesús A. De Loera, Francisco Santos, Jorge Urrutia
    The Number of Geometric Bistellar Neighbors of a Triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:1, pp:131-142 [Journal]
  18. David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley
    Non-Crossing Frameworks with Non-Crossing Reciprocals. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:4, pp:567-600 [Journal]
  19. David Orden, Francisco Santos
    Asymptotically Efficient Triangulations of the d-Cube. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:4, pp:509-528 [Journal]
  20. David Orden, Francisco Santos
    The Polytope of Non-Crossing Graphs on a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:275-305 [Journal]
  21. Francisco Santos
    Triangulations with Very Few Geometric Bistellar Neighbors. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:15-33 [Journal]
  22. Francisco Santos
    On Delaunay Oriented Matroids for Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:2, pp:197-210 [Journal]
  23. David Orden, Francisco Santos, Brigitte Servatius, Herman Servatius
    Combinatorial pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:554-566 [Journal]
  24. Christos A. Athanasiadis, Jesús A. De Loera, Victor Reiner, Francisco Santos
    Fiber Polytopes for the Projections between Cyclic Polytopes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:19-47 [Journal]
  25. Francisco Santos
    Realizable but not Strongly Euclidean Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:767-776 [Journal]
  26. Jörg Rambau, Francisco Santos
    The Generalized Baues Problem for Cyclic Polytopes I. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:65-83 [Journal]
  27. Francisco Santos, Achill Schürmann, Frank Vallentin
    Lattice Delone simplices with super-exponential volume. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:801-806 [Journal]
  28. Francisco Santos
    Inscribing a Symmetric Body in an Ellipse. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:4, pp:175-178 [Journal]
  29. Francisco Santos, Bernd Sturmfels
    Higher Lawrence configurations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:103, n:1, pp:151-164 [Journal]
  30. Francisco Santos, Raimund Seidel
    A better upper bound on the number of triangulations of a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:1, pp:186-193 [Journal]
  31. Jesús A. De Loera, Francisco Santos, Fumihiko Takeuchi
    Extremal Properties for Dissections of Convex 3-Polytopes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:143-161 [Journal]
  32. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
    Maximizing Maximal Angles for Plane Straight-Line Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:458-469 [Conf]
  33. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
    Maximizing Maximal Angles for Plane Straight-Line Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  34. Pilar Sabariego, Francisco Santos
    Triple-loop networks with arbitrarily many minimum distance diagrams [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  35. On the number of facets of three-dimensional Dirichlet stereohedra III: Cubic group. [Citation Graph (, )][DBLP]


  36. A counterexample to the Hirsch conjecture [Citation Graph (, )][DBLP]


  37. On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups. [Citation Graph (, )][DBLP]


  38. Multitriangulations as Complexes of Star Polygons. [Citation Graph (, )][DBLP]


  39. Triple-loop networks with arbitrarily many minimum distance diagrams. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.307secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002