Search the dblp DataBase

Publications of Author

1. Valentin Polishchuk
   The box mover problem. [Citation Graph (0, 0)][DBLP]
   CCCG, 2004, pp:36-39 [Conf]
   
2. Valentin Polishchuk, Joseph S. B. Mitchell
   k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:101-104 [Conf]
   
3. Valentin Polishchuk, Joseph S. B. Mitchell
   Touring Convex Bodies - A Conic Programming Solution. [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:290-293 [Conf]
   
4. Valentin Polishchuk, Joseph S. B. Mitchell
   Thick non-crossing paths and minimum-cost flows in polygonal domains. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2007, pp:56-65 [Conf]
   
5. Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk
   The Tsp and the Sum of its Marginal Values. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:333-344 [Journal]
   
6. Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell
   Hamiltonian Cycles in Triangular Grids. [Citation Graph (0, 0)][DBLP]
   CCCG, 2006, pp:- [Conf]
   
7. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk
   The Snowblower Problem [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
8. 
   Optimal Backlog in the Plane. [Citation Graph (, )][DBLP]
   
   
9. 
   Routing a maximum number of disks through a scene of moving obstacles. [Citation Graph (, )][DBLP]
   
   
10. 
    Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]
    
    
11. 
    Shape approximation using k-order alpha-hulls. [Citation Graph (, )][DBLP]
    
    
12. 
    Data transmission and base-station placement for optimizing network lifetime. [Citation Graph (, )][DBLP]
    
    
13. 
    Improved Approximation Algorithms for Relay Placement. [Citation Graph (, )][DBLP]
    
    
14. 
    Periodic Multi-labeling of Public Transit Lines. [Citation Graph (, )][DBLP]
    
    
15. 
    Brief announcement: distributed almost stable marriage. [Citation Graph (, )][DBLP]
    
    
16. 
    Robust curve reconstruction with k-order alpha-shapes. [Citation Graph (, )][DBLP]
    
    
17. 
    A Local 2-Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Simple Wriggling Is Hard Unless You Are a Fat Hippo. [Citation Graph (, )][DBLP]
    
    
19. 
    The Snowblower Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP]
    
    
21. 
    Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]
    
    
22. 
    Optimal backlog in the plane [Citation Graph (, )][DBLP]
    
    
23. 
    A simple local 3-approximation algorithm for vertex cover [Citation Graph (, )][DBLP]
    
    
24. 
    Almost stable matchings in constant time [Citation Graph (, )][DBLP]
    
    
25. 
    Local algorithms in (weakly) coloured graphs [Citation Graph (, )][DBLP]
    
    
26. 
    Simple Wriggling is Hard unless You Are a Fat Hippo [Citation Graph (, )][DBLP]
    
    
27. 
    Geodesic diameter of a polygonal domain in O(n^4 log n) time [Citation Graph (, )][DBLP]