default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaolin Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i4]Wei Bi, Xiangyu Liu, Maolin Zheng:
ε-differential agreement: A Parallel Data Sorting Mechanism for Distributed Information Processing System. CoRR abs/1904.07124 (2019)- [i3]Luke Zeng, Shawn Xin, Avadesian Xu, Thomas Pang, Tim Yang, Maolin Zheng:
Seele's New Anti-ASIC Consensus Algorithm with Emphasis on Matrix Computation. CoRR abs/1905.04565 (2019) - 2018
- [i2]Wei Bi, Xiaoyun Jia, Maolin Zheng:
A Secure Multiple Elliptic Curves Digital Signature Algorithm for Blockchain. CoRR abs/1808.02988 (2018) - [i1]Wei Bi, Huawei Yang, Maolin Zheng:
An Accelerated Method for Message Propagation in Blockchain Networks. CoRR abs/1809.00455 (2018)
2000 – 2009
- 2002
- [j13]Xiaofeng Guo, Pierre Hansen, Maolin Zheng:
Boundary uniqueness of fusenes. Discret. Appl. Math. 118(3): 209-222 (2002) - 2000
- [e1]Pierre Hansen, Patrick W. Fowler, Maolin Zheng:
Discrete Mathematical Chemistry, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 51, DIMACS/AMS 2000, ISBN 978-0-8218-0987-7 [contents]
1990 – 1999
- 1998
- [c1]Gilles Caporossi, Pierre Hansen, Maolin Zheng:
Enumeration of fusenes to h = 20. Discrete Mathematical Chemistry 1998: 63-78 - 1997
- [j12]Pierre Hansen, Fuji Zhang, Maolin Zheng:
Perfect matchings and ears in elementary bipartite graphs. Discret. Math. 176(1-3): 131-138 (1997) - 1996
- [j11]Pierre Hansen, Maolin Zheng:
Shortest Shortest Path Trees of a Network. Discret. Appl. Math. 65(1-3): 275-284 (1996) - 1995
- [j10]Pierre Hansen, Maolin Zheng:
Assigning a Kekulé Structure to a Conjugated Molecule. Comput. Chem. 19(1): 21-25 (1995) - [j9]Pierre Hansen, Brigitte Jaumard, Horst Sachs, Maolin Zheng:
Finding a Kekule Structure in a Benzenoid System in Linear Time. J. Chem. Inf. Comput. Sci. 35(3): 561-567 (1995) - [j8]Peter E. John, Horst Sachs, Maolin Zheng:
Kekule patterns and Clar patterns in bipartite plane graphs. J. Chem. Inf. Comput. Sci. 35(6): 1019-1021 (1995) - 1994
- [j7]Pierre Hansen, Maolin Zheng:
Bonds Fixed by Fixing Bonds. J. Chem. Inf. Comput. Sci. 34(2): 297-304 (1994) - [j6]Pierre Hansen, Maolin Zheng:
Numerical Bounds for the Perfect Matching Vectors of a Polyhex. J. Chem. Inf. Comput. Sci. 34(2): 305-308 (1994) - [j5]Pierre Hansen, Brigitte Jaumard, Catherine Lebatteux, Maolin Zheng:
Coding Chemical Trees with the Centered N-tuple Code. J. Chem. Inf. Comput. Sci. 34(4): 782-790 (1994) - 1993
- [j4]Pierre Hansen, Maolin Zheng:
A linear algorithm for perfect matching in hexagonal systems. Discret. Math. 122(1-3): 179-196 (1993) - [j3]Pierre Hansen, Maolin Zheng:
Sharp bounds on the order, size, and stability number of graphs. Networks 23(2): 99-102 (1993) - 1992
- [j2]Fuji Zhang, Maolin Zheng:
Generalized hexagonal systems with each hexagon being resonant. Discret. Appl. Math. 36(1): 67-73 (1992) - 1990
- [j1]Maolin Zheng, Xiaoyun Lu:
On the maximum induced forests of a connected cubic graph without triangles. Discret. Math. 85(1): 89-96 (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 2024-04-25 05:53 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:
