default search action
Chaitanya Swamy
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
- [c61]David Alemán Espinosa, Chaitanya Swamy:
Approximation Algorithms for Correlated Knapsack Orienteering. APPROX/RANDOM 2024: 29:1-29:24 - [c60]Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy:
Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. ITCS 2024: 84:1-84:22 - [i38]David Alemán Espinosa, Chaitanya Swamy:
Approximation Algorithms for Correlated Knapsack Orienteering. CoRR abs/2408.16566 (2024) - 2022
- [j23]Zachary Friggstad
, Chaitanya Swamy
A constant-factor approximation for directed latency in quasi-polynomial time. J. Comput. Syst. Sci. 126: 44-58 (2022) - [c59]Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO 2022: 195-209 - [c58]Sharat Ibrahimpur
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. SOSA 2022: 247-256 - [e1]Amit Chakrabarti
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). LIPIcs 245, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-249-5 [contents] - 2021
- [c57]Zachary Friggstad, Chaitanya Swamy:
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. ICALP 2021: 67:1-67:21 - [c56]Sharat Ibrahimpur
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. ICALP 2021: 81:1-81:20 - [i37]Sharat Ibrahimpur, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. CoRR abs/2111.07244 (2021) - [i36]Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR abs/2111.07414 (2021) - [i35]Haripriya Pulyassary, Chaitanya Swamy:
On the Randomized Metric Distortion Conjecture. CoRR abs/2111.08698 (2021) - 2020
- [j22]André Linhares, Neil Olver, Chaitanya Swamy
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020) - [j21]Valentine Kabanets, Sofya Raskhodnikova, Chaitanya Swamy:
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017). SIAM J. Comput. 49(4) (2020) - [c55]Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ESA 2020: 52:1-52:20 - [c54]Sharat Ibrahimpur, Chaitanya Swamy:
Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. FOCS 2020: 966-977 - [i34]Sharat Ibrahimpur
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization. CoRR abs/2010.05127 (2020)
2010 – 2019
- 2019
- [j20]Konstantinos Georgiou, Chaitanya Swamy:
Black-box reductions for cost-sharing mechanism design. Games Econ. Behav. 113: 17-37 (2019) - [j19]Umang Bhaskar, Katrina Ligett
Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. 118: 533-569 (2019) - [c53]Deeparnab Chakrabarty, Chaitanya Swamy:
Simpler and Better Algorithms for Minimum-Norm Load Balancing. ESA 2019: 27:1-27:12 - [c52]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312 - [c51]Deeparnab Chakrabarty, Chaitanya Swamy:
Approximation algorithms for minimum norm and ordered optimization problems. STOC 2019: 126-137 - [c50]André Linhares, Chaitanya Swamy:
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. STOC 2019: 768-779 - [i33]André Linhares, Chaitanya Swamy:
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions. CoRR abs/1904.07381 (2019) - [i32]Deeparnab Chakrabarty, Chaitanya Swamy:
Simpler and Better Algorithms for Minimum-Norm Load Balancing. CoRR abs/1905.00044 (2019) - [i31]Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. CoRR abs/1912.06198 (2019) - 2018
- [j18]André Linhares, Chaitanya Swamy:
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Math. Program. 172(1-2): 17-34 (2018) - [j17]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - [c49]Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - [c48]Deeparnab Chakrabarty, Chaitanya Swamy:
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. ICALP 2018: 29:1-29:14 - [c47]Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins:
Orienteering Algorithms for Generating Travel Itineraries. WSDM 2018: 180-188 - [c46]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim
Minimizing Latency in Online Ride and Delivery Services. WWW 2018: 379-388 - [i30]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. CoRR abs/1802.02744 (2018) - [i29]Deeparnab Chakrabarty, Chaitanya Swamy:
Approximation Algorithms for Minimum Norm and Ordered Optimization Problems. CoRR abs/1811.05022 (2018) - [i28]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR abs/1811.09027 (2018) - 2017
- [c45]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM 2017: 17:1-17:13 - [c44]André Linhares, Chaitanya Swamy:
Improved Algorithms for MST and Metric-TSP Interdiction. ICALP 2017: 32:1-32:14 - [c43]Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. IPCO 2017: 199-211 - [c42]Sharat Ibrahimpur
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. IPCO 2017: 279-291 - [i27]André Linhares, Chaitanya Swamy:
Improved Algorithms for MST and Metric-TSP Interdiction. CoRR abs/1706.00034 (2017) - [i26]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR abs/1706.06565 (2017) - [i25]Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. CoRR abs/1708.01335 (2017) - [i24]Sharat Ibrahimpur
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. CoRR abs/1708.06857 (2017) - [i23]Deeparnab Chakrabarty, Chaitanya Swamy:
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. CoRR abs/1711.08715 (2017) - 2016
- [j16]Deeparnab Chakrabarty, Chaitanya Swamy:
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems. Math. Oper. Res. 41(3): 865-883 (2016) - [j15]Chaitanya Swamy:
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. ACM Trans. Algorithms 12(4): 49:1-49:22 (2016) - [c41]Sara Ahmadian, Chaitanya Swamy:
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. ICALP 2016: 69:1-69:15 - [c40]André Linhares, Chaitanya Swamy:
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. IPCO 2016: 38-49 - [c39]Umang Bhaskar, Yu Cheng
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. EC 2016: 479-496 - [i22]André Linhares, Chaitanya Swamy:
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. CoRR abs/1605.03203 (2016) - [i21]Sara Ahmadian, Chaitanya Swamy:
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. CoRR abs/1608.01700 (2016) - 2015
- [j14]Hadi Minooei, Chaitanya Swamy:
Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. ACM Trans. Economics and Comput. 3(4): 19:1-19:24 (2015) - [c38]Ian Post, Chaitanya Swamy:
Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract). SODA 2015: 512-531 - [c37]Guru Guruganesh, Laura Sanità, Chaitanya Swamy:
Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract). SODA 2015: 676-695 - [c36]Jian Li, Yuval Rabani
Learning Arbitrary Statistical Mixtures of Discrete Distributions. STOC 2015: 743-752 - [i20]Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Arbitrary Statistical Mixtures of Discrete Distributions. CoRR abs/1504.02526 (2015) - [i19]Siddharth Barman, Umang Bhaskar, Chaitanya Swamy:
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR abs/1505.04897 (2015) - [i18]Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy:
Near-Optimal Hardness Results for Signaling in Bayesian Games. CoRR abs/1512.03543 (2015) - 2014
- [c35]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM 2014: 17-33 - [c34]Chaitanya Swamy:
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. APPROX-RANDOM 2014: 403-418 - [c33]Umang Bhaskar, Katrina Ligett
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. FOCS 2014: 31-40 - [c32]Deeparnab Chakrabarty, Chaitanya Swamy:
Welfare maximization and truthfulness in mechanism design with ordinal preferences. ITCS 2014: 105-120 - [c31]Yuval Rabani
Learning mixtures of arbitrary distributions over large discrete domains. ITCS 2014: 207-224 - [c30]Zachary Friggstad, Chaitanya Swamy:
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. STOC 2014: 744-753 - [i17]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. CoRR abs/1408.1429 (2014) - [i16]Guru Guruganesh, Laura Sanità, Chaitanya Swamy:
Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. CoRR abs/1410.5105 (2014) - [i15]Ian Post, Chaitanya Swamy:
Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems. CoRR abs/1411.4573 (2014) - 2013
- [c29]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA 2013: 1607-1621 - [c28]Hadi Minooei, Chaitanya Swamy:
Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. WINE 2013: 377-390 - [i14]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. CoRR abs/1301.4478 (2013) - [i13]Chaitanya Swamy:
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. CoRR abs/1310.7834 (2013) - [i12]Zachary Friggstad, Chaitanya Swamy:
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing. CoRR abs/1311.6024 (2013) - [i11]Hadi Minooei, Chaitanya Swamy:
Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. CoRR abs/1311.6883 (2013) - [i10]Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy:
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply. CoRR abs/1312.0137 (2013) - [i9]Deeparnab Chakrabarty, Chaitanya Swamy:
Welfare Maximization and Truthfulness in Mechanism Design with Ordinal Preferences. CoRR abs/1312.1831 (2013) - 2012
- [j13]Elliot Anshelevich
Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012) - [j12]Rafail Ostrovsky, Yuval Rabani
The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28:1-28:22 (2012) - [j11]Retsef Levi, David B. Shmoys
LP-based approximation algorithms for capacitated facility location. Math. Program. 131(1-2): 365-379 (2012) - [j10]Chaitanya Swamy, David B. Shmoys
Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. 41(4): 975-1004 (2012) - [j9]Chaitanya Swamy:
The effectiveness of stackelberg strategies and tolls for network congestion games. ACM Trans. Algorithms 8(4): 36:1-36:19 (2012) - [c27]Konstantinos Georgiou, Chaitanya Swamy:
Black-box reductions for cost-sharing mechanism design. SODA 2012: 896-913 - [c26]Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. WAOA 2012: 257-271 - [c25]Hadi Minooei, Chaitanya Swamy:
Truthful Mechanism Design for Multidimensional Covering Problems. WINE 2012: 448-461 - [i8]Hadi Minooei, Chaitanya Swamy:
Truthful Mechanism Design for Multidimensional Covering Problems. CoRR abs/1211.3201 (2012) - [i7]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Mixtures of Arbitrary Distributions over Large Discrete Domains. CoRR abs/1212.1527 (2012) - 2011
- [j8]Ron Lavi
Truthful and Near-Optimal Mechanism Design via Linear Programming. J. ACM 58(6): 25:1-25:24 (2011) - [c24]Deeparnab Chakrabarty, Chaitanya Swamy:
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011: 92-103 - [c23]Chaitanya Swamy:
Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions. SODA 2011: 1627-1646 - [i6]Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. CoRR abs/1104.3128 (2011) - 2010
- [c22]Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy:
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO 2010: 244-257 - [c21]Khaled M. Elbassioni
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE 2010: 462-472 - [i5]Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy:
Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm. CoRR abs/1003.1295 (2010) - [i4]Deeparnab Chakrabarty, Chaitanya Swamy:
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems. CoRR abs/1009.2452 (2010)
2000 – 2009
- 2009
- [j7]Ron Lavi
Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games Econ. Behav. 67(1): 99-124 (2009) - [c20]Elliot Anshelevich
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983 - 2008
- [j6]John Augustine, Sandy Irani, Chaitanya Swamy:
Optimal Power-Down Strategies. SIAM J. Comput. 37(5): 1499-1516 (2008) - [j5]Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy:
Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4): 1411-1429 (2008) - [j4]Chaitanya Swamy, David B. Shmoys
Fault-tolerant facility location. ACM Trans. Algorithms 4(4): 51:1-51:27 (2008) - [c19]Maurice Cheung, Chaitanya Swamy:
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. FOCS 2008: 35-44 - [c18]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies. SODA 2008: 671-680 - [i3]Chaitanya Swamy:
Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions. CoRR abs/0805.0389 (2008) - 2007
- [c17]Ron Lavi
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. EC 2007: 252-261 - [c16]Chaitanya Swamy:
The effectiveness of Stackelberg strategies and tolls for network congestion games. SODA 2007: 1133-1142 - [c15]Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson:
Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA 2007: 1275-1284 - [i2]Chaitanya Swamy, David B. Shmoys
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - 2006
- [j3]David B. Shmoys
An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6): 978-1012 (2006) - [j2]Chaitanya Swamy, David B. Shmoys
Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37(1): 33-46 (2006) - [c14]Michael Langberg, Yuval Rabani
Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187 - [c13]Rafail Ostrovsky, Yuval Rabani
The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 - [c12]Chaitanya Swamy, David B. Shmoys:
Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS 2006: 5-19 - 2005
- [c11]Chaitanya Swamy, David B. Shmoys
Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS 2005: 357-366 - [c10]Ron Lavi
Truthful and Near-Optimal Mechanism Design via Linear Programming. FOCS 2005: 595-604 - [c9]Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos:
Network design for information networks. SODA 2005: 933-942 - [i1]Chaitanya Swamy, David B. Shmoys
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [b1]Chaitanya Swamy:
Approximation Algorithms for Clustering Problems. Cornell University, USA, 2004 - [j1]Chaitanya Swamy, Amit Kumar:
Primal-Dual Algorithms for Connected Facility Location Problems. Algorithmica 40(4): 245-269 (2004) - [c8]David B. Shmoys
Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS 2004: 228-237 - [c7]John Augustine, Sandy Irani, Chaitanya Swamy:
Optimal Power-Down Strategies. FOCS 2004: 530-539 - [c6]Retsef Levi, David B. Shmoys, Chaitanya Swamy:
LP-based Approximation Algorithms for Capacitated Facility Location. IPCO 2004: 206-218 - [c5]Chaitanya Swamy:
Correlation Clustering: maximizing agreements via semidefinite programming. SODA 2004: 526-527 - [c4]David B. Shmoys
Facility location with Service Installation Costs. SODA 2004: 1088-1097 - 2003
- [c3]Chaitanya Swamy, David B. Shmoys
Fault-tolerant facility location. SODA 2003: 735-736 - 2002
- [c2]Chaitanya Swamy, Amit Kumar
Primal-Dual Algorithms for Connected Facility Location Problems. APPROX 2002: 256-270
1990 – 1999
- 1999
- [c1]Naveen Garg
A Randomized Algorithm for Flow Shop Scheduling. FSTTCS 1999: 213-218
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-09-30 00:10 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: