Author of the publication

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.

, and . Panhellenic Conference on Informatics, volume 3746 of Lecture Notes in Computer Science, page 68-79. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Efficient Shape-Based Approach to Image Retrieval., and . DGCI, volume 1953 of Lecture Notes in Computer Science, page 505-517. Springer, (2000)Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs., and . Parallel Process. Lett., 14 (1): 119-129 (2004)An O(nm)-time certifying algorithm for recognizing HHD-free graphs., and . Theor. Comput. Sci., (2012)Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks., , and . J. Comput. Secur., 31 (2): 107-128 (2023)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., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 256-268. Springer, (2006)Recognizing HHDS-Free Graphs., and . WG, volume 3787 of Lecture Notes in Computer Science, page 456-467. Springer, (2005)Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching., and . Panhellenic Conference on Informatics, volume 3746 of Lecture Notes in Computer Science, page 68-79. Springer, (2005)Join-Reachability Problems in Directed Graphs., , and . CSR, volume 6651 of Lecture Notes in Computer Science, page 195-208. Springer, (2011)Adding a Tail in Classes of Perfect Graphs., , and . CoRR, (2023)