Richard B. Tan

According to our database1, Richard B. Tan authored at least 26 papers between 1987 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Shortcutting directed and undirected networks with a degree constraint.
Discret. Appl. Math., 2017

2009
<i>L</i> ( <i>h</i> , 1, 1)-labeling of outerplanar graphs.
Math. Methods Oper. Res., 2009

2008
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.
Proceedings of the Algorithm Theory, 2008

A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2006
Efficient management of transient station failures in linear radio communication networks with bases.
J. Parallel Distributed Comput., 2006

L(h, 1, 1)-Labeling of Outerplanar Graphs.
Proceedings of the Structural Information and Communication Complexity, 2006

2004
Approximations for lambda-Colorings of Graphs.
Comput. J., 2004

2003
Channel Assignment with Separation for Interference Avoidance in Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2003

Finding a bigtriangleup-regular supergraph of minimum order.
Discret. Appl. Math., 2003

Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001
Characterization results of all shortest paths interval routing schemes.
Networks, 2001

Bandwidth and topological bandwidth of graphs with few P4's.
Discret. Appl. Math., 2001

2000
lambda-Coloring of Graphs.
Proceedings of the STACS 2000, 2000

Efficient use of radio spectrum in wireless networks with channel separation between close stations.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999
Fundamental Control Algorithms in Mobile Networks.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Fundamental Distributed Protocols in Mobile Networks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Multidimensional Interval Routing Schemes.
Theor. Comput. Sci., 1998

1997
On Interval Routing Schemes and Treewidth.
Inf. Comput., 1997

1995
Multi-Dimensional Interval Routing Schemes.
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994
Compact Routing Methods: A Survey.
Proceedings of the Structural Information and Communication Complexity, 1994

1993
Prefix Routing Schemes in Dynamic Networks.
Comput. Networks ISDN Syst., 1993

1988
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.
Sci. Comput. Program., 1988

1987
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.
Distributed Comput., 1987

Interval Routing.
Comput. J., 1987

The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
Proceedings of the STACS 87, 1987


  Loading...