Search - INRIA - Institut National de Recherche en Informatique et en Automatique

HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

		Relevance Author A→Z Author Z→A Title A→Z Title Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante 30 results per page 50 results per page 100 results per page Merci d'indiquer la raison de votre demande o Export XML-TEI BibTeX EndNote CSV PDF HTML Advanced export... Syndicated feeds RSS ATOM
	hal-01641019v1 Journal articles Bruce Reed, Xing Shi Cai, Guillem Perarnau, Adam Bene Watts. Acyclic edge colourings of graphs with large girth Random Structures and Algorithms, Wiley, 2017, 50 (4), pp.511 - 533. ⟨10.1002/rsa.20695⟩
	hal-01641023v1 Journal articles Bruce Reed, Jonas Witt, Marco E. Lübbecke. Polyhedral results on the stable set problem in graphs containing even or odd pairs Mathematical Programming, Springer Verlag, 2017, ⟨10.1007/s10107-017-1168-x⟩
	hal-00821609v1 Journal articles Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs Discrete Mathematics, Elsevier, 2013, 313 (8), pp.967-974. ⟨10.1016/j.disc.2013.01.011⟩
	lirmm-00806800v1 Book sections Martin Loebl, Bruce Reed, Alex Scott, Andrew Thomason, Stéphan Thomassé. Almost All F-Free Graphs Have The Erdos-Hajnal Property An Irregular Mind, 21, pp.405-414, 2010, ⟨10.1007/978-3-642-14444-8_11⟩
	inria-00100553v1 Book sections Hazel Everett, Celina M. H. de Figueiredo, Claudia Linhares Sales, Frédéric Maffray, Oscar Porto et al. Even Pairs Jorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization
	hal-00795285v1 Conference papers Nikolaos Fountoulakis, Bruce Reed. A general critical condition for the emergence of a giant component in random graphs with given degrees European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. pp.639―645
	hal-00795286v1 Conference papers S. Kennedy, C. Meagher, Bruce Reed. Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. pp.47―51, ⟨10.1016/j.endm.2009.07.008⟩
	hal-00795281v1 Journal articles Louigi Addario-Berry, Bruce Reed. Minima in branching random walks Annals of Probability, Institute of Mathematical Statistics, 2009, 37, pp.1044―1079
	hal-00795995v1 Journal articles Jim Geelen, Bert Gerards, Bruce Reed, Paul Seymour, Adrian Vetta. On the odd-minor variant of Hadwiger's conjecture Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99, pp.20―29
	inria-00486183v1 Conference papers Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. L(2,1)-labelling of graphs ACM-SIAM symposium on Discrete algorithms (SODA 2008), Jan 2008, San Francisco, California, United States. pp.621-630
	inria-00327909v2 Journal articles Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. Griggs and Yeh's Conjecture and L(p,1)-labelings SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (1), pp.145--168. ⟨10.1137/090763998⟩
	hal-02497401v1 Journal articles Frédéric Havet, Bruce Reed, Maya Stein, David Wood. A variant of the Erdős‐Sós conjecture Journal of Graph Theory, Wiley, 2020, 94 (1), pp.131-158. ⟨10.1002/jgt.22511⟩
	hal-01641473v1 Journal articles Bruce Reed, Felix Joos, Guillem Perarnau, Dieter Rautenbach. How to determine if a random graph with a fixed degree sequence has a giant component Probability Theory and Related Fields, Springer Verlag, 2017, ⟨10.1007/s00440-017-0757-1⟩
	hal-01641020v1 Journal articles Bruce Reed, Guillem Perarnau. Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2017, 26 (03), pp.448 - 467. ⟨10.1017/S0963548316000328⟩
	inria-00551133v1 Reports Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs. [Research Report] RR-7502, INRIA. 2011
	hal-00795287v1 Journal articles K. Kawarabayashi, O. Lee, Bruce Reed. Removable cycles in non-bipartite graphs Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99, pp.30―38. ⟨10.1016/j.jctb.2008.03.007⟩
	inria-00303303v1 Reports Frédéric Havet, Jan van den Heuvel, Colin Mcdiarmid, Bruce Reed. List colouring squares of planar graphs [Research Report] RR-6586, INRIA. 2008
	inria-00100577v1 Conference papers Hazel Everett, Celina de Figueiredo, Sulamita Klein, Bruce Reed. Bull-Reducible Berge Graphs are Perfect Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p
	hal-01274081v1 Journal articles Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce Reed, Udi Rotics. Polynomial-time recognition of clique-width ≤3 graphs Discrete Applied Mathematics, Elsevier, 2012, Fourth Workshop on Graph Classes, Optimization, and Width Parameters Bergen, Norway, October 2009: Bergen GROW 09, 160 (6), pp.834-865. ⟨10.1016/j.dam.2011.03.020⟩
		Relevance Author A→Z Author Z→A Title A→Z Title Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante 30 results per page 50 results per page 100 results per page o Export XML-TEI BibTeX EndNote CSV PDF HTML Advanced export... Syndicated feeds RSS ATOM

Document types Minimize

Author Minimize

Subject field Minimize

Laboratory Minimize

Language Minimize

Type of deposit Minimize

Year Minimize

Designed by Inria-IES Team : Hosted by HAL :