Ding-Zhu Du

According to our database1, Ding-Zhu Du authored at least 264 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Maximizing Activity Profit in Social Networks.
IEEE Trans. Comput. Social Systems, 2019

In Memoriam: Ker-I Ko (1950-2018).
SIGACT News, 2019

Quality of barrier cover with wireless sensors.
IJSNet, 2019

Maximisation of the number of β-view covered targets in visual sensor networks.
IJSNet, 2019

A class of asymptotically optimal group testing strategies to identify good items.
Discrete Applied Mathematics, 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.
Applied Mathematics and Computation, 2019

Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Maximize a Monotone Function with a Generic Submodularity Ratio.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.
IEEE/ACM Trans. Netw., 2018

Distributed Rumor Blocking With Multiple Positive Cascades.
IEEE Trans. Comput. Social Systems, 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 lp-norm.
J. Global Optimization, 2018

Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set.
INFORMS Journal on Computing, 2018

Computing Minimum k-Connected m-Fold Dominating Set in General Graphs.
INFORMS Journal on Computing, 2018

On Misinformation Containment in Online Social Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Minimizing Influence of Rumors by Blockers on Social Networks.
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

General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.
IEEE/ACM Trans. Netw., 2017

Adaptive Influence Maximization in Dynamic Social Networks.
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. Biology Bioinform., 2017

On positive-influence target-domination.
Optimization Letters, 2017

Online makespan minimization in MapReduce-like systems with complex reduce tasks.
Optimization Letters, 2017

iGreen: green scheduling for peak demand minimization.
J. Global Optimization, 2017

A novel approach for detecting multiple rumor sources in networks with partial observations.
J. Comb. Optim., 2017

Viral marketing with positive influence.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

An efficient randomized algorithm for rumor blocking in online social networks.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Active Friending in Online Social Networks.
Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, 2017

2016
Probe Selection.
Encyclopedia of Algorithms, 2016

Adaptive Partitions.
Encyclopedia of Algorithms, 2016

Connected Dominating Set.
Encyclopedia of Algorithms, 2016

Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016

Effector Detection in Social Networks.
IEEE Trans. Comput. Social Systems, 2016

Editorial for Computing and Combinatorics Conference.
Theor. Comput. Sci., 2016

Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.
Optimization Letters, 2016

Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Global Optimization, 2016

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Global Optimization, 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

Terminal-set-enhanced community detection in social networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Preface.
Theor. Comput. Sci., 2015

A new strongly competitive group testing algorithm with small sequentiality.
Annals OR, 2015

DAM: A Bayesian Method for Detecting Genome-wide Associations on Multiple Diseases.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

Fault-tolerant coverage with maximum lifetime in wireless sensor networks.
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

Dynamic Resource Provision for Cloud Broker with Multiple Reserved Instance Terms.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014
A formal proof of the deadline driven scheduler in PPTL axiomatic system.
Theor. Comput. Sci., 2014

Computing and Combinatorics.
Theor. Comput. Sci., 2014

Maximizing rumor containment in social networks with constrained time.
Social Netw. Analys. Mining, 2014

Routing-efficient CDS construction in Disk-Containment Graphs.
Optimization Letters, 2014

Minimum vertex cover in ball graphs through local search.
J. Global Optimization, 2014

Preface.
J. Comb. Optim., 2014

A Zig-Zag Approach for Competitive Group Testing.
INFORMS Journal on Computing, 2014

How Could a Boy Influence a Girl?
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

2013
PND: a p-persistent neighbor discovery protocol in wireless networks.
Wireless Communications and Mobile Computing, 2013

On bounding node-to-sink latency in wireless sensor networks with multiple sinks.
IJSNet, 2013

Resource pricing game in geo-distributed clouds.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

A stackelberg game for cooperative cognitive radio network with active SUs.
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

Preface - COCOON'2011.
Theor. Comput. Sci., 2012

Topology Control in Cooperative Wireless Ad-Hoc Networks.
IEEE Journal on Selected Areas in Communications, 2012

Complexity and approximation of the connected set-cover problem.
J. Global Optimization, 2012

Radar placement along banks of river.
J. Global Optimization, 2012

A Price-Based Spectrum Management Scheme with Stackelberg Game in Cooperative Cognitive Radio Networks.
IEICE Transactions, 2012

2011
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks.
IEEE Trans. Parallel Distrib. Syst., 2011

Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Reducing reader collision for mobile RFID.
IEEE Trans. Consumer Electronics, 2011

An exact algorithm for minimum CDS with shortest path constraint in wireless networks.
Optimization Letters, 2011

Adaptive Path Planning for Randomly Deployed Wireless Sensor Networks.
J. Inf. Sci. Eng., 2011

On minimum submodular cover with submodular cost.
J. Global Optimization, 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

Wireless networking, dominating and packing.
Optimization Letters, 2010

New dominating sets in social networks.
J. Global Optimization, 2010

Topology Control for Increasing Connectivity in Cooperative Wireless Ad Hoc Networks.
IEICE Transactions, 2010

FTTP: A Fast Tree Traversal Protocol for Efficient Tag Identification in RFID Networks.
IEEE Communications Letters, 2010

Wireless Network Algorithms, Systems, and Applications.
EURASIP J. Wireless Comm. and Networking, 2010

Greedy approximations for minimum submodular cover with submodular cost.
Comp. Opt. and Appl., 2010

Cooperative Bridges: Topology Control in Cooperative Wireless Ad Hoc Networks.
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
Rosen's Method, Global Convergence, and Powell's Conjecture.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

History of Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Steiner Tree Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the construction of 2-connected virtual backbone in wireless networks.
IEEE Trans. Wireless Communications, 2009

Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks.
IEEE Trans. Parallel Distrib. Syst., 2009

On the upper bounds of the minimum number of rows of disjunct matrices.
Optimization Letters, 2009

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.
J. Global Optimization, 2009

On the Parameterized Complexity of Pooling Design.
Journal of Computational Biology, 2009

Wireless Network Security.
EURASIP J. Wireless Comm. and Networking, 2009

Channel occupancy-based user association in IEEE 802.11 wireless LANs.
Proceedings of the IEEE 20th International Symposium on Personal, 2009

Performance Limits of Fair-Access in Underwater Sensor Networks.
Proceedings of the ICPP 2009, 2009

2008
Connected Dominating Set.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Relay sensor placement in wireless sensor networks.
Wireless Networks, 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

New Constructions of One- and Two-Stage Pooling Designs.
Journal of Computational Biology, 2008

An one-way function based framework for pairwise key establishment in sensor networks.
IJSN, 2008

Wireless Telemedicine and Applications.
EURASIP J. Wireless Comm. and Networking, 2008

Preface.
Algorithmica, 2008

PTAS for Minimum Connected Dominating Set in Unit Ball Graph.
Proceedings of the Wireless Algorithms, 2008

Analysis of greedy approximations with nonsubmodular potential functions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Fault-Tolerant Dual Power Management in Wireless Sensor Networks.
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
Approximations for Steiner Minimum Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges.
IEEE Trans. Mob. Comput., 2007

Preface.
Theor. Comput. Sci., 2007

Genetic networks: processing data, regulatory network modelling and their analysis.
Optimization Methods and Software, 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.
Journal of Computational Biology, 2007

Fault tolerant topology control for one-to-all communications in symmetric wireless networks.
IJSNet, 2007

2006
Recent advances in wireless ad hoc networks.
Wireless Communications and Mobile Computing, 2006

On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay.
IEEE Trans. Mob. Comput., 2006

Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication.
J. Global Optimization, 2006

New Construction for Transversal Design.
Journal of Computational Biology, 2006

Connected dominating sets in disk graphs with bidirectional links.
IEEE Communications Letters, 2006

Wireless Network Security.
EURASIP J. Wireless Comm. and Networking, 2006

GeoSENS: geo-based sensor network secure communication protocol.
Computer Communications, 2006

Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links.
Proceedings of the Frontiers of WWW Research and Development, 2006

2005
Improving Wireless Sensor Network Lifetime through Power Aware Organization.
Wireless Networks, 2005

On greedy construction of connected dominating sets in wireless networks.
Wireless Communications and Mobile Computing, 2005

Location management in mobile ad hoc wireless networks using quorums and clusters.
Wireless Communications and Mobile Computing, 2005

Identifying d positive clones in the presence of inhibitors.
IJBRA, 2005

A combination of wireless multicast advantage and hitch-hiking.
IEEE Communications Letters, 2005

On the construction of stable virtual backbones in mobile ad-hoc networks.
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

New constructions on broadcast encryption key pre-distribution schemes.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Energy-Efficient Wireless Networks.
Proceedings of the Mobile Computing Handbook., 2004

Topology Control of Ad Hoc Wireless Networks for Energy Efficiency.
IEEE Trans. Computers, 2004

A reliable virtual backbone scheme in mobile ad-hoc networks.
Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004

QoS Topology Control in Ad Hoc Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks.
Networks, 2003

Paired-domination of Trees.
J. Global Optimization, 2003

On a Minimum Linear Classification Problem.
J. Global Optimization, 2003

A Decision Criterion for the Optimal Number of Clusters in Hierarchical Clustering.
J. Global Optimization, 2003

On the optimal placement of wavelength converters in WDM networks.
Computer Communications, 2003

Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet.
Comput. J., 2003

Energy-efficient broadcast and multicast routing in ad hoc wireless networks.
Proceedings of the 22nd IEEE International Performance Computing and Communications Conference, 2003

2002
Foreword.
Theor. Comput. Sci., 2002

Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.
SIAM J. Discrete Math., 2002

Wireless Sensor Networks with Energy Efficient Organization.
Journal of Interconnection Networks, 2002

New bounds on a hypercube coloring problem.
Inf. Process. Lett., 2002

New constructions of non-adaptive and error-tolerance pooling designs.
Discrete Mathematics, 2002

Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.
Discrete Mathematics, 2002

On connectivity of consecutive-d digraphs.
Discrete Mathematics, 2002

Approximations for a Bottleneck Steiner Tree Problem.
Algorithmica, 2002

Connected Domination in Multihop Ad Hoc Wireless Networks.
Proceedings of the 6th Joint Conference on Information Science, 2002

Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Approximations for Steiner trees with minimum number of Steiner points.
Theor. Comput. Sci., 2001

Optimization of wavelength assignment for QoS multicast in WDM networks.
IEEE Trans. Communications, 2001

Converter Placement Supporting Broadcast in WDM Optical Networks.
IEEE Trans. Computers, 2001

Placement of Data Replicas for Optimal Data Availability in Ring Networks.
J. Parallel Distrib. Comput., 2001

Monotone Routing in Multirate Rearrangeable Clos Networks.
J. Parallel Distrib. Comput., 2001

Optimal Consecutive-k-out-of-(2k+1): G Cycle.
J. Global Optimization, 2001

Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks.
Computer Communications, 2001

Optimal Placement of Web Proxies for Replicated Web Servers in the Internet.
Comput. J., 2001

Grade of Service Steiner Minimum Trees in the Euclidean Plane.
Algorithmica, 2001

New Bounds on a Hypercube Coloring Problem and Linear Codes.
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

Placement of Read-Write Web Proxies in the Internet.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Lower Bounds on the Minus Domination and k-Subdomination Numbers.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 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
Performance of split routing algorithm for three-stage multicast networks.
IEEE/ACM Trans. Netw., 2000

Approximations for Steiner Trees with Minimum Number of Steiner Points.
J. Global Optimization, 2000

Editorial.
J. Comb. Optim., 2000

A coloring problem on the n-cube.
Discrete Applied Mathematics, 2000

Optimal Placement of Proxies of Replicated Web Servers in the Internet.
Proceedings of the WISE 2000, 2000

Static Timing Analysis with False Paths.
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
Fault Tolerance Properties of Pyramid Networks.
IEEE Trans. Computers, 1999

Interconnecting Highways.
SIAM J. Discrete Math., 1999

On Rearrangeability of Multirate Clos Networks.
SIAM J. Comput., 1999

On optimizing the satisfiability (SAT) problem.
J. Comput. Sci. Technol., 1999

The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.
J. Complexity, 1999

An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology.
Algorithmica, 1999

Fault-Tolerant Routing and Multicasting in Butterfly Networks.
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Grade of service Euclidean Steiner minimum trees.
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

On Multirate Rearrangeable Clos Networks.
SIAM J. Comput., 1998

Criticality- and QoS-Based Multiresource Negotiation and Adaptation.
Real-Time Systems, 1998

The k-Steiner Ratio in the Rectilinear Plane.
J. Algorithms, 1998

Super line-connectivity of consecutive-d digraphs.
Discrete Mathematics, 1998

On conflict-free channel set assignments for optical cluster-based hypercube networks.
Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

Multirate Multicast Switching Networks.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Foreword (COCOON'95).
Theor. Comput. Sci., 1997

Book Review: Discrete Analysis and Operation Research.
J. Comb. Optim., 1997

The Steiner ratio for the dual normed plane.
Discrete Mathematics, 1997

A (log23+1/2) competitive algorithm for the counterfeit coin problem.
Discrete Mathematics, 1997

On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discrete Applied Mathematics, 1997

A Special Case for Subset Interconnection Designs.
Discrete Applied Mathematics, 1997

Fault-tolerant Properties of Pyramid Network.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

On 3-rate rearrangeability of Clos networks.
Proceedings of the Advances in Switching Networks, 1997

Multirate broadcast switching networks nonblocking in a wide sense.
Proceedings of the Advances in Switching Networks, 1997

1996
Convergence Properties of Optimization Algorithms for the SAT Problem.
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

On the diameter vulnerability of Kautz digraphs.
Discrete Mathematics, 1996

O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
On complexity of subset interconnection designs.
J. Global Optimization, 1995

A tight lower bound for the Steiner ratio in Minkowski planes.
Discrete Mathematics, 1995

on Component-size Bounded Steiner Trees.
Discrete Applied Mathematics, 1995

On Greedy Heuristics for Steiner Minimum Trees.
Algorithmica, 1995

The k-Steiner ratio in graphs.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Modifications of Competitive Group Testing.
SIAM J. Comput., 1994

On Competitive Group Testing.
SIAM J. Comput., 1994

Minimal-distance routing for KYKLOS II.
Networks, 1994

Multicasting in Generalized Multistage Interconnection Networks.
J. Parallel Distrib. Comput., 1994

A continuous version of a result of Du and Hwang.
J. Global Optimization, 1994

Book review.
J. Global Optimization, 1994

Resource Management for Continuous Multimedia Database Applications.
Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS '94), 1994

Modification of consecutive-d digraphs.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

The Tight Lower Bound for the Steiner Ratio in Minkowski Planes.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
A test problem generator for the Steiner problem in graphs.
ACM Trans. Math. Softw., 1993

Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs.
IEEE Trans. Computers, 1993

Book reviews.
J. Global Optimization, 1993

Minimum Steiner Trees in Normed Planes.
Discrete & Computational Geometry, 1993

1992
Reducing the Steiner Problem in a Normed Space.
SIAM J. Comput., 1992

On better heuristics for Steiner minimum trees.
Math. Program., 1992

A note on best fractions of a computable real number.
J. Complexity, 1992

A Note on Shortest Superstrings with Flipping.
Inf. Process. Lett., 1992

Connectivity of Consecutive-d Digraphs.
Discrete Applied Mathematics, 1992

On Steiner Minimal Trees with L_p Distance.
Algorithmica, 1992

A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.
Algorithmica, 1992

1991
The Hamiltonian property of generalized de Bruijn digraphs.
J. Comb. Theory, Ser. B, 1991

Partitionable starters for twin prime power type.
Discrete Mathematics, 1991

On steiner ratio conjectures.
Annals OR, 1991

Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.
Proceedings of the 17th International Workshop, 1991

On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Competitive Group Testing.
Proceedings of the On-Line Algorithms, 1991

Convergence theory of feasible direction methods.
Discrete mathematics and theoretical computer science, Science Press, ISBN: 978-1-880132-00-5, 1991

1990
Optimal Assembly of an s-Stage k-OUT-OF-n System.
SIAM J. Discrete Math., 1990

A combinatorial problem related to distributed loop networks.
Networks, 1990

Diameter and Radius in the Manhattan Metric.
Discrete & Computational Geometry, 1990

The complexity of determinacy problem on group testing.
Discrete Applied Mathematics, 1990

On Heuristics for Minimum Length Rectilinear Partitions.
Algorithmica, 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
On Inefficient Special Cases of NP-Complete Problems.
Theor. Comput. Sci., 1989

Global convergence of Rosen's gradient projection method.
Math. Program., 1989

1988
The Structure of Generalized Complexity Cores.
Theor. Comput. Sci., 1988

Matroids and Subset Interconnection Design.
SIAM J. Discrete Math., 1988

Generalized de Bruijn digraphs.
Networks, 1988

A Decomposition Theorem on Euclidean Steiner Minimal Trees.
Discrete & Computational Geometry, 1988

On polynomial and generalized complexity cores.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987
The existence and density of generalized complexity cores.
J. ACM, 1987

Steiner Minimal Trees for Regular Polygons.
Discrete & Computational Geometry, 1987

Steiner Minimal Trees on Sets of Four Points.
Discrete & Computational Geometry, 1987

Minimal-Distance Routing for Kykios II.
Proceedings of the International Conference on Parallel Processing, 1987

1986
On One-Way Functions and Polynomial-Time Isomorphisms.
Theor. Comput. Sci., 1986

On a conjecture of trietsch and handler on the flow-dependent steiner ratio.
Networks, 1986

A convergence theorem of Rosen's gradient projection method.
Math. Program., 1986

An optimization problem on graphs.
Discrete Applied Mathematics, 1986

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

A Note on One- Way Functions and Polynomial Time Isomorphisms.
Proceedings of the Structure in Complexity Theory, 1986

1985
Doubly Linked Ring Networks.
IEEE Trans. Computers, 1985

Optimal consecutive-2 systems of lines and cycles.
Networks, 1985

The Steiner Ratio Conjecture Is True for Five Points.
J. Comb. Theory, Ser. A, 1985

Generalized complexity cores and levelability of intractable sets.
PhD thesis, 1985

1984
A Multiplication Theorem for Balanced Howell Rotations.
J. Comb. Theory, Ser. A, 1984

1983
A class of full Steiner minimal trees.
Discrete Mathematics, 1983

1982
A Short Proof of a Result of Pollak on Steiner Minimal Trees.
J. Comb. Theory, Ser. A, 1982


  Loading...