( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Algorithms for Detecting Network Stability.

, , , и . WALCOM, том 4921 из Lecture Notes in Computer Science, стр. 188-199. Springer, (2008)

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.

Leonidas Klinge

Leonidas Doxiades

Leonidas Kiriazis

Leonidas Kokkoris

Leonidas Leontiades

 

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

Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs., и . Parallel Process. Lett., 14 (1): 119-129 (2004)Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks., , и . J. Comput. Secur., 31 (2): 107-128 (2023)An Efficient Shape-Based Approach to Image Retrieval., и . DGCI, том 1953 из Lecture Notes in Computer Science, стр. 505-517. Springer, (2000)An O(nm)-time certifying algorithm for recognizing HHD-free graphs., и . Theor. Comput. Sci., (2012)An Output-Sensitive Algorithm for Computing the s-Kernel.. CCCG, Queen's University, Ontario, Canada, (2015)A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs., , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 256-268. Springer, (2006)Recognizing HHDS-Free Graphs., и . WG, том 3787 из Lecture Notes in Computer Science, стр. 456-467. Springer, (2005)Join-Reachability Problems in Directed Graphs., , и . CSR, том 6651 из Lecture Notes in Computer Science, стр. 195-208. Springer, (2011)Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching., и . Panhellenic Conference on Informatics, том 3746 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2005)Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 1080-1089. Springer, (2005)