Gordon T. Wilfong

Publication Activity (10 Years)

Years Active: 1986-2019
Publications (10 Years): 8

Top Topics

Integer Variables

Network Topologies

Multi Commodity

Top Venues

J. Graph Algorithms Appl.

Publications

Glencora Borradaile, Theresa Migler, Gordon T. Wilfong
Density decompositions of networks. J. Graph Algorithms Appl. 23 (4) (2019)
Yang Xu, Marco Cello, I-Chih Wang, Anwar Walid, Gordon T. Wilfong, Charles H.-P. Wen, Mario Marchese, H. Jonathan Chao
Dynamic Switch Migration in Distributed Software-Defined Networks to Achieve Controller Load Balance. IEEE J. Sel. Areas Commun. 37 (3) (2019)
W. Sean Kennedy, Vladimir Kolesnikov, Gordon T. Wilfong
Overlaying Conditional Circuit Clauses for Secure Computation. ASIACRYPT (2) (2017)
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang
Egalitarian Graph Orientations. J. Graph Algorithms Appl. 21 (4) (2017)
Adiseshu Hari, Urs Niesen, Gordon T. Wilfong
On the Problem of Optimal Path Encoding for Software-Defined Networks. IEEE/ACM Trans. Netw. 25 (1) (2017)
Marco Cello, Yang Xu, Anwar Walid, Gordon T. Wilfong, H. Jonathan Chao, Mario Marchese
BalCon: A Distributed Elastic SDN Control via Efficient Switch Migration. IC2E (2017)
Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, Lisa Zhang
Improving robustness of next-hop routing. J. Comb. Optim. 31 (3) (2016)
W. Sean Kennedy, Vladimir Kolesnikov, Gordon T. Wilfong
Overlaying Circuit Clauses for Secure Computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Adiseshu Hari, T. V. Lakshman, Gordon T. Wilfong
Path switching: reduced-state flow handling in SDN using path information. CoNEXT (2015)
Matthew Andrews, Gordon T. Wilfong, Lisa Zhang
Analysis of k-anonymity algorithms for streaming location data. INFOCOM Workshops (2015)
F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. FOCS (2015)
Michael Scharf, Gordon T. Wilfong, Lisa Zhang
Sparsifying network topologies for application guidance. IM (2015)
Adiseshu Hari, Urs Niesen, Gordon T. Wilfong
Optimal Path Encoding for Software-Defined Networks. CoRR (2015)
Adiseshu Hari, Urs Niesen, Gordon T. Wilfong
Optimal path encoding for software-defined networks. ISIT (2015)
Glencora Borradaile, Theresa Migler, Gordon T. Wilfong
Density decompositions of networks. CoRR (2014)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability. Algorithmica 70 (3) (2014)
Glencora Borradaile, William Sean Kennedy, Gordon T. Wilfong, Lisa Zhang
Improving Robustness of Next-Hop Routing. CoRR (2014)
Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo
PACE: Policy-Aware Application Cloud Embedding. INFOCOM (2013)
William Sean Kennedy, Jamie Morgenstern, Gordon T. Wilfong, Lisa Zhang
Hierarchical community decomposition via oblivious routing techniques. COSN (2013)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16 (2012)
Michael Dinitz, Gordon T. Wilfong
iBGP and Constrained Connectivity. APPROX-RANDOM (2012)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability. ESA (2012)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability CoRR (2012)
Volodymyr Kuleshov, Gordon T. Wilfong
On the Efficiency of the Simplest Pricing Mechanisms in Two-Sided Markets. WINE (2012)
Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong
The Inherent Difficulty of Timely Primary-Backup Replication. Bell Labs Tech. J. 17 (2) (2012)
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang
Egalitarian Graph Orientations CoRR (2012)
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
Strategic network formation through peering and service agreements. Games Econ. Behav. 73 (1) (2011)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
The 1-Neighbour Knapsack Problem. IWOCA (2011)
Sourjya Bhaumik, David Chuck, Girija J. Narlikar, Gordon T. Wilfong
Energy-Efficient Design and Optimization of Wireline Access Networks CoRR (2011)
Sourjya Bhaumik, David Chuck, Girija J. Narlikar, Gordon T. Wilfong
Energy-efficient design and optimization of wireline access networks. INFOCOM (2011)
Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong
The inherent difficulty of timely primary-backup replication. PODC (2011)
Michael Dinitz, Gordon T. Wilfong
iBGP and Constrained Connectivity CoRR (2011)
Penny E. Haxell, Gordon T. Wilfong
On the Stable Paths Problem. SIAM J. Discret. Math. 24 (3) (2010)
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
Designing multihop wireless backhaul networks with delay guarantees. Wirel. Networks 16 (1) (2010)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
Approximation Algorithms for Constrained Knapsack Problems CoRR (2009)
Penny E. Haxell, Gordon T. Wilfong
A fractional model of the border gateway protocol (BGP). SODA (2008)
Elliot Anshelevich, Gordon T. Wilfong
Network Formation and Routing by Strategic Agents Using Local Contracts. WINE (2008)
Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
Degree-constrained network flows. STOC (2007)
Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons, James H. Mosher Jr., Gordon T. Wilfong
Economic modeling of global test strategy II: Software system and examples. Bell Labs Tech. J. 12 (1) (2007)
Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons, James H. Mosher Jr., Gordon T. Wilfong
Economic modeling of global test strategy I: Mathematical models. Bell Labs Tech. J. 12 (1) (2007)
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
Strategic Network Formation through Peering and Service Agreements. FOCS (2006)
Seungjoon Lee, Girija J. Narlikar, Martin Pal, Gordon T. Wilfong, Lisa Zhang
Admission control for multihop wireless backhaul networks with QoS support. WCNC (2006)
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. Bell Labs Tech. J. 11 (2) (2006)
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
Designing Multihop Wireless Backhaul Networks with Delay Guarantees. INFOCOM (2006)
April Rasala Lehman, Gordon T. Wilfong
Strictly Nonblocking WDM Cross-connects. SIAM J. Comput. 35 (2) (2005)
Daniel P. Lopresti, Gordon T. Wilfong
A fast technique for comparing graph representations with applications to performance evaluation. Int. J. Document Anal. Recognit. 6 (4) (2003)
Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
Wide-Sense Nonblocking WDM Cross-Connects. ESA (2002)
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10 (2) (2002)
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong
Evaluating the performance of table processing algorithms. Int. J. Document Anal. Recognit. 4 (3) (2002)
Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong
Route oscillations in I-BGP with route reflection. SIGCOMM (2002)
Timothy Griffin, Gordon T. Wilfong
Analysis of the MED Oscillation Problem in BGP. ICNP (2002)
Timothy Griffin, Gordon T. Wilfong
On the correctness of IBGP configuration. SIGCOMM (2002)
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong
Table structure recognition and its evaluation. Document Recognition and Retrieval (2001)
Daniel P. Lopresti, Gordon T. Wilfong
Evaluating Document Analysis Results via Graph Probing. ICDAR (2001)
Daniel P. Lopresti, Gordon T. Wilfong
Comparing Semi-Structured Documents via Graph Probing. Multimedia Information Systems (2001)
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong, George Nagy
Why Table Ground-Truthing is Hard. ICDAR (2001)
April Rasala, Gordon T. Wilfong
Strictly non-blocking WDM cross-connects. SODA (2000)
Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
Comparison and Classification of Documents Based on Layout Similarity. Inf. Retr. 2 (2/3) (2000)
Timothy Griffin, Gordon T. Wilfong
A Safe Path Vector Protocol. INFOCOM (2000)
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong
Medium-independent table detection. Document Recognition and Retrieval (2000)
April Rasala, Gordon T. Wilfong
Strictly non-blocking WDM cross-connects for heterogeneous networks. STOC (2000)
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
Policy Disputes in Path-Vector Protocols. ICNP (1999)
Daniel P. Lopresti, Gordon T. Wilfong
Cross-Domain Approximate String Matching. SPIRE/CRIWG (1999)
Timothy Griffin, Gordon T. Wilfong
An Analysis of BGP Convergence Properties. SIGCOMM (1999)
Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
Document Classification Using Layout Analysis. DEXA Workshop (1999)
Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong
Document Image Layout Comparison and Classification. ICDAR (1999)
Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
Computing constrained minimum-width annuli of point sets. Comput. Aided Des. 30 (4) (1998)
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8 (4) (1998)
Gordon T. Wilfong, Peter Winkler
Ring Routing and Wavelength Translation. SODA (1998)
Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
Computing Constrained Minimum-Width Annuli of Point Sets. WADS (1997)
Gordon T. Wilfong
On-line Algorithms for Compressing Planar Curves. SODA (1997)
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. Algorithmica 19 (1/2) (1997)
Gordon T. Wilfong, Frank Sinden, Laurence W. Ruedisueli
On-Line Recognition of Handwritten Symbols. IEEE Trans. Pattern Anal. Mach. Intell. 18 (9) (1996)
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
Computing the Angularity Tolerance. CCCG (1996)
Gordon T. Wilfong
Minimum Wavelength in an All-Optical Ring Network. ISAAC (1996)
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. FSTTCS (1993)
Boris Aronov, Steven Fortune, Gordon T. Wilfong
The Furthest-Site Geodesic Voronoi Diagram. Discret. Comput. Geom. 9 (1993)
Gordon T. Wilfong
Nearest neighbor problems. Int. J. Comput. Geom. Appl. 2 (4) (1992)
Steven Fortune, Gordon T. Wilfong
Planning Constrained Motion. Ann. Math. Artif. Intell. 3 (1) (1991)
Gordon T. Wilfong
Nearest Neighbor Problems. SCG (1991)
Gordon T. Wilfong
Motion Planning in the Presence of Movable Obstacles. Ann. Math. Artif. Intell. 3 (1) (1991)
Boris Aronov, Steven Fortune, Gordon T. Wilfong
Minimum-Speed Motions. Int. J. Robotics Res. 10 (3) (1991)
Gordon T. Wilfong
Graphs with variable edge costs: a model for scheduling a vehicle subject to speed and timing restraints. IROS (1990)
Gordon T. Wilfong
Shortest paths for autonomous vehicles. ICRA (1989)
Gordon T. Wilfong
Guest Editor's Introduction: Robotics and Automation. Computer 22 (3) (1989)
Gordon T. Wilfong
Motion planning for an autonomous vehicle. ICRA (1988)
Steven Fortune, Gordon T. Wilfong
Planning Constrained Motion STOC (1988)
Boris Aronov, Steven Fortune, Gordon T. Wilfong
The Furthest-Site Geodesic Voronoi Diagram. SCG (1988)
Gordon T. Wilfong
Motion Planning in the Presence of Movable Obstacles. SCG (1988)
Michael R. Garey, Robert E. Tarjan, Gordon T. Wilfong
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties. Math. Oper. Res. 13 (2) (1988)
Steven Fortune, Gordon T. Wilfong, Chee Yap
Coordinated motion of two robot arms. ICRA (1986)
John E. Hopcroft, Gordon T. Wilfong
Reducing Multiple Object Motion Planning to Graph Searching. SIAM J. Comput. 15 (3) (1986)