default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKun-Mao Chao
趙坤茂
Person information
- unicode name: 趙坤茂
- affiliation: National Taiwan University, Taipei, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i4]Manuel Dubinsky, Kun-Mao Chao, César Massri, Gabriel Taubin:
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem. CoRR abs/2404.17428 (2024)- 2022
- [j60]Min-Jen Chen
, Kun-Mao Chao:
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection. Discret. Appl. Math. 321: 19-23 (2022)
2010 – 2019
- 2018
- [p2]Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao:
Approximation Algorithms for the Selection of Robust Tag SNPs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p1]Bang Ye Wu, Chuan Yi Tang, Kun-Mao Chao:
Optimum Communication Spanning Trees. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2016
- [c35]Albert Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao:
Computing the Line-Constrained k-center in the Plane for Small k. AAIM 2016: 197-208 - [c34]Tsung-Han Tsai, Lih-Jen Kau, Kun-Mao Chao:
A Takagi-Sugeno fuzzy neural network-based algorithm with single-channel EEG signal for the discrimination between light and deep sleep stages. BioCAS 2016: 532-535 - [r6]Kun-Mao Chao:
Maximum-Average Segments. Encyclopedia of Algorithms 2016: 1241-1242 - [r5]Kun-Mao Chao:
Maximum-Sum Segments. Encyclopedia of Algorithms 2016: 1242-1244 - 2015
- [j59]Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu:
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 384-390 (2015) - [c33]Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao:
Forming Plurality at Minimum Cost. WALCOM 2015: 77-88 - 2014
- [j58]Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee:
Preface Algorithms and Computation (ISAAC 2012). Algorithmica 70(4): 694-695 (2014) - [j57]Chia-Jung Chang, Pei-Lung Chen, Wei-Shiung Yang, Kun-Mao Chao:
A fault-tolerant method for HLA typing with PacBio data. BMC Bioinform. 15: 296 (2014) - [j56]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao:
Locating Valid SLCAs for XML Keyword Search with NOT Semantics. SIGMOD Rec. 43(2): 29-34 (2014) - [j55]Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee:
Algorithms and Computation (ISAAC 2012). Theor. Comput. Sci. 544: 1-2 (2014) - [c32]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
The Generalized Popular Condensation Problem. ISAAC 2014: 606-617 - 2013
- [j54]Kuan-Yu Chen, Kun-Mao Chao:
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. Algorithmica 65(2): 354-370 (2013) - [j53]An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao:
A linear-time algorithm for finding an edge-partition with max-min ratio at most two. Discret. Appl. Math. 161(7-8): 932-943 (2013) - [j52]Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23(6): 425-426 (2013) - [c31]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao:
A Compact and Efficient Labeling Scheme for XML Documents. DASFAA (1) 2013: 269-283 - [c30]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
Computing Plurality Points and Condorcet Points in Euclidean Space. ISAAC 2013: 688-698 - [c29]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
An Optimal Algorithm for the Popular Condensation Problem. IWOCA 2013: 412-422 - 2012
- [j51]Chia-Jung Chang, Kun-Mao Chao:
Efficient algorithms for local ranking. Inf. Process. Lett. 112(13): 517-522 (2012) - [j50]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao:
Efficient retrieval of approximate palindromes in a run-length encoded string. Theor. Comput. Sci. 432: 28-37 (2012) - [c28]Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron:
Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. TAMC 2012: 177-188 - [c27]Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier:
Preserving Inversion Phylogeny Reconstruction. WABI 2012: 1-13 - [e1]Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, ISBN 978-3-642-35260-7 [contents] - 2011
- [j49]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Minkowski Sum Selection and Finding. Int. J. Comput. Geom. Appl. 21(3): 283-311 (2011) - [j48]Yi-Ching Chen, Kun-Mao Chao:
On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3): 383-392 (2011) - [j47]Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding all sorting tandem duplication random loss operations. J. Discrete Algorithms 9(1): 32-48 (2011) - [j46]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao:
Improving the performance of identifying contributors for XML keyword search. SIGMOD Rec. 40(1): 5-10 (2011) - [j45]Cheng-Wei Luo, Ming-Chiang Chen, Yi-Ching Chen, Roger W. L. Yang, Hsiao-Fei Liu, Kun-Mao Chao:
Linear-Time Algorithms for the Multiple Gene Duplication Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 260-265 (2011) - [c26]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao:
Identifying Relevant Matches with NOT Semantics over XML Documents. DASFAA (1) 2011: 466-480 - 2010
- [j44]An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao:
A tight bound on the min-ratio edge-partitioning problem of a tree. Discret. Appl. Math. 158(14): 1471-1478 (2010) - [j43]Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao:
Finding All Approximate Gapped Palindromes. Int. J. Found. Comput. Sci. 21(6): 925-939 (2010) - [j42]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao:
Hardness of comparing two run-length encoded strings. J. Complex. 26(4): 364-374 (2010) - [c25]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao:
Faster Algorithms for Searching Relevant Matches in XML Databases. DEXA (1) 2010: 290-297 - [c24]Kuan-Yu Chen, Kun-Mao Chao:
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. ESA (1) 2010: 415-426 - [c23]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao:
Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) 2010: 339-350
2000 – 2009
- 2009
- [b2]Kun-Mao Chao, Louxin Zhang:
Sequence Comparison - Theory and Methods. Computational Biology 7, Springer 2009, ISBN 978-1-84800-319-4, pp. i-xx, 1-209 - [j41]Hsiao-Fei Liu, Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities. Algorithmica 54(1): 107-117 (2009) - [j40]Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao:
Optimal algorithms for the average-constrained maximum-sum segment problem. Inf. Process. Lett. 109(3): 171-174 (2009) - [j39]Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao:
The backup 2-center and backup 2-median problems on trees. Networks 53(1): 39-49 (2009) - [c22]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao:
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. CPM 2009: 168-179 - [c21]Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding All Sorting Tandem Duplication Random Loss Operations. CPM 2009: 301-313 - [c20]Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao:
Finding All Approximate Gapped Palindromes. ISAAC 2009: 1084-1093 - 2008
- [j38]Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao:
The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008) - [j37]Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao:
CNVDetector: locating copy number variations using array CGH data. Bioinform. 24(23): 2773-2775 (2008) - [j36]Yao-Ting Huang, Kun-Mao Chao:
A new framework for the selection of tag SNPs by multimarker haplotypes. J. Biomed. Informatics 41(6): 953-961 (2008) - [j35]Hsiao-Fei Liu, Kun-Mao Chao:
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theor. Comput. Sci. 407(1-3): 349-358 (2008) - [j34]Hung-Lung Wang, Kun-Mao Chao:
The 2-radius and 2-radiian problems on trees. Theor. Comput. Sci. 407(1-3): 524-531 (2008) - [c19]Chia-Ying Yang, Chao-Hui Chang, Ya-Ling Yu, Tsu-Chun Emma Lin, Sheng-An Lee, Chueh-Chuan Yen, Jinn-Moon Yang, Jin-Mei Lai, Yi-Ren Hong, Tzu-Ling Tseng, Kun-Mao Chao, Chi-Ying F. Huang:
PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database. ECCB 2008: 14-20 - [c18]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Minkowski Sum Selection and Finding. ISAAC 2008: 460-471 - [r4]Kun-Mao Chao:
Maximum-Density Segment. Encyclopedia of Algorithms 2008 - [r3]Kun-Mao Chao:
Maximum-scoring Segment with Length Restrictions. Encyclopedia of Algorithms 2008 - [i3]Hsiao-Fei Liu, Kun-Mao Chao:
An Õ(n2.5)-Time Algorithm for Online Topological Ordering. CoRR abs/0804.3860 (2008) - [i2]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Minkowski Sum Selection and Finding. CoRR abs/0809.1171 (2008) - [i1]Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Algorithms for Locating Constrained Optimal Intervals. CoRR abs/0809.2097 (2008) - 2007
- [j33]Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao:
On the uniform edge-partition of a tree. Discret. Appl. Math. 155(10): 1213-1223 (2007) - [j32]Kuan-Yu Chen, Kun-Mao Chao:
On the range maximum-sum segment query problem. Discret. Appl. Math. 155(16): 2043-2052 (2007) - [j31]Hsiao-Fei Liu, Kun-Mao Chao:
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389(1-2): 182-189 (2007) - [c17]Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis. ISAAC 2007: 834-845 - [r2]Chuan Yi Tang, Kun-Mao Chao, Bang Ye Wu:
Optimum Communication Spanning Trees. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Kui Zhang, Kun-Mao Chao, Yao-Ting Huang, Ting Chen:
Approximation Algorithms for the Selection of Robust Tag SNPs. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j30]Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao:
A greedier approach for finding tag SNPs. Bioinform. 22(6): 685-691 (2006) - [j29]Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved algorithms for the k maximum-sums problems. Theor. Comput. Sci. 362(1-3): 162-170 (2006) - [c16]Hsiao-Fei Liu, Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC 2006: 300-307 - 2005
- [j28]Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao:
Selecting additional tag SNPs for tolerating missing data in genotyping. BMC Bioinform. 6: 263 (2005) - [j27]I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao:
A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93(5): 249-253 (2005) - [j26]Kuan-Yu Chen, Kun-Mao Chao:
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Inf. Process. Lett. 96(6): 197-201 (2005) - [j25]Yao-Ting Huang, Kun-Mao Chao, Ting Chen:
An Approximation Algorithm for Haplotype Inference by Maximum Parsimony. J. Comput. Biol. 12(10): 1261-1274 (2005) - [j24]Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao:
Finding a Length-Constrained Maximum-Density Path in a Tree. J. Comb. Optim. 9(2): 147-156 (2005) - [c15]Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved Algorithms for the k Maximum-Sums Problems. ISAAC 2005: 799-808 - [c14]Yao-Ting Huang, Kun-Mao Chao, Ting Chen:
An approximation algorithm for haplotype inference by maximum parsimony. SAC 2005: 146-150 - 2004
- [b1]Bang Ye Wu, Kun-Mao Chao:
Spanning trees and optimization problems. Discrete mathematics and its applications, Chapman & Hall 2004, ISBN 978-1-58488-436-1, pp. I-XV, 1-184 - [j23]Xiaoqiu Huang, Liang Ye, Hui-Hsien Chou, I-Hsuan Yang, Kun-Mao Chao:
Efficient combination of multiple word models for improved sequence comparison. Bioinform. 20(16): 2529-2533 (2004) - [j22]Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao:
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. SIGMOD Rec. 33(2): 21-26 (2004) - [c13]I-Hsuan Yang, Sheng-Ho Wang, Yang-Ho Chen, Pao-Hsian Huang, Liang Ye, Xiaoqiu Huang, Kun-Mao Chao:
Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds. BIBE 2004: 411-418 - [c12]Kuan-Yu Chen, Kun-Mao Chao:
On the Range Maximum-Sum Segment Query Problem. ISAAC 2004: 294-305 - [c11]Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao:
A Sensitive Sequence Comparison Method. SNPD 2004: 77-80 - [c10]Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao:
Approximation Algorithms for the Selection of Robust Tag SNPs. WABI 2004: 278-289 - 2003
- [j21]Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao:
MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinform. 19(1): 151-152 (2003) - [j20]Xiaoqiu Huang, Kun-Mao Chao:
A generalized global alignment algorithm. Bioinform. 19(2): 228-233 (2003) - [j19]Chuan Yi Tang, Chin Lung Lu, Margaret Dah-Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun-Mao Chao, Jia-Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao-Teng Chang, Wei-I Chou:
Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment. J. Bioinform. Comput. Biol. 1(2): 267-288 (2003) - [c9]Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao:
Finding a Length-Constrained Maximum-Density Path in a Tree. ISAAC 2003: 78-87 - 2002
- [j18]Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao:
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci. 65(3): 570-586 (2002) - [j17]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Light graphs with small routing cost. Networks 39(3): 130-138 (2002) - [c8]Chuan Yi Tang, Chin Lung Lu, Margaret Dah-Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun-Mao Chao, Jia-Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao-Teng Chang, Wei-I Chou:
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment. CSB 2002: 127-137 - [c7]Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao:
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. MFCS 2002: 459-470 - 2000
- [j16]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for some optimum communication spanning tree problems. Discret. Appl. Math. 102(3): 245-266 (2000) - [j15]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for the shortest total path length spanning tree problem. Discret. Appl. Math. 105(1-3): 273-289 (2000) - [j14]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. J. Algorithms 36(2): 182-204 (2000)
1990 – 1999
- 1999
- [j13]Kun-Mao Chao:
Calign: aligning sequences with restricted affine gap penalties. Bioinform. 15(4): 298-304 (1999) - [j12]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. Inf. Process. Lett. 69(2): 63-67 (1999) - [j11]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. J. Comb. Optim. 3(2-3): 199-211 (1999) - [j10]Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999) - [c6]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Constructing Light Spanning Trees with Small Routing Cost. STACS 1999: 334-344 - 1998
- [j9]Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee:
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998) - [j8]Kun-Mao Chao:
On Computing all Supoptimal Alignments. Inf. Sci. 105(1-4): 189-207 (1998) - [c5]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. COCOON 1998: 299-308 - [c4]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC 1998: 407-416 - [c3]Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32 - 1997
- [j7]Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller:
A tool for aligning very similar DNA sequences. Comput. Appl. Biosci. 13(1): 75-80 (1997) - [c2]Kun-Mao Chao:
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. COCOON 1997: 264-273 - 1995
- [j6]Kun-Mao Chao, Webb Miller:
Linear-Space Algorithms that Build Local Alignments from Fragments. Algorithmica 13(1/2): 106-134 (1995) - [j5]Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller:
A local alignment tool for very long DNA sequences. Comput. Appl. Biosci. 11(2): 147-153 (1995) - 1994
- [j4]Kun-Mao Chao, Ross C. Hardison, Webb Miller:
Recent Developments in Linear-Space Alignment Methods: A Survey. J. Comput. Biol. 1(4): 271-291 (1994) - [c1]Kun-Mao Chao:
Computing all Suboptimal Alignments in Linear Space. CPM 1994: 31-42 - 1993
- [j3]Kun-Mao Chao, Ross C. Hardison, Webb Miller:
Locating well-conserved regions within a pairwise alignment. Comput. Appl. Biosci. 9(4): 387-396 (1993) - 1992
- [j2]Kun-Mao Chao, William R. Pearson, Webb Miller:
Aligning two sequences within a specified diagonal band. Comput. Appl. Biosci. 8(5): 481-487 (1992) - 1990
- [j1]Ruei-Chuan Chang, Kun-Mao Chao:
Parallel Operator-Precedence Parsing. J. Inf. Sci. Eng. 6(1): 51-61 (1990)
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:20 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:
