3 citations · 3 across the 4 of their papers we have counts for
6 papers · 1 filter
Large-Treewidth Graph Decompositions and Applications
Chandra Chekuri, Julia Chuzhoy
Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph into node-disjoint…
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
Julia Chuzhoy, Shi Li
In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M={(s_1,t_1),...,(s_k,t_k)} of demand pairs and an integer c.…
Routing in Undirected Graphs with Constant Congestion
Julia Chuzhoy
Given an undirected graph G=(V,E), a collection (s_1,t_1),...,(s_k,t_k) of k source-sink pairs, and an integer c, the goal in the Edge Disjoint Paths with Congestion problem is to…
An Algorithm for the Graph Crossing Number Problem
Julia Chuzhoy
We study the Minimum Crossing Number problem: given an -vertex graph , the goal is to find a drawing of in the plane with minimum number of edge crossings. This is one of…
On Graph Crossing Number and Edge Planarization
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their e…
On Allocating Goods to Maximize Fairness
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
Given a set of agents and a set of items, where agent has utility for item , our goal is to allocate items to agents to maximize fairness. Specifically, th…