Matt DeVos

	2012
22		Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide: Immersing complete digraphs. Eur. J. Comb. 33(6): 1294-1302 (2012)
	2011
21		Drago Bokal, Matt DeVos, Sandi Klavzar, Aki Mimoto, Arne Ø. Mooers: Computing quadratic entropy in evolutionary trees. Computers & Mathematics with Applications 62(10): 3821-3828 (2011)
20		Matt DeVos, Bojan Mohar, Robert Sámal: Unexpected behaviour of crossing sequences. J. Comb. Theory, Ser. B 101(6): 448-463 (2011)
19		Matt DeVos, Robert Sámal: High-girth cubic graphs are homomorphic to the Clebsch graph. Journal of Graph Theory 66(3): 241-259 (2011)
	2010
18		Matt DeVos, Ariel Gabizon: Simple Affine Extractors Using Dimension Expansion. IEEE Conference on Computational Complexity 2010: 50-57
17		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. ACM Transactions on Algorithms 6(4): (2010)
16		Matt DeVos, Stéphan Thomassé: Edge Growth in Graph Cubes CoRR abs/1009.0343: (2010)
15		Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal: An Eberhard-Like Theorem for Pentagons and Heptagons. Discrete & Computational Geometry 44(4): 931-945 (2010)
	2009
14		Matt DeVos, Ariel Gabizon: Simple Affine Extractors using Dimension Expansion. Electronic Colloquium on Computational Complexity (ECCC) 16: 63 (2009)
13		Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal: Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory, Ser. B 99(2): 358-369 (2009)
	2008
12		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531
11		Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan: 5-cycles and the Petersen graph CoRR abs/0801.3714: (2008)
10		Matt DeVos, Bojan Mohar, Robert Sámal: Unexpected behaviour of crossing sequences. Electronic Notes in Discrete Mathematics 31: 259-264 (2008)
9		Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008)
	2007
8		Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr: Circular Coloring the Plane. SIAM J. Discrete Math. 21(2): 461-465 (2007)
	2006
7		Matt DeVos, Rui Xu, Gexin Yu: Nowhere-zero Z3-flows through Z3-connectivity. Discrete Mathematics 306(1): 26-30 (2006)
6		Matt DeVos, Bojan Mohar: Small separations in vertex-transitive graphs. Electronic Notes in Discrete Mathematics 24: 165-172 (2006)
5		Sergio Cabello, Matt DeVos, Bojan Mohar: Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006)
	2004
4		Matt DeVos, Jaroslav Nesetril, André Raspaud: Antisymmetric flows and edge-connectivity. Discrete Mathematics 276(1-3): 161-167 (2004)
3		Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan: Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory, Ser. B 91(1): 25-41 (2004)
	2003
2		Matt DeVos, Paul D. Seymour: Extending partial 3-colourings in a planar graph. J. Comb. Theory, Ser. B 88(2): 219-225 (2003)
	2000
1		Matt DeVos: Matrix Choosability. J. Comb. Theory, Ser. A 90(1): 197-209 (2000)

Coauthor Index

1	Drago Bokal	[21]
2	Sergio Cabello	[5] [12] [17]
3	Guoli Ding	[3]
4	Javad Ebrahimi	[8]
5	Jeff Erickson	[12] [17]
6	Ariel Gabizon	[14] [18]
7	Agelos Georgakopoulos	[15]
8	Mohammad Ghebleh	[8]
9	Luis A. Goddyn	[8] [13]
10	Ken-ichi Kawarabayashi	[9]
11	Sandi Klavzar	[21]
12	Jessica McDonald	[22]
13	Aki Mimoto	[21]
14	Vahan V. Mkrtchyan	[11]
15	Bojan Mohar	[5] [6] [8] [9] [10] [12] [13] [15] [17] [20] [22]
16	Arne Ø. Mooers	[21]
17	Reza Naserasr	[8]
18	Jaroslav Nesetril (Jarik Nesetril)	[4]
19	Bogdan Oporowski	[3]
20	Samvel S. Petrosyan	[11]
21	André Raspaud	[4]
22	Bruce A. Reed	[3]
23	Robert Sámal	[10] [13] [15] [19] [20]
24	Daniel P. Sanders	[3]
25	Diego Scheide	[22]
26	Paul D. Seymour	[2] [3]
27	Stéphan Thomassé	[16]
28	Dirk L. Vertigan (Dirk Vertigan)	[3]
29	Rui Xu	[7]
30	Gexin Yu	[7]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page