Остановите войну!
for scientists:
default search action
Julia Chuzhoy
- > Home > Persons > Julia Chuzhoy
Publications
- 2024
- [c58]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA 2024: 2185-2235 - 2023
- [i34]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. CoRR abs/2312.12584 (2023) - 2019
- [c46]Julia Chuzhoy, Sanjeev Khanna:
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. STOC 2019: 389-400 - [i24]Julia Chuzhoy, Sanjeev Khanna:
A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems. CoRR abs/1905.11512 (2019) - 2012
- [j11]Julia Chuzhoy, Sanjeev Khanna:
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. Theory Comput. 8(1): 401-413 (2012) - [c33]Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna:
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM 2012: 73-84 - 2010
- [j10]Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang:
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Comb. 30(5): 485-520 (2010) - 2009
- [j9]Julia Chuzhoy, Sanjeev Khanna:
Polynomial flow-cut gaps and hardness of directed cut problems. J. ACM 56(2): 6:1-6:28 (2009) - [c21]Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna:
On Allocating Goods to Maximize Fairness. FOCS 2009: 107-116 - [c20]Julia Chuzhoy, Sanjeev Khanna:
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. FOCS 2009: 437-441 - [i5]Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna:
On Allocating Goods to Maximize Fairness. CoRR abs/0901.0205 (2009) - 2008
- [c18]Julia Chuzhoy, Sanjeev Khanna:
Algorithms for Single-Source Vertex Connectivity. FOCS 2008: 105-114 - [c17]Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna:
Network design for vertex connectivity. STOC 2008: 167-176 - [i4]Julia Chuzhoy, Sanjeev Khanna:
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. CoRR abs/0812.4442 (2008) - 2007
- [c16]Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar:
Hardness of routing with congestion in directed graphs. STOC 2007: 165-178 - [c15]Julia Chuzhoy, Sanjeev Khanna:
Polynomial flow-cut gaps and hardness of directed cut problems. STOC 2007: 179-188 - [i3]Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang:
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c12]Julia Chuzhoy, Sanjeev Khanna:
Hardness of cut problems in directed graphs. STOC 2006: 527-536 - [i2]Julia Chuzhoy, Sanjeev Khanna:
Hardness of Directed Routing with Congestion. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005) - [c11]Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang:
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. FOCS 2005: 226-244 - 2004
- [c7]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004: 81-90 - [c5]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. STOC 2004: 21-27 - 2003
- [i1]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Asymmetric k-center is log*n-hard to Approximate. Electron. Colloquium Comput. Complex. TR03 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint