Jan van den Heuvel

	2012
19		Jan van den Heuvel, Stéphan Thomassé: Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory, Ser. B 102(3): 638-646 (2012)
	2011
18		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding paths between 3-colorings. Journal of Graph Theory 67(1): 69-82 (2011)
	2010
17		Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich: Preface. Discrete Mathematics 310(2): 197-198 (2010)
	2009
16		Omid Amini, Louis Esperet, Jan van den Heuvel: A unified approach to distance-two colouring of planar graphs. SODA 2009: 273-282
15		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009)
	2008
14		Matthew Johnson, Luis Cereceda, Jan van den Heuvel: Finding Paths Between 3-Colourings. IWOCA 2008: 182-196
13		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(5-6): 913-919 (2008)
12		Jan van den Heuvel, Matthew Johnson: Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008)
11		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		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177
9		Omid Amini, Louis Esperet, Jan van den Heuvel: Frugal Colouring of Graphs CoRR abs/0705.0422: (2007)
8		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		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		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		Jan van den Heuvel, Matthew Johnson: The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126
	2001
3		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): 505-529 (2001)
	1997
1		Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness: Removable Circuits in Multigraphs. J. Comb. Theory, Ser. B 71(2): 130-143 (1997)

Coauthor Index

1	Omid Amini	[9] [16]
2	Paul Bonsma (Paul S. Bonsma)	[8]
3	Graham Brightwell	[5]
4	Luis Cereceda	[8] [10] [13] [14] [15] [18]
5	Keith J. Edwards	[17]
6	Louis Esperet	[9] [16]
7	Luis A. Goddyn	[1]
8	Terry S. Griggs	[17]
9	Arvind Gupta	[11]
10	Frédéric Havet	[7]
11	Matt Johnson (Matthew Johnson)	[4] [8] [10] [12] [13] [14] [15] [18]
12	Ján Manuch	[11]
13	Colin McDiarmid (Colin J. H. McDiarmid)	[7]
14	Sean McGuinness	[1]
15	Snezana Pejic	[3]
16	Stephanie Perkins	[17]
17	Bruce A. Reed	[7]
18	Ladislav Stacho	[11]
19	Leen Stougie	[5]
20	Stéphan Thomassé	[19]
21	Bridget S. Webb	[17]
22	Xiaohong Zhao	[11]
23	Vadim E. Zverovich	[17]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page