default search action
Mohammad Hossein Bateni 0001
MohammadHossein Bateni
Person information
- affiliation: Google
Other persons with the same name
- Mohammad Hossein Bateni 0002
— Isfahan University of Technology, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c48]MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi:
A Scalable Algorithm for Individually Fair k-Means Clustering. AISTATS 2024: 3151-3159 - [c47]MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram, Chen Wang:
Metric Clustering and MST with Strong and Weak Distance Oracles. COLT 2024: 498-550 - [c46]Yanfei Chen, Jinsung Yoon, Devendra Singh Sachan, Qingze Wang, Vincent Cohen-Addad, MohammadHossein Bateni, Chen-Yu Lee, Tomas Pfister:
Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval. EMNLP (Findings) 2024: 4705-4726 - [c45]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC Average Linkage! ICALP 2024: 18:1-18:18 - [c44]Sara Ahmadian
Resilient k-Clustering. KDD 2024: 29-38 - [c43]MohammadHossein Bateni
Improved Active Covering via Density-Based Space Transformation. KDD 2024: 107-118 - [i30]MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi:
A Scalable Algorithm for Individually Fair K-means Clustering. CoRR abs/2402.06730 (2024) - [i29]Taisuke Yasuda, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni:
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization. CoRR abs/2402.17902 (2024) - [i28]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC with Average Linkage! CoRR abs/2404.14730 (2024) - [i27]MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
Efficient Centroid-Linkage Clustering. CoRR abs/2406.05066 (2024) - [i26]Yanfei Chen, Jinsung Yoon, Devendra Singh Sachan, Qingze Wang, Vincent Cohen-Addad, MohammadHossein Bateni, Chen-Yu Lee, Tomas Pfister:
Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval. CoRR abs/2408.01875 (2024) - 2023
- [j18]Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab Mirrokni:
Tackling Provably Hard Representative Selection via Graph Neural Networks. Trans. Mach. Learn. Res. 2023 (2023) - [c42]Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin:
On Complexity of 1-Center in Various Metrics. APPROX/RANDOM 2023: 1:1-1:19 - [c41]Otilia Stretcu, Edward Vendrow, Kenji Hata, Krishnamurthy Viswanathan, Vittorio Ferrari, Sasan Tavakkol, Wenlei Zhou, Aditya Avinash, Enming Luo, Neil Gordon Alldrin, MohammadHossein Bateni, Gabriel Berger, Andrew Bunner, Chun-Ta Lu, Javier A Rey, Giulia DeSalvo, Ranjay Krishna, Ariel Fuxman:
Agile Modeling: From Concept to Classifier in Minutes. ICCV 2023: 22266-22277 - [c40]Taisuke Yasuda, Mohammad Hossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Sequential Attention for Feature Selection. ICLR 2023 - [c39]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. SODA 2023: 2677-2727 - [c38]Sami Abu-El-Haija, Joshua V. Dillon, Bahare Fatemi, Kyriakos Axiotis, Neslihan Bulut, Johannes Gasteiger, Bryan Perozzi, MohammadHossein Bateni:
SubMix: Learning to Mix Graph Sampling Heuristics. UAI 2023: 1-10 - [i25]Otilia Stretcu, Edward Vendrow, Kenji Hata, Krishnamurthy Viswanathan, Vittorio Ferrari, Sasan Tavakkol, Wenlei Zhou, Aditya Avinash, Enming Luo, Neil Gordon Alldrin, MohammadHossein Bateni, Gabriel Berger, Andrew Bunner, Chun-Ta Lu, Javier A Rey, Ariel Fuxman:
Agile Modeling: Image Classification with Domain Experts in the Loop. CoRR abs/2302.12948 (2023) - [i24]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR abs/2303.11843 (2023) - [i23]MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram, Chen Wang:
Metric Clustering and MST with Strong and Weak Distance Oracles. CoRR abs/2310.15863 (2023) - 2022
- [j17]MohammadHossein Bateni, Yiwei Chen
Fair Resource Allocation in a Volatile Marketplace. Oper. Res. 70(1): 288-308 (2022) - [c37]MohammadHossein Bateni, Morteza Monemizadeh, Kees Voorintholt:
Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs. ICDM (Workshops) 2022: 777-786 - [i22]Seyed Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab S. Mirrokni:
Tackling Provably Hard Representative Selection via Graph Neural Networks. CoRR abs/2205.10403 (2022) - [i21]MohammadHossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni, Taisuke Yasuda:
Sequential Attention for Feature Selection. CoRR abs/2209.14881 (2022) - 2021
- [c36]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [c35]Yuchen Wu, Jakab Tardos, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard:
Streaming Belief Propagation for Community Detection. NeurIPS 2021: 26976-26988 - [i20]Yuchen Wu, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard, Jakab Tardos:
Streaming Belief Propagation for Community Detection. CoRR abs/2106.04805 (2021) - [i19]Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin:
On Complexity of 1-Center in Various Metrics. CoRR abs/2112.03222 (2021) - [i18]MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram, Vahab S. Mirrokni:
Optimal Fully Dynamic k-Centers Clustering. CoRR abs/2112.07050 (2021)
2010 – 2019
- 2019
- [j16]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. Algorithms 12(8): 162 (2019) - [j15]Arash Asadpour
Concise Bid Optimization Strategies with Multiple Budget Constraints. Manag. Sci. 65(12): 5785-5812 (2019) - [j14]Aaron Archer, Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni, Aaron Schild, Ray Yang, Richard Zhuang:
Cache-aware load balancing of data center applications. Proc. VLDB Endow. 12(6): 709-723 (2019) - [j13]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Silvio Lattanzi:
Introduction to the Special Issue for SPAA'17. ACM Trans. Parallel Comput. 6(3): 10:1 (2019) - [c34]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. ICML 2019: 333-343 - [c33]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. ICML 2019: 515-523 - [c32]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA 2019: 1055-1068 - [c31]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA 2019: 1616-1635 - [i17]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. CoRR abs/1904.13389 (2019) - [i16]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. CoRR abs/1906.01993 (2019) - 2018
- [j12]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. SIAM J. Comput. 47(4): 1275-1293 (2018) - [c30]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c29]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Optimal Distributed Submodular Optimization via Sketching. KDD 2018: 1138-1147 - [c28]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast algorithms for knapsack via convolution and prediction. STOC 2018: 1269-1282 - [i15]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - [i14]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. CoRR abs/1811.04052 (2018) - [i13]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast Algorithms for Knapsack via Convolution and Prediction. CoRR abs/1811.12554 (2018) - 2017
- [c27]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin:
A Study of Compact Reserve Pricing Languages. AAAI 2017: 363-368 - [c26]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c25]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. SPAA 2017: 13-23 - [i12]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - 2016
- [c24]MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni:
Fair Resource Allocation in A Volatile Marketplace. EC 2016: 819 - [c23]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC 2016: 570-583 - [c22]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. WSDM 2016: 387-396 - [r1]MohammadHossein Bateni:
Secretary Problems and Online Auctions. Encyclopedia of Algorithms 2016: 1910-1913 - [i11]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. CoRR abs/1610.08096 (2016) - [i10]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Distributed Coverage Maximization via Sketching. CoRR abs/1612.02327 (2016) - 2015
- [j11]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. ACM Trans. Economics and Comput. 3(4): 18:1-18:16 (2015) - [c21]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. ESA 2015: 95-105 - [i9]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. CoRR abs/1512.02727 (2015) - 2014
- [c20]MohammadHossein Bateni, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni:
Distributed Balanced Clustering via Mapping Coresets. NIPS 2014: 2591-2599 - [c19]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative bidding in online advertising. EC 2014: 715-732 - [c18]Melika Abolhassani, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Network Cournot Competition. WINE 2014: 15-29 - [c17]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. WINE 2014: 263-276 - [i8]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative Bidding in Online Advertising. CoRR abs/1404.6727 (2014) - [i7]Melika Abolhassani, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Network Cournot Competition. CoRR abs/1405.1794 (2014) - [i6]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. CoRR abs/1412.3187 (2014) - 2013
- [j10]MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. Algorithmica 65(3): 545-561 (2013) - [j9]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4): 32:1-32:23 (2013) - [c16]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems. ICALP (1) 2013: 81-92 - [c15]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. WINE 2013: 40-53 - [i5]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. CoRR abs/1304.7530 (2013) - 2012
- [j8]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Euclidean Prize-Collecting Steiner Forest. Algorithmica 62(3-4): 906-929 (2012) - [j7]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. ACM Trans. Algorithms 8(3): 20:1-20:19 (2012) - [c14]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu:
A polynomial-time approximation scheme for planar multiway cut. SODA 2012: 639-655 - 2011
- [j6]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx:
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. J. ACM 58(5): 21:1-21:37 (2011) - [j5]MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. Theory Comput. Syst. 49(4): 757-780 (2011) - [j4]Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. SIAM J. Comput. 40(2): 309-332 (2011) - [c13]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Sina Jafarpour, Dan Pei
Towards an efficient algorithmic framework for pricing cellular data service. INFOCOM 2011: 581-585 - [c12]MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 - 2010
- [j3]MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen:
Multi-VPN Optimization for Scalable Routing via Relaying. IEEE/ACM Trans. Netw. 18(5): 1544-1556 (2010) - [c11]MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. APPROX-RANDOM 2010: 25-38 - [c10]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52 - [c9]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini:
The Cooperative Game Theory Foundations of Network Bargaining Games. ICALP (1) 2010: 67-78 - [c8]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Euclidean Prize-Collecting Steiner Forest. LATIN 2010: 503-514 - [c7]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. STOC 2010: 211-220 - [i4]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini:
The cooperative game theory foundations of network bargaining games. CoRR abs/1004.4317 (2010) - [i3]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Prize-collecting Network Design on Planar Graphs. CoRR abs/1006.4339 (2010)
2000 – 2009
- 2009
- [j2]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
A note on the subadditive network design problem. Oper. Res. Lett. 37(5): 339-344 (2009) - [c6]Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 - [c5]MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen:
Multi-VPN Optimization for Scalable Routing via Relaying. INFOCOM 2009: 2756-2760 - [c4]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. SODA 2009: 805-814 - [c3]MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA 2009: 29-38 - [c2]MohammadHossein Bateni, Moses Charikar
MaxMin allocation via degree lower-bounded arborescences. STOC 2009: 543-552 - [i2]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. CoRR abs/0911.5143 (2009) - [i1]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
Euclidean Prize-collecting Steiner Forest. CoRR abs/0912.1137 (2009) - 2007
- [j1]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami:
Plane Embeddings of Planar Graph Metrics. Discret. Comput. Geom. 38(3): 615-637 (2007) - 2006
- [c1]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami:
Plane embeddings of planar graph metrics. SCG 2006: 197-206
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-14 21:00 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: