The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xuehou Tan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Xuehou Tan
    Finding an Optimal Bridge between Two Polygons. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:170-180 [Conf]
  2. Xuehou Tan
    Approximation Algorithms for Cutting Out Polygons with Lines and Rays. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:534-543 [Conf]
  3. Xuehou Tan
    Approximation Algorithms for the Watchman Route and Zookeeper's Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:201-206 [Conf]
  4. Xuehou Tan, Xiaoyu Song
    Hexagonal Routings of Multiterminal Nets. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:311-320 [Conf]
  5. Xuehou Tan, Binhai Zhu
    Two-Guarding a Rectilinear Polygon. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:391-400 [Conf]
  6. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    An Incremental Algorithm for Constructing Shortest Watchman Routes. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:163-175 [Conf]
  7. Xuehou Tan
    Searching a Simple Polygon by a k-Searcher. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:503-514 [Conf]
  8. Xuehou Tan, Tomio Hirata
    Constructing Shortest Watchman Routes by Divide-and-Conquer. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:68-77 [Conf]
  9. Xuehou Tan
    The Two-Guard Problem Revisited and Its Generalization. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:847-858 [Conf]
  10. Xuehou Tan, Tomio Hirata
    Shortest Safari Routes in Simple Polygon. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:523-531 [Conf]
  11. Xuehou Tan
    Efficient Algorithms for Searching a Polygonal Room with a Door. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:339-350 [Conf]
  12. Xuehou Tan
    A Characterization of Polygonal Regions Searchable from the Boundary. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:200-215 [Conf]
  13. Xuehou Tan
    An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:174-183 [Conf]
  14. Xuehou Tan
    An Efficient Solution to the Corridor Search Problem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:317-331 [Conf]
  15. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    Spatial Point Location and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:241-250 [Conf]
  16. Xuehou Tan
    Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:181-191 [Conf]
  17. Jin Akiyama, Mikio Kano, Xuehou Tan
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:1- [Journal]
  18. Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
    Complexity of Projected Images of Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:293-308 [Journal]
  19. Xuehou Tan
    Approximation algorithms for the watchman route and zookeeper's problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:363-376 [Journal]
  20. Xuehou Tan, Xiaoyu Song
    Routing Multiterminal Nets on a Hexagonal Grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:245-255 [Journal]
  21. Xuehou Tan
    Finding an Optimal Bridge Between Two Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:249-262 [Journal]
  22. Xuehou Tan
    Edge Guards in Straight Walkable Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:63-0 [Journal]
  23. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    An incremental algorithm for constructing shortest watchman routes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:351-365 [Journal]
  24. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:319-323 [Journal]
  25. Xuehou Tan
    On optimal bridges between two convex regions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:4-6, pp:163-168 [Journal]
  26. Xuehou Tan
    Shortest zookeeper's routes in simple polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:23-26 [Journal]
  27. Xuehou Tan
    Fast computation of shortest watchman routes in simple polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:27-33 [Journal]
  28. Xuehou Tan
    Optimal computation of the Voronoi diagram of disjoint clusters. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:3, pp:115-119 [Journal]
  29. Xuehou Tan, Tomio Hirata
    Finding shortest safari routes in simple polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:4, pp:179-186 [Journal]
  30. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    The Intersection Searching Problem for c-Oriented Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:201-204 [Journal]
  31. Xuehou Tan, Xiaoyu Song
    Hexagonal Three-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:4, pp:223-228 [Journal]
  32. Xuehou Tan
    A 2-approximation algorithm for the zookeeper's problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:5, pp:183-187 [Journal]
  33. Xuehou Tan
    Sweeping simple polygons with the minimum number of chain guards. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:66-71 [Journal]
  34. Xiaoyu Song, Xuehou Tan
    An optimal channel-routing algorithm in the times square model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:7, pp:891-898 [Journal]
  35. Xuehou Tan
    Searching a Polygonal Region by Two Guards. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:262-273 [Conf]
  36. Xuehou Tan
    A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:92-103 [Journal]

  37. Searching a Circular Corridor with Two Flashlights. [Citation Graph (, )][DBLP]


  38. Optimum Sweeps of Simple Polygons with Two Guards. [Citation Graph (, )][DBLP]


  39. New Algorithms for Barrier Coverage with Mobile Sensors. [Citation Graph (, )][DBLP]


  40. A unified and efficient solution to the room search problem. [Citation Graph (, )][DBLP]


  41. An efficient algorithm for the three-guard problem. [Citation Graph (, )][DBLP]


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