default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Aboulker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Pierre Aboulker, Quentin Vermande:
Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph. Electron. J. Comb. 31(1) (2024)- [j30]Pierre Aboulker
, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. J. Graph Theory 105(4): 652-669 (2024) - [j29]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. SIAM J. Discret. Math. 38(2): 1863-1901 (2024) - [i27]Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel:
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order. CoRR abs/2403.02298 (2024) - 2023
- [j28]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85(1): 1-28 (2023) - [j27]Pierre Aboulker, Guillaume Aubian:
Four proofs of the directed Brooks' Theorem. Discret. Math. 346(11): 113193 (2023) - [i26]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Digraph Colouring and Arc-Connectivity. CoRR abs/2304.04690 (2023) - [i25]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes:
Clique number of tournaments. CoRR abs/2310.04265 (2023) - 2022
- [j26]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29(1) (2022) - [j25]Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos:
Chordal Directed Graphs Are Not $\chi$-Bounded. Electron. J. Comb. 29(2) (2022) - [j24]Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang:
Vizing's and Shannon's Theorems for Defective Edge Colouring. Electron. J. Comb. 29(4) (2022) - [j23]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Decomposing and colouring some locally semicomplete digraphs. Eur. J. Comb. 106: 103591 (2022) - [j22]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. J. Graph Theory 100(4): 638-652 (2022) - [j21]Pierre Aboulker, Guillaume Aubian, Raphael Steiner:
Heroes in Orientations of Chordal Graphs. SIAM J. Discret. Math. 36(4): 2497-2505 (2022) - [i24]Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang:
Vizing's and Shannon's Theorems for defective edge colouring. CoRR abs/2201.11548 (2022) - [i23]Pierre Aboulker, Guillaume Aubian, Raphael Steiner:
Heroes in orientations of chordal graphs. CoRR abs/2202.09191 (2022) - [i22]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. CoRR abs/2202.13306 (2022) - [i21]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the minimum number of arcs in k-dicritical oriented graphs. CoRR abs/2207.01051 (2022) - [i20]Pierre Aboulker, Quentin Vermande:
Various bounds on the minimum number of arcs in a k-dicritical digraph. CoRR abs/2208.02112 (2022) - [i19]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé:
(P6, triangle)-free digraphs have bounded dichromatic number. CoRR abs/2212.02272 (2022) - 2021
- [j20]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j19]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. Eur. J. Comb. 98: 103394 (2021) - [i18]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the dichromatic number of surfaces. CoRR abs/2102.01034 (2021) - [i17]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Decomposing and colouring some locally semicomplete digraphs. CoRR abs/2103.07886 (2021) - [i16]Pierre Aboulker, Guillaume Aubian:
Four proofs of the directed Brooks' Theorem. CoRR abs/2109.01600 (2021) - 2020
- [c2]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS 2020: 58:1-58:18 - [i15]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR abs/2001.03794 (2020) - [i14]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property. CoRR abs/2005.09447 (2020) - [i13]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. CoRR abs/2008.05504 (2020) - [i12]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyarfas-Sumner conjecture to digraphs. CoRR abs/2009.13319 (2020)
2010 – 2019
- 2019
- [j18]Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé:
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26(3): 3 (2019) - [j17]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26(4): 4 (2019) - [j16]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1): 47-51 (2019) - 2018
- [j15]Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. J. Graph Theory 87(1): 77-88 (2018) - [j14]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - [j13]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [c1]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC 2018: 419-425 - [i11]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed coloring in sparse graphs with fewer colors. CoRR abs/1802.05582 (2018) - [i10]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension Complexity of the Correlation Polytope. CoRR abs/1806.00541 (2018) - 2017
- [j12]Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins:
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340(5): 995-999 (2017) - [j11]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017) - [i9]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - 2016
- [j10]Pierre Aboulker, Xiaomin Chen, Guangda Huzhang, Rohan Kapadia, Cathryn Supko:
Lines, Betweenness and Metric Spaces. Discret. Comput. Geom. 56(2): 427-448 (2016) - [i8]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
$χ$-bounded families of oriented graphs. CoRR abs/1605.07411 (2016) - [i7]Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A new class of graphs that satisfies the Chen-Chvátal Conjecture. CoRR abs/1606.06011 (2016) - 2015
- [j9]Pierre Aboulker, Nicolas Bousquet:
Excluding cycles with a fixed number of chords. Discret. Appl. Math. 180: 11-24 (2015) - [j8]Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic:
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338(5): 825-834 (2015) - [j7]Pierre Aboulker, Rohan Kapadia:
The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs. Eur. J. Comb. 43: 1-7 (2015) - [j6]Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Wheel-free planar graphs. Eur. J. Comb. 49: 57-67 (2015) - [j5]Pierre Aboulker, Zhentao Li, Stéphan Thomassé:
Excluding clocks. Electron. Notes Discret. Math. 50: 103-108 (2015) - [i6]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Colouring graphs with constraints on connectivity. CoRR abs/1505.01616 (2015) - 2014
- [j4]Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao:
Number of lines in hypergraphs. Discret. Appl. Math. 171: 137-140 (2014) - [j3]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Linear Balanceable and Subcubic Balanceable Graphs. J. Graph Theory 75(2): 150-166 (2014) - [j2]Pierre Aboulker:
Excluding 4-Wheels. J. Graph Theory 75(4): 311-322 (2014) - 2013
- [i5]Pierre Aboulker, Nicolas Bousquet:
Excluding cycles with a fixed number of chords. CoRR abs/1304.1718 (2013) - [i4]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs that do not contain a cycle with a node that has at least two neighbors on it. CoRR abs/1309.1841 (2013) - [i3]Pierre Aboulker, Rohan Kapadia:
The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs. CoRR abs/1312.3214 (2013) - 2012
- [j1]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. SIAM J. Discret. Math. 26(4): 1510-1531 (2012) - [i2]Pierre Aboulker:
Excluding 4-wheels. CoRR abs/1202.3549 (2012) - [i1]Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic:
LexBFS, structure and algorithms. CoRR abs/1205.2535 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
