Ding-Zhu Du
Orcid: 0000-0002-7345-2185Affiliations:
- University of Texas at Dallas, USA
According to our database1,
Ding-Zhu Du
authored at least 326 papers
between 1982 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on utdallas.edu
On csauthors.net:
Bibliography
2024
IEEE Trans. Mob. Comput., May, 2024
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems.
Optim. Lett., March, 2024
IEEE Trans. Comput. Soc. Syst., February, 2024
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity.
J. Optim. Theory Appl., January, 2024
2023
Construction of minimum edge-fault tolerant connected dominating set in a general graph.
J. Comb. Optim., March, 2023
Asia Pac. J. Oper. Res., February, 2023
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice.
J. Glob. Optim., 2023
2022
Optim. Lett., 2022
Optim. Lett., 2022
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties.
J. Comb. Optim., 2022
A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks.
J. Comb. Optim., 2022
Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems.
CoRR, 2022
Composite Community-Aware Diversified Influence Maximization with Efficient Approximation.
CoRR, 2022
CoRR, 2022
Proceedings of the Wireless Internet - 15th EAI International Conference, 2022
2021
Slow Replica and Shared Protection: Energy-Efficient and Reliable Task Assignment in Cloud Data Centers.
IEEE Trans. Reliab., 2021
IEEE Trans. Reliab., 2021
DTNB: A Blockchain Transaction Framework With Discrete Token Negotiation for the Delay Tolerant Network.
IEEE Trans. Netw. Sci. Eng., 2021
Cloud/Edge Computing Resource Allocation and Pricing for Mobile Blockchain: An Iterative Greedy and Search Approach.
IEEE Trans. Comput. Soc. Syst., 2021
Two-Phase Multidocument Summarization Through Content-Attention-Based Subtopic Detection.
IEEE Trans. Comput. Soc. Syst., 2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
An approximation algorithm for the submodular multicut problem in trees with linear penalties.
Optim. Lett., 2021
Optim. Lett., 2021
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks.
J. Glob. Optim., 2021
Breaking the <i>r</i><sub>max</sub> Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem.
INFORMS J. Comput., 2021
On optimal randomized group testing with one defective item and a constrained number of positive responses.
Discret. Optim., 2021
MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021
2020
IEEE/ACM Trans. Netw., 2020
Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis.
IEEE Trans. Netw. Sci. Eng., 2020
IEEE Trans. Netw. Sci. Eng., 2020
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
A blockchain-based data storage framework: A rotating multiple random masters and error-correcting approach.
Peer-to-Peer Netw. Appl., 2020
Optim. Lett., 2020
J. Parallel Distributed Comput., 2020
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
J. Glob. Optim., 2020
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice.
J. Comb. Optim., 2020
IEEE Internet Things J., 2020
Latency-Aware Data Placements for Operational Cost Minimization of Distributed Data Centers.
Proceedings of the Database Systems for Advanced Applications, 2020
Proceedings of the Combinatorial Optimization and Applications, 2020
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
Corrections to "Fractal Intelligent Privacy Protection in Online Social Network Using Attribute-Based Encryption Schemes".
IEEE Trans. Comput. Soc. Syst., 2019
IEEE Trans. Comput. Soc. Syst., 2019
J. Glob. Optim., 2019
Int. J. Sens. Networks, 2019
A class of asymptotically optimal group screening strategies with limited item participation.
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
Appl. Math. Comput., 2019
Proceedings of the Wireless Algorithms, Systems, and Applications, 2019
Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019
2018
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.
IEEE/ACM Trans. Netw., 2018
IEEE Trans. Comput. Soc. Syst., 2018
Fractal Intelligent Privacy Protection in Online Social Network Using Attribute-Based Encryption Schemes.
IEEE Trans. Comput. Soc. Syst., 2018
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.
Math. Program., 2018
Partial inverse maximum spanning tree in which weight can only be decreased under l<sub>p</sub>-norm.
J. Glob. Optim., 2018
Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set.
INFORMS J. Comput., 2018
INFORMS J. Comput., 2018
CoRR, 2018
CoRR, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the Computational Data and Social Networks - 7th International Conference, 2018
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
IEEE/ACM Trans. Netw., 2017
IEEE/ACM Trans. Netw., 2017
Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs.
IEEE/ACM Trans. Netw., 2017
A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks.
IEEE/ACM Trans. Netw., 2017
Searching Genome-Wide Multi-Locus Associations for Multiple Diseases Based on Bayesian Inference.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017
Optim. Lett., 2017
A novel approach for detecting multiple rumor sources in networks with partial observations.
J. Comb. Optim., 2017
CoRR, 2017
Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.
CoRR, 2017
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017
Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, 2017
2016
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.
Optim. Lett., 2016
Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Glob. Optim., 2016
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim., 2016
Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks.
CoRR, 2016
Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set.
CoRR, 2016
Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016
2015
CoRR, 2015
CoRR, 2015
Ann. Oper. Res., 2015
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
A Novel Approximation for Multi-hop Connected Clustering Problem in Wireless Sensor Networks.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015
2014
Theor. Comput. Sci., 2014
Soc. Netw. Anal. Min., 2014
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014
2013
Wirel. Commun. Mob. Comput., 2013
Int. J. Sens. Networks, 2013
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013
Proceedings of the International Conference on Computing, Networking and Communications, 2013
2012
Tight Performance Bounds of Multihop Fair Access for MAC Protocols in Wireless Sensor Networks and Underwater Sensor Networks.
IEEE Trans. Mob. Comput., 2012
IEEE J. Sel. Areas Commun., 2012
J. Glob. Optim., 2012
A Price-Based Spectrum Management Scheme with Stackelberg Game in Cooperative Cognitive Radio Networks.
IEICE Trans. Commun., 2012
2011
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2011
IEEE/ACM Trans. Netw., 2011
An exact algorithm for minimum CDS with shortest path constraint in wireless networks.
Optim. Lett., 2011
J. Inf. Sci. Eng., 2011
Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network.
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011
Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model.
Proceedings of the 31st IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2011 Workshops), 2011
2010
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.
IEEE Trans. Mob. Comput., 2010
Topology Control for Increasing Connectivity in Cooperative Wireless Ad Hoc Networks.
IEICE Trans. Commun., 2010
FTTP: A Fast Tree Traversal Protocol for Efficient Tag Identification in RFID Networks.
IEEE Commun. Lett., 2010
EURASIP J. Wirel. Commun. Netw., 2010
Comput. Optim. Appl., 2010
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
IEEE Trans. Wirel. Commun., 2009
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2009
Optim. Lett., 2009
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.
J. Glob. Optim., 2009
Proceedings of the IEEE 20th International Symposium on Personal, 2009
Proceedings of the ICPP 2009, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks.
IEEE Trans. Mob. Comput., 2008
On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links.
IEEE Trans. Mob. Comput., 2008
An one-way function based framework for pairwise key establishment in sensor networks.
Int. J. Secur. Networks, 2008
Proceedings of the Wireless Algorithms, 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2008
Steiner tree problems in computer communication networks.
World Scientific, ISBN: 978-981-279-144-3, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
IEEE Trans. Mob. Comput., 2007
Optim. Methods Softw., 2007
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution.
J. Comb. Optim., 2007
Efficient Constructions of Disjunct Matrices with Applications to DNA Library Screening.
J. Comput. Biol., 2007
Fault tolerant topology control for one-to-all communications in symmetric wireless networks.
Int. J. Sens. Networks, 2007
2006
Wirel. Commun. Mob. Comput., 2006
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay.
IEEE Trans. Mob. Comput., 2006
J. Glob. Optim., 2006
IEEE Commun. Lett., 2006
Comput. Commun., 2006
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links.
Proceedings of the Frontiers of WWW Research and Development, 2006
2005
Wirel. Networks, 2005
Wirel. Commun. Mob. Comput., 2005
Wirel. Commun. Mob. Comput., 2005
Int. J. Bioinform. Res. Appl., 2005
IEEE Commun. Lett., 2005
Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005
On the construction of energy-efficient broadcast tree with Hitch-hiking in wireless networks.
Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
2004
Proceedings of the Mobile Computing Handbook., 2004
IEEE Trans. Computers, 2004
Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004
2003
Theor. Comput. Sci., 2003
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks.
Networks, 2003
J. Glob. Optim., 2003
Comput. Commun., 2003
Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet.
Comput. J., 2003
Proceedings of the 22nd IEEE International Performance Computing and Communications Conference, 2003
2002
SIAM J. Discret. Math., 2002
J. Interconnect. Networks, 2002
Discret. Math., 2002
Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.
Discret. Math., 2002
Connected Domination in Multihop Ad Hoc Wireless Networks.
Proceedings of the 6th Joint Conference on Information Science, 2002
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
2001
Theor. Comput. Sci., 2001
IEEE Trans. Commun., 2001
IEEE Trans. Computers, 2001
J. Parallel Distributed Comput., 2001
J. Parallel Distributed Comput., 2001
Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks.
Comput. Commun., 2001
Comput. J., 2001
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
IEEE/ACM Trans. Netw., 2000
Proceedings of the WISE 2000, 2000
Proceedings of the IEEE International Conference On Computer Design: VLSI In Computers & Processors, 2000
A new wavelength assignment method for minimal wavelength conversions in WDM networks.
Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000
1999
The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.
J. Complex., 1999
An <i>O</i>(<i>n</i> log <i>n</i>) Average Time Algorithm for Computing the Shortest Network under a Given Topology.
Algorithmica, 1999
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
A survey on combinatorial group testing algorithms with applications to DNA Library Screening.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999
1998
In Memoriam Ronald V. Book.
Theor. Comput. Sci., 1998
Real Time Syst., 1998
On conflict-free channel set assignments for optical cluster-based hypercube networks.
Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998
1997
Discret. Math., 1997
Discret. Appl. Math., 1997
Fault-tolerant Properties of Pyramid Network.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997
Proceedings of the Advances in Switching Networks, 1997
Proceedings of the Advances in Switching Networks, 1997
1996
IEEE Trans. Computers, 1996
Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions.
J. Comb. Theory, Ser. A, 1996
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
1994
J. Parallel Distributed Comput., 1994
Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS '94), 1994
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
ACM Trans. Math. Softw., 1993
IEEE Trans. Computers, 1993
1992
1991
J. Comb. Theory, Ser. B, 1991
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.
Proceedings of the 17th International Workshop, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Convergence theory of feasible direction methods.
Discrete mathematics and theoretical computer science, Science Press, ISBN: 978-1-880132-00-5, 1991
1990
SIAM J. Discret. Math., 1990
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
1988
Discret. Comput. Geom., 1988
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988
1987
Minimal-Distance Routing for Kykios II.
Proceedings of the International Conference on Parallel Processing, 1987
1986
Networks, 1986
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the Structure in Complexity Theory, 1986
1985
Generalized complexity cores and levelability of intractable sets.
PhD thesis, 1985
1984
J. Comb. Theory, Ser. A, 1984
1983
1982
J. Comb. Theory, Ser. A, 1982