Errol L. Lloyd

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2013

Fully Dynamic Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Problems in Computing, 2013

2012

Topology control with a limited number of relays.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

Capturing Interface Protocols to Support Comprehension and Evaluation of C++ Libraries.

[BibT_eX]

[DOI]

Int. J. Softw. Eng. Knowl. Eng., 2011

2010

Topology control in constant rate mobile ad hoc networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2010

2009

Improved Topology Control Algorithms for Simple Mobile Networks.

[BibT_eX]

[DOI]

Fei Che

Proceedings of the Ad Hoc Networks, First International Conference, 2009

2008

Efficient probe selection algorithms for fault diagnosis.

[BibT_eX]

[DOI]

Maitreya Natu

Adarshpal S. Sethi

Telecommun. Syst., 2008

Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

2007

Topology Control Problems for Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Relay Node Placement in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Guoliang Xue

IEEE Trans. Computers, 2007

A carrier sense multiple access protocol with power backoff (CSMA/PB).

[BibT_eX]

[DOI]

Ad Hoc Networks, 2007

Optimal Relay Node Fault Recovery.

[BibT_eX]

[DOI]

Fei Che

Proceedings of the 4th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2007), 2007

2006

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks.

[BibT_eX]

[DOI]

Rui Liu

Mob. Networks Appl., 2006

The implementation of an extensible system for comparison and visualization of class ordering methodologies.

[BibT_eX]

[DOI]

J. Syst. Softw., 2006

Distributed Topology Control for Stationary and Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

Topology Control for Simple Mobile Networks.

[BibT_eX]

[DOI]

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

Topology Control for Constant Rate Mobile Networks.

[BibT_eX]

[DOI]

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

The Impact of Clustering in Distributed Topology Control.

[BibT_eX]

Proceedings of the 2006 International Conference on Communications in Computing, 2006

2005

Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2005

A Study of Test Coverage Adequacy In the Presence of Stubs.

[BibT_eX]

[DOI]

Chavalit Srisathapornphat

J. Object Technol., 2005

2004

CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks.

[BibT_eX]

[DOI]

Chien-Chung Shen

IEEE Trans. Mob. Comput., 2004

2003

A Parameterized Cost Model to Order Classes for Class-based Testing of C++ Applications.

[BibT_eX]

[DOI]

Peter J. Clarke

Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Cost Constrained Fixed Job Scheduling.

[BibT_eX]

[DOI]

Qiwei Huang

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Topology Control Problems under Symmetric and Asymmetric Power Thresholds.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Analysis of Queuing Delay in Multimedia Gateway Call Routing.

[BibT_eX]

Qiwei Huang

Proceedings of the International Conference on Internet Computing, 2002

1998

Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

1997

Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

1996

River Routing with a Generalized Model.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays.

[BibT_eX]

[DOI]

Hari Krishna Tadepalli

Proceedings of IPPS '96, 1996

1995

on the K-coloring of Intervals.

[BibT_eX]

[DOI]

Martin C. Carlisle

Discret. Appl. Math., 1995

1994

Scheduling DAG's for Asynchronous Multiprocessor Execution.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

1993

Scheduling algorithms for multihop radio networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1993

Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks.

[BibT_eX]

[DOI]

J. High Speed Networks, 1993

Graph Theoretic Analysis of PLA Folding Heuristics.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Fully Dynamic Maintenance of Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Minimizing External Wires in Generalized Single-Row Routing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

The Impact of wire Topology on Single Row Routing.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 1992

Scheduling Algorithms for Multi-Hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Conference on Communications Architecture & Protocols, 1992

A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors.

[BibT_eX]

Proceedings of the Computing and Information, 1992

On the Complexity of Distance-2 Coloring.

[BibT_eX]

Proceedings of the Computing and Information, 1992

1991

The Benefits of External Wires in Single Row Routing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Minimal Shared Information for Concurrent Reading and Writing.

[BibT_eX]

[DOI]

Prasad Jayanti

Adarshpal S. Sethi

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1989

A Fast Algorithm for Finding Interlocking Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

The Complexity of Near-Optimal Programmable Logic Array Folding.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

On Locating Minimum Feedback Vertex Sets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

1987

Minimizing Channel Density in Standard Cell Layout.

[BibT_eX]

[DOI]

Algorithmica, 1987

1986

Two Processor Scheduling with Limited Preemption.

[BibT_eX]

[DOI]

Perform. Evaluation, 1986

Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Feedback Vertex Sets and Cyclically Reducible Graphs

[BibT_eX]

[DOI]

Ching-Chy Wang

J. ACM, April, 1985

On the Worst Case Performance of Buddy Systems.

[BibT_eX]

[DOI]

Michael C. Loui

Acta Informatica, 1985

1984

One-Layer Routing without Component Constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1984

1983

An O(n log m) Algorithm for the Josephus Problem.

[BibT_eX]

[DOI]

J. Algorithms, 1983

On a Simple Deadlock Recovery Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1982

Critical Path Scheduling with Resource and Processor Constraints.

[BibT_eX]

[DOI]

J. ACM, 1982

1981

Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Concurrent Task Systems.

[BibT_eX]

[DOI]

Oper. Res., 1981

1980

Scheduling task systems with resources.

[BibT_eX]

[DOI]

PhD thesis, 1980

List Scheduling Bounds for UET Systems With Resources.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1977

On Triangulations of a Set of Points in the Plane

[BibT_eX]

[DOI]