From post

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.

, , , и . Panhellenic Conference on Informatics, том 3746 из Lecture Notes in Computer Science, стр. 57-67. Springer, (2005)

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.

 

Другие публикации лиц с тем же именем

Acceptor-Definable Counting Classes., , , и . Panhellenic Conference on Informatics, том 2563 из Lecture Notes in Computer Science, стр. 453-463. Springer, (2001)A New Characterization of BPP.. FSTTCS, том 181 из Lecture Notes in Computer Science, стр. 179-187. Springer, (1984)Teaching Programming through Problem Solving: The Role of the Programming Language., и . FedCSIS, стр. 1533-1536. (2013)Randomized and Approximation Algorithms for Blue-Red Matching., , и . MFCS, том 4708 из Lecture Notes in Computer Science, стр. 715-725. Springer, (2007)Random Walks on Some Basic Classes of Digraphs., , и . ICTAC, том 8049 из Lecture Notes in Computer Science, стр. 122-140. Springer, (2013)Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview.. SCT, том 223 из Lecture Notes in Computer Science, стр. 383-400. Springer, (1986)Two remarks on the power of counting., и . Theoretical Computer Science, том 145 из Lecture Notes in Computer Science, стр. 269-276. Springer, (1983)Ordered Coloring Grids and Related Graphs., , , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 30-43. Springer, (2009)Probabalistic Quantifiers vs. Distrustful Adversaries., и . FSTTCS, том 287 из Lecture Notes in Computer Science, стр. 443-455. Springer, (1987)How to Place Efficiently Guards and Paintings in an Art Gallery., , и . Panhellenic Conference on Informatics, том 3746 из Lecture Notes in Computer Science, стр. 145-154. Springer, (2005)