Author of the publication

On the Computational Complexity of Vertex Integrity and Component Order Connectivity.

, , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 285-297. Springer, (2014)

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

On the Computational Complexity of Vertex Integrity and Component Order Connectivity., , and . Algorithmica, 76 (4): 1181-1202 (2016)Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs., , , and . Algorithmica, 65 (1): 129-145 (2013)On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties., , , , and . Algorithmica, 72 (3): 687-713 (2015)Finding Disjoint Paths in Split Graphs., , , and . Theory Comput. Syst., 57 (1): 140-159 (2015)Maximal induced matchings in triangle-free graphs., , , , and . CoRR, (2013)On graph contractions and induced minors., , , , and . Discret. Appl. Math., 160 (6): 799-809 (2012)Vector Connectivity in Graphs., , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 331-342. Springer, (2013)On the Computational Complexity of Vertex Integrity and Component Order Connectivity., , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 285-297. Springer, (2014)Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints., , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 16-27. Springer, (2013)Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time., , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 75-87. (2010)