default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPingshan Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j28]Congzhen Chen, Pingshan Li, Xianglin Liu:
Paired 2-disjoint path cover of burnt pancake graphs with n-3 faulty elements. Discret. Appl. Math. 380: 307-325 (2026)- [j27]Pingshan Li, Ke Yang, Wei Jin:
A note on the second-largest number of dissociation sets in connected graphs. Discret. Appl. Math. 384: 34-40 (2026) - [j26]Pingshan Li, Jue Wu, Wei Jin, Min Xu:
The characterization of the lower bound on the dissociation number of trees. Discret. Math. 349(3): 114854 (2026) - 2025
- [j25]Pingshan Li
, Wen Jiang, Zewei Qian:
Restricted 2-fault diameter of hypercubes. Int. J. Comput. Math. Comput. Syst. Theory 10(4): 246-267 (2025) - 2024
- [j24]Shijie Zhao, Pingshan Li:
On Conditional Edge-Fault-Tolerant Strong Menger Edge Connectivity Of Folded Hypercubes. Comput. J. 67(2): 777-781 (2024) - [j23]Xiaojun Zhao, Shudan Xue, Qingying Deng, Pingshan Li:
Structure connectivity and substructure connectivity of Möbius cubes. Comput. J. 67(12): 3207-3220 (2024) - [j22]Pingshan Li, Min Xu, Eddie Cheng:
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs. Discret. Appl. Math. 348: 152-158 (2024) - [j21]Pingshan Li, Min Xu:
The maximum number of maximum generalized 4-independent sets in trees. J. Graph Theory 107(2): 359-380 (2024) - 2023
- [j20]Shudan Xue, Qingying Deng, Pingshan Li:
Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees. Comput. J. 66(2): 384-398 (2023) - [j19]Shudan Xue, Qingying Deng, Pingshan Li, Jianguo Chen:
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges. Discret. Appl. Math. 334: 68-80 (2023) - 2022
- [j18]Pingshan Li:
Edge fault-tolerance of strongly Menger edge connected graphs. Discret. Math. 345(2): 112681 (2022) - [j17]Pingshan Li, Rong Liu, Xianglin Liu:
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees. Int. J. Found. Comput. Sci. 33(1): 33-43 (2022) - [j16]Rong Liu, Pingshan Li:
The 3-Good Neighbor Edge-Fault-Tolerant Strong Menger Edge Connectivity on the Class of BC Networks. J. Interconnect. Networks 22(1): 2142015:1-2142015:14 (2022) - [j15]Dong Liu, Pingshan Li, Bicheng Zhang:
Component edge connectivity of hypercube-like networks. Theor. Comput. Sci. 911: 19-25 (2022) - 2021
- [i1]Dong Liu, Pingshan Li, Bicheng Zhang:
Component Edge Connectivity of Hypercube-like Networks. CoRR abs/2105.04803 (2021) - 2020
- [j14]Pingshan Li, Min Xu:
Fault-tolerant strong Menger (edge) connectivity of arrangement graph. Discret. Appl. Math. 287: 53-61 (2020) - [j13]Pingshan Li, Min Xu:
The largest component of faulty star graphs. Theor. Comput. Sci. 824-825: 57-66 (2020) - [j12]Tongtong Ding, Pingshan Li, Min Xu:
The component (edge) connectivity of shuffle-cubes. Theor. Comput. Sci. 835: 108-119 (2020) - [j11]Min Xu, Pingshan Li:
Edge-fault-tolerant strong Menger edge connectivity on regular graphs. Theor. Comput. Sci. 847: 39-48 (2020)
2010 – 2019
- 2019
- [j10]Pingshan Li, Min Xu:
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks. Discret. Appl. Math. 259: 145-152 (2019) - [j9]Pingshan Li, Min Xu:
Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults. Int. J. Found. Comput. Sci. 30(5): 693-717 (2019) - [j8]Pingshan Li, Min Xu:
The t/k-diagnosability and strong Menger connectivity on star graphs with conditional faults. Theor. Comput. Sci. 793: 181-192 (2019) - 2018
- [j7]Pingshan Li, Min Xu:
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes. Theor. Comput. Sci. 707: 56-68 (2018) - [j6]Qi Cheng, Pingshan Li, Min Xu:
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes. Theor. Comput. Sci. 728: 1-8 (2018) - 2017
- [j5]Pingshan Li, Min Xu:
Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes. Appl. Math. Comput. 307: 180-192 (2017) - [j4]Pingshan Li, Min Xu:
The Super Spanning Connectivity of Arrangement Graphs. Int. J. Found. Comput. Sci. 28(8): 1047- (2017)
2000 – 2009
- 2005
- [j3]Pingshan Li, Jan P. Allebach:
Block interlaced pinwheel error diffusion. J. Electronic Imaging 14(2): 023007 (2005) - 2004
- [j2]Pingshan Li, Jan P. Allebach:
Tone-dependent error diffusion. IEEE Trans. Image Process. 13(2): 201-215 (2004) - 2002
- [c4]Pingshan Li, Jan P. Allebach:
Tone-dependent error diffusion. Color Imaging: Device-Independent Color, Color Hardcopy, and Applications 2002: 310-321 - [c3]Pingshan Li, Jan P. Allebach:
Clustered minority pixel error diffusion. ICIP (1) 2002: 641-644 - [c2]Pingshan Li, Jan P. Allebach:
Block Interlaced Pinwheel Error Diffusion. PICS 2002: 245-249 - 2000
- [j1]Pingshan Li, Jan P. Allebach:
Look-up-table based halftoning algorithm. IEEE Trans. Image Process. 9(9): 1593-1603 (2000)
1990 – 1999
- 1998
- [c1]Pingshan Li, Jan P. Allebach:
Look-Up-Table based Halftoning Algorithm. ICIP (2) 1998: 34-38
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 2026-02-18 23:24 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:
