VLDB 2026 Research / reviewers in the wild / expert
Wei Ding 0006
dblp:59/622-6
· DBLP profile ↗
21ranked-venue papers
21as first author
2since 2021 · last 2025
0000-0002-4353-5385ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 12 first-author · 2 since 2021Artificial intelligence and machine learning · 8 · 8 first-authorSystems, architecture and hardware · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | An Improved Approximation Algorithm for the k-Supplier Problem with Parameterized Triangle Inequality
Wei Ding 0006, Guangting Chen, Ke Qiu 0001, Yu Zhou 0019 |
TAMC | 1 |
| 2021 | Finding Cheapest Deadline Paths
Wei Ding 0006 |
COCOON | 1 |
| 2020 | Minimum Diameter Vertex-Weighted Steiner Tree
Wei Ding 0006, Ke Qiu 0001 |
AAIM | 1 |
| 2020 | A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors
Wei Ding 0006 |
Real Time Syst. | 1 |
| 2020 | A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem
Wei Ding 0006, Ke Qiu 0001 |
Theor. Comput. Sci. | 1 |
| 2019 | Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable
Wei Ding 0006 |
AAIM | 1 |
| 2019 | Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs
Wei Ding 0006, Ke Qiu 0001 |
AAIM | 1 |
| 2019 | Updating Matrix Polynomials
Wei Ding 0006, Ke Qiu 0001 |
AAIM | 1 |
| 2019 | Approximating the restricted 1-center in graphs
Wei Ding 0006, Ke Qiu 0001 |
Theor. Comput. Sci. | 1 |
| 2018 | Minimum Diameter k-Steiner Forest
Wei Ding 0006, Ke Qiu 0001 |
AAIM | 1 |
| 2017 | Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
Wei Ding 0006, Ke Qiu 0001 |
Theor. Comput. Sci. | 1 |
| 2016 | A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract)
Wei Ding 0006, Ke Qiu 0001 |
COCOA | 1 |
| 2015 | Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs
Wei Ding 0006, Ke Qiu 0001 |
COCOA | 1 |
| 2015 | Approximating the Restricted 1-Center in Graphs
Wei Ding 0006, Ke Qiu 0001 |
COCOA | 1 |
| 2014 | Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights
Wei Ding 0006, Guohui Lin |
AAIM | 1 |
| 2012 | On the Minimum Diameter Cost-Constrained Steiner Tree Problem
Wei Ding 0006, Guoliang Xue |
COCOA | 1 |
| 2011 | A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges
Wei Ding 0006, Guoliang Xue |
COCOA | 1 |
| 2011 | A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
Wei Ding 0006, Guoliang Xue |
Theor. Comput. Sci. | 1 |
| 2010 | Diameter-Constrained Steiner Tree
Wei Ding 0006, Guohui Lin, Guoliang Xue |
COCOA (2) | 1 |
| 2010 | A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree
Wei Ding 0006, Guoliang Xue |
COCOA (2) | 1 |
| 2009 | A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
Wei Ding 0006, Guoliang Xue |
COCOA | 1 |