2009 |
14 | EE | Omid Amini,
Louis Esperet,
Jan van den Heuvel:
A unified approach to distance-two colouring of planar graphs.
SODA 2009: 273-282 |
2008 |
13 | EE | Luis Cereceda,
Jan van den Heuvel,
Matthew Johnson:
Connectedness of the graph of vertex-colourings.
Discrete Mathematics 308(5-6): 913-919 (2008) |
12 | EE | Jan van den Heuvel,
Matthew Johnson:
Transversals of subtree hypergraphs and the source location problem in digraphs.
Networks 51(2): 113-119 (2008) |
11 | EE | Arvind Gupta,
Jan van den Heuvel,
Ján Manuch,
Ladislav Stacho,
Xiaohong Zhao:
On the Complexity of Ordered Colorings.
SIAM J. Discrete Math. 22(2): 832-847 (2008) |
2007 |
10 | EE | Luis Cereceda,
Jan van den Heuvel,
Matthew Johnson:
Mixing 3-Colourings in Bipartite Graphs.
WG 2007: 166-177 |
9 | EE | Omid Amini,
Louis Esperet,
Jan van den Heuvel:
Frugal Colouring of Graphs
CoRR abs/0705.0422: (2007) |
8 | EE | Paul S. Bonsma,
Luis Cereceda,
Jan van den Heuvel,
Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
Electronic Notes in Discrete Mathematics 29: 463-469 (2007) |
7 | EE | Frédéric Havet,
Jan van den Heuvel,
Colin McDiarmid,
Bruce A. Reed:
List Colouring Squares of Planar Graphs.
Electronic Notes in Discrete Mathematics 29: 515-519 (2007) |
2006 |
6 | | Jan van den Heuvel:
On the Complexity of Ordered Colourings.
ACiD 2006: 156 |
5 | EE | Graham Brightwell,
Jan van den Heuvel,
Leen Stougie:
A Linear Bound On The Diameter Of The Transportation Polytope.
Combinatorica 26(2): 133-139 (2006) |
2004 |
4 | EE | Jan van den Heuvel,
Matthew Johnson:
The External Network Problem with Edge- or Arc-Connectivity Requirements.
CAAN 2004: 114-126 |
2001 |
3 | EE | Jan van den Heuvel,
Snezana Pejic:
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems.
Annals OR 107(1-4): 349-368 (2001) |
2 | | Jan van den Heuvel:
Algorithmic Aspects Of A Chip-Firing Game.
Combinatorics, Probability & Computing 10(6): (2001) |
1997 |
1 | EE | Luis A. Goddyn,
Jan van den Heuvel,
Sean McGuinness:
Removable Circuits in Multigraphs.
J. Comb. Theory, Ser. B 71(2): 130-143 (1997) |