Guoliang Xue

Jelena V. Misic

Mob. Networks Appl., 2007

Lightpaths routing for single link failure survivability in IP-over-WDM networks.

[BibT_eX]

[DOI]

Muhammad S. Javed

J. Commun. Networks, 2007

Modelling gene functional linkages using yeast microarray data.

[BibT_eX]

[DOI]

Tie Wang

Jeffrey W. Touchman

Int. J. Bioinform. Res. Appl., 2007

Spectrum allocation and scheduling in dynamic spectrum access wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 4th International ICST Conference on Heterogeneous Networking for Quality, 2007

Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Robust Localization in Wireless Sensor Networks through the Revocation of Malicious Anchors.

[BibT_eX]

[DOI]

Aviral Shrivastava

Proceedings of IEEE International Conference on Communications, 2007

Multiconstrained QoS Routing: Greedy is Good.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2007

A Technique to Enhance Localization in the Presence of NLOS Errors.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2007

2006

Recent advances in wireless ad hoc networks.

[BibT_eX]

[DOI]

Feng Cao

Wirel. Commun. Mob. Comput., 2006

Link scheduling with power control for throughput enhancement in multihop wireless networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2006

Constrained shortest link-disjoint paths selection: a network programming based approach.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2006

QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

An improved algorithm for optimal lightpath establishment on a tree topology.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2006

Reliable Ad Hoc Routing Based on Mobility Prediction.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Efficient anonymity schemes for clustered wireless sensor networks.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2006

On current areas of interest in wireless sensor networks designs.

[BibT_eX]

[DOI]

Hossam S. Hassanein

Comput. Commun., 2006

A cost-minimization algorithm for fast location tracking in mobile wireless networks.

[BibT_eX]

[DOI]

Wenye Wang

Comput. Networks, 2006

End-to-end rate allocation in multi-radio wireless mesh networks: cross-layer schemes.

[BibT_eX]

[DOI]

Proceedings of the 3rd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 2006

Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

SAS: A Simple Anonymity Scheme for Clustered Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation.

[BibT_eX]

[DOI]

Muhammad S. Javed

Matthew A. Gaines

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005

Interference-aware routing and bandwidth allocation for QoS provisioning in multihop wireless networks.

[BibT_eX]

[DOI]

Christopher Chandler

Wirel. Commun. Mob. Comput., 2005

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology.

[BibT_eX]

[DOI]

Wei Xiao

Algorithmica, 2005

Interference-aware topology control and QoS routing in multi-channel wireless mesh networks.

[BibT_eX]

[DOI]

Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

Advances in QoS path(s) selection problem.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Using β-skeletons for localized topology control in wireless ad hoc networks.

[BibT_eX]

[DOI]

Manvendu Bhardwaj

Satyayant Misra

Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005

Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Interference-aware routing in multihop wireless networks using directional antennas.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Establishment of survivable connections in WDM networks using partial path protection.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2005

Power efficient broadcasting and multicasting in wireless networks with directional antennas.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2005

Dynamic light trail routing and protection issues in WDM optical networks.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.

[BibT_eX]

[DOI]

Zhipeng Cai

Guohui Lin

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

A Parallel Algorithm for Extracting Transcription Regulatory Network Motifs.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

2004

Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 2004

The Primal Simplex Approach to the QoS Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 2004

Reliable routing in mobile ad hoc networks based on mobility prediction.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004

TPS: A Time-Based Positioning Scheme for Outdoor Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Node-disjoint path routing in wireless networks: tradeoff between path lifetime and total energy.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

Optimal routing for fast transfer of bulk data files in time-varying networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

Applying Two-Level Simulated Annealing on Bayesian Structure Learning to Infer Genetic Networks.

[BibT_eX]

[DOI]

Tie Wang

Jeffrey W. Touchman

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2003

A PTAS for weight constrained Steiner trees in series-parallel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Minimum-cost QoS multicast and unicast routing in communication networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2003

Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2003

Server cost minimization in a distributed servers architecture for on-demand video services.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2003

Optimal multichannel data transmission in computer networks.

[BibT_eX]

[DOI]

Comput. Commun., 2003

Guest editorial - 50th anniversary of clos networks.

[BibT_eX]

[DOI]

Wojciech Kabacinski

Chin-Tau Lea

IEEE Commun. Mag., 2003

Bottom-up construction of dynamic multicast trees in WDM networks.

[BibT_eX]

[DOI]

Rakesh Banka

Proceedings of the 22nd IEEE International Performance Computing and Communications Conference, 2003

Routing with many additive QoS constraints.

[BibT_eX]

[DOI]

Arunabha Sen

Rakesh Banka

Proceedings of IEEE International Conference on Communications, 2003

2002

An improved random walk model for PCS networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2002

Computing the Shortest Network under a Fixed Topology.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2002

On the terminal Steiner tree problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria.

[BibT_eX]

Byung Suk Lee

Proceedings of the 6th Joint Conference on Information Science, 2002

QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2002

Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2002

2001

A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Signed genome rearrangement by reversals and transpositions: models and approximations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Approximations for Steiner trees with minimum number of Steiner points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Handbook of Combinatorial Optimization DingZhu Du and Panos M. Pardalos (co-editors), Kluwer Academic Publishers, 1998, Vols. 1-3, ISBN: 0-7923-5285-8.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

Grade of Service Steiner Minimum Trees in the Euclidean Plane.

[BibT_eX]

[DOI]

Algorithmica, 2001

K-pair delay constrained minimum cost routing in undirected networks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Source-waiting QoS routing in networks with advanced resource reservations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2001

Optimal lightpath routing and rerouting in WDM networks.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

An Efficient Algorithm for Minimizing a Sum of p-Norms.

[BibT_eX]

[DOI]

Yinyu Ye

SIAM J. Optim., 2000

Reducing the Steiner problem in four uniform orientations.

[BibT_eX]

[DOI]

Networks, 2000

An Efficient Algorithm for Delay Buffer Minimization.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

Optimal Multi-Path End-to-End Data Transmission in Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000

Optimal layout of hexagonal minimum spanning trees in linear time [VLSI].

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology.

[BibT_eX]

[DOI]

Guo-jun Li

Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000

1999

Optimal multicast trees in communication systems with channel capacities and channel reliabilities.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1999

Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources.

[BibT_eX]

[DOI]

Theodore P. Lillys

David E. Dougherty

SIAM J. Optim., 1999

Interconnecting Highways.

[BibT_eX]

[DOI]

Frank K. Hwang

SIAM J. Discret. Math., 1999

On Rearrangeability of Multirate Clos Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Optimization of Molecular Similarity Index with Applications to Biomolecules.

[BibT_eX]

[DOI]

Lunjiang Ling

J. Glob. Optim., 1999

Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

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

[BibT_eX]

[DOI]

Algorithmica, 1999

Algorithms for a Class of Isotonic Regression Problems.

[BibT_eX]

[DOI]

Algorithmica, 1999

Grade of service Euclidean Steiner minimum trees.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

The 1-Steiner tree problem in lambda-3 geometry plane.

[BibT_eX]

[DOI]

Andrew P. Thurber

Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Computing hexagonal Steiner trees using PCx [for VLSI].

[BibT_eX]

[DOI]

Andrew P. Thurber

Proceedings of the 6th IEEE International Conference on Electronics, Circuits and Systems, 1999

Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees.

[BibT_eX]

[DOI]

Defang Zhou

Proceedings of the IEEE International Conference On Computer Design, 1999

Provably good approximation to minimum cost delay-constrained multicast trees.

[BibT_eX]

[DOI]

Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1999), 1999

1998

An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

K-Center and K-Median Problems in Graded Distances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges.

[BibT_eX]

[DOI]

Charles J. Colbourn

Theor. Comput. Sci., 1998

Fast Data Transmission and Maximal Dynamic Flow.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

End-to-end data paths: quickest or most reliable?

[BibT_eX]

[DOI]

IEEE Commun. Lett., 1998

The Steiner Tree Problem in Lambda4-geometry Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications.

[BibT_eX]

[DOI]

Yinyu Ye

SIAM J. Optim., 1997

Linear time algorithms for computing the most reliable source on an unreliable tree network.

[BibT_eX]

[DOI]

Networks, 1997

Copmputer Simulations in Molecular and Protein Conformations.

[BibT_eX]

[DOI]

J. Glob. Optim., 1997

A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

A polynomial time dual algorithm for the Euclidean multifacility location problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

Parallel algorithms for global optimization problems.

[BibT_eX]

[DOI]

P. D. Panagiotopoulos

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

On an open problem in spherical facility location.

[BibT_eX]

[DOI]

Numer. Algorithms, 1995

1994

Modifications of Competitive Group Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Improvement on the northby algorithm for molecular conformation: Better solutions.

[BibT_eX]

[DOI]

J. Glob. Optim., 1994

Molecular conformation on the CM-5 by parallel two-level simulated annealing.

[BibT_eX]

[DOI]

J. Glob. Optim., 1994

Preface.

[BibT_eX]

[DOI]

J. Glob. Optim., 1994

Optimization methods for computing global minima of nonconvex potential energy functions.

[BibT_eX]

[DOI]

David Shalloway

J. Glob. Optim., 1994

Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay.

[BibT_eX]

[DOI]

David Hung-Chang Du

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Parallel Two-Level Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the 7th international conference on Supercomputing, 1993

1992

A Discrete-Continuous Algorithm for Molecular Energy Minimization.

[BibT_eX]

[DOI]

Robert S. Maier

Proceedings of the Proceedings Supercomputing '92, 1992

Minimizing the Lennard-Jones potential function on a massively parallel computer.

[BibT_eX]

[DOI]

Robert S. Maier

Proceedings of the 6th international conference on Supercomputing, 1992

Minimum Time Message Transmission in Networks.

[BibT_eX]

Proceedings of the Computing and Information, 1992

1991

Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1991

Algorithms for the quickest path problem and the enumeration of quickest paths.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1991

Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

1989

On the convergence of one-dimensional simplex search.

[BibT_eX]

[DOI]