( en | de | ru )

 

Disambiguation of "Broersma, Hajo"

Author of the publication

copydeleteadd this publication to your clipboard
The Computational Complexity of the Minimum Weight Processor Assignment Problem.

, , , , and . WG, volume 3353 of Lecture Notes in Computer Science, page 189-200. Springer, (2004)

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 connectivity of the leaf-exchange spanning tree graph of a graph., and . Ars Comb., (1996)Forbidden subgraph pairs for traceability of block-chains., , and . Electron. J. Graph Theory Appl., 1 (1): 1-10 (2013)Editorial., , , and . J. Discrete Algorithms, 8 (2): 101 (2010)Online Graph Coloring with Predictions., , and . CoRR, (2023)A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs., , and . Discret. Appl. Math., 99 (1-3): 367-400 (2000)Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs., , and . Journal of Automata, Languages and Combinatorics, 8 (4): 675-681 (2003)Spanning trees with many or few colors in edge-colored graphs., and . Discuss. Math. Graph Theory, 17 (2): 259-269 (1997)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 . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)More About Subcolorings., , , and . Computing, 69 (3): 187-203 (2002)