( en | de | ru )

 

Disambiguation of "Broersma, Hajo"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

, , and . WG, volume 1335 of Lecture Notes in Computer Science, page 109-117. Springer, (1997)

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.

Alain Hajo

Karl Hajowsky

Naziha Hajo

Alexandra Hajok

Iván Hajós

 

Other publications of authors with the same name

The effect of graph operations on the degree-based entropy., , , , and . Appl. Math. Comput., (2023)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)Upper Bounds and Algorithms for Parallel Knock-Out Numbers., , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)Heavy cycles in weighted graphs., , , and . Discuss. Math. Graph Theory, 22 (1): 7-15 (2002)Upper bounds and algorithms for parallel knock-out numbers., , and . Theor. Comput. Sci., 410 (14): 1319-1327 (2009)Tight complexity bounds for FPT subgraph problems parameterized by the clique-width., , and . Theor. Comput. Sci., (2013)Editorial., , , and . J. Discrete Algorithms, 8 (2): 101 (2010)A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs., , and . Discret. Appl. Math., 99 (1-3): 367-400 (2000)On Coloring Graphs without Induced Forests., , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 156-167. Springer, (2010)Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width., , and . IPEC, volume 7112 of Lecture Notes in Computer Science, page 207-218. Springer, (2011)