default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSasanka Roy
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
[c39]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20- [i23]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M, Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. CoRR abs/2404.15487 (2024) - 2023
- [j42]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant delay lattice train schedules. Discret. Appl. Math. 339: 1-10 (2023) - [j41]Satyabrata Jana
, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33(3&4): 133-157 (2023) - 2022
- [j40]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100: 101819 (2022) - [j39]Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy:
Collision-free routing problem with restricted L-path. Discret. Appl. Math. 319: 71-80 (2022) - [j38]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j37]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929: 69-80 (2022) - 2021
- [c38]Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Graph Partition. CALDAM 2021: 487-499 - [c37]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CCCG 2021: 107-113 - [i22]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CoRR abs/2107.04657 (2021) - 2020
- [j36]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020) - [j35]Binayak Dutta, Sasanka Roy:
Approximate Shortest Paths in Polygons with Violations. Int. J. Comput. Geom. Appl. 30(1): 79-95 (2020) - [j34]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy:
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. 31(4): 421-443 (2020) - [j33]Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia:
Problems on One Way Road Networks. J. Graph Algorithms Appl. 24(3): 523-546 (2020) - [j32]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]. Theor. Comput. Sci. 806: 632-640 (2020) - [j31]Binayak Dutta, Arindam Karmakar, Sasanka Roy:
Optimal facility location problem on polyhedral terrains using descending paths. Theor. Comput. Sci. 847: 68-75 (2020) - [c36]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c35]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169
2010 – 2019
- 2019
- [j30]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with unit squares. Comput. Geom. 79: 1-13 (2019) - [j29]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81: 1-11 (2019) - [j28]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164(1): 119-138 (2019) - [j27]Anisur Rahaman Molla, Supantha Pandit, Sasanka Roy:
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132: 36-47 (2019) - [j26]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Theor. Comput. Sci. 769: 63-74 (2019) - [c34]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c33]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA 2019: 56-68 - [c32]Binayak Dutta, Sasanka Roy:
Approximate Shortest Paths in Polygons with Violations. COCOA 2019: 168-180 - [i21]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR abs/1909.03872 (2019) - [i20]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR abs/1909.03896 (2019) - [i19]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR abs/1909.06457 (2019) - [i18]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63-74. CoRR abs/1909.09445 (2019) - 2018
- [j25]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j24]Sourish Das, Sasanka Roy, Rajiv Sambasivan:
Fast Gaussian Process Regression for Big Data. Big Data Res. 14: 12-26 (2018) - [j23]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. Int. J. Comput. Geom. Appl. 28(4): 365-379 (2018) - [j22]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum width color spanning annulus. Theor. Comput. Sci. 725: 16-30 (2018) - [c31]Jammigumpula Ajay, Sasanka Roy:
Collision-Free Routing Problem with Restricted L-Path. IWOCA 2018: 1-13 - [i17]Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and maximum transitive relation contained in a given binary relation. CoRR abs/1805.08953 (2018) - [i16]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - 2017
- [j21]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j20]Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy:
On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. 120: 1-5 (2017) - [j19]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127: 58-61 (2017) - [c30]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Points: Minimizing the Maximum Depth. CCCG 2017: 37-42 - [c29]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON 2017: 457-468 - [c28]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA 2017: 52:1-52:13 - [c27]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy:
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) 2017: 509-524 - [c26]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. WADS 2017: 1-12 - [i15]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. CoRR abs/1709.04870 (2017) - 2016
- [j18]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-efficient algorithm for computing a centerpoint of a set of points in R2. Theor. Comput. Sci. 615: 61-70 (2016) - [c25]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum Width Color Spanning Annulus. COCOON 2016: 431-442 - [i14]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with axis-parallel unit squares. CoRR abs/1607.07256 (2016) - [i13]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR abs/1609.04148 (2016) - [i12]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR abs/1611.03260 (2016) - 2015
- [j17]Minati De, Subhas C. Nandy, Sasanka Roy:
Prune-and-search with limited workspace. J. Comput. Syst. Sci. 81(2): 398-414 (2015) - [c24]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - [c23]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh:
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON 2015: 349-360 - [c22]Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. COCOON 2015: 587-600 - [i11]Sourish Das, Sasanka Roy, Rajiv Sambasivan:
Fast Gaussian Process Regression for Big Data. CoRR abs/1509.05142 (2015) - [i10]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015) - 2014
- [j16]Minati De, Subhas C. Nandy, Sasanka Roy:
In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. 178: 58-70 (2014) - [c21]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014 - [c20]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG 2014 - [c19]Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song:
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - [c18]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. LATIN 2014: 306-317 - [i9]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Facility location problems in the constant work-space read-only memory model. CoRR abs/1409.4092 (2014) - 2013
- [j15]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013) - [j14]John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy:
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. Int. J. Found. Comput. Sci. 24(1): 31-50 (2013) - [j13]Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Comput. Sci. 20: 22-38 (2013) - [i8]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. CoRR abs/1307.8268 (2013) - 2012
- [j12]Sasanka Roy:
Near optimal algorithm for the shortest descending path on the surface of a convex terrain. J. Discrete Algorithms 15: 63-70 (2012) - [c17]Minati De, Subhas C. Nandy, Sasanka Roy:
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338 - [c16]Minati De, Subhas C. Nandy, Sasanka Roy:
Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521 - [c15]Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137 - [i7]Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy:
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles. CoRR abs/1212.0640 (2012) - [i6]Minati De, Subhas C. Nandy, Sasanka Roy:
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space. CoRR abs/1212.5353 (2012) - 2011
- [j11]Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011) - [c14]John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy:
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. CATS 2011: 31-40 - [i5]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011) - 2010
- [j10]John Augustine, Brian Putnam, Sasanka Roy:
Largest empty circle centered on a query line. J. Discrete Algorithms 8(2): 143-153 (2010) - [j9]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010) - [c13]Sangameshwar Patil, Sasanka Roy, John Augustine, Amanda Redlich, Sachin Lodha, Harrick M. Vin, Anand Deshpande, Mangesh S. Gharote, Ankit Mehrotra:
Minimizing Testing Overheads in Database Migration Lifecycle. COMAD 2010: 191 - [i4]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)
2000 – 2009
- 2009
- [j8]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. 42(6-7): 632-638 (2009) - [j7]Debabrata Bardhan, Sasanka Roy, Sandip Das:
Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geom. Appl. 19(4): 357-370 (2009) - [j6]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009) - [i3]John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy:
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks. CoRR abs/0902.3517 (2009) - 2008
- [j5]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008) - [j4]Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast computation of smallest enclosing circle with center on a query line segment. Inf. Process. Lett. 108(6): 343-346 (2008) - [j3]Sasanka Roy, Debabrata Bardhan, Sandip Das:
Base station placement on boundary of a convex polygon. J. Parallel Distributed Comput. 68(2): 265-273 (2008) - [c12]Prosenjit Bose, Stefan Langerman, Sasanka Roy:
Smallest enclosing circle centered on a query line segment. CCCG 2008 - [c11]Arindam Karmakar, Sasanka Roy, Sandip Das:
Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110 - [i2]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008) - [i1]John Augustine, Brian Putnam, Sasanka Roy:
Largest Empty Circle Centered on a Query Line. CoRR abs/0809.2651 (2008) - 2007
- [j2]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007) - [c10]Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari:
Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192 - [c9]Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276 - [c8]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152 - 2006
- [c7]Debabrata Bardhan, Sasanka Roy, Sandip Das:
Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19 - [c6]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776 - 2005
- [c5]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158 - [c4]Sasanka Roy, Debabrata Bardhan, Sandip Das:
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116 - [c3]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292 - 2004
- [j1]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004) - [c2]Sasanka Roy, Sandip Das, Subhas C. Nandy:
A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) 2004: 42-52 - 2002
- [c1]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
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 22:23 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:
