The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gordon T. Wilfong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:331-336 [Conf]
  2. Boris Aronov, Steven Fortune, Gordon T. Wilfong
    The Furthest-Site Geodesic Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:229-240 [Conf]
  3. Gordon T. Wilfong
    Motion Planning in the Presence of Movable Obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:279-288 [Conf]
  4. Gordon T. Wilfong
    Nearest Neighbor Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:224-233 [Conf]
  5. Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
    Document Classification Using Layout Analysis. [Citation Graph (0, 0)][DBLP]
    DEXA Workshop, 1999, pp:556-560 [Conf]
  6. Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
    Wide-Sense Nonblocking WDM Cross-Connects. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:538-549 [Conf]
  7. Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
    Strategic Network Formation through Peering and Service Agreements. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:77-86 [Conf]
  8. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasability of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:228-237 [Conf]
  9. Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong, George Nagy
    Why Table Ground-Truthing is Hard. [Citation Graph (0, 0)][DBLP]
    ICDAR, 2001, pp:129-133 [Conf]
  10. Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
    Document Image Layout Comparison and Classification. [Citation Graph (0, 0)][DBLP]
    ICDAR, 1999, pp:285-288 [Conf]
  11. Daniel P. Lopresti, Gordon T. Wilfong
    Evaluating Document Analysis Results via Graph Probing. [Citation Graph (0, 0)][DBLP]
    ICDAR, 2001, pp:116-120 [Conf]
  12. Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
    Policy Disputes in Path-Vector Protocols. [Citation Graph (0, 0)][DBLP]
    ICNP, 1999, pp:21-30 [Conf]
  13. Timothy Griffin, Gordon T. Wilfong
    Analysis of the MED Oscillation Problem in BGP. [Citation Graph (0, 0)][DBLP]
    ICNP, 2002, pp:90-99 [Conf]
  14. Timothy Griffin, Gordon T. Wilfong
    A Safe Path Vector Protocol. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:490-499 [Conf]
  15. Gordon T. Wilfong
    Minimum Wavelength in an All-Optical Ring Network. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:346-355 [Conf]
  16. Daniel P. Lopresti, Gordon T. Wilfong
    Comparing Semi-Structured Documents via Graph Probing. [Citation Graph (0, 0)][DBLP]
    Multimedia Information Systems, 2001, pp:41-50 [Conf]
  17. Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong
    Route oscillations in I-BGP with route reflection. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:235-247 [Conf]
  18. Timothy Griffin, Gordon T. Wilfong
    On the correctness of IBGP configuration. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:17-29 [Conf]
  19. Timothy Griffin, Gordon T. Wilfong
    An Analysis of BGP Convergence Properties. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1999, pp:277-288 [Conf]
  20. April Rasala, Gordon T. Wilfong
    Strictly non-blocking WDM cross-connects. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:606-615 [Conf]
  21. Gordon T. Wilfong
    On-line Algorithms for Compressing Planar Curves. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:158-165 [Conf]
  22. Gordon T. Wilfong, Peter Winkler
    Ring Routing and Wavelength Translation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:333-341 [Conf]
  23. Daniel P. Lopresti, Gordon T. Wilfong
    Cross-Domain Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE/CRIWG, 1999, pp:120-127 [Conf]
  24. Steven Fortune, Gordon T. Wilfong
    Planning Constrained Motion [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:445-459 [Conf]
  25. April Rasala, Gordon T. Wilfong
    Strictly non-blocking WDM cross-connects for heterogeneous networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:514-523 [Conf]
  26. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing Constrained Minimum-Width Annuli of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:392-401 [Conf]
  27. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasibility of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:61-83 [Journal]
  28. Steven Fortune, Gordon T. Wilfong
    Planning Constrained Motion. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:1, pp:21-82 [Journal]
  29. Gordon T. Wilfong
    Motion Planning in the Presence of Movable Obstacles. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:1, pp:131-150 [Journal]
  30. Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang
    Design tools for transparent optical networks. [Citation Graph (0, 0)][DBLP]
    Bell Labs Technical Journal, 2006, v:11, n:2, pp:129-143 [Journal]
  31. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing constrained minimum-width annuli of point sets. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:267-275 [Journal]
  32. Gordon T. Wilfong
    Guest Editor's Introduction: Robotics and Automation. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1989, v:22, n:3, pp:6-7 [Journal]
  33. Boris Aronov, Steven Fortune, Gordon T. Wilfong
    The Furthest-Site Geodesic Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:217-255 [Journal]
  34. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:4, pp:467-0 [Journal]
  35. Gordon T. Wilfong
    Nearest neighbor problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:383-416 [Journal]
  36. Daniel P. Lopresti, Gordon T. Wilfong
    A fast technique for comparing graph representations with applications to performance evaluation. [Citation Graph (0, 0)][DBLP]
    IJDAR, 2003, v:6, n:4, pp:219-229 [Journal]
  37. Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong
    Evaluating the performance of table processing algorithms. [Citation Graph (0, 0)][DBLP]
    IJDAR, 2002, v:4, n:3, pp:140-153 [Journal]
  38. Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
    Comparison and Classification of Documents Based on Layout Similarity. [Citation Graph (0, 0)][DBLP]
    Inf. Retr., 2000, v:2, n:2/3, pp:227-243 [Journal]
  39. Gordon T. Wilfong, Frank Sinden, Laurence Ruedisueli
    On-Line Recognition of Handwritten Symbols. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1996, v:18, n:9, pp:935-940 [Journal]
  40. John E. Hopcroft, Gordon T. Wilfong
    Reducing Multiple Object Motion Planning to Graph Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:768-785 [Journal]
  41. April Rasala Lehman, Gordon T. Wilfong
    http: //epubs.siam.org/SICOMP/volume-35/art_43425.html. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:449-485 [Journal]
  42. Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
    The stable paths problem and interdomain routing. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:2, pp:232-243 [Journal]
  43. Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
    Designing Multihop Wireless Backhaul Networks with Delay Guarantees. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  44. P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
    Degree-constrained network flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:681-688 [Conf]

  45. A fractional model of the border gateway protocol (BGP). [Citation Graph (, )][DBLP]


  46. Network Formation and Routing by Strategic Agents Using Local Contracts. [Citation Graph (, )][DBLP]


  47. Economic modeling of global test strategy II: Software system and examples. [Citation Graph (, )][DBLP]


  48. Economic modeling of global test strategy I: Mathematical models. [Citation Graph (, )][DBLP]


  49. Approximation Algorithms for Constrained Knapsack Problems [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