default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThéo Pierron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Nicolas Bousquet, Théo Pierron
, Alexandra Wesolek:
A note on highly connected K2,-minor free graphs. Discret. Math. 347(7): 114005 (2024)- [j21]Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen:
Oriented total-coloring of oriented graphs. Discret. Math. 347(12): 114174 (2024) - [j20]Théo Pierron:
A Brooks-like result for graph powers. Eur. J. Comb. 117: 103822 (2024) - [j19]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. J. Parallel Distributed Comput. 193: 104954 (2024) - [j18]Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. 38(1): 504-528 (2024) - [c9]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG 2024: 22:1-22:17 - [i22]Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron:
Fast winning strategies for the attacker in eternal domination. CoRR abs/2401.10584 (2024) - [i21]Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun:
Local certification of forbidden subgraphs. CoRR abs/2402.12148 (2024) - [i20]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
How local constraints influence network diameter and applications to LCL generalizations. CoRR abs/2409.01305 (2024) - 2023
- [j17]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2(1): 8:1-8:7 (2023) - [j16]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30(3) (2023) - [j15]Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie:
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30(4) (2023) - [j14]Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Improved square coloring of planar graphs. Discret. Math. 346(4): 113288 (2023) - [j13]Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory 104(1): 17-86 (2023) - [j12]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. Math. Comput. 93(345): 443-458 (2023) - [j11]Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron:
Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. 37(1): 332-350 (2023) - [j10]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. 37(2): 604-611 (2023) - [i19]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. CoRR abs/2301.02020 (2023) - [i18]Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2, 𝓁-minor free graphs. CoRR abs/2301.02133 (2023) - [i17]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A note on the flip distance between non-crossing spanning trees. CoRR abs/2303.07710 (2023) - [i16]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of plane trees in convex geometric graphs. CoRR abs/2310.18518 (2023) - 2022
- [j9]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84(5): 1183-1212 (2022) - [j8]Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica 84(11): 3338-3364 (2022) - [j7]Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron:
Density Maximizers of Layered Permutations. Electron. J. Comb. 29(3) (2022) - [j6]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. Discret. Math. 345(2): 112664 (2022) - [c8]Laurent Feuilloley, Nicolas Bousquet, Théo Pierron:
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC 2022: 131-140 - [i15]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a theorem of Meyniel. CoRR abs/2201.07595 (2022) - [i14]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
What can be certified compactly? CoRR abs/2202.06065 (2022) - [i13]Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron:
Square coloring planar graphs with automatic discharging. CoRR abs/2204.05791 (2022) - [i12]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. CoRR abs/2210.09936 (2022) - 2021
- [j5]Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021) - [j4]Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344(1): 112151 (2021) - [c7]Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC 2021: 8:1-8:14 - [c6]Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. IPEC 2021: 29:1-29:4 - [c5]Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: μSolver - Heuristic Track. IPEC 2021: 33:1-33:3 - [c4]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS 2021: 22:1-22:17 - [c3]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC 2021: 49:1-49:4 - [i11]Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear kernels for edge modification problems towards structured graph classes. CoRR abs/2105.09566 (2021) - [i10]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. CoRR abs/2108.00059 (2021) - [i9]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of MSO properties for bounded treedepth graphs. CoRR abs/2110.01936 (2021) - [i8]Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie:
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR abs/2110.10530 (2021) - 2020
- [j3]Ilkyoo Choi, Daniel W. Cranston, Théo Pierron:
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40(5): 625-653 (2020) - [j2]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284: 166-178 (2020) - [i7]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. CoRR abs/2009.12059 (2020)
2010 – 2019
- 2019
- [b1]Théo Pierron:
Induction Schemes : From Language Separation to Graph Colorings. (Schémas d'induction : from languages separation to graph colorings). University of Bordeaux, France, 2019 - [j1]Hervé Hocquard, Seog-Jin Kim, Théo Pierron:
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271: 64-73 (2019) - [c2]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC 2019: 15:1-15:16 - [i6]Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR abs/1904.12060 (2019) - [i5]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. CoRR abs/1907.03266 (2019) - [i4]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR abs/1910.01099 (2019) - [i3]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. CoRR abs/1911.09909 (2019) - [i2]Théo Pierron:
A Brooks-like result for graph powers. CoRR abs/1912.11181 (2019) - 2016
- [c1]Théo Pierron, Thomas Place, Marc Zeitoun:
Quantifier Alternation for Infinite Words. FoSSaCS 2016: 234-251 - 2015
- [i1]Théo Pierron, Thomas Place, Marc Zeitoun:
Quantifier Alternation for Infinite Words. CoRR abs/1511.09011 (2015)
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-02 22:30 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:
