3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…