Bruno Jartoux

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Counting kernels in directed graphs with arbitrary orientations	2024	Bruno Jartoux
+ PDF Chat	Conflict-Free Colouring of Subsets	2023	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs	2022	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	Counting Kernels in Directed Graphs with Arbitrary Orientations	2022	Bruno Jartoux
+	Conflict-Free Colouring of Subsets	2022	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs	2021	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	The $\epsilon$-$t$-Net Problem	2020	Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	The $ε$-$t$-Net Problem	2020	Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky

Common Coauthors

Coauthor	Papers Together
Chaya Keller	6
Shakhar Smorodinsky	6
Yelena Yuditsky	6
Noga Alon	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Combinatorial Theorems on Classifications of Subsets of a Given Set	1952	P. Erdős R. Rado	3
+	A survey of bounds for classical Ramsey numbers	1983	Fan Chung Charles M. Grinstead	2
+	Enumerating the kernels of a directed graph with no odd circuits	1994	Jayme L. Szwarcfiter Guy Chaty	2
+	Convex-Round and Concave-Round Graphs	2000	Jørgen Bang‐Jensen Jing Huang Anders Yeo	2
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	2
+ PDF Chat	On the structure of linear graphs	1946	Paul Erdős A. H. Stone	2
+	An improved bound for the stepping-up lemma	2010	David Conlon Jacob Fox Benny Sudakov	2
+ PDF Chat	Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers	2000	Harold Fredricksen Melvin M. Sweet	2
+	Counting the number of independent sets in chordal graphs	2007	Yoshio Okamoto Takeaki Uno Ryuhei Uehara	2
+ PDF Chat	Matrix characterizations of circular-arc graphs	1971	Alan Tucker	2
+	Epsilon-approximations and epsilon-nets	2017	Nabil H. Mustafa Kasturi Varadarajan	2
+	On Pseudo-disk Hypergraphs	2018	Boris Aronov Anirudh Donakonda Esther Ezra Rom Pinchasi	2
+	Coloring Delaunay-Edges and their Generalizations.	2018	Eyal Ackerman Balázs Keszegh Dömötör Pálvölgyi	2
+	Heawood inequalities	1987	K. S. Sarkaria	2
+ PDF Chat	Domination When the Stars Are Out	2019	Danny Hermelin Matthias Mnich Erik Jan van Leeuwen Gerhard J. Woeginger	2
+ PDF Chat	Perfect graphs with polynomially computable kernels	2018	Adèle Pass-Lanneau Ayumi Igarashi Frédéric Meunier	2
+ PDF Chat	Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property	2019	Martín D. Safe	2
+ PDF Chat	Coloring Intersection Hypergraphs of Pseudo-Disks	2019	Balázs Keszegh	2
+ PDF Chat	On pseudo-disk hypergraphs	2020	Boris Aronov Anirudh Donakonda Esther Ezra Rom Pinchasi	2
+ PDF Chat	Conflict-Free Coloring Made Stronger	2010	Elad Aigner‐Horev Roi Krakovski Shakhar Smorodinsky	2
+ PDF Chat	On Tangencies Among Planar Curves with an Application to Coloring L-Shapes	2021	Eyal Ackerman Balázs Keszegh Dömötör Pálvölgyi	2
+ PDF Chat	Applications of random sampling in computational geometry, II	1989	Kenneth L. Clarkson Peter W. Shor	2
+ PDF Chat	Conflict-Free Coloring and its Applications	2013	Shakhar Smorodinsky	2
+	On the density of families of sets	1972	N. Sauer	2
+	Multicolor Ramsey numbers for triple systems	2014	Maria Axenovich András Gyárfás Hong Liu Dhruv Mubayi	2
+ PDF Chat	Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set	2012	Timothy M. Chan	2
+ PDF Chat	Tight lower bounds for the size of epsilon-nets	2012	János Pach Gábor Tardos	2
+	Kernels in perfect line-graphs	1992	Frédéric Maffray	2
+	The complexity of computing the permanent	1979	Leslie G. Valiant	2
+	On cliques in graphs	1965	J. W. Moon Leo Moser	2
+ PDF Chat	On The Chromatic Number of Geometric Hypergraphs	2007	Shakhar Smorodinsky	2
+	Shift graphs and lower bounds on Ramsey numbers rk(l; r)	1995	Dwight Duffus Hannon Lefmann Vojtěch Rödl	2
+	A bound on the chromatic number of graphs without certain induced subgraphs	1980	Stanley Wagon	2
+	Claw-free graphs. VII. Quasi-line graphs	2012	Maria Chudnovsky Paul Seymour	2
+ PDF Chat	A combinatorial problem; stability and order for models and theories in infinitary languages	1972	Saharon Shelah	2
+	Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition	2014	Yuri Faenza Gianpaolo Oriolo Gautier Stauffer	2
+ PDF Chat	On the recognition of fuzzy circular interval graphs	2012	Gianpaolo Oriolo Ugo Pietropaoli Gautier Stauffer	2
+ PDF Chat	Partition relations for cardinal numbers	1965	Péter L. Erdős A. Hajnal R. Rado	2
+ PDF Chat	Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs	2013	Panagiotis Cheilaris Balázs Keszegh Dömötör Pálvölgyi	2
+	Polynomial algorithms for kernels in comparability, permutation and P4-free graphs	2005	Moncef Abbas Youcef Saoula	2
+	A combinatorial problem in logic	1977	C. Berge A. Ramachandra Rao	2
+	Small Ramsey Numbers	2011	Stanisław Radziszowski	1
+	On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities	2015	Vladimir Vapnik Alexey Chervonenkis	1
+	On the VC-dimension of half-spaces with respect to convex sets	2019	Nicolas Grelier Saeed Ilchi Tillmann Miltzow Shakhar Smorodinsky	1
+	Combinatorial Set Theory: Partition Relations for Cardinals	1984	P. Erdős	1
+	On the VC-dimension of convex sets and half-spaces.	2019	Nicolas Grelier Saeed Ilchi Tillmann Miltzow Shakhar Smorodinsky	1
+	Applications of random sampling in computational geometry, II	1988	Kenneth L. Clarkson	1
+ PDF Chat	Almost tight bounds forɛ-Nets	1992	János Komlós János Pach Gerhard J. Woeginger	1
+ PDF Chat	The structure of claw-free graphs	2005	Maria Chudnovsky Paul Seymour	1
+	Surveys in Combinatorics 2005	2005	B. S Webb	1