default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Zeh
Person information
- affiliation: Dalhousie University, Halifax, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Elise Deen, Leo van Iersel, Remie Janssen
, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A near-linear kernel for bounded-state parsimony distance. J. Comput. Syst. Sci. 140: 103477 (2024)- [c70]Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh:
Another virtue of wavelet forests. DCC 2024: 559 - [c69]Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh:
Another Virtue of Wavelet Forests. SPIRE 2024: 184-191 - [i13]Jordan Dempsey, Leo van Iersel, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Wild Sheep Chase Through an Orchard. CoRR abs/2408.10769 (2024) - [i12]Jordan Dempsey, Leo van Iersel, Mark Jones, Norbert Zeh:
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees. CoRR abs/2409.08440 (2024) - 2023
- [j29]Mozhgan Saeidi, Kaveh Mahdaviani, Evangelos E. Milios, Norbert Zeh:
Context-enhanced concept disambiguation in Wikification. Intell. Syst. Appl. 19: 200246 (2023) - [c68]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) 2023: 195-206 - [i11]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR abs/2305.03240 (2023) - [i10]Christina Boucher, Travis Gagie, Aaron Hong, Yansong Li, Norbert Zeh:
Another virtue of wavelet forests? CoRR abs/2308.07809 (2023) - 2022
- [j28]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. Algorithmica 84(4): 917-960 (2022) - [c67]Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh:
Biomedical Word Sense Disambiguation with Contextualized Representation Learning. WWW (Companion Volume) 2022: 843-848 - [i9]Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yuki Murakami, Norbert Zeh:
A Near-Linear Kernel for Two-Parsimony Distance. CoRR abs/2211.00378 (2022) - 2021
- [j27]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A unifying characterization of tree-based networks and orchard networks using cherry covers. Adv. Appl. Math. 129: 102222 (2021) - [c66]Md. Rashadul Hasan Rakib, Norbert Zeh, Evangelos E. Milios:
Efficient clustering of short text streams using online-offline clustering. DocEng 2021: 5:1-5:10 - [c65]Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh:
Contextualized Knowledge Base Sense Embeddings in Word Sense Disambiguation. ICDAR Workshops (2) 2021: 174-186 - [c64]Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh:
Graph Representation Learning in Document Wikification. ICDAR Workshops (2) 2021: 509-524 - [c63]Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh:
Graph Convolutional Networks for Categorizing Online Harassment on Twitter. ICMLA 2021: 946-951 - 2020
- [j26]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 14-26 (2020) - [c62]Neil Burke, Oliver Baltzer, Norbert Zeh:
Efficient location-level risk analytics. CASCON 2020: 33-42 - [c61]Md. Rashadul Hasan Rakib, Norbert Zeh, Evangelos E. Milios:
Short Text Stream Clustering via Frequent Word Pairs and Reassignment of Outliers to Clusters. DocEng 2020: 13:1-13:4 - [c60]Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios:
Enhancement of Short Text Clustering by Iterative Classification. NLDB 2020: 105-117 - [i8]Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios:
Enhancement of Short Text Clustering by Iterative Classification. CoRR abs/2001.11631 (2020)
2010 – 2019
- 2019
- [j25]Meng He, Norbert Zeh:
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 77: 1-2 (2019) - [c59]Mozhgan Saeidi, Samuel Bruno da Silva Sousa, Evangelos E. Milios, Norbert Zeh, Lilian Berton:
Categorizing Online Harassment on Twitter. PKDD/ECML Workshops (2) 2019: 283-297 - [i7]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. CoRR abs/1907.08474 (2019) - 2018
- [c58]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems. AlCoB 2018: 37-49 - [c57]Md. Rashadul Hasan Rakib, Magdalena Jankowska, Norbert Zeh, Evangelos E. Milios:
Improving Short Text Clustering by Similarity Matrix Sparsification. DocEng 2018: 50:1-50:4 - [c56]Meng He, Cuong P. Nguyen, Norbert Zeh:
Maximal and Convex Layers of Random Point Sets. LATIN 2018: 597-610 - 2017
- [j24]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017) - [j23]José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh:
Parallel construction of succinct trees. Theor. Comput. Sci. 700: 1-22 (2017) - [c55]Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios:
High-performance Computational Framework for Phrase Relatedness. DocEng 2017: 145-148 - [c54]Zhijiang Li, Norbert Zeh:
Computing Maximum Agreement Forests without Cluster Partitioning is Folly. ESA 2017: 56:1-56:14 - 2016
- [j22]Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. Algorithmica 74(3): 1019-1054 (2016) - [j21]Peter Sanders, Norbert Zeh:
Introduction to Special Issue ALENEX 2013. ACM J. Exp. Algorithmics 21(1): 2.1:1-2.1:2 (2016) - [j20]Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh:
Hybridization Number on Three Rooted Binary Trees is EPT. SIAM J. Discret. Math. 30(3): 1607-1631 (2016) - [r2]Norbert Zeh, Ulrich Meyer:
I/O-Model. Encyclopedia of Algorithms 2016: 943-947 - 2015
- [c53]Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh:
Parallel Construction of Succinct Trees. SEA 2015: 3-14 - 2014
- [c52]Andrew Rau-Chaplin, Zhimin Yao, Norbert Zeh:
Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce. ICCS 2014: 1557-1568 - [c51]Meng He, Ganggui Tang, Norbert Zeh:
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC 2014: 128-140 - [i6]Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh:
Hybridization Number on Three Trees. CoRR abs/1402.2136 (2014) - 2013
- [j19]Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fixed-Parameter Algorithms for Maximum Agreement Forests. SIAM J. Comput. 42(4): 1431-1466 (2013) - [c50]Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh:
QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce. IEEE BigData 2013: 703-709 - [c49]Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh:
Building a scalable spatial OLAP system. SAC 2013: 13-15 - [c48]Freek van Walderveen, Norbert Zeh, Lars Arge:
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA 2013: 901-918 - [e2]Peter Sanders, Norbert Zeh:
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013. SIAM 2013, ISBN 978-1-61197-253-5 [contents] - [i5]Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. CoRR abs/1305.0512 (2013) - [i4]Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh:
QuPARA: Query-Driven Large-Scale Portfolio Aggregate Risk Analysis on MapReduce. CoRR abs/1308.3615 (2013) - 2012
- [j18]Ulrich Meyer, Norbert Zeh:
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms 8(3): 22:1-22:28 (2012) - [c47]Peyman Afshani, Norbert Zeh:
Lower Bounds for Sorted Geometric Queries in the I/O Model. ESA 2012: 48-59 - [c46]Reza Dorrigiv, Meng He, Norbert Zeh:
On the Advice Complexity of Buffer Management. ISAAC 2012: 136-145 - [c45]Meng He, Patrick K. Nicholson, Norbert Zeh:
A Space-Efficient Framework for Dynamic Point Location. ISAAC 2012: 548-557 - [c44]Nodari Sitchinava, Norbert Zeh:
A parallel buffer tree. SPAA 2012: 214-223 - 2011
- [j17]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. Discret. Comput. Geom. 45(4): 824-850 (2011) - [j16]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011) - [j15]Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
A topological sorting algorithm for large graphs. ACM J. Exp. Algorithmics 17(1) (2011) - [j14]Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh:
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 551-556 (2011) - [c43]Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
Engineering a Topological Sorting Algorithm for Massive Graphs. ALENEX 2011: 139-150 - [c42]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. IPDPS 2011: 1114-1123 - [c41]Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh:
Ordered and Unordered Top-K Range Reporting in Large Data Sets. SODA 2011: 390-400 - [c40]Peyman Afshani, Norbert Zeh:
Improved Space Bounds for Cache-Oblivious Range Reporting. SODA 2011: 1745-1758 - [i3]Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests. CoRR abs/1108.2664 (2011) - 2010
- [j13]Norbert Zeh:
Editorial. Comput. Geom. 43(4): 329-330 (2010) - [j12]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom. 43(8): 700-712 (2010) - [c39]Lars Arge, Morten Revsbæk, Norbert Zeh:
I/O-efficient computation of water flow across a terrain. SCG 2010: 403-412 - [c38]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). ESA (2) 2010: 75-86 - [c37]Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. SEA 2010: 141-153
2000 – 2009
- 2009
- [j11]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009) - [j10]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [c36]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh:
Relaxed Gabriel Graphs. CCCG 2009: 169-172 - [c35]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-oblivious range reporting with optimal queries requires superlinear space. SCG 2009: 277-286 - [c34]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. SCG 2009: 287-295 - [c33]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184 - [c32]Vlado Keselj, Haibin Liu, Norbert Zeh, Christian Blouin, Chris Whidden:
Finding optimal parameters for edit distance based sequence classification is NP-hard. KDD Workshop on Statistical and Relational Learning in Bioinformatics 2009: 17-21 - [c31]Chris Whidden, Norbert Zeh:
A Unifying View on Approximation and FPT of Agreement Forests. WABI 2009: 390-402 - [c30]Adan Cosgaya-Lozano, Norbert Zeh:
A Heuristic Strong Connectivity Algorithm for Large Graphs. SEA 2009: 113-124 - 2008
- [j9]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008) - [j8]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008) - [c29]Lars Arge, Thomas Mølhave, Norbert Zeh:
Cache-Oblivious Red-Blue Line Segment Intersection. ESA 2008: 88-99 - [c28]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86 - [r1]Norbert Zeh:
I/O-model. Encyclopedia of Algorithms 2008 - [i2]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. CoRR abs/0805.1661 (2008) - 2007
- [j7]Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh:
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions. J. Digit. Inf. Manag. 5(4): 180-190 (2007) - [c27]Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh:
Adaptive Tuple Differential Coding. DEXA 2007: 109-119 - [c26]Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh:
Parallel Computation of Skyline Queries. HPCS 2007: 12 - [c25]Luca Allulli, Peter Lichodzijewski, Norbert Zeh:
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. SODA 2007: 910-919 - [c24]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 - [e1]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh:
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4619, Springer 2007, ISBN 978-3-540-73948-7 [contents] - [i1]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007) - 2006
- [j6]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006) - [j5]Richard J. Nowakowski, Norbert Zeh:
Boundary-optimal Triangulation Flooding. Int. J. Comput. Geom. Appl. 16(2-3): 271-290 (2006) - [c23]Lars Arge, Norbert Zeh:
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. SCG 2006: 158-166 - [c22]Ulrich Meyer, Norbert Zeh:
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA 2006: 540-551 - [c21]Allan E. Scott, Ulrike Stege, Norbert Zeh:
Politician's Firefighting. ISAAC 2006: 608-617 - 2005
- [c20]Hema Jampala, Norbert Zeh:
Cache-Oblivious Planar Shortest Paths. ICALP 2005: 563-575 - 2004
- [j4]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004) - [j3]Anil Maheshwari, Norbert Zeh:
I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004) - [c19]Richard J. Nowakowski, Norbert Zeh:
Boundary-Optimal Triangulation Flooding. ISAAC 2004: 717-728 - [c18]Norbert Zeh:
Connectivity of Graphs Under Edge Flips. SWAT 2004: 161-173 - [c17]Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh:
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT 2004: 480-492 - 2003
- [j2]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An external memory data structure for shortest path queries. Discret. Appl. Math. 126(1): 55-82 (2003) - [j1]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003) - [c16]Ulrich Meyer, Norbert Zeh:
I/O-Efficient Undirected Shortest Paths. ESA 2003: 434-445 - [c15]Lars Arge, Norbert Zeh:
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003: 261-270 - [c14]Lars Arge, Laura Toma, Norbert Zeh:
I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93 - [c13]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49 - 2002
- [c12]Anil Maheshwari, Jan Vahrenhold, Norbert Zeh:
On reverse nearest neighbor queries. CCCG 2002: 128-132 - [c11]Anil Maheshwari, Norbert Zeh:
A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61 - [c10]Laura Toma, Norbert Zeh:
I/O-Efficient Algorithms for Sparse Graphs. Algorithms for Memory Hierarchies 2002: 85-109 - [c9]Anil Maheshwari, Norbert Zeh:
I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381 - 2001
- [c8]Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255 - [c7]Norbert Zeh, Nicola Santoro:
On Finding Minimum Deadly Sets for Directed Networks. SIROCCO 2001: 351-366 - [c6]Anil Maheshwari, Norbert Zeh:
I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90 - [c5]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299 - [c4]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. WADS 2001: 471-482 - 2000
- [c3]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231
1990 – 1999
- 1999
- [c2]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60 - [c1]Anil Maheshwari, Norbert Zeh:
External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316
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-20 23:58 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:
