default search action
Jugal Garg
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
- [j25]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-sided matching markets with endowments: equilibria and algorithms. Auton. Agents Multi Agent Syst. 38(2): 40 (2024) - [j24]Bhaskar Ray Chaudhury
, Jugal Garg
EFX Exists for Three Agents. J. ACM 71(1): 4:1-4:27 (2024) - [j23]Jugal Garg, Aniket Murhekar:
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. J. Artif. Intell. Res. 80: 1-25 (2024) - [j22]Jugal Garg
Satiation in Fisher Markets and Approximation of Nash Social Welfare. Math. Oper. Res. 49(2): 1109-1139 (2024) - [c53]Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. IJCAI 2024: 2799-2806 - [c52]Hannaneh Akrami, Jugal Garg:
Breaking the 3/4 Barrier for Approximate Maximin Share. SODA 2024: 74-91 - [e1]Jugal Garg
Web and Internet Economics - 19th International Conference, WINE 2023, Shanghai, China, December 4-8, 2023, Proceedings. Lecture Notes in Computer Science 14413, Springer 2024, ISBN 978-3-031-48973-0 [contents] - [i44]Jugal Garg, Yixin Tao, László A. Végh:
Approximating Competitive Equilibrium by Nash Welfare. CoRR abs/2402.09994 (2024) - [i43]Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. CoRR abs/2402.17173 (2024) - [i42]Jugal Garg, Aniket Murhekar, John Qin:
Fair Division of Indivisible Chores via Earning Restricted Equilibria. CoRR abs/2407.03318 (2024) - [i41]Jugal Garg, Eklavya Sharma:
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm. CoRR abs/2410.08986 (2024) - [i40]Jugal Garg, Eklavya Sharma:
EF1 for Mixed Manna with Unequal Entitlements. CoRR abs/2410.12966 (2024) - 2023
- [j21]Jugal Garg
A Strongly Polynomial Algorithm for Linear Exchange Markets. Oper. Res. 71(2): 487-505 (2023) - [j20]Jugal Garg, Peter McGlaughlin, Martin Hoefer, Marco Schmalhofer:
Competitive Equilibria with a Constant Number of Chores. J. Artif. Intell. Res. 78: 1201-1219 (2023) - [j19]Bhaskar Ray Chaudhury, Jugal Garg
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna. Math. Oper. Res. 48(3): 1630-1656 (2023) - [j18]Jugal Garg
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. ACM Trans. Algorithms 19(4): 36:1-36:25 (2023) - [j17]Jugal Garg, Aniket Murhekar
Computing fair and efficient allocations with few utility values. Theor. Comput. Sci. 962: 113932 (2023) - [c51]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. AAMAS 2023: 2721-2723 - [c50]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. IJCAI 2023: 2485-2493 - [c49]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI 2023: 2494-2502 - [c48]Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio:
New Fairness Concepts for Allocating Indivisible Items. IJCAI 2023: 2554-2562 - [c47]Jugal Garg, Aniket Murhekar, John Qin:
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores. IJCAI 2023: 2710-2718 - [c46]Hannaneh Akrami
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC 2023: 61 - [c45]Jugal Garg, Edin Husic
Approximating Nash Social Welfare by Matching and Local Search. STOC 2023: 1298-1310 - [i39]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. CoRR abs/2303.16788 (2023) - [i38]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR abs/2305.04788 (2023) - [i37]Hannaneh Akrami, Jugal Garg:
Breaking the 3/4 Barrier for Approximate Maximin Share. CoRR abs/2307.07304 (2023) - [i36]Hannaneh Akrami, Jugal Garg, Setareh Taki:
Improving Approximation Guarantees for Maximin Share. CoRR abs/2307.12916 (2023) - 2022
- [j16]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
Fair Division of Indivisible Goods for a Class of Concave Valuations. J. Artif. Intell. Res. 74: 111-142 (2022) - [j15]Timothy Murray
Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods. IEEE Trans Autom. Sci. Eng. 19(1): 531-544 (2022) - [c44]Jugal Garg, Aniket Murhekar, John Qin:
Fair and Efficient Allocations of Chores under Bivalued Preferences. AAAI 2022: 5043-5050 - [c43]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS 2022: 463-471 - [c42]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
On the Existence of Competitive Equilibrium with Chores. ITCS 2022: 41:1-41:13 - [c41]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. EC 2022: 1106-1107 - [c40]Jugal Garg, Yixin Tao, László A. Végh
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. SODA 2022: 2269-2284 - [c39]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. WINE 2022: 362-363 - [i35]Jugal Garg, Aniket Murhekar:
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. CoRR abs/2204.14229 (2022) - [i34]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX Allocations: Simplifications and Improvements. CoRR abs/2205.07638 (2022) - [i33]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. CoRR abs/2205.11363 (2022) - [i32]Jugal Garg, Eklavya Sharma:
Existence and Computation of Epistemic EFX. CoRR abs/2206.01710 (2022) - [i31]Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák:
Approximating Nash Social Welfare by Matching and Local Search. CoRR abs/2211.03883 (2022) - [i30]Jugal Garg, Aniket Murhekar, John Qin:
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. CoRR abs/2212.02440 (2022) - 2021
- [j14]Jugal Garg
An improved approximation algorithm for maximin shares. Artif. Intell. 300: 103547 (2021) - [j13]Timothy Murray
Limited-trust equilibria. Eur. J. Oper. Res. 289(1): 364-380 (2021) - [j12]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel
Fast Algorithms for Rank-1 Bimatrix Games. Oper. Res. 69(2): 613-631 (2021) - [j11]Jugal Garg, Edin Husic
Approximating nash social welfare under rado valuations. SIGecom Exch. 19(1): 45-51 (2021) - [c38]Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta:
Fair and Efficient Allocations under Subadditive Valuations. AAAI 2021: 5269-5276 - [c37]Aniket Murhekar
On Fair and Efficient Allocations of Indivisible Goods. AAAI 2021: 5595-5602 - [c36]Jugal Garg, Pooja Kulkarni, Aniket Murhekar
On Fair and Efficient Allocations of Indivisible Public Goods. FSTTCS 2021: 22:1-22:19 - [c35]Jugal Garg, Martin Hoefer, Peter McGlaughlin, Marco Schmalhofer:
When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores. SAGT 2021: 329-344 - [c34]Jugal Garg, Aniket Murhekar
Computing Fair and Efficient Allocations with Few Utility Values. SAGT 2021: 345-359 - [c33]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. EC 2021: 310-311 - [c32]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. SODA 2021: 1405-1424 - [c31]Jugal Garg, Edin Husic
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. STACS 2021: 33:1-33:19 - [c30]Jugal Garg, Edin Husic
Approximating Nash social welfare under rado valuations. STOC 2021: 1412-1425 - [i29]Timothy Murray, Jugal Garg, Rakesh Nagi:
Trust in Social Network Games. CoRR abs/2103.01460 (2021) - [i28]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. CoRR abs/2103.01628 (2021) - [i27]Jugal Garg, Yixin Tao, László A. Végh:
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. CoRR abs/2107.05700 (2021) - [i26]Jugal Garg, Pooja Kulkarni, Aniket Murhekar:
On Fair and Efficient Allocations of Indivisible Public Goods. CoRR abs/2107.09871 (2021) - [i25]Jugal Garg, Aniket Murhekar, John Qin:
Fair and Efficient Allocations of Chores under Bivalued Preferences. CoRR abs/2110.09601 (2021) - [i24]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR abs/2112.10199 (2021) - 2020
- [j10]Peter McGlaughlin, Jugal Garg:
Improving Nash Social Welfare Approximations. J. Artif. Intell. Res. 68: 225-245 (2020) - [j9]Omkar Thakoor
Multiagent UAV Routing: A Game Theory Analysis With Tight Price of Anarchy Bounds. IEEE Trans Autom. Sci. Eng. 17(1): 100-116 (2020) - [c29]Jugal Garg, Peter McGlaughlin:
Computing Competitive Equilibria with Mixed Manna. AAMAS 2020: 420-428 - [c28]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. EC 2020: 1-19 - [c27]Jugal Garg, Setareh Taki:
An Improved Approximation Algorithm for Maximin Shares. EC 2020: 379-380 - [c26]Jugal Garg, Pooja Kulkarni, Rucha Kulkarni:
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. SODA 2020: 2673-2687 - [i23]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. CoRR abs/2002.05119 (2020) - [i22]Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta:
Fair and Efficient Allocations under Subadditive Valuations. CoRR abs/2005.06511 (2020) - [i21]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores. CoRR abs/2008.00285 (2020) - [i20]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. CoRR abs/2008.02753 (2020) - [i19]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. CoRR abs/2009.10320 (2020) - [i18]Jugal Garg, Edin Husic, László A. Végh:
Approximating Nash Social Welfare under Rado Valuations. CoRR abs/2009.14793 (2020)
2010 – 2019
- 2019
- [j8]Xiaohui Bei
Ascending-Price Algorithms for Unknown Markets. ACM Trans. Algorithms 15(3): 37:1-37:33 (2019) - [j7]Xiaohui Bei
Earning and Utility Limits in Fisher Markets. ACM Trans. Economics and Comput. 7(2): 10:1-10:35 (2019) - [c25]Jugal Garg, Peter McGlaughlin:
Improving Nash Social Welfare Approximations. IJCAI 2019: 294-300 - [c24]Jugal Garg, Peter McGlaughlin, Setareh Taki:
Approximating Maximin Share Allocations. SOSA 2019: 20:1-20:11 - [c23]Jugal Garg, László A. Végh
A strongly polynomial algorithm for linear exchange markets. STOC 2019: 54-65 - [i17]Jugal Garg, Setareh Taki:
An Improved Approximation Algorithm for Maximin Shares. CoRR abs/1903.00029 (2019) - [i16]Jugal Garg, Edin Husic, László A. Végh:
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. CoRR abs/1908.07948 (2019) - [i15]Jugal Garg, Pooja Kulkarni, Rucha Kulkarni:
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. CoRR abs/1912.12541 (2019) - 2018
- [j6]Jugal Garg
Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm. Math. Oper. Res. 43(3): 996-1024 (2018) - [j5]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria. ACM Trans. Economics and Comput. 6(1): 1:1-1:23 (2018) - [c22]Rahul Swamy
Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling. COCOA 2018: 722-738 - [c21]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg
On Fair Division for Indivisible Items. FSTTCS 2018: 25:1-25:17 - [c20]Jugal Garg, Peter McGlaughlin:
A Truthful Mechanism for Interval Scheduling. SAGT 2018: 100-112 - [c19]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. SODA 2018: 2311-2325 - [c18]Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Approximating the Nash Social Welfare with Budget-Additive Valuations. SODA 2018: 2326-2340 - [i14]Yun Kuen Cheung, Bhaskar Chaudhuri, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division of Indivisible Items. CoRR abs/1805.06232 (2018) - [i13]Jugal Garg, László A. Végh:
A Strongly Polynomial Algorithm for Linear Exchange Markets. CoRR abs/1809.06266 (2018) - [i12]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel:
Fast Algorithms for Rank-1 Bimatrix Games. CoRR abs/1812.04611 (2018) - 2017
- [j4]Jugal Garg
Market equilibrium under piecewise Leontief concave utilities. Theor. Comput. Sci. 703: 55-65 (2017) - [c17]Xiaohui Bei
Earning Limits in Fisher Markets with Spending-Constraint Utilities. SAGT 2017: 67-79 - [c16]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. STOC 2017: 890-901 - [i11]Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Approximating the Nash Social Welfare with Budget-Additive Valuations. CoRR abs/1707.04428 (2017) - 2016
- [j3]Nikhil R. Devanur, Jugal Garg, László A. Végh:
A Rational Convex Program for Linear Arrow-Debreu Markets. ACM Trans. Economics and Comput. 5(1): 6:1-6:13 (2016) - [j2]Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. Theory Comput. 12(1): 1-25 (2016) - [c15]Xiaohui Bei
Learning Market Parameters Using Aggregate Demand Queries. AAAI 2016: 411-417 - [c14]Xiaohui Bei
Computing Equilibria in Markets with Budget-Additive Utilities. ESA 2016: 8:1-8:14 - [c13]Xiaohui Bei
Ascending-Price Algorithms for Unknown Markets. EC 2016: 699 - [c12]Ran Duan, Jugal Garg, Kurt Mehlhorn:
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. SODA 2016: 90-106 - [i10]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Computing Equilibria in Markets with Budget-Additive Utilities. CoRR abs/1603.07210 (2016) - 2015
- [j1]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. SIAM J. Comput. 44(6): 1820-1847 (2015) - [c11]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. ICALP (1) 2015: 554-566 - [c10]Jugal Garg, Ravi Kannan:
Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange. EC 2015: 733-749 - [i9]Xiaohui Bei, Jugal Garg, Martin Hoefer:
Tatonnement for Linear and Gross Substitutes Markets. CoRR abs/1507.04925 (2015) - [i8]Ran Duan, Jugal Garg, Kurt Mehlhorn:
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR abs/1510.02694 (2015) - [i7]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A Market for Scheduling, with Applications to Cloud Computing. CoRR abs/1511.08748 (2015) - 2014
- [c9]Jugal Garg, Vijay V. Vazirani:
On Computability of Equilibria in Markets with Production. SODA 2014: 1329-1340 - [c8]Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. STOC 2014: 525-534 - [c7]Jugal Garg:
Market Equilibrium under Piecewise Leontief Concave Utilities - [Extended Abstract]. WINE 2014: 467-473 - [i6]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness. CoRR abs/1411.5060 (2014) - 2013
- [c6]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Nisheeth K. Vishnoi:
Towards Polynomial Simplex-Like Algorithms for Market Equlibria. SODA 2013: 1226-1242 - [i5]Nikhil R. Devanur, Jugal Garg, László A. Végh:
A Rational Convex Program for Linear Arrow-Debreu Markets. CoRR abs/1307.8037 (2013) - [i4]Jugal Garg, Vijay V. Vazirani:
Computability of Equilibria in Markets with Production. CoRR abs/1308.5272 (2013) - 2012
- [c5]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. STOC 2012: 1003-1016 - 2011
- [c4]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm. STOC 2011: 195-204 - [c3]Jugal Garg, Albert Xin Jiang, Ruta Mehta:
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses. WINE 2011: 399-407 - [i3]Jugal Garg, Albert Xin Jiang, Ruta Mehta:
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses. CoRR abs/1109.6182 (2011) - 2010
- [c2]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
A Simplex-Like Algorithm for Fisher Markets. SAGT 2010: 18-29 - [c1]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash Equilibria in Fisher Market. SAGT 2010: 30-41 - [i2]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash equilibria in Fisher market. CoRR abs/1002.4832 (2010) - [i1]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm. CoRR abs/1010.3083 (2010)
Coauthor Index
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-11-25 22:40 CET 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: