Bert Marchal

According to our database, Bert Marchal authored at least 8 papers between 2007 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

A Note on the Minimum H-Subgraph Edge Deletion.

Alexander Grigoriev, Bert Marchal, Natalya Usotskaya

Int. J. Found. Comput. Sci., 2015

2012

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

2010

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph.

Alexander Grigoriev, Bert Marchal, Natalya Usotskaya

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009

Finding good tree decompositions by local search.

Stan P. M. van Hoesel, Bert Marchal

Electron. Notes Discret. Math., 2009

On planar graphs with large tree-width and small grid minors.

Alexander Grigoriev, Bert Marchal, Natalya Usotskaya

Electron. Notes 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

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

2007

Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007