Chuzhoy, Julia - Toyota Technological Institute at Chicago

• log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
• SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 2, pp. 498515
• On Graph Crossing Number and Edge Planarization Julia Chuzhoy
• Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems Julia Chuzhoy
• On the Approximability of Some Network Design JULIA CHUZHOY
• Non-Cooperative Multicast and Facility Location Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,
• Hardness of Routing with Congestion in Directed Graphs Julia Chuzhoy
• On the Approximability of Some Network Design Problems Julia Chuzhoy
• An Algorithm for the Graph Crossing Number Problem Julia Chuzhoy
• On Graph Crossing Number and Edge Planarization Julia Chuzhoy
• Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
• Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
• On Allocating Goods to Maximize Fairness Deeparnab Chakrabarty
• On Allocating Goods to Maximize Fairness Deeparnab Chakrabarty
• log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
• Resource Minimization Job Scheduling Julia Chuzhoy
• Algorithms for Single-Source Vertex Connectivity Julia Chuzhoy
• Network Design for Vertex Connectivity Tanmoy Chakraborty
• Polynomial Flow-Cut Gaps and Hardness of Directed Cut [Extended Abstract]
• Hardness of Cut Problems in Directed Graphs [Extended Abstract]
• New Hardness Results for Undirected Edge Disjoint Paths Julia Chuzhoy
• Low-distortion Embeddings of General Metrics Into the Mihai Badoiu
• Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy
• The Hardness of Metric Labeling Julia Chuzhoy
• New Hardness Results for Congestion Minimization and Machine Scheduling
• Asymmetric k-Center is log n-Hard to Approximate
• Asymmetric k-Center is log n-Hard to Approximate
• Covering Problems with Hard Capacities Julia Chuzhoy Joseph (Seffi) Naor
• Algorithmic Aspects of Bandwidth Trading Randeep Bhatia
• Maximum Independent Set of Rectangles Parinya Chalermsook
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Maximum Independent Set of Rectangles Parinya Chalermsook
• Embedding Ultrametrics Into Low-Dimensional Spaces Mihai Badoiu
• Algorithms for Single-Source Vertex Connectivity Julia Chuzhoy
• Resource Minimization Job Scheduling Julia Chuzhoy1
• Low-distortion Embeddings of General Metrics Into the Line Mihai Badoiu Julia Chuzhoy Piotr Indyk Anastasios Sidiropoulos
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling
• Hardness of Directed Routing with Congestion Julia Chuzhoy
• Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion Matthew Andrews
• An Algorithm for the Graph Crossing Number Problem [Extended Abstract]
• Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy
• TTIC 31010 and CMSC 37000 Algorithms Sample Exam
• Approximation Algorithms and Hardness of the k-Route Cut Problem Julia Chuzhoy
• Algorithms Tutorial 1 January 4, 2011
• Approximation Algorithms and Hardness of the k-Route Cut Julia Chuzhoy
• On Allocating Goods to Maximize Fairness Deeparnab Chakrabarty
• Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy
• Algorithms Tutorial 3 January 18, 2011
• Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy