default search action
Rodrigo I. Silveira
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j49]Jordi Aguilar
, Kevin Buchin
Graph Sampling for Map Comparison. ACM Trans. Spatial Algorithms Syst. 10(3): 20:1-20:24 (2024) - [c49]Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:
Computing Largest Minimum Color-Spanning Intervals of Imprecise Points. LATIN (1) 2024: 81-96 - [i33]Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. CoRR abs/2402.12028 (2024) - [i32]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
Approximating shortest paths in weighted square and hexagonal meshes. CoRR abs/2404.07562 (2024) - [i31]Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:
Computing largest minimum color-spanning intervals of imprecise points. CoRR abs/2410.03213 (2024) - 2023
- [j48]Prosenjit Bose, Guillermo Esteban
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318: 103898 (2023) - [c48]Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira
Shortest Paths in Portalgons. SoCG 2023: 48:1-48:16 - [c47]Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira:
Shortest Coordinated Motion for Square Robots. WADS 2023: 430-443 - [i30]Maarten Löffler, Tim Ophelders, Frank Staals, Rodrigo I. Silveira:
Shortest Paths in Portalgons. CoRR abs/2303.08937 (2023) - 2022
- [c46]Maike Buchin, Ivor van der Hoog
Efficient Fréchet Distance Queries for Segments. ESA 2022: 29:1-29:14 - [c45]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM 2022: 409-421 - [i29]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet distance queries for segments. CoRR abs/2203.01794 (2022) - 2021
- [j47]Irene Parada
A new meta-module design for efficient reconfiguration of modular robots. Auton. Robots 45(4): 457-472 (2021) - [j46]Prosenjit Bose
Affine invariant triangulations. Comput. Aided Geom. Des. 91: 102039 (2021) - [j45]Yuejun Guo
A scalable method to construct compact road networks from GPS trajectories. Int. J. Geogr. Inf. Sci. 35(7): 1309-1345 (2021) - [c44]Ankush Acharyya
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. GIScience (II) 2021: 10:1-10:16 - [i28]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary:
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR abs/2103.06696 (2021) - [i27]Delia Garijo, Alberto Márquez, Rodrigo I. Silveira:
Continuous mean distance of a weighted graph. CoRR abs/2103.11676 (2021) - [i26]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. CoRR abs/2111.13912 (2021) - 2020
- [j44]Prosenjit Bose
Hamiltonicity for convex shape Delaunay and Gabriel graphs. Comput. Geom. 89: 101629 (2020) - [j43]David Duran, Vera Sacristán, Rodrigo I. Silveira
Map construction algorithms: a local evaluation through hiking data. GeoInformatica 24(3): 633-681 (2020) - [c43]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Jorren Hendriks, Erfan Hosseini Sereshgi
Improved Map Construction using Subtrajectory Clustering. LocalRec@SIGSPATIAL 2020: 5:1-5:4 - [c42]Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Flips in Higher Order Delaunay Triangulations. LATIN 2020: 223-234 - [c41]Ioannis Mantas, Evanthia Papadopoulou
Farthest Color Voronoi Diagrams: Complexity and Algorithms. LATIN 2020: 283-295 - [i25]Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira:
New production matrices for geometric graphs. CoRR abs/2003.00524 (2020) - [i24]Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Affine invariant triangulations. CoRR abs/2011.02197 (2020)
2010 – 2019
- 2019
- [j42]Kevin Buchin
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles). Algorithmica 81(7): 2682-2715 (2019) - [j41]Clemens Huemer
A new lower bound on the maximum number of plane graphs using production matrices. Comput. Geom. 84: 36-49 (2019) - [j40]Clemens Huemer
Matching points with disks with a common intersection. Discret. Math. 342(7): 1885-1893 (2019) - [j39]Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing paths with geographic constraints. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j38]Delia Garijo
Computing optimal shortcuts for networks. Eur. J. Oper. Res. 279(1): 26-37 (2019) - [c40]Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Ane invariant triangulations. CCCG 2019: 250-256 - [c39]Prosenjit Bose, Pilar Cano, Maria Saumell
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. WADS 2019: 196-210 - [i23]Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara, Rodrigo I. Silveira:
Matching points with disks with a common intersection. CoRR abs/1902.08427 (2019) - [i22]Clemens Huemer, Alexander Pilz, Rodrigo I. Silveira:
A new lower bound on the maximum number of plane graphs using production matrices. CoRR abs/1902.09841 (2019) - 2018
- [j37]Ferran Hurtado, Matias Korman, Marc J. van Kreveld
Colored spanning graphs for set visualization. Comput. Geom. 68: 262-276 (2018) - [j36]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell
Colored ray configurations. Comput. Geom. 68: 292-308 (2018) - [j35]Matias Korman, Maarten Löffler, Rodrigo I. Silveira
On the complexity of barrier resilience for fat regions and bounded ply. Comput. Geom. 72: 34-51 (2018) - [j34]Jean Cardinal, Vera Sacristán
A Note on Flips in Diagonal Rectangulations. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j33]Guillermo Esteban
New results on production matrices for geometric graphs. Electron. Notes Discret. Math. 68: 215-220 (2018) - [c38]Joachim Gudmundsson, Irina Kostitsyna
Theoretical analysis of beaconless geocast protocols in 1D. ANALCO 2018: 62-76 - [c37]Delia Garijo
Computing Optimal Shortcuts for Networks. ISAAC 2018: 15:1-15:12 - [i21]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. CoRR abs/1802.03415 (2018) - [i20]Delia Garijo, Alberto Márquez, Natalia Rodríguez, Rodrigo I. Silveira:
Computing optimal shortcuts for networks. CoRR abs/1807.10093 (2018) - 2017
- [j32]Mercè Claverol
Stabbing segments with rectilinear objects. Appl. Math. Comput. 309: 359-373 (2017) - [j31]Clemens Huemer
Characteristic polynomials of production matrices for geometric graphs. Electron. Notes Discret. Math. 61: 631-637 (2017) - [j30]Natalia Rodríguez, Rodrigo I. Silveira
Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations. ISPRS Int. J. Geo Inf. 6(12): 390 (2017) - [c36]Rodrigo I. Silveira
Non-crossing Paths with Geographic Constraints. GD 2017: 454-461 - [c35]Kevin Buchin
Clustering Trajectories for Map Construction. SIGSPATIAL/GIS 2017: 14:1-14:10 - [i19]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs I: Maximal Graphs. CoRR abs/1702.01275 (2017) - [i18]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs II: Graph Augmentation. CoRR abs/1702.01277 (2017) - [i17]Mercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira:
Stabbing segments with rectilinear objects. CoRR abs/1703.04329 (2017) - [i16]Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing paths with geographic constraints. CoRR abs/1708.05486 (2017) - [i15]Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. CoRR abs/1708.06062 (2017) - [i14]Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira:
A Note on Flips in Diagonal Rectangulations. CoRR abs/1712.07919 (2017) - 2016
- [j29]Clemens Huemer
Production matrices for geometric graphs. Electron. Notes Discret. Math. 54: 301-306 (2016) - [j28]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-preserving spatial treemaps. J. Comput. Geom. 7(1): 100-122 (2016) - [c34]Natalia Rodríguez, Rodrigo I. Silveira
Implementing data-dependent triangulations with higher order Delaunay triangulations. SIGSPATIAL/GIS 2016: 26:1-26:10 - [c33]David Duran, Vera Sacristán, Rodrigo I. Silveira:
Map construction algorithms: an evaluation through hiking data. MobiGIS 2016: 74-83 - [c32]Irene Parada
A new meta-module for efficient reconfiguration of hinged-units modular robots. ICRA 2016: 5197-5202 - [i13]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored Spanning Graphs for Set Visualization. CoRR abs/1603.00580 (2016) - [i12]Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Space-Efficient Hidden Surface Removal. CoRR abs/1611.06915 (2016) - 2015
- [j27]Luis Barba, Matias Korman, Stefan Langerman
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72(4): 1097-1129 (2015) - [j26]José Miguel Díaz-Báñez
New results on stabbing segments with a polygon. Comput. Geom. 48(1): 14-29 (2015) - [j25]Esther M. Arkin, José Miguel Díaz-Báñez
Bichromatic 2-center of pairs of points. Comput. Geom. 48(2): 94-107 (2015) - [j24]Sergey Bereg
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181: 21-32 (2015) - [j23]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs I: Maximal Graphs. Graphs Comb. 31(2): 407-425 (2015) - [j22]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs II: Graph Augmentation. Graphs Comb. 31(2): 427-452 (2015) - [c31]Kevin Buchin, Irina Kostitsyna
Region-based Approximation Algorithms for Visibility between Imprecise Locations. ALENEX 2015: 94-103 - [c30]Ronald van Zon, Diego Escudero, Dan Halperin, Igor Jovanovic, Raffaelle Vito, Rodrigo I. Silveira
Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces. CASE 2015: 1638-1643 - [c29]Mercè Claverol
Stabbing Segments with Rectilinear Objects. FCT 2015: 53-64 - 2014
- [j21]Luis Barba, Matias Korman, Stefan Langerman
Computing a visibility polygon using few variables. Comput. Geom. 47(9): 918-926 (2014) - [j20]Oswin Aichholzer
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [j19]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán
Terrain Visibility with Multiple Viewpoints. Int. J. Comput. Geom. Appl. 24(4): 275-306 (2014) - [c28]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored Ray Configurations. CCCG 2014 - [i11]Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira:
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). CoRR abs/1402.5681 (2014) - 2013
- [j18]Kevin Buchin
Median Trajectories. Algorithmica 66(3): 595-614 (2013) - [j17]Anne Driemel
Flow computations on imprecise terrains. J. Comput. Geom. 4(1): 38-78 (2013) - [j16]Pankaj K. Agarwal, Boris Aronov
Computing Correlation between Piecewise-Linear Functions. SIAM J. Comput. 42(5): 1867-1887 (2013) - [c27]Matias Korman, Maarten Löffler, Rodrigo I. Silveira
On the Complexity of Barrier Resilience for Fat Regions. ALGOSENSORS 2013: 201-216 - [c26]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG 2013 - [c25]Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira:
Convex hull alignment through translation. CCCG 2013 - [c24]José Miguel Díaz-Báñez
New Results on Stabbing Segments with a Polygon. CIAC 2013: 146-157 - [c23]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán Adinolfi, Rodrigo I. Silveira
Colored Spanning Graphs for Set Visualization. GD 2013: 280-291 - [c22]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán
Terrain Visibility with Multiple Viewpoints. ISAAC 2013: 317-327 - [c21]Luis Barba, Matias Korman, Stefan Langerman
Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292 - [i10]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the Complexity of Barrier Resilience for Fat Regions. CoRR abs/1302.4707 (2013) - [i9]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán Adinolfi, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain visibility with multiple viewpoints. CoRR abs/1309.4323 (2013) - 2012
- [j15]Kevin Buchin
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012) - [j14]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
Removing local extrema from imprecise terrains. Comput. Geom. 45(7): 334-349 (2012) - [j13]Kevin Buchin
Processing aggregated data: the location of clusters in health data. GeoInformatica 16(3): 497-521 (2012) - [j12]Manuel Abellanas, Mercè Claverol
Improving Shortest Paths in the Delaunay Triangulation. Int. J. Comput. Geom. Appl. 22(6): 559-576 (2012) - [c20]Esther M. Arkin, José Miguel Díaz-Báñez
Bichromatic 2-Center of Pairs of Points. LATIN 2012: 25-36 - [i8]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012) - [i7]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira:
New results on stabbing segments with a polygon. CoRR abs/1211.1490 (2012) - 2011
- [j11]Boris Aronov
Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) - [j10]Marc J. van Kreveld, Rodrigo I. Silveira
Embedding rivers in triangulated irregular networks with linear programming. Int. J. Geogr. Inf. Sci. 25(4): 615-631 (2011) - [j9]Boris Aronov
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [j8]Dieter Mitsche, Maria Saumell
On the number of higher order Delaunay triangulations. Theor. Comput. Sci. 412(29): 3589-3597 (2011) - [c19]Luis Barba, Matias Korman, Stefan Langerman
Computing the Visibility Polygon Using Few Variables. ISAAC 2011: 70-79 - [c18]Kevin Buchin
Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170 - [c17]Anne Driemel
Flow Computations on Imprecise Terrains. WADS 2011: 350-361 - [i6]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011) - [i5]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. CoRR abs/1111.3584 (2011) - 2010
- [j7]Marc J. van Kreveld
Optimization for first order Delaunay triangulations. Comput. Geom. 43(4): 377-394 (2010) - [j6]Rodrigo I. Silveira
Flooding Countries and Destroying dams. Int. J. Comput. Geom. Appl. 20(3): 361-380 (2010) - [j5]Chris Gray, Maarten Löffler, Rodrigo I. Silveira
Smoothing Imprecise 1.5D Terrains. Int. J. Comput. Geom. Appl. 20(4): 381-414 (2010) - [j4]Kevin Buchin
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [c16]Dieter Mitsche, Maria Saumell
On the Number of Higher Order Delaunay Triangulations. CIAC 2010: 217-228 - [c15]Pankaj K. Agarwal, Boris Aronov
Computing similarity between piecewise-linear functions. SCG 2010: 375-383 - [c14]Kevin Buchin
Median Trajectories. ESA (1) 2010: 463-474 - [i4]Joachim Gudmundsson, Harvey J. Miller, Rodrigo I. Silveira, Mathias Versichele, Stefan van der Spek:
10491 Results of the break-out group: Similarity measures. Representation, Analysis and Visualization of Moving Objects 2010 - [i3]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Removing Local Extrema from Imprecise Terrains. CoRR abs/1002.2580 (2010) - [i2]Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira:
On the Number of Higher Order Delaunay Triangulations. CoRR abs/1002.4364 (2010)
2000 – 2009
- 2009
- [b1]Rodrigo I. Silveira:
Optimization of polyhedral terrains. Utrecht University, Netherlands, 2009 - [j3]Rodrigo I. Silveira
Towards a definition of higher order constrained Delaunay triangulations. Comput. Geom. 42(4): 322-337 (2009) - [j2]Rodrigo I. Silveira
Optimal higher order Delaunay triangulations of polygons. Comput. Geom. 42(8): 803-813 (2009) - [j1]Magdalene G. Borgelt, Marc J. van Kreveld
Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4): 469-478 (2009) - [c13]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c12]Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Minimizing Slope Change in Imprecise 1.5D terrains. CCCG 2009: 55-58 - [c11]Marc J. van Kreveld, Rodrigo I. Silveira
Embedding rivers in polyhedral terrains. SCG 2009: 169-178 - [c10]Boris Aronov
Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 - 2008
- [c9]Kevin Buchin
Drawing (Complete) Binary Tanglegrams. GD 2008: 324-335 - [c8]Boris Aronov
Feed-links for network extensions. GIS 2008: 35 - [c7]Rodrigo I. Silveira
Optimal Higher Order Delaunay Triangulations of Polygons. LATIN 2008: 133-145 - [c6]Kevin Buchin, Maike Buchin, Marc J. van Kreveld
Clusters in Aggregated Health Data. SDH 2008: 77-90 - [c5]Chris Gray, Maarten Löffler, Rodrigo I. Silveira
Smoothing Imprecise 1.5D Terrains. WAOA 2008: 214-226 - [i1]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008) - 2007
- [c4]Rodrigo I. Silveira, Marc J. van Kreveld:
Towards a Definition of Higher Order Constrained Delaunay Triangulations. CCCG 2007: 161-164 - [c3]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216 - [c2]Marc J. van Kreveld
Optimization for First Order Delaunay Triangulations. WADS 2007: 175-187 - [c1]Rodrigo I. Silveira
Flooding Countries and Destroying Dams. WADS 2007: 227-238
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-13 23:51 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: