Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On the L(h, k)-Labeling of Co-comparability Graphs.

T. Calamoneri, S. Caminiti, S. Olariu, and R. Petreschi. ESCAPE, volume 4614 of Lecture Notes in Computer Science, page 116-127. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. -Ing. Stephan Klamert University of Stuttgart

Univ. -Prof. a. D. Dr. -Ing. Karl Stephan University of Stuttgart

Dr. -Ing. Stephan Heimerl University of Stuttgart

Silke Stephan University of Stuttgart

Stephan Renninger University of Stuttgart

Other publications of authors with the same name

Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes.S. Olariu, and I. Stojmenovic. J. Parallel Distrib. Comput., 36 (2): 144-155 (1996)Fault-Tolerant Recursive Least-Squares Computations on a Mesh-Connected Parallel Processor.A. Zomaya, A. Yates, and S. Olariu. J. Parallel Distrib. Comput., 62 (7): 1142-1167 (2002)Biomimetic Models for Wireless Sensor Networks.M. Eltoweissy, K. Jones, S. Olariu, A. Wadaa, L. Wilson, and K. Lodding. Handbook of Bioinspired Algorithms and Applications, Chapman and Hall/CRC, (2005)Q-Win - A New Admission and Handoff Management Scheme for Multimedia LEO Satellite Networks.S. Olariu, S. Rizvi, R. Shirhatti, and P. Todorova. Telecommunication Systems, 22 (1-4): 151-168 (2003)Efficient List Ranking on the Reconfigurable Mesh with Applications.T. Hayashi, K. Nakano, and S. Olariu. Theory Comput. Syst., 31 (5): 593-611 (1998)On the Closure of Triangle-Free Graphs Under Substitution.S. Olariu. Inf. Process. Lett., 34 (2): 97-101 (1990)A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.D. Corneil, S. Olariu, and L. Stewart. Inf. Process. Lett., 54 (5): 253-257 (1995)A Simple Linear-Time Algorithm for Computing the RNG and MST of Unimodal Polygons.S. Olariu. Inf. Process. Lett., 31 (5): 243-247 (1989)Randomized Initialization Protocols for Ad Hoc Networks.K. Nakano, and S. Olariu. IEEE Trans. Parallel Distrib. Syst., 11 (7): 749-759 (2000)How to Sort N Items Using a Sorting Network of Fixed I/O Size.S. Olariu, M. Pinotti, and S. Zheng. IEEE Trans. Parallel Distrib. Syst., 10 (5): 487-499 (1999)