![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jeng-Jung Wang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j12]Jeng-Jung Wang, Yan-Haw Chen
:
The inverse of circulant matrices over GF(2m). Discret. Math. 345(3): 112741 (2022) - 2018
- [j11]Jeng-Jung Wang
, Lih-Hsing Hsu:
On the spanning connectivity of the generalized Petersen graphs P(n,3). Discret. Math. 341(3): 672-690 (2018) - 2014
- [j10]Ming-Yi Ju, Jeng-Jung Wang, Shu-Hao Chang:
Diameter variability of hypercubes. Theor. Comput. Sci. 542: 63-70 (2014) - 2013
- [j9]Jeng-Jung Wang, Tung-Yang Ho, Ting-Yi Sung, Ming-Yi Ju:
Changing the Diameter in a Diagonal Mesh Network. J. Inf. Sci. Eng. 29(2): 193-208 (2013) - 2008
- [j8]Ta-Cheng Mai, Jeng-Jung Wang, Lih-Hsing Hsu:
Hyper-Hamiltonian generalized Petersen graphs. Comput. Math. Appl. 55(9): 2076-2085 (2008) - [j7]Jeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero
, Ting-Yi Sung:
Diameter variability of cycles and tori. Inf. Sci. 178(14): 2960-2967 (2008) - 2007
- [j6]Been-Chian Chien, Ming-Huang Zhong, Jeng-Jung Wang:
Mining Fuzzy Association Rules on Has-A and Is-A Hierarchical Structures. J. Adv. Comput. Intell. Intell. Informatics 11(4): 423-432 (2007) - 2001
- [j5]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n). J. Inf. Sci. Eng. 17(4): 535-548 (2001) - 2000
- [j4]Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Construction schemes for fault-tolerant Hamiltonian graphs. Networks 35(3): 233-245 (2000) - [j3]Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. IEEE Trans. Parallel Distributed Syst. 11(8): 864 (2000) - 1998
- [j2]Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu:
Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998) - 1997
- [j1]Jeng-Jung Wang, Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung:
Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks. J. Inf. Sci. Eng. 13(4): 665-680 (1997)
Conference and Workshop Papers
- 2017
- [c3]Jeng-Jung Wang, Chong-Dao Lee, Yaotsu Chang:
Perfect Gaussian integer sequences from monomial o-polynomials. SPAWC 2017: 1-5 - 2001
- [c2]Ting-Yi Sung, Jeng-Jung Wang:
Changing the Diameter of Graph Products. COCOON 2001: 390-394 - 1998
- [c1]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin:
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. COCOON 1998: 269-278
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint