default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYury Makarychev
Person information
- affiliation: Toyota Technological Institute at Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j13]Hananel Zaichyk, Armin Biess, Aryeh Kontorovich
, Yury Makarychev:
Efficient Kirszbraun extension with applications to regression. Math. Program. 207(1): 617-642 (2024)- [j12]Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev:
Correction: Efficient Kirszbraun extension with applications to regression. Math. Program. 207(1): 643 (2024) - [c53]Yury Makarychev, Max Ovsiankin, Erasmo Tani:
Approximation Algorithms for 𝓁p-Shortest Path and 𝓁p-Group Steiner Tree. ICALP 2024: 111:1-111:20 - [c52]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. SODA 2024: 2236-2274 - [c51]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes. STOC 2024: 1526-1537 - [i48]Suprovat Ghoshal, Konstantin Makarychev, Yury Makarychev:
Constraint Satisfaction Problems with Advice. CoRR abs/2403.02212 (2024) - [i47]Yury Makarychev, Max Ovsiankin, Erasmo Tani:
Approximation Algorithms for ℓp-Shortest Path and ℓp-Group Steiner Tree. CoRR abs/2404.17669 (2024) - [i46]Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian:
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR abs/2405.10378 (2024) - 2023
- [c50]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. APPROX/RANDOM 2023: 11:1-11:19 - [c49]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. ESA 2023: 32:1-32:14 - [i45]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Red-Blue Set Cover. CoRR abs/2302.00213 (2023) - [i44]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithms for Norm Multiway Cut. CoRR abs/2308.08373 (2023) - [i43]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. CoRR abs/2308.10160 (2023) - [i42]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes. CoRR abs/2311.09460 (2023) - 2022
- [c48]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes. COLT 2022: 3070-3093 - [c47]Zhen Dai, Yury Makarychev, Ali Vakilian:
Fair Representation Clustering with Several Protected Classes. FAccT 2022: 814-823 - [c46]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Fair Clustering with Cascaded Norm Objectives. SODA 2022: 2664-2683 - [i41]Zhen Dai, Yury Makarychev, Ali Vakilian:
Fair Representation Clustering with Several Protected Classes. CoRR abs/2202.01391 (2022) - [i40]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes. CoRR abs/2206.07250 (2022) - 2021
- [c45]Yury Makarychev, Ali Vakilian:
Approximation Algorithms for Socially Fair Clustering. COLT 2021: 3246-3264 - [c44]Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. SoCG 2021: 13:1-13:14 - [c43]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Local Correlation Clustering with Asymmetric Classification Errors. ICML 2021: 4677-4686 - [i39]Yury Makarychev, Ali Vakilian:
Approximation Algorithms for Socially Fair Clustering. CoRR abs/2103.02512 (2021) - [i38]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Correlation Clustering with Asymmetric Classification Errors. CoRR abs/2108.05696 (2021) - [i37]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Local Correlation Clustering with Asymmetric Classification Errors. CoRR abs/2108.05697 (2021) - [i36]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Fair Clustering with Cascaded Norm Objectives. CoRR abs/2111.04804 (2021) - 2020
- [c42]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Correlation Clustering with Asymmetric Classification Errors. ICML 2020: 4641-4650 - [c41]Konstantin Makarychev, Yury Makarychev:
Certified Algorithms: Worst-Case Analysis and Beyond. ITCS 2020: 49:1-49:14 - [p2]Konstantin Makarychev, Yury Makarychev:
Perturbation Resilience. Beyond the Worst-Case Analysis of Algorithms 2020: 95-119 - [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]
2010 – 2019
- 2019
- [j11]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48(6): 1763-1795 (2019) - [c40]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. STOC 2019: 1027-1038 - [i35]Armin Biess, Aryeh Kontorovich, Yury Makarychev, Hanan Zaichyk:
Regression via Kirszbraun Extension with Applications to Imitation Learning. CoRR abs/1905.11930 (2019) - 2018
- [c39]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC 2018: 1088-1101 - [i34]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering. CoRR abs/1811.03195 (2018) - [i33]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR abs/1811.03591 (2018) - 2017
- [j10]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-Approximation for the Genus of Hamiltonian Graphs. Theory Comput. 13(1): 1-47 (2017) - [c38]Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. IPCO 2017: 39-50 - [c37]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA 2017: 340-357 - [c36]Eden Chlamtác, Michael Dinitz, Yury Makarychev:
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. SODA 2017: 881-899 - [c35]Haris Angelidakis, Yury Makarychev, Vsevolod Oparin:
Algorithmic and Hardness Results for the Hub Labeling Problem. SODA 2017: 1442-1461 - [c34]Haris Angelidakis, Konstantin Makarychev, Yury Makarychev:
Algorithms for stable and perturbation-resilient problems. STOC 2017: 438-451 - [p1]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithms for CSPs. The Constraint Satisfaction Problem 2017: 287-325 - 2016
- [j9]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) - [j8]Anand Louis, Yury Makarychev:
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion. Theory Comput. 12(1): 1-25 (2016) - [c33]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A Bi-Criteria Approximation Algorithm for k-Means. APPROX-RANDOM 2016: 14:1-14:20 - [c32]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Learning Communities in the Presence of Errors. COLT 2016: 1258-1291 - [i32]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR abs/1607.04787 (2016) - [i31]Konstantin Makarychev, Yury Makarychev:
Metric Perturbation Resilience. CoRR abs/1607.06442 (2016) - [i30]Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut. CoRR abs/1611.05530 (2016) - [i29]Haris Angelidakis, Yury Makarychev, Vsevolod Oparin:
Algorithmic and Hardness Results for the Hub Labeling Problem. CoRR abs/1611.06605 (2016) - [i28]Eden Chlamtác, Michael Dinitz, Yury Makarychev:
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. CoRR abs/1611.07866 (2016) - 2015
- [c31]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Correlation Clustering with Noisy Partial Information. COLT 2015: 1321-1342 - [c30]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. FOCS 2015: 975-993 - [i27]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs Above Average. CoRR abs/1503.03851 (2015) - [i26]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A bi-criteria approximation algorithm for k Means. CoRR abs/1507.04227 (2015) - [i25]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Learning Communities in the Presence of Errors. CoRR abs/1511.03229 (2015) - 2014
- [j7]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-Boolean Max-k-CSP. Theory Comput. 10: 341-358 (2014) - [c29]Behnam Neyshabur, Yury Makarychev, Nathan Srebro:
Clustering, Hamming Embedding, Generalized LSH and the Max Norm. ALT 2014: 306-320 - [c28]Anand Louis, Yury Makarychev:
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion. APPROX-RANDOM 2014: 339-355 - [c27]Konstantin Makarychev, Yury Makarychev:
Nonuniform Graph Partitioning with Unrelated Weights. ICALP (1) 2014: 812-822 - [c26]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut. SODA 2014: 890-906 - [c25]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Constant factor approximation for balanced cut in the PIE model. STOC 2014: 41-49 - [i24]Konstantin Makarychev, Yury Makarychev:
Nonuniform Graph Partitioning with Unrelated Weights. CoRR abs/1401.0699 (2014) - [i23]Anand Louis, Yury Makarychev:
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion. CoRR abs/1404.4575 (2014) - [i22]Behnam Neyshabur, Yury Makarychev, Nathan Srebro:
Clustering, Hamming Embedding, Generalized LSH and the Max Norm. CoRR abs/1405.3167 (2014) - [i21]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Constant Factor Approximation for Balanced Cut in the PIE model. CoRR abs/1406.5665 (2014) - [i20]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Algorithms for Semi-random Correlation Clustering. CoRR abs/1406.5667 (2014) - 2013
- [c24]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-approximation for the Genus of Hamiltonian Graphs. APPROX-RANDOM 2013: 244-259 - [c23]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Sorting noisy data with partial information. ITCS 2013: 515-528 - [c22]Behnam Neyshabur, Nati Srebro, Ruslan Salakhutdinov, Yury Makarychev, Payman Yadollahpour:
The Power of Asymmetry in Binary Hashing. NIPS 2013: 2823-2831 - [i19]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Bilu-Linial Stable Instances of Max Cut. CoRR abs/1305.1681 (2013) - [i18]Behnam Neyshabur, Payman Yadollahpour, Yury Makarychev, Ruslan Salakhutdinov, Nathan Srebro:
The Power of Asymmetry in Binary Hashing. CoRR abs/1311.7662 (2013) - 2012
- [j6]Yury Makarychev:
Simple linear time approximation algorithm for betweenness. Oper. Res. Lett. 40(6): 450-452 (2012) - [j5]Konstantin Makarychev, Yury Makarychev:
Chain Independence and Common Information. IEEE Trans. Inf. Theory 58(8): 5279-5286 (2012) - [c21]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-boolean MAX k-CSP. APPROX-RANDOM 2012: 254-265 - [c20]Yury Makarychev, Anastasios Sidiropoulos:
Planarizing an Unknown Surface. APPROX-RANDOM 2012: 266-275 - [c19]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799 - [c18]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Approximation algorithms for semi-random partitioning problems. STOC 2012: 367-384 - [i17]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Approximation Algorithms for Semi-random Graph Partitioning Problems. CoRR abs/1205.2234 (2012) - [i16]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-Boolean MAX k-CSP. CoRR abs/1206.3603 (2012) - [i15]Yury Makarychev, Anastasios Sidiropoulos:
Planarizing an Unknown Surface. CoRR abs/1206.4898 (2012) - 2011
- [c17]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games. FOCS 2011: 443-452 - [c16]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462 - [c15]Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou:
Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337 - [c14]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. SODA 2011: 1050-1069 - [i14]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck constant is strictly smaller than Krivine's bound. CoRR abs/1103.6161 (2011) - [i13]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games against a Semi-Random Adversary. CoRR abs/1104.3806 (2011) - [i12]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation Algorithms and Hardness of the k-Route Cut Problem. CoRR abs/1112.3611 (2011) - 2010
- [j4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. SIAM J. Comput. 39(6): 2487-2512 (2010) - [c13]Konstantin Makarychev, Yury Makarychev:
Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. FOCS 2010: 255-264 - [c12]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66 - [c11]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. WAOA 2010: 190-200 - [i11]Konstantin Makarychev, Yury Makarychev:
Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. CoRR abs/1006.4607 (2010) - [i10]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. CoRR abs/1010.3976 (2010)
2000 – 2009
- 2009
- [j3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms 5(3): 32:1-32:14 (2009) - [c10]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292 - [i9]Itai Benjamini, Yury Makarychev:
Balanced Allocation: Memory Performance Tradeoffs. CoRR abs/0901.1155 (2009) - [i8]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. CoRR abs/0903.0367 (2009) - [i7]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. CoRR abs/0912.1623 (2009) - [i6]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [c9]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. FOCS 2007: 625-633 - [c8]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. FOCS 2007: 713-723 - [c7]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. SODA 2007: 62-68 - [c6]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
A divide and conquer algorithm for d-dimensional arrangement. SODA 2007: 541-546 - [i5]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c5]Eden Chlamtac, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Using Embeddings. FOCS 2006: 687-696 - [c4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Directed metrics and directed graph partitioning problems. SODA 2006: 51-60 - [c3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for unique games. STOC 2006: 205-214 - [i3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for the Max k-CSP Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Note on MAX 2SAT. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c2]Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
Quadratic forms on graphs. STOC 2005: 486-493 - [c1]Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev:
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. STOC 2005: 573-581 - [i1]Konstantin Makarychev, Yury Makarychev:
Conditionally independent random variables. CoRR abs/cs/0510029 (2005) - 2002
- [j2]Konstantin Makarychev, Yury Makarychev, Andrei E. Romashchenko, Nikolai K. Vereshchagin:
A new class of non-Shannon-type inequalities for entropies. Commun. Inf. Syst. 2(2): 147-166 (2002)
1990 – 1999
- 1997
- [j1]Yury Makarychev:
A short proof of Kuratowski's graph planarity criterion. J. Graph Theory 25(2): 129-131 (1997)
Coauthor Index
[c52] [i48] [c49] [i44] [i43] [c44] [c43] [i38] [i37] [c42] [c41] [p2] [e1] [j11] [c40] [c39] [i34] [i33] [c37] [c34] [p1] [c33] [c32] [i32] [i31] [c31] [c30] [i27] [i26] [i25] [j7] [c27] [c26] [c25] [i24] [i21] [i20] [c23] [i19] [j5] [c21] [c18] [i17] [i16] [c17] [c16] [i14] [i13] [j4] [c13] [c11] [i11] [j3] [c10] [i8] [i6] [c9] [c8] [c7] [c6] [i5] [i4] [c5] [c4] [c3] [i3] [i2] [c2] [c1] [i1] [j2]
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-08-23 19:25 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:
