default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam S. Evans
Person information
- affiliation: University of British Columbia, Canada
- affiliation (former): University of Arizona, Tucson, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]William S. Evans
, David G. Kirkpatrick:
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. Algorithms 17(6): 246 (2024)- [c55]William S. Evans, Seyed Ali Tabatabaee:
Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. LATIN (1) 2024: 273-287 - [c54]Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee:
Fractional Bamboo Trimming and Distributed Windows Scheduling. SOFSEM 2024: 69-81 - [c53]William S. Evans, Kassian Köck, Stephen G. Kobourov:
Visualization of Bipartite Graphs in Limited Window Size. SOFSEM 2024: 198-210 - 2023
- [j38]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023) - [j37]William S. Evans, Lucca Morais de Arruda Siaudzionis:
On path-greedy geometric spanners. Comput. Geom. 110: 101948 (2023) - [c52]William S. Evans, David G. Kirkpatrick:
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. FCT 2023: 162-175 - [c51]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95 - [c50]William S. Evans, David G. Kirkpatrick:
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. WAOA 2023: 14-28 - [i20]William S. Evans, Seyed Ali Tabatabaee:
Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. CoRR abs/2304.10028 (2023) - 2022
- [j36]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022) - [i19]William S. Evans, Noushin Saeedi, Chan-Su Shin, Hyun Tark:
Reachability of turn sequences. CoRR abs/2203.00855 (2022) - [i18]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022) - 2021
- [j35]Ben Chugg, William S. Evans, Kelvin Wong:
Simultaneous visibility representations of undirected pairs of graphs. Comput. Geom. 98: 101788 (2021) - [j34]William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
On Area-Universal Quadrangulations. J. Graph Algorithms Appl. 25(1): 171-193 (2021) - [j33]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25(2): 643-661 (2021) - [j32]Kathryn Hymes, Jessica Hammer, Hakan Seyalioglu, Carol Dow-Richards, Deidra Brown, Trish Hambridge, Jill Ventrice, Meguey Baker, Yeonsoo Julian Kim, Tim Hutchings, William S. Evans:
Designing Game-Based Rehabilitation Experiences for People with Aphasia. Proc. ACM Hum. Comput. Interact. 5(CHI PLAY): 270:1-270:31 (2021) - 2020
- [c49]Ben Chugg, William S. Evans, Kelvin Wong:
Simultaneous Visibility Representations of Undirected Pairs of Graphs. CCCG 2020: 148-159 - [c48]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. WALCOM 2020: 94-106 - [i17]Ben Chugg, William S. Evans, Kelvin Wong:
Simultaneous Visibility Representations of Undirected Pairs of Graphs. CoRR abs/2005.00937 (2020)
2010 – 2019
- 2019
- [c47]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD 2019: 18-32 - [c46]Daniel Busto, William S. Evans, David G. Kirkpatrick:
Minimizing Interference Potential Among Moving Entities. SODA 2019: 2400-2418 - [i16]William S. Evans, Noushin Saeedi:
On problems related to crossing families. CoRR abs/1906.00191 (2019) - [i15]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR abs/1908.08273 (2019) - [i14]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. CoRR abs/1911.02040 (2019) - 2018
- [j31]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80(8): 2345-2383 (2018) - [j30]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table cartogram. Comput. Geom. 68: 174-185 (2018) - [j29]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j28]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713: 78-84 (2018) - [j27]Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin:
Covering points with convex sets of minimum size. Theor. Comput. Sci. 718: 14-23 (2018) - 2017
- [i13]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Results on Edge Partitions of 1-plane Graphs. CoRR abs/1706.05161 (2017) - 2016
- [j26]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating paths and cycles of minimum length. Comput. Geom. 58: 124-135 (2016) - [j25]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. J. Graph Theory 82(1): 45-64 (2016) - [j24]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Minimizing Co-location Potential of Moving Entities. SIAM J. Comput. 45(5): 1870-1893 (2016) - [j23]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636: 1-16 (2016) - [j22]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous visibility representations of plane st-graphs using L-shapes. Theor. Comput. Sci. 645: 100-111 (2016) - [c45]William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk:
Recognizing a DOG is Hard, But Not When It is Thin and Unit. FUN 2016: 16:1-16:12 - [c44]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [c43]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. GD 2016: 280-294 - [c42]Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin:
Covering Points with Convex Sets of Minimum Size. WALCOM 2016: 166-178 - [i12]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR abs/1604.08797 (2016) - [i11]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR abs/1606.06940 (2016) - [i10]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. CoRR abs/1608.08899 (2016) - 2015
- [j21]William S. Evans, Noushin Saeedi:
On characterizing terrain visibility graphs. J. Comput. Geom. 6(1): 108-141 (2015) - [c41]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. GD 2015: 295-308 - [c40]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating Paths and Cycles of Minimum Length. GD 2015: 383-394 - [c39]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG 2015: 105-119 - [c38]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Contact Representations of Graphs in 3D. WADS 2015: 14-27 - [c37]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. WG 2015: 252-265 - [i9]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR abs/1501.00304 (2015) - [i8]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. CoRR abs/1505.04388 (2015) - [i7]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-planar Graphs. CoRR abs/1509.00388 (2015) - 2014
- [j20]William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18(5): 721-739 (2014) - 2013
- [j19]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [j18]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) - [c36]Daniel Busto, William S. Evans, David G. Kirkpatrick:
On k-Guarding Polygons. CCCG 2013 - [c35]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Competitive query strategies for minimising the ply of the potential locations of moving points. SoCG 2013: 155-164 - [c34]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table Cartograms. ESA 2013: 421-432 - [c33]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. ISAAC 2013: 185-195 - [i6]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR abs/1309.4713 (2013) - [i5]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2012
- [c32]David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides:
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [c31]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - 2011
- [c30]Jeff Sember, William S. Evans:
The Possible Hull of Imprecise Points. CCCG 2011 - [c29]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - [c28]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate Proximity Drawings. GD 2011: 166-178 - 2010
- [c27]Zohreh Jabbari, William S. Evans, David G. Kirkpatrick:
Multi-guard covers for polygonal regions. CCCG 2010: 5-8 - [c26]Jeff Sember, William S. Evans:
k-star-shaped polygons. CCCG 2010: 215-218 - [c25]Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
On Graphs Supported by Line Sets. GD 2010: 177-182
2000 – 2009
- 2009
- [j17]William S. Evans, Christopher W. Fraser, Fei Ma:
Clone detection via structural abstraction. Softw. Qual. J. 17(4): 309-330 (2009) - 2008
- [c24]Jeff Sember, William S. Evans:
Guaranteed Voronoi Diagrams of Uncertain Sites. CCCG 2008 - [i4]William S. Evans, Christopher W. Fraser, Fei Ma:
Clone Detection via Structural Abstraction. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j16]Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs. J. Graph Algorithms Appl. 11(1): 45-59 (2007) - [c23]Warren Cheung, William S. Evans:
Pursuit-Evasion Voronoi Diagrams in ell_1. ISVD 2007: 58-65 - [c22]William S. Evans, Christopher W. Fraser, Fei Ma:
Clone Detection via Structural Abstraction. WCRE 2007: 150-159 - 2006
- [j15]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discret. Math. 20(2): 412-427 (2006) - [j14]William S. Evans, David G. Kirkpatrick:
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. ACM Trans. Algorithms 2(4): 661-678 (2006) - [i3]William S. Evans:
Program Compression. Duplication, Redundancy, and Similarity in Software 2006 - [i2]Andrew Walenstein, James R. Cordy, William S. Evans, Ahmed E. Hassan, Toshihiro Kamiya, Cory Kapser, Ettore Merlo:
06301 Working Session Summary: Presentation and Visualization of Redundant Code. Duplication, Redundancy, and Similarity in Software 2006 - [i1]Andrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, Jürgen Wolff von Gudenberg:
Similarity in Programs. Duplication, Redundancy, and Similarity in Software 2006 - 2005
- [j13]Daniel Archambault, William S. Evans, David G. Kirkpatrick:
Computing the Set of all the Distant Horizons of a Terrain. Int. J. Comput. Geom. Appl. 15(6): 547-564 (2005) - [c21]Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. GD 2005: 73-82 - 2004
- [j12]William S. Evans, David G. Kirkpatrick:
Restructuring ordered binary trees. J. Algorithms 50(2): 168-193 (2004) - [c20]Chris Gray, William S. Evans:
Optimistic shortest paths on uncertain terrains. CCCG 2004: 68-71 - [c19]William S. Evans, Daniel Archambault, David G. Kirkpatrick:
Computing the set of all distant horizons of a terrain. CCCG 2004: 76-79 - [c18]Ritesh Shah, Norman C. Hutchinson, William S. Evans:
Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks. LCN 2004: 610-617 - [c17]William S. Evans, David G. Kirkpatrick:
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. SODA 2004: 1041-1049 - 2003
- [j11]Saumya K. Debray, William S. Evans:
Cold code decompression at runtime. Commun. ACM 46(8): 54-60 (2003) - [j10]William S. Evans, Christopher W. Fraser:
Grammar-based compression of interpreted code. Commun. ACM 46(8): 61-66 (2003) - [j9]William S. Evans, Leonard J. Schulman:
On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Trans. Inf. Theory 49(11): 3094-3098 (2003) - [c16]Jocelyn Smith, William S. Evans:
Triangle Guarding. CCCG 2003: 76-80 - [c15]Warren Cheung, William S. Evans, Jeremy Moses:
Predicated Instructions for Code Compaction. SCOPES 2003: 17-32 - 2002
- [j8]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geom. Appl. 12(6): 445-454 (2002) - [c14]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN 2002: 479-493 - [c13]Saumya K. Debray, William S. Evans:
Profile-Guided Code Compression. PLDI 2002: 95-105 - 2001
- [j7]William S. Evans, David G. Kirkpatrick, G. Townsend:
Right-Triangulated Irregular Networks. Algorithmica 30(2): 264-286 (2001) - [c12]William S. Evans, Christopher W. Fraser:
Bytecode Compression via Profiled Grammar Rewriting. PLDI 2001: 148-155 - 2000
- [j6]Curtis E. Dyreson, William S. Evans, Hong Lin, Richard T. Snodgrass:
Efficiently Supported Temporal Granularities. IEEE Trans. Knowl. Data Eng. 12(4): 568-587 (2000) - [j5]Saumya K. Debray, William S. Evans, Robert Muth, Bjorn De Sutter:
Compiler techniques for code compaction. ACM Trans. Program. Lang. Syst. 22(2): 378-415 (2000) - [c11]William S. Evans, David G. Kirkpatrick:
Restructuring ordered binary trees. SODA 2000: 477-486
1990 – 1999
- 1999
- [j4]William S. Evans, Leonard J. Schulman:
Signal propagation and noisy circuits. IEEE Trans. Inf. Theory 45(7): 2367-2373 (1999) - 1998
- [j3]William S. Evans, Nicholas Pippenger:
Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM J. Comput. 28(2): 433-446 (1998) - [j2]William S. Evans, Nicholas Pippenger:
On the Maximum Tolerable Noise for Reliable Computation by Formulas. IEEE Trans. Inf. Theory 44(3): 1299-1305 (1998) - [c10]Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan:
Recovering lines with fixed linear probes. CCCG 1998 - [c9]William S. Evans:
Compression via Guided Parsing. Data Compression Conference 1998: 544 - 1997
- [c8]Claudio Bettini, Curtis E. Dyreson, William S. Evans, Richard T. Snodgrass, Xiaoyang Sean Wang:
A Glossary of Time Granularity Concepts. Temporal Databases, Dagstuhl 1997: 406-413 - [c7]Jens Ernst, William S. Evans, Christopher W. Fraser, Steven Lucco, Todd A. Proebsting:
Code Compression. PLDI 1997: 358-365 - 1996
- [c6]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG 1996: 68-73 - [c5]Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 - [c4]William S. Evans, Nicholas Pippenger:
Lower Bounds for Noisy Boolean Decision Trees. STOC 1996: 620-628 - 1994
- [j1]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994) - 1993
- [c3]William S. Evans, Sridhar Rajagopalan, Umesh V. Vazirani:
Choosing a Reliable Hypothesis. COLT 1993: 269-276 - [c2]William S. Evans, Leonard J. Schulman:
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas. FOCS 1993: 594-603 - 1991
- [c1]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. FOCS 1991: 90-99
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-08-03 21:14 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:
