Author of the publication

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions.

, , , , and . Electron. Notes Discret. Math., (2015)

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

The Cost of Perfection for Matchings in Graphs, , and . CoRR, (2012)The non planar vertex deletion of Cn x Cm., , , , and . Ars Comb., (2005)A Linear-Time Algorithm for Proper Interval Graph Recognition., , and . Inf. Process. Lett., 56 (3): 179-184 (1995)Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 13-23. Springer, (2014)An Improved Upper Bound on the Crossing Number of the Hypercube., , , and . WG, volume 2880 of Lecture Notes in Computer Science, page 230-236. Springer, (2003)The tessellation problem of quantum walks., , , , , , , and . CoRR, (2017)Kinetic hanger., , and . Inf. Process. Lett., 89 (3): 151-157 (2004)Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs., , , and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 82-92. Springer, (2012)Split Clique Graph Complexity., , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 11-22. Springer, (2011)Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems., , , and . J. Braz. Comput. Soc., 14 (2): 45-52 (2008)