BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × The Netherlands
9 × USA
Collaborated with:
S.Khanna C.Chekuri J.Naor T.Chakraborty P.Chalermsook A.Ene S.Li V.Guruswami K.Talwar M.Badoiu P.Indyk A.Sidiropoulos R.Bhatia A.Freund S.Guha E.Halperin G.Kortsarz
Talks about:
hard (6) graph (5) algorithm (3) problem (3) congest (3) direct (3) cut (3) polynomi (2) approxim (2) theorem (2)

Person: Julia Chuzhoy

DBLP DBLP: Chuzhoy:Julia

Contributed to:

STOC 20152015
STOC 20142014
STOC 20132013
STOC 20122012
STOC 20112011
STOC 20082008
STOC 20072007
STOC 20062006
STOC 20052005
STOC 20042004
ICALP 20032003

Wrote 15 papers:

STOC-2015-Chuzhoy #grid #theorem
Excluded Grid Theorem: Improved and Simplified (JC), pp. 645–654.
STOC-2014-ChekuriC #bound #polynomial #theorem
Polynomial bounds for the grid-minor theorem (CC, JC), pp. 60–69.
STOC-2013-ChekuriC #graph
Large-treewidth graph decompositions and applications (CC, JC), pp. 291–300.
STOC-2012-ChalermsookCEL #algorithm #approximate #concurrent
Approximation algorithms and hardness of integral concurrent flow (PC, JC, AE, SL), pp. 689–708.
STOC-2012-Chuzhoy #on the
On vertex sparsifiers with Steiner nodes (JC), pp. 673–688.
STOC-2012-Chuzhoy12a #constant #graph
Routing in undirected graphs with constant congestion (JC), pp. 855–874.
STOC-2011-Chuzhoy #algorithm #graph #problem
An algorithm for the graph crossing number problem (JC), pp. 303–312.
STOC-2008-ChakrabortyCK #design #network
Network design for vertex connectivity (TC, JC, SK), pp. 167–176.
STOC-2007-ChuzhoyGKT #graph
Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.
STOC-2007-ChuzhoyK #polynomial #problem
Polynomial flow-cut gaps and hardness of directed cut problems (JC, SK), pp. 179–188.
STOC-2006-ChuzhoyK #graph #problem
Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.
STOC-2005-BadoiuCIS #metric
Low-distortion embeddings of general metrics into the line (MB, JC, PI, AS), pp. 225–233.
STOC-2004-ChuzhoyGHKKN #approximate #symmetry
Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
STOC-2004-ChuzhoyN #scheduling
New hardness results for congestion minimization and machine scheduling (JC, JN), pp. 28–34.
ICALP-2003-BhatiaCFN #algorithm #aspect-oriented
Algorithmic Aspects of Bandwidth Trading (RB, JC, AF, JN), pp. 751–766.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.