default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulia Chuzhoy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA 2024: 2185-2235- [c58]Julia Chuzhoy
, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. STOC 2024: 83-94 - [i36]Julia Chuzhoy, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. CoRR abs/2405.20861 (2024) - 2023
- [c57]Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan:
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. ITCS 2023: 38:1-38:23 - [c56]Julia Chuzhoy:
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. SODA 2023: 2122-2213 - [c55]Julia Chuzhoy, Ruimin Zhang:
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. STOC 2023: 1159-1172 - [i35]Julia Chuzhoy, Ruimin Zhang:
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. CoRR abs/2304.09321 (2023) - [i34]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. CoRR abs/2312.12584 (2023) - 2022
- [j20]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
New Hardness Results for Routing on Disjoint Paths. SIAM J. Comput. 51(2): 17-189 (2022) - [c54]Julia Chuzhoy, Zihan Tan:
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. STOC 2022: 303-316 - [i33]Julia Chuzhoy, Zihan Tan:
A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs. CoRR abs/2202.06827 (2022) - [i32]Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan:
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. CoRR abs/2211.05906 (2022) - [i31]Julia Chuzhoy:
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. CoRR abs/2211.10556 (2022) - 2021
- [j19]Julia Chuzhoy, Zihan Tan:
Towards tight(er) bounds for the Excluded Grid Theorem. J. Comb. Theory B 146: 219-265 (2021) - [j18]Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat:
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. Theory Comput. 17: 1-57 (2021) - [c53]Julia Chuzhoy, Thatchaphol Saranurak:
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. SODA 2021: 2478-2496 - [c52]Julia Chuzhoy:
Decremental all-pairs shortest paths in deterministic near-linear time. STOC 2021: 626-639 - [i30]Julia Chuzhoy:
Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time. CoRR abs/2109.05621 (2021) - 2020
- [c51]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM 2020: 33:1-33:21 - [c50]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. FOCS 2020: 73-84 - [c49]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS 2020: 1158-1167 - [c48]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. ICALP 2020: 33:1-33:18 - [e1]Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, Julia Chuzhoy:
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. ACM 2020, ISBN 978-1-4503-6979-4 [contents] - [i29]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. CoRR abs/2006.07486 (2020) - [i28]Julia Chuzhoy, Thatchaphol Saranurak:
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. CoRR abs/2009.08479 (2020) - [i27]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. CoRR abs/2011.06545 (2020)
2010 – 2019
- 2019
- [c47]Julia Chuzhoy, Zihan Tan:
Towards Tight(er) Bounds for the Excluded Grid Theorem. SODA 2019: 1445-1464 - [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 - [i26]Julia Chuzhoy, Zihan Tan:
Towards Tight(er) Bounds for the Excluded Grid Theorem. CoRR abs/1901.07944 (2019) - [i25]Julia Chuzhoy, Rachit Nimavat:
Large Minors in Expanders. CoRR abs/1901.09349 (2019) - [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) - [i23]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs/1910.08025 (2019) - [i22]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR abs/1912.02900 (2019) - 2018
- [c45]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. ICALP 2018: 38:1-38:14 - [c44]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
Almost polynomial hardness of node-disjoint paths in grids. STOC 2018: 1220-1233 - [i21]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. CoRR abs/1805.09956 (2018) - 2017
- [j17]Julia Chuzhoy, Alexander Russell:
Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Coomputer Science (FOCS 2014). SIAM J. Comput. 46(1): 160 (2017) - [c43]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
New hardness results for routing on disjoint paths. STOC 2017: 86-99 - [i20]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. CoRR abs/1711.01980 (2017) - 2016
- [j16]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63(5): 40:1-40:65 (2016) - [j15]Julia Chuzhoy, Shi Li:
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. J. ACM 63(5): 45:1-45:51 (2016) - [j14]Julia Chuzhoy:
Routing in Undirected Graphs with Constant Congestion. SIAM J. Comput. 45(4): 1490-1532 (2016) - [j13]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation Algorithms and Hardness of the k-Route Cut Problem. ACM Trans. Algorithms 12(1): 2:1-2:40 (2016) - [c42]Julia Chuzhoy, Alina Ene:
On Approximating Maximum Independent Set of Rectangles. FOCS 2016: 820-829 - [c41]Julia Chuzhoy, David H. K. Kim, Shi Li:
Improved approximation for node-disjoint paths in planar graphs. STOC 2016: 556-569 - [c40]Julia Chuzhoy:
Excluded Grid Theorem: Improved and Simplified (Invited Talk). SWAT 2016: 31:1-31:1 - [r3]Julia Chuzhoy:
Generalized Steiner Network. Encyclopedia of Algorithms 2016: 817-819 - [r2]Julia Chuzhoy:
Large-Treewidth Graph Decompositions. Encyclopedia of Algorithms 2016: 1057-1059 - [i19]Julia Chuzhoy:
Improved Bounds for the Excluded Grid Theorem. CoRR abs/1602.02629 (2016) - [i18]Julia Chuzhoy, David H. K. Kim, Shi Li:
Improved Approximation for Node-Disjoint Paths in Planar Graphs. CoRR abs/1603.05520 (2016) - [i17]Julia Chuzhoy, Alina Ene:
On Approximating Maximum Independent Set of Rectangles. CoRR abs/1608.00271 (2016) - [i16]Julia Chuzhoy, David H. K. Kim, Rachit Nimavat:
New Hardness Results for Routing on Disjoint Paths. CoRR abs/1611.05429 (2016) - 2015
- [c39]Julia Chuzhoy, David H. K. Kim:
On Approximating Node-Disjoint Paths in Grids. APPROX-RANDOM 2015: 187-211 - [c38]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. SODA 2015: 242-255 - [c37]Julia Chuzhoy:
Improved Bounds for the Flat Wall Theorem. SODA 2015: 256-275 - [c36]Julia Chuzhoy:
Excluded Grid Theorem: Improved and Simplified. STOC 2015: 645-654 - 2014
- [c35]Chandra Chekuri, Julia Chuzhoy:
Polynomial bounds for the grid-minor theorem. STOC 2014: 60-69 - [i15]Julia Chuzhoy:
Improved Bounds for the Flat Wall Theorem. CoRR abs/1410.0276 (2014) - [i14]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. CoRR abs/1410.1016 (2014) - 2013
- [j12]MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. Algorithmica 65(3): 545-561 (2013) - [c34]Chandra Chekuri, Julia Chuzhoy:
Large-treewidth graph decompositions and applications. STOC 2013: 291-300 - [i13]Chandra Chekuri, Julia Chuzhoy:
Large-Treewidth Graph Decompositions and Applications. CoRR abs/1304.1577 (2013) - [i12]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. CoRR abs/1305.6577 (2013) - 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 - [c32]Julia Chuzhoy, Shi Li:
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. FOCS 2012: 233-242 - [c31]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799 - [c30]Julia Chuzhoy:
On vertex sparsifiers with Steiner nodes. STOC 2012: 673-688 - [c29]Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li:
Approximation algorithms and hardness of integral concurrent flow. STOC 2012: 689-708 - [c28]Julia Chuzhoy:
Routing in undirected graphs with constant congestion. STOC 2012: 855-874 - [i11]Julia Chuzhoy:
On Vertex Sparsifiers with Steiner Nodes. CoRR abs/1204.2844 (2012) - [i10]Julia Chuzhoy, Shi Li:
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. CoRR abs/1208.1272 (2012) - 2011
- [c27]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. SODA 2011: 1050-1069 - [c26]Julia Chuzhoy:
An algorithm for the graph crossing number problem. STOC 2011: 303-312 - [i9]Julia Chuzhoy:
Routing in Undirected Graphs with Constant Congestion. CoRR abs/1107.2554 (2011) - [i8]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation Algorithms and Hardness of the k-Route Cut Problem. CoRR abs/1112.3611 (2011) - 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) - [c25]MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. APPROX-RANDOM 2010: 25-38 - [c24]Parinya Chalermsook, Julia Chuzhoy:
Resource Minimization for Fire Containment. SODA 2010: 1334-1349 - [i7]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. CoRR abs/1010.3976 (2010) - [i6]Julia Chuzhoy:
An Algorithm for the Graph Crossing Number Problem. CoRR abs/1012.0255 (2010)
2000 – 2009
- 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) - [c23]Julia Chuzhoy, Paolo Codenotti:
Resource Minimization Job Scheduling. APPROX-RANDOM 2009: 70-83 - [c22]Julia Chuzhoy, Paolo Codenotti:
Erratum: Resource Minimization Job Scheduling. APPROX-RANDOM 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 - [c19]Parinya Chalermsook, Julia Chuzhoy:
Maximum independent set of rectangles. SODA 2009: 892-901 - [i5]Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna:
On Allocating Goods to Maximize Fairness. CoRR abs/0901.0205 (2009) - 2008
- [j8]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. ACM Trans. Algorithms 4(2): 23:1-23:17 (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 - [r1]Julia Chuzhoy:
Generalized Steiner Network. Encyclopedia of Algorithms 2008 - [i4]Julia Chuzhoy, Sanjeev Khanna:
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. CoRR abs/0812.4442 (2008) - 2007
- [j7]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25(6): 1193-1206 (2007) - [j6]Julia Chuzhoy, Joseph Naor:
The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007) - [j5]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3(1): 10:1-10:19 (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
- [j4]Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006) - [j3]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006) - [j2]Julia Chuzhoy, Joseph Naor:
Covering Problems with Hard Capacities. SIAM J. Comput. 36(2): 498-515 (2006) - [c14]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Embedding ultrametrics into low-dimensional spaces. SCG 2006: 187-196 - [c13]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative multicast and facility location games. EC 2006: 72-81 - [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 - [c10]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. SODA 2005: 943-951 - [c9]Julia Chuzhoy, Yuval Rabani:
Approximating k-median with non-uniform capacities. SODA 2005: 952-958 - [c8]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233 - 2004
- [b1]Julia Chuzhoy:
Hardness approximation and new approximability classes. Technion - Israel Institute of Technology, Israel, 2004 - [c7]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004: 81-90 - [c6]Julia Chuzhoy, Joseph Naor:
The Hardness of Metric Labeling. FOCS 2004: 108-114 - [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 - [c4]Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. STOC 2004: 28-34 - 2003
- [c3]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic Aspects of Bandwidth Trading. ICALP 2003: 751-766 - [i1]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Asymmetric k-center is log*n-hard to Approximate. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c2]Julia Chuzhoy, Joseph Naor:
Covering Problems with Hard Capacities. FOCS 2002: 481-489 - 2001
- [c1]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356
Coauthor Index
David H. K. Kim
aka: David Hong Kyun Kim
aka: David Hong Kyun Kim
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-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
