The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Orden: [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. David Orden, Francisco Santos
    Asymptotically efficient triangulations of the d-cube. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:167-169 [Conf]
  3. 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]
  4. Diego R. Llanos Ferraris, David Orden, Belén Palop
    MESETA: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2005, pp:121-128 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. Diego R. Llanos Ferraris, David Orden, Belén Palop
    New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:6, pp:839-852 [Journal]
  12. Oswin Aichholzer, Jesus Garcia, David Orden, Pedro Ramos
    New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:1-14 [Journal]

  13. Just-In-Time Scheduling for Loop-based Speculative Parallelization. [Citation Graph (, )][DBLP]


  14. Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]


  15. Decomposition of Multiple Coverings into More Parts [Citation Graph (, )][DBLP]


  16. Decomposition of Multiple Coverings into More Parts. [Citation Graph (, )][DBLP]


  17. New results on lower bounds for the number of (<=k)-facets. [Citation Graph (, )][DBLP]


Search in 0.278secs, Finished in 0.280secs
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