Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Chuzhoy, Julia"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for the directed
k
-Tour and
k
-Stroll problems
MohammadHossein Bateni
,
Julia Chuzhoy
Algorithmica
65
(3), 2013, pp. 545-561
Large-treewidth graph decompositions and applications
Chandra Chekuri
,
Julia Chuzhoy
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 291-300
Approximation algorithms and hardness of integral concurrent flow
Parinya Chalermsook
,
Julia Chuzhoy
,
Alina Ene
,
Shi Li
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 689-708
On vertex sparsifiers with Steiner nodes
Julia Chuzhoy
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 673-688
Routing in undirected graphs with constant congestion
Julia Chuzhoy
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 855-874
An algorithm for the graph crossing number problem
Julia Chuzhoy
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 303-312
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Matthew Andrews
,
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
,
Lisa Zhang
Combinatorica
30
(5), 2010, pp. 485-520
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy
,
Sanjeev Khanna
Journal of the ACM
56
(2), 2009, pp. 6: 1-28
Network design for vertex connectivity
Tanmoy Chakraborty
,
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 167-176
Hardness of routing with congestion in directed graphs
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 165-178
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 179-188
Hardness of cut problems in directed graphs
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 527-536
New hardness results for congestion minimization and machine scheduling
Julia Chuzhoy
,
Joseph (Seffi) Naor
Journal of the ACM
53
(5), 2006, pp. 707-721
Covering problems with hard capacities
Julia Chuzhoy
,
Joseph (Seffi) Naor
SIAM Journal on Computing
36
(2), 2006, pp. 498-515
The hardness of metric labeling
Julia Chuzhoy
,
Joseph (Seffi) Naor
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1376-1386
Low-distortion embeddings of general metrics into the line
Mihai Bvadoiu
,
Julia Chuzhoy
,
Piotr Indyk
,
Anastasios Sidiropoulos
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 225-233
Asymmetric
k
-center is log
^*
n
-hard to approximate
Julia Chuzhoy
,
Sudipto Guha
,
Eran Halperin
,
Sanjeev Khanna
,
Guy Kortsarz
,
Robert Krauthgamer
,
Joseph (Seffi) Naor
Journal of the ACM
52
(4), 2005, pp. 538-551
Asymmetric
k
-center is
\log^* n
-hard to approximate
Julia Chuzhoy
,
Sudipto Guha
,
Eran Halperin
,
Sanjeev Khanna
,
Guy Kortsarz
,
Joseph (Seffi) Naor
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 21-27
New hardness results for congestion minimization and machine scheduling
Julia Chuzhoy
,
Joseph (Seffi) Naor
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 28-34
Algorithmic aspects of bandwidth trading
Randeep Bhatia
,
Julia Chuzhoy
,
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
2719
, 2003, pp. 751-766
Covering problems with hard capacities
Julia Chuzhoy
,
Joseph (Seffi) Naor
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 481-489