The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vladlen Koltun: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian
    Hardware-Assisted Natural Neighbor Interpolation. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:111-120 [Conf]
  2. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    On lines avoiding unit balls in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:36-45 [Conf]
  3. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the union of kapa-round objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:383-390 [Conf]
  4. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between points and circles in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:116-122 [Conf]
  5. Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg
    Efficient algorithms for shared camera control. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:68-77 [Conf]
  6. Vladlen Koltun
    Segment intersection searching problems in general settings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:197-206 [Conf]
  7. Vladlen Koltun, Micha Sharir
    Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:217-226 [Conf]
  8. Vladlen Koltun, Micha Sharir
    Polyhedral Voronoi diagrams of polyhedra in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:227-236 [Conf]
  9. Vladlen Koltun, Micha Sharir
    Curve-sensitive cuttings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:136-143 [Conf]
  10. Vladlen Koltun, Micha Sharir
    On overlays and minimization diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:395-401 [Conf]
  11. Vladlen Koltun
    Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:56-65 [Conf]
  12. Vladlen Koltun, Micha Sharir
    The Partition Technique for Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:637-0 [Conf]
  13. Vladlen Koltun, Christos H. Papadimitriou
    Approximately Dominating Representatives. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:204-214 [Conf]
  14. Sariel Har-Peled, Vladlen Koltun
    Separability with Outliers. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:28-39 [Conf]
  15. Vladlen Koltun, Yiorgos Chrysanthou, Daniel Cohen-Or
    Virtual Occluders: An Efficient Intermediate PVS Representation. [Citation Graph (0, 0)][DBLP]
    Rendering Techniques, 2000, pp:59-70 [Conf]
  16. Vladlen Koltun, Yiorgos Chrysanthou, Daniel Cohen-Or
    Hardware-Accelerated from-Region Visibility Using a Dual Ray Space. [Citation Graph (0, 0)][DBLP]
    Rendering Techniques, 2001, pp:205-216 [Conf]
  17. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:682-690 [Conf]
  18. Vladlen Koltun
    Pianos are not flat: rigid motion planning in three dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:505-514 [Conf]
  19. Vladlen Koltun, Micha Sharir
    On the overlay of envelopes in four dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:810-819 [Conf]
  20. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting triangular cycles of lines in space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:547-555 [Conf]
  21. Vladlen Koltun, Carola Wenk
    Matching Polyhedral Terrains Using Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:114-126 [Conf]
  22. Jason D. Hartline, Vladlen Koltun
    Near-Optimal Pricing in Near-Linear Time. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:422-431 [Conf]
  23. Vladlen Koltun
    Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:99-110 [Conf]
  24. Vladlen Koltun, Carola Wenk
    Matching Polyhedral Terrains Using Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:3, pp:159-183 [Journal]
  25. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    Lines Avoiding Unit Balls in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:231-250 [Journal]
  26. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between Points and Circles in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:185-206 [Journal]
  27. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting Triangular Cycles of Lines in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:231-247 [Journal]
  28. Vladlen Koltun
    Segment Intersection Searching Problems in General Settings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:25-44 [Journal]
  29. Vladlen Koltun
    Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:3, pp:435-460 [Journal]
  30. Vladlen Koltun, Micha Sharir
    Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:83-124 [Journal]
  31. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the Union of kappa-Round Objects in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:511-526 [Journal]
  32. Vladlen Koltun
    Ready, Set, Go! The Voronoi diagram of moving points that start from a line. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:5, pp:233-235 [Journal]
  33. Vladlen Koltun
    Almost tight upper bounds for vertical decompositions in four dimensions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:5, pp:699-730 [Journal]
  34. Vladlen Koltun, Micha Sharir
    3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:616-642 [Journal]
  35. Vladlen Koltun, Micha Sharir
    The Partition Technique for Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:841-863 [Journal]
  36. Vladlen Koltun, Micha Sharir
    Curve-Sensitive Cuttings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:863-878 [Journal]
  37. Dimitris Achlioptas, Vladlen Koltun
    Special Section on Foundations of Computer Science. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:165- [Journal]
  38. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:209-227 [Journal]
  39. Vladlen Koltun, Christos H. Papadimitriou
    Approximately dominating representatives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:371, n:3, pp:148-154 [Journal]

  40. Kinetic stable Delaunay graphs. [Citation Graph (, )][DBLP]


  41. Smoothed analysis of probabilistic roadmaps. [Citation Graph (, )][DBLP]


  42. On Overlays and Minimization Diagrams. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
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