default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiane L. Souvaine
Person information
- affiliation: Tufts University, Medford, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j35]Hugo A. Akitaya
, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth:
Reconfiguration of connected graph partitions. J. Graph Theory 102(1): 35-66 (2023)- [c41]Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill:
Reconfiguration of Polygonal Subdivisions via Recombination. ESA 2023: 6:1-6:16 - [i11]Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill:
Reconfiguration of Polygonal Subdivisions via Recombination. CoRR abs/2307.00704 (2023) - 2022
- [j34]Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. Discret. Comput. Geom. 68(1): 218-254 (2022) - [j33]Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of connected graph partitions via recombination. Theor. Comput. Sci. 923: 13-26 (2022) - 2021
- [c40]Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions via Recombination. CIAC 2021: 61-74 - 2020
- [i10]Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions via Recombination. CoRR abs/2011.07378 (2020)
2010 – 2019
- 2019
- [j32]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum weight connectivity augmentation for planar straight-line graphs. Theor. Comput. Sci. 789: 50-63 (2019) - [c39]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. SoCG 2019: 9:1-9:17 - [i9]Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions. CoRR abs/1902.10765 (2019) - [i8]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. CoRR abs/1903.07019 (2019) - 2017
- [c38]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. WALCOM 2017: 204-216 - 2016
- [j31]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. Discret. Appl. Math. 210: 123-132 (2016) - [j30]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [i7]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. CoRR abs/1612.04780 (2016) - 2015
- [j29]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. Comput. Geom. 48(8): 622-633 (2015) - [j28]Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine:
Isoperimetric Enclosures. Graphs Comb. 31(2): 361-392 (2015) - 2014
- [c37]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN 2014: 478-489 - 2013
- [j27]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013) - [j26]Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Compatible Geometric Matchings. Discret. Comput. Geom. 49(1): 89-131 (2013) - [j25]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. Electron. Notes Discret. Math. 44: 345-350 (2013) - [j24]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [c36]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. SoCG 2013: 267-276 - [c35]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow:
Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280 - [i6]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. CoRR abs/1302.2271 (2013) - [i5]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR abs/1312.4429 (2013) - 2012
- [c34]Sarah Cannon, Diane L. Souvaine, Andrew Winslow:
Hidden Mobile Guards in Simple Polygons. CCCG 2012: 161-166 - [i4]Sarah Cannon, Diane L. Souvaine, Andrew Winslow:
Hidden Mobile Guards in Simple Polygons. CoRR abs/1206.1803 (2012) - [i3]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. CoRR abs/1207.2375 (2012) - 2011
- [j23]Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr:
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Algorithmica 61(4): 971-999 (2011) - [j22]Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Convex partitions with 2-edge connected dual graphs. J. Comb. Optim. 22(3): 409-425 (2011) - [c33]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. CCCG 2011 - [c32]Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint compatible geometric matchings. SCG 2011: 125-134 - [c31]Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Simultaneously Flippable Edges in Triangulations. EGC 2011: 138-145 - [i2]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Dynamic Maintenance of Half-Space Depth for Points and Contours. CoRR abs/1109.1517 (2011) - 2010
- [j21]Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space. Discret. Comput. Geom. 43(2): 221-241 (2010) - [c30]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102 - [c29]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15
2000 – 2009
- 2009
- [j20]Diane L. Souvaine, Csaba D. Tóth:
A vertex-face assignment for plane graphs. Comput. Geom. 42(5): 388-394 (2009) - [j19]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [c28]Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Convex Partitions with 2-Edge Connected Dual Graphs. COCOON 2009: 192-204 - [c27]Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth:
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. ISAAC 2009: 902-912 - 2008
- [j18]Eynat Rafalin, Diane L. Souvaine:
Topological sweep of the complete graph. Discret. Appl. Math. 156(17): 3276-3290 (2008) - [j17]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight Bounds for Connecting Sites Across Barriers. Discret. Comput. Geom. 40(3): 377-394 (2008) - [j16]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j15]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. Nat. Comput. 7(3): 347-370 (2008) - [c26]Mashhood Ishaque, Diane L. Souvaine, Nadia M. Benbernou:
Data Structures for Restricted Triangular Range Searching. CCCG 2008 - [i1]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues. CoRR abs/0803.0316 (2008) - 2007
- [j14]Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint:
Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. 23(Supplement-1): 169-178 (2007) - [c25]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG 2007: 13-16 - [c24]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. DNA 2007: 1-14 - [c23]Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Deflating the Pentagon. KyotoCGGT 2007: 56-67 - [c22]Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles. WADS 2007: 470-482 - 2006
- [c21]John Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine:
An Experimental Study of Old and New Depth Measures. ALENEX 2006: 51-64 - [c20]Prosenjit Bose, David Bremner, Diane L. Souvaine:
Computing the Tool Path of an Externally Monotone Polygon in Linear Time. CCCG 2006 - [c19]Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing. CCCG 2006 - [c18]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight bounds for connecting sites across barriers. SCG 2006: 439-448 - [e2]Regina Y. Liu, Robert Serfling, Diane L. Souvaine:
Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, May 14-16, 2003. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 72, DIMACS/AMS 2006, ISBN 978-0-8218-3596-8 [contents] - 2005
- [j13]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1-2): 31-61 (2005) - [c17]Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine:
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG 2005: 35-38 - [c16]Csaba D. Tóth, Diane L. Souvaine:
A vertex-face assignment for plane graphs. CCCG 2005: 138-141 - [c15]Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine:
Hinged Dissection of Polypolyhedra. WADS 2005: 205-217 - 2004
- [c14]Michael A. Burr, Alan C. Cheng, Ryan G. Coleman, Diane L. Souvaine:
Transformations and algorithms for least sum of squares hypersphere fitting. CCCG 2004: 104-107 - [c13]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. CCCG 2004: 136-139 - 2003
- [j12]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf:
Efficient computation of location depth contours by methods of computational geometry. Stat. Comput. 13(2): 153-162 (2003) - [c12]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. SCG 2003: 154-163 - [c11]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 195-209 - 2002
- [c10]Eynat Rafalin, Diane L. Souvaine, Ileana Streinu:
Topological Sweep in Degenerate Cases. ALENEX 2002: 155-165 - [c9]Frederick Crimins, Diane L. Souvaine:
Constructing differentiable homeomorphisms between isomorphic triangulations. CCCG 2002: 170-173 - 2001
- [c8]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf:
Fast implementation of depth contours using topological sweep. SODA 2001: 690-699 - [e1]Diane L. Souvaine:
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001. ACM 2001, ISBN 1-58113-357-X [contents]
1990 – 1999
- 1997
- [j11]Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997) - [j10]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. Int. J. Comput. Geom. Appl. 7(1/2): 153-163 (1997) - [c7]Mark Babikov, Diane L. Souvaine, Rephael Wenger:
Constructing piecewise linear homeomorphisms of polygons with holes. CCCG 1997 - 1995
- [j9]Diane L. Souvaine, Chee-Keng Yap:
Combinatorial Complexity of Signed Discs. Comput. Geom. 5: 207-223 (1995) - [j8]Iliana Bjorling-Sachs, Diane L. Souvaine:
An Efficient Algorithm for Guard Placement in Polygons with Holes. Discret. Comput. Geom. 13: 77-109 (1995) - 1994
- [j7]Diane L. Souvaine, Christopher J. Van Wyk:
Clamping a polygon. Vis. Comput. 10(8): 484-494 (1994) - 1993
- [j6]Boris Aronov, Raimund Seidel, Diane L. Souvaine:
On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993) - [c6]Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
Testing Simple Polygons. CCCG 1993: 387-392 - [c5]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - [c4]Diane L. Souvaine, Chee-Keng Yap:
Combinatorial Complexity of Signed Discs (Extended Abstract). WADS 1993: 577-588 - 1992
- [j5]Diane L. Souvaine, Iliana Bjorling-Sachs:
The contour problem for restricted-orientation polygons. Proc. IEEE 80(9): 1449-1470 (1992) - [j4]Elefterios A. Melissaratos, Diane L. Souvaine:
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions. SIAM J. Comput. 21(4): 601-638 (1992) - [c3]Elefterios A. Melissaratos, Diane L. Souvaine:
Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes. SCG 1992: 202-211 - 1991
- [j3]David P. Dobkin, Diane L. Souvaine:
Detecting the intersection of convex objects in the plane. Comput. Aided Geom. Des. 8(3): 181-199 (1991) - [c2]Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia:
The Aquarium Keeper's Problem. SODA 1991: 459-464 - 1990
- [j2]David P. Dobkin, Diane L. Souvaine:
Computational Geometry in a Curved World. Algorithmica 5(3): 421-457 (1990) - [c1]Elefterios A. Melissaratos, Diane L. Souvaine:
On Solving Geometric Optimization Problems Using Shortest Paths. SCG 1990: 350-359
1980 – 1989
- 1988
- [j1]David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk:
Decomposition and Intersection of Simple Splinegons. Algorithmica 3: 473-485 (1988)
Coauthor Index
Hugo Alves Akitaya
aka: Hugo A. Akitaya
aka: Hugo A. Akitaya
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-05-08 20:57 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:
