Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. - Hajo Broersma; Bert Marchal; Daniël Paulusma; A. N. M. Salman (SOFSEM (1), 2007)

lambda-backbone colorings along pairwise disjoint stars and matchings. - Haitze J. Broersma; Jun Fujisawa; Bert Marchal; Daniël Paulusma; A. N. M. Salman; Kiyoshi Yoshimoto (Discret. Math., 2009)

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. - Hajo Broersma; Bert Marchal; Daniël Paulusma; A. N. M. Salman (Discuss. Math. Graph Theory, 2009)

On planar graphs with large tree-width and small grid minors. - Alexander Grigoriev; Bert Marchal; Natalya Usotskaya (Electron. Notes Discret. Math., 2009)

Finding good tree decompositions by local search. - Stan P. M. van Hoesel; Bert Marchal (Electron. Notes Discret. Math., 2009)

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. - Alexander Grigoriev; Bert Marchal; Natalya Usotskaya (SOFSEM, 2010)

A note on planar graphs with large width parameters and small grid-minors. - Alexander Grigoriev; Bert Marchal; Natalya Usotskaya; Ioan Todinca (Discret. Appl. Math., 2012)

A Note on the Minimum H-Subgraph Edge Deletion. - Alexander Grigoriev; Bert Marchal; Natalya Usotskaya (Int. J. Found. Comput. Sci., 2015)