EDBT 2026 Demo / reviewers in the wild / expert
Chaoqian Huang
dblp:421/0135
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0002-1845-7642ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 first-author · 2 since 2021
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 · 100% | |
| Computer networks
1 paper |
Network optimization and economics · 100% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › network design
network topology design |
1.0 | 1 | 2026 | Design and Application of Network Topology Robustness Optimization Algorithms Based on Cheeger's Inequality · IEEE Trans. Netw. 2026 |
Graph algorithms and graph theory › spectral graph theory
cheeger inequality |
1.0 | 1 | 2026 | Design and Application of Network Topology Robustness Optimization Algorithms Based on Cheeger's Inequality · IEEE Trans. Netw. 2026 |
Graph algorithms and graph theory
graph partitioning |
1.0 | 1 | 2026 | Design and Application of Network Topology Robustness Optimization Algorithms Based on Cheeger's Inequality · IEEE Trans. Netw. 2026 |
Network security
attack resilience |
0.3 | 1 | 2026 | Design and Application of Network Topology Robustness Optimization Algorithms Based on Cheeger's Inequality · IEEE Trans. Netw. 2026 |
Methods — techniques the papers use, named apart from their topics
regular graph algorithm · 3.0cheeger's inequality · 3.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Recovery Algorithm: A Network Robustness Enhancement Algorithm Against Malicious AttacksabstractIt is crucial to improve the robustness of the IoT against malicious attacks. For scenarios where the network topology is split due to malicious attacks, but can still reconnect fragmented networks by adjusting links between nodes, existing algorithms offer limited robustness improvements, exhibit high computational complexity, incur significant energy consumption, and produce optimized network topologies lacking scalability. To address these issues, we propose a network robustness optimization algorithm called the ’Recovery Algorithm’. Based on this algorithm, the IoT can automatically adjust its topology to effectively resist malicious attacks. Compared with other algorithms, the optimized network of this algorithm possesses higher robustness and higher communication efficiency without affecting the scalability of the original network. Furthermore, the computational complexity and energy consumption of this algorithm are several orders of magnitude lower than existing algorithms. Chaoqian Huang, Hanzhou Wang, Dongyu Li |
IEEE Internet Things J. | 1 |
| 2026 | Design and Application of Network Topology Robustness Optimization Algorithms Based on Cheeger's InequalityabstractCheeger’s inequality is used to estimate a lower bound on the number of edges that need to be cut off to split a regular graph into two subgraphs with the same number of nodes. Therefore, we design a network topology that is robust under malicious attacks based on Cheeger’s inequality. Considering that Cheeger’s inequality cannot be directly used to optimize complex networks in reality, we generalize the conclusion of Cheeger’s inequality and use this conclusion to propose the Good Regular Graph algorithm (GRG) for generating strongly robust network topologies under malicious attacks. In addition, we explain the design principle of the algorithm from a graph-theoretic perspective and give the corresponding network topology expansion algorithm. GRG, after appropriate processing, can be applied to optimize the substructures of a wide range of real-world network topologies to enhance their robustness. Experiments show that the algorithms proposed in this research perform better compared to other algorithms. We prove from both theoretical and experimental perspectives that Cheeger’s inequality can serve as a basis for designing robust network topologies under malicious attacks. Chaoqian Huang, Hanzhou Wang, Dongyu Li |
IEEE Trans. Netw. | 1 |