default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad R. Salavatipour
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
[j43]Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Approximations for Throughput Maximization. Algorithmica 86(5): 1545-1577 (2024)- [j42]Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour
:
Approximation schemes for Min-Sum k-Clustering. Discret. Optim. 54: 100860 (2024) - [c43]Mohammad R. Salavatipour, Lijiangnan Tian:
Approximation Algorithms for the Airport and Railway Problem. SWAT 2024: 40:1-40:16 - [i14]Kinter Ren, Mohammad R. Salavatipour:
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics. CoRR abs/2405.00818 (2024) - [i13]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun:
A QPTAS for Facility Location on Unit Disk graphs. CoRR abs/2405.08931 (2024) - 2023
- [j41]Meng He, Anna Lubiw, Mohammad R. Salavatipour:
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Algorithmica 85(6): 1736-1737 (2023) - [j40]Meng He, Anna Lubiw, Mohammad R. Salavatipour:
Preface. Comput. Geom. 110: 101958 (2023) - [j39]Aditya Jayaprakash, Mohammad R. Salavatipour:
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. ACM Trans. Algorithms 19(2): 20:1-20:36 (2023) - [c42]Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Min-Sum k-Clustering. ESA 2023: 84:1-84:16 - 2022
- [j38]Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. Algorithmica 84(9): 2462-2479 (2022) - [c41]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. IPCO 2022: 251-261 - [c40]Aditya Jayaprakash, Mohammad R. Salavatipour:
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. SODA 2022: 877-893 - 2021
- [j37]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica 83(3): 775 (2021) - [e2]Anna Lubiw, Mohammad R. Salavatipour:
Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings. Lecture Notes in Computer Science 12808, Springer 2021, ISBN 978-3-030-83507-1 [contents] - [i12]Aditya Jayaprakash, Mohammad R. Salavatipour:
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. CoRR abs/2106.15034 (2021) - [i11]Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Hierarchical Clustering: New Bounds and Objective. CoRR abs/2111.06863 (2021) - [i10]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for CVRP with Unsplittable Demands. CoRR abs/2111.08138 (2021) - 2020
- [j36]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Preface. Comput. Geom. 91: 101671 (2020) - [c39]Haozhou Pang, Mohammad R. Salavatipour:
Approximation Algorithms for Generalized Path Scheduling. ISAAC 2020: 10:1-10:16 - [c38]Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Approximations for Throughput Maximization. ISAAC 2020: 11:1-11:17 - [c37]Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. STACS 2020: 33:1-33:14 - [i9]Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Approximations for Throughput Maximization. CoRR abs/2001.10037 (2020)
2010 – 2019
- 2019
- [j35]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Algorithmica 81(3): 1006-1030 (2019) - [j34]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto:
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Algorithmica 81(3): 1075-1095 (2019) - [j33]Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang:
Scheduling problems over a network of machines. J. Sched. 22(2): 239-253 (2019) - [j32]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. SIAM J. Comput. 48(2): 452-480 (2019) - [j31]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15(2): 26:1-26:26 (2019) - [c36]Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour:
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. SODA 2019: 2958-2972 - [e1]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Lecture Notes in Computer Science 11646, Springer 2019, ISBN 978-3-030-24765-2 [contents] - 2018
- [j30]Christopher S. Martin, Mohammad R. Salavatipour:
Minimizing Latency of Capacitated k-Tours. Algorithmica 80(8): 2492-2511 (2018) - [j29]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) - [c35]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. SODA 2018: 398-414 - [i8]Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour:
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means. CoRR abs/1807.05443 (2018) - 2017
- [c34]Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang:
Scheduling Problems over Network of Machines. APPROX-RANDOM 2017: 5:1-5:18 - [i7]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. CoRR abs/1707.04295 (2017) - 2016
- [j28]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. Algorithmica 75(1): 53-83 (2016) - [j27]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55(1): 39-73 (2016) - [j26]M. Reza Khani, Mohammad R. Salavatipour:
Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph. J. Comb. Optim. 31(2): 669-685 (2016) - [c33]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. FOCS 2016: 365-374 - [c32]Christopher S. Martin, Mohammad R. Salavatipour:
Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. ISAAC 2016: 56:1-56:12 - [c31]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. SWAT 2016: 1:1-1:14 - [i6]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. CoRR abs/1603.08976 (2016) - 2015
- [j25]Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. Algorithmica 73(1): 143-165 (2015) - [c30]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) 2015: 116-128 - [c29]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto:
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. WADS 2015: 373-385 - 2014
- [j24]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. Algorithmica 69(2): 443-460 (2014) - [j23]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10(1): 1:1-1:15 (2014) - [c28]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 - [i5]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR abs/1401.7042 (2014) - 2013
- [j22]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013) - [j21]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SIAM J. Comput. 42(4): 1596-1619 (2013) - 2012
- [j20]Imran A. Pirwani, Mohammad R. Salavatipour:
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. Algorithmica 62(3-4): 1050-1072 (2012) - [c27]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to walk your dog in the mountains with no magic leash. SCG 2012: 121-130 - [c26]Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. SWAT 2012: 71-82 - [c25]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. SWAT 2012: 237-248 - 2011
- [j19]Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. Algorithmica 60(2): 395-400 (2011) - [j18]MohammadAli Safari, Mohammad R. Salavatipour:
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs. SIAM J. Discret. Math. 25(3): 1089-1102 (2011) - [j17]Zachary Friggstad, Mohammad R. Salavatipour:
Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7(3): 28:1-28:22 (2011) - [c24]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems. APPROX-RANDOM 2011: 302-314 - [c23]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph. ISAAC 2011: 20-29 - 2010
- [j16]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010) - [c22]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SODA 2010: 419-428 - [c21]Imran A. Pirwani, Mohammad R. Salavatipour:
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. SWAT 2010: 188-199
2000 – 2009
- 2009
- [j15]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) - [j14]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) - [c20]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709 - [i4]Imran A. Pirwani, Mohammad R. Salavatipour:
A PTAS for Minimum Clique Partition in Unit Disk Graphs. CoRR abs/0904.2203 (2009) - [i3]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. CoRR abs/0907.0726 (2009) - 2008
- [j13]Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour:
Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008) - [c19]MohammadAli Safari, Mohammad R. Salavatipour:
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. APPROX-RANDOM 2008: 233-246 - [c18]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600 - [c17]Zachary Friggstad, Mohammad R. Salavatipour:
Minimizing Movement in Mobile Facility Location Problems. FOCS 2008: 357-366 - 2007
- [j12]Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin:
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. BMC Bioinform. 8 (2007) - [j11]Michael Molloy, Mohammad R. Salavatipour:
The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37(3): 895-922 (2007) - [j10]Joseph Cheriyan, Mohammad R. Salavatipour:
Packing element-disjoint steiner trees. ACM Trans. Algorithms 3(4): 47 (2007) - [j9]Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4): 48 (2007) - [c16]Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Yi Shi, Lizhe Xu, Guohui Lin:
Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction. APBC 2007: 81-90 - [c15]Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. ISAAC 2007: 304-315 - [c14]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 - [c13]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable network design with degree or order constraints. STOC 2007: 651-660 - [c12]Omid Madani, Wiley Greiner, David Kempe, Mohammad R. Salavatipour:
Recall Systems: Effcient Learning and Use of Category Indices. AISTATS 2007: 307-314 - 2006
- [j8]Joseph Cheriyan, Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees. Algorithmica 45(1): 21-43 (2006) - [j7]Mohammad R. Salavatipour:
Large Induced Forests in Triangle-Free Planar Graphs. Graphs Comb. 22(1): 113-126 (2006) - [c11]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163 - [c10]Zhipeng Cai, Lizhe Xu, Yi Shi, Mohammad R. Salavatipour, Randy Goebel, Guohui Lin:
Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy. BIBE 2006: 235-242 - [c9]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 - [c8]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour:
Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171 - [i2]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk k-Steiner trees. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j6]Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour:
Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory B 93(2): 303-311 (2005) - [j5]Michael Molloy, Mohammad R. Salavatipour:
A bound on the chromatic number of the square of a planar graph. J. Comb. Theory B 94(2): 189-213 (2005) - [c7]Joseph Cheriyan, Mohammad R. Salavatipour:
Packing Element-Disjoint Steiner Trees. APPROX-RANDOM 2005: 52-61 - [c6]Mohammad R. Salavatipour, Jacques Verstraëte:
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. IPCO 2005: 51-65 - 2004
- [j4]Mohammad R. Salavatipour:
A polynomial time algorithm for strong edge coloring of partial k-trees. Discret. Appl. Math. 143(1-3): 285-291 (2004) - [j3]Mohammad R. Salavatipour:
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. Random Struct. Algorithms 25(1): 68-90 (2004) - [c5]Joseph Cheriyan, Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees. ESA 2004: 180-191 - 2003
- [b1]Mohammad R. Salavatipour:
Graph colouring via the discharging method. University of Toronto, Canada, 2003 - [j2]Mohammad R. Salavatipour:
On Sum Coloring of Graphs. Discret. Appl. Math. 127(3): 477-488 (2003) - [c4]Michael Molloy, Mohammad R. Salavatipour:
The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2003: 330-339 - [c3]Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour:
Packing Steiner trees. SODA 2003: 266-274 - [c2]Mohammad R. Salavatipour:
A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. SODA 2003: 347-356 - 2002
- [c1]Michael Molloy, Mohammad R. Salavatipour:
Frequency Channel Assignment on Planar Networks. ESA 2002: 736-747 - 2000
- [j1]Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani:
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216(1-3): 287-292 (2000)
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-10-07 21:20 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:
