Vladlen Koltun

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

Coauthor Index

1	Dimitris Achlioptas	[39]
2	Pankaj K. Agarwal	[22] [24] [26] [36]
3	Boris Aronov	[8] [16] [21] [22] [24] [26] [27] [28] [35] [36]
4	Yiorgos Chrysanthou	[1] [4]
5	Daniel Cohen-Or	[1] [4]
6	Alon Efrat	[21] [34] [35]
7	Quanfu Fan	[34]
8	Kenneth Y. Goldberg	[14]
9	Sariel Har-Peled	[14] [32]
10	Jason D. Hartline	[30]
11	Shankar Krishnan	[34]
12	Christos H. Papadimitriou	[33] [38]
13	Micha Sharir	[6] [7] [8] [9] [10] [11] [12] [15] [16] [20] [21] [22] [25] [26] [27] [28] [35] [37]
14	Dezhen Song	[14]
15	Suresh Venkatasubramanian	[34]
16	Carola Wenk	[23] [29]

Colors in the list of coauthors