default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirela Damian
Mirela Damian-Iordache
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
[i31]Mirela Damian, Henk Meijer:
Edge-Unfolding Polycubes with Orthogonally Convex Layers. CoRR abs/2407.01326 (2024)- 2023
- [j33]Mirela Damian
, Robin Y. Flatland:
Unfolding 3-separated polycube graphs of arbitrary genus. Comput. Geom. 109: 101944 (2023) - 2022
- [i30]Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - 2021
- [j32]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021) - [j31]Mirela Damian, Robin Y. Flatland:
Unfolding polycube trees with constant refinement. Comput. Geom. 98: 101793 (2021) - [c35]Mirela Damian, Robin Y. Flatland:
Unfolding a New Class of Orthographs of Arbitrary Genus. CCCG 2021: 286-296 - 2020
- [j30]Mirela Damian, John Iacono, Andrew Winslow:
Spanning Properties of Theta-Theta-6. Graphs Comb. 36(3): 525-538 (2020)
2010 – 2019
- 2019
- [c34]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [i29]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR abs/1908.07880 (2019) - 2018
- [j29]Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao graphs. Comput. Geom. 67: 42-52 (2018) - [j28]Mirela Damian:
Cone-based spanners of constant degree. Comput. Geom. 68: 48-61 (2018) - [c33]Mirela Damian, Robin Y. Flatland:
Unfolding Low-Degree Orthotrees with Constant Refinement. CCCG 2018: 189-208 - [c32]Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara:
Toward Unfolding Doubly Covered n-Stars. JCDCGGG 2018: 122-135 - [i28]Mirela Damian, John Iacono, Andrew Winslow:
Spanning Properties of Theta-Theta-6. CoRR abs/1808.04744 (2018) - [i27]Mirela Damian, Robin Y. Flatland:
Unfolding Orthotrees with Constant Refinement. CoRR abs/1811.01842 (2018) - 2017
- [j27]Mirela Damian, Naresh Nelavalli:
Improved bounds on the stretch factor of Y4. Comput. Geom. 62: 14-24 (2017) - [j26]Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. Graphs Comb. 33(5): 1357-1379 (2017) - [i26]Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami:
Minimal forcing sets for 1D origami. CoRR abs/1703.06373 (2017) - 2016
- [j25]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [i25]Mirela Damian, Naresh Nelavalli:
Improved Bounds on the Stretch Factor of $Y_4$. CoRR abs/1602.05481 (2016) - [i24]Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. CoRR abs/1611.00106 (2016) - 2015
- [j24]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [c31]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. SODA 2015: 136-147 - [i23]Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015) - 2014
- [j23]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014) - [j22]Mirela Damian, Erik D. Demaine, Robin Y. Flatland:
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. Graphs Comb. 30(1): 125-140 (2014) - [c30]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c29]Mirela Damian, Dumitru V. Voicu:
Spanning Properties of Theta-Theta Graphs. COCOA 2014: 216-230 - [c28]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [i22]Mirela Damian, Dumitru V. Voicu:
Spanning Properties of Theta-Theta Graphs. CoRR abs/1407.3507 (2014) - [i21]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i20]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. CoRR abs/1410.2231 (2014) - 2013
- [j21]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing strong connectivity using optimal radius half-disk antennas. Comput. Geom. 46(3): 328-339 (2013) - [j20]Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer:
Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8): 917-928 (2013) - [j19]Mirela Damian, Robin Y. Flatland:
Spanning Properties of graphs induced by Directional Antennas. Discret. Math. Algorithms Appl. 5(3) (2013) - [j18]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) - [c27]Matthew Bauer, Mirela Damian:
An Infinite Class of Sparse-Yao Spanners. SODA 2013: 184-196 - [i19]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - [i18]Mirela Damian, Erik D. Demaine, Robin Y. Flatland:
Unfolding Orthogrids with Constant Refinement. CoRR abs/1310.4561 (2013) - 2012
- [j17]Mirela Damian, Kristin Raudonis:
Yao Graphs Span Theta Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - [j16]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [i17]Matthew Bauer, Mirela Damian:
An Infinite Class of Sparse-Yao Spanners. CoRR abs/1206.3628 (2012) - 2011
- [j15]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán, Stefanie Wuhrer:
Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011) - [c26]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. CCCG 2011 - [c25]Mirela Damian, Abhaykumar Kumbhar:
Undirected connectivity of sparse Yao graphs. FOMC 2011: 25-32 - [c24]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146 - [i16]Mirela Damian, Abhaykumar Kumbhar:
Undirected Connectivity of Sparse Yao Graphs. CoRR abs/1103.4343 (2011) - [i15]Mirela Damian, Erik D. Demaine, Robin Y. Flatland:
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. CoRR abs/1112.4791 (2011) - 2010
- [j14]Mirela Damian, Sriram V. Pemmaraju:
Localized Spanners for Ad Hoc Wireless Networks. Ad Hoc Sens. Wirel. Networks 9(3-4): 305-328 (2010) - [j13]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. Theory Comput. Syst. 47(3): 674-695 (2010) - [c23]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 - [c22]Mirela Damian, Kristin Raudonis:
Yao Graphs Span Theta Graphs. COCOA (2) 2010: 181-194 - [c21]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [c20]Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert T. Schweller:
Shape Replication through Self-Assembly and RNase Enzymes. SODA 2010: 1045-1064 - [i14]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010) - [i13]Mirela Damian, Robin Y. Flatland:
Connectivity of Graphs Induced by Directional Antennas. CoRR abs/1008.3889 (2010)
2000 – 2009
- 2009
- [j12]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Linear reconfiguration of cube-style modular robots. Comput. Geom. 42(6-7): 652-663 (2009) - [j11]Mirela Damian, Nagesh Javali:
Distributed construction of low-interference spanners. Distributed Comput. 22(1): 15-28 (2009) - [c19]Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer:
Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR 2009: 81-86 - 2008
- [j10]Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks. Comput. Geom. 39(1): 43-54 (2008) - [j9]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. Comput. Geom. 40(2): 102-114 (2008) - [j8]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. Discret. Comput. Geom. 39(1-3): 213-238 (2008) - [c18]Mirela Damian, Nagesh Javali:
Distributed construction of bounded-degree low-interference spanners of low weight. MobiHoc 2008: 101-110 - [c17]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. STACS 2008: 217-228 - [c16]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 2008: 433-447 - [i12]Mirela Damian:
A Simple Yao-Yao-Based Spanner of Bounded Degree. CoRR abs/0802.4325 (2008) - [i11]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Local Approximation Schemes for Topology Control. CoRR abs/0803.2174 (2008) - [i10]Mirela Damian, Sriram V. Pemmaraju:
Localized Spanners for Wireless Networks. CoRR abs/0806.4221 (2008) - 2007
- [j7]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) - [j6]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. Graphs Comb. 23(Supplement-1): 179-194 (2007) - [c15]Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint:
Vertex Pops and Popturns. CCCG 2007: 137-140 - [c14]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Linear Reconfiguration of Cube-Style Modular Robots. ISAAC 2007: 208-219 - [i9]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. CoRR abs/0705.1541 (2007) - [i8]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. CoRR abs/0709.1942 (2007) - [i7]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
A New Lower Bound on Guard Placement for Wireless Localization. CoRR abs/0709.3554 (2007) - 2006
- [j5]Mirela Damian, Sriram V. Pemmaraju:
APX-hardness of domination problems in circle graphs. Inf. Process. Lett. 97(6): 231-237 (2006) - [j4]Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. J. Comput. Biol. 13(4): 979-989 (2006) - [c13]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 - [c12]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Distributed Spanner Construction in Doubling Metric Spaces. OPODIS 2006: 157-171 - [c11]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Local approximation schemes for topology control. PODC 2006: 208-217 - [c10]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. STACS 2006: 264-276 - [i6]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. CoRR abs/cs/0602095 (2006) - 2005
- [c9]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. CCCG 2005: 211-214 - [i5]Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment. CoRR abs/cs/0507013 (2005) - [i4]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. CoRR abs/cs/0509054 (2005) - 2004
- [j3]Mirela Damian, Sriram V. Pemmaraju:
Computing Optimal Diameter-Bounded Polygon Partitions. Algorithmica 40(1): 1-14 (2004) - [j2]Mirela Damian:
Exact and approximation algorithms for computing optimal fat decompositions. Comput. Geom. 28(1): 19-27 (2004) - [c8]Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks. CCCG 2004: 20-23 - [i3]Mirela Damian, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions. CoRR abs/cs/0412095 (2004) - 2003
- [c7]Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CCCG 2003: 43-46 - [i2]Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CoRR cs.CG/0304023 (2003) - [i1]Mirela Damian-Iordache, Joseph O'Rourke:
A Note on Objects Built From Bricks without Corners. CoRR cs.CG/0307042 (2003) - 2002
- [j1]Mirela Damian-Iordache, Sriram V. Pemmaraju:
A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. J. Algorithms 42(2): 255-276 (2002) - [c6]Mirela Damian-Iordache:
Exact and approximation algorithms for computing a-fat decompositions. CCCG 2002: 93-96 - 2001
- [c5]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Computing optimal alpha-fat and alpha-small decompositions. SODA 2001: 338-339 - 2000
- [c4]Mirela Damian-Iordache, Sriram V. Pemmaraju:
A (2 + epsilon)-approximation scheme for minimum domination on circle graphs. SODA 2000: 672-679
1990 – 1999
- 1999
- [c3]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Hardness of Approximating Independent Domination in Circle Graphs. ISAAC 1999: 56-69 - [c2]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. ISAAC 1999: 70-82 - 1997
- [c1]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Automatic Data Decomposition for Message-Passing Machines. LCPC 1997: 64-78
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 2025-01-21 00:05 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:
