Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	F. Bruce
Last name:	Shepherd
DBLP:	01/4088
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 58  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel. Flow-cut gaps for integer and fractional multiflows.	J. Comb. Theory, Ser. B 2013, Volume 103	(0)	2013
	Journal article Alexandre Fréchette, F. Bruce Shepherd, Marina Thottan, Peter J. Winzer. Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand	CoRR 2013, Volume 0	(0)	2013
	Journal article Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd. Maximum Edge-Disjoint Paths in $k$-sums of Graphs	CoRR 2013, Volume 0	(0)	2013
	Conference paper Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd. Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks.	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II 2012	(0)	2012
	Journal article Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang. Buy-at-Bulk Network Design with Protection.	Math. Oper. Res. 2011, Volume 36	(0)	2011
	Journal article Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design.	Algorithmica 2011, Volume 61	(0)	2011
	Conference paper Loïc Seguin-Charbonneau, F. Bruce Shepherd. Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2.	IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011	(0)	2011
	Journal article Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong. Strategic network formation through peering and service agreements.	Games and Economic Behavior 2011, Volume 73	(0)	2011
	Conference paper Neil Olver, F. Bruce Shepherd. Approximability of Robust Network Design.	Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010	(0)	2010
	Conference paper Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel. Flow-Cut Gaps for Integer and Fractional Multiflows.	Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010	(0)	2010
	Journal article Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel. Flow-Cut Gaps for Integer and Fractional Multiflows	CoRR 2010, Volume 0	(0)	2010
	Conference paper Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design.	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009	(0)	2009
	Conference paper Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. A Note on Multiflows and Treewidth.	Algorithmica 2009, Volume 54	(0)	2009
	Journal article Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. Edge-Disjoint Paths in Planar Graphs with Constant Congestion.	SIAM J. Comput. 2009, Volume 39	(0)	2009
	Conference paper F. Bruce Shepherd. Single-Sink Multicommodity Flow with Side Constraints.	Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany 2009	(0)	2008
	Conference paper Navin Goyal, Neil Olver, F. Bruce Shepherd. The vpn conjecture is true.	Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008	(0)	2008
	Journal article Chandra Chekuri, F. Bruce Shepherd. Approximate Integer Decompositions for Undirected Network Design Problems.	SIAM J. Discrete Math. 2009, Volume 23	(0)	2008
	Conference paper Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang. Buy-at-Bulk Network Design with Protection.	48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007	(0)	2007
	Conference paper P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong. Degree-constrained network flows.	Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 2007	(0)	2007
	Conference paper F. Bruce Shepherd, Adrian Vetta. The Demand-Matching Problem.	Math. Oper. Res. 2007, Volume 32	(0)	2007
	Conference paper Chandra Chekuri, F. Bruce Shepherd, G. Oriolo, Maria Grazia Scutellà. Hardness of robust network design.	Networks 2007, Volume 50	(0)	2007
	Conference paper Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. Multicommodity demand flow in a tree and packing integer programs.	ACM Transactions on Algorithms 2007, Volume 3	(0)	2007
	Conference paper Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong. Strategic Network Formation through Peering and Service Agreements.	47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006	(0)	2006
	Conference paper Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. Edge-disjoint paths in Planar graphs with constant congestion.	Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006 2006	(0)	2006
	Conference paper 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 Technical Journal 2006, Volume 11	(0)	2006

Show item 1 to 25 of 58  

Your query returned 58 matches in the database.