![](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
Qing Hu 0007
Person information
- affiliation: University of Missouri, Computer Science Telecommunications Program, MO, USA
Other persons with the same name
- Qing Hu — disambiguation page
- Qing Hu 0001
— Dalian Maritime University, College of Information Science and Technology, China
- Qing Hu 0002
— VU University Amsterdam, Department of Computer Science, Netherlands (and 1 more)
- Qing Hu 0003 — City University of New York, CUNY, USA (and 3 more)
- Qing Hu 0004
— Huazhong University of Science and Technology, School of Optical and Electronic Information, Wuhan, China
- Qing Hu 0005
— Hunan University, ollege of Electrical and Information Engineering, Changsha, China
- Qing Hu 0006 — North China University of Water Resources and Electric Power, School of Mathematics and Statistics, Zhengzhou, China
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
- 1999
- [j10]Qing Hu, Yixin Zhang, Xiaojun Shen:
Rearrangeable Graphs. Inf. Process. Lett. 71(1): 23-27 (1999) - 1997
- [j9]Qing Hu, Xiaojun Shen, Jing-Yu Yang:
Topologies of Combined (2logN - 1)-Stage Interconnection Networks. IEEE Trans. Computers 46(1): 118-124 (1997) - [j8]Xiaojun Shen, Weifa Liang
, Qing Hu:
On Embedding Between 2D Meshes of the Same Size. IEEE Trans. Computers 46(8): 880-889 (1997) - 1996
- [j7]Weifa Liang
, Xiaojun Shen, Qing Hu:
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems. J. Parallel Distributed Comput. 32(1): 66-73 (1996) - [j6]Qing Hu, Xiaojun Shen, Weifa Liang
:
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks. IEEE Trans. Computers 45(1): 97-103 (1996) - 1995
- [j5]Xiaojun Shen, Qing Hu, Weifa Liang
:
Embedding K-ary Complete Trees into Hypercubes. J. Parallel Distributed Comput. 24(1): 100-106 (1995) - [j4]Qing Hu, Jing-Yu Yang, Qian Zhang, Ke Liu, Xiaojun Shen:
An automatic seal imprint verification approach. Pattern Recognit. 28(8): 1251-1266 (1995) - 1994
- [j3]Xiaojun Shen, Qing Hu, Weifa Liang
:
Realization of an Arbitrary Permutation on a Hypercube. Inf. Process. Lett. 51(5): 237-243 (1994) - 1993
- [j2]Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb:
The 4-Star Graph is not a Subgraph of Any Hypercube. Inf. Process. Lett. 45(4): 199-203 (1993) - [j1]Xiaojun Shen, Qing Hu:
A Note on Minimal Visibility Graphs. Inf. Process. Lett. 46(2): 101 (1993)
Conference and Workshop Papers
- 1997
- [c5]Qing Hu, Yixin Zhang, Xiaojun Shen:
Rearrangeable Graphs. COCOON 1997: 441-450 - 1994
- [c4]Xiaojun Shen, Qing Hu, Weifa Liang:
Efficient Embedding K-ary Complete Trees into Hypercubes. IPPS 1994: 710-714 - [c3]Xiaojun Shen, Qing Hu, Hao Dai, Xiangzu Wang:
Optimal Routing of Permutations on Rings. ISAAC 1994: 360-368 - 1993
- [c2]Weifa Liang, Qing Hu, Xiaojun Shen:
Embedding Between 2-D Meshes of the Same Size. SPDP 1993: 712-719 - 1992
- [c1]Xiaojun Shen, Qing Hu:
Approximate submatrix matching problems. SAC 1992: 993-999
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-08-11 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint