EDBT 2026 Demo / reviewers in the wild / expert
Mingxin He
dblp:71/4339
· DBLP profile ↗
5ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 87% Combinatorics and discrete mathematics · 13% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › network topology
low-diameter topology |
0.1 | 1 | 2008 | Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs · IEEE Trans. Computers 2008 |
Interconnection networks and networks-on-chip
network topology |
0.1 | 1 | 2008 | Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs · IEEE Trans. Computers 2008 |
Graph algorithms and graph theory › graph coloring
edge coloring |
0.1 | 1 | 2008 | Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs · IEEE Trans. Computers 2008 |
Graph algorithms and graph theory
graph coloring |
0.1 | 1 | 2008 | Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs · IEEE Trans. Computers 2008 |
Methods — techniques the papers use, named apart from their topics
graph decomposition · 0.2arc coloring · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Removing Stray-Light for Wild-Field Fundus Image Fusion Based on Large Generative Models
Jun Wu 0022, Mingxin He, Jingjie Lin, Dayong Ding |
MMM (4) | 2 |
| 2010 | Fully symmetric swapped networks based on bipartite cluster connectivity
Wenjun Xiao, Behrooz Parhami, Weidong Chen 0009, Mingxin He, Wenhong Wei |
Inf. Process. Lett. | 4 |
| 2008 | Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset GraphsabstractRecently, Melhem presented a "new" class of low-diameter interconnection (LDI) networks, (IEEE Trans. Computers, Vol. 56, No. 4, pp. 502-510). We note that LDI networks are the same as the previously known generalized de Bruijn graphs, point out an error in the decomposition of LDI networks into permutations, and find that the correct decomposition scheme is an instance of arc coloring for coset graphs. Hence, we pursue a number of general results on arc coloring of coset graphs that can be applied to this particular decomposition problem as well as within many other contexts, including complete arc coloring and normality of coset graphs. Wenjun Xiao, Wenhong Wei, Weidong Chen 0009, Mingxin He, Behrooz Parhami |
IEEE Trans. Computers | 4 |
| 2007 | General Biswapped Networks and Their Topological Properties
Mingxin He, Wenjun Xiao, Weidong Chen 0009, Wenhong Wei, Zhen Zhang 0017 |
APPT | 1 |
| 2007 | Optimal Routing Algorithm and Diameter in Hexagonal Torus Networks
Zhen Zhang 0017, Wenjun Xiao, Mingxin He |
APPT | 3 |