Théo Pierron - RankMe

63 papers A* 2A 2B 8Journal 50

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Inversion diameter and 2-edge-colored homomorphisms. CoRR Carmen Arana, Thomas Bellitto, Hector Buffière, Quentin Chuet, Théo Pierron, Amadeus Reinald
2026	J	`jnl`	Reconfiguration of Plane Trees in Convex Geometric Graphs. Discret. Comput. Geom. Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2025	J	`jnl`	4-tangrams are 4-avoidable. CoRR Pascal Ochem, Théo Pierron
2025	J	`jnl`	4-tangrams are 4-avoidable. Discret. Math. Theor. Comput. Sci. Pascal Ochem, Théo Pierron
2025	J	`jnl`	Determining a graph from its reconfiguration graph. CoRR Gaétan Berthe, Caroline Brosse, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, Théo Pierron
2025	A	`conf`	The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration. ESA Nicolas Bousquet, Quentin Deschamps, Arnaud Mary, Amer E. Mouawad, Théo Pierron
2025	J	`jnl`	The tape reconfiguration problem and its consequences for dominating set reconfiguration. CoRR Nicolas Bousquet, Quentin Deschamps, Arnaud Mary, Amer E. Mouawad, Théo Pierron
2024	J	`jnl`	A Brooks-like result for graph powers. Eur. J. Comb. Théo Pierron
2024	J	`jnl`	A note on highly connected K2,-minor free graphs. Discret. Math. Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
2024	B	`conf`	Fast Winning Strategies for the Attacker in Eternal Domination. WG Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024	J	`jnl`	Fast winning strategies for the attacker in eternal domination. CoRR Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024	B	`conf`	How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. OPODIS Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	J	`jnl`	How local constraints influence network diameter and applications to LCL generalizations. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	J	`jnl`	Local certification of forbidden subgraphs. CoRR Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun
2024	J	`jnl`	Local certification of graph decompositions and applications to minor-free classes. J. Parallel Distributed Comput. Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2024	J	`jnl`	Oriented total-coloring of oriented graphs. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
2024	A*	`conf`	Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2024	J	`jnl`	Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
2023	J	`jnl`	A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
2023	J	`jnl`	A note on highly connected K CoRR Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
2023	J	`jnl`	A note on the flip distance between non-crossing spanning trees. CoRR Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
2023	J	`jnl`	Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory Marthe Bonamy, Théo Pierron, Éric Sopena
2023	J	`jnl`	Extremal Independent Set Reconfiguration. Electron. J. Comb. Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
2023	J	`jnl`	Extremal Independent Set Reconfiguration. CoRR Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
2023	J	`jnl`	Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
2023	J	`jnl`	Improved square coloring of planar graphs. Discret. Math. Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
2023	J	`jnl`	Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin R. Moore, Théo Pierron
2023	J	`jnl`	Reconfiguration of plane trees in convex geometric graphs. CoRR Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2023	J	`jnl`	Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2023	J	`jnl`	The smallest 5-chromatic tournament. Math. Comput. Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
2022	J	`jnl`	(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron
2022	J	`jnl`	Density Maximizers of Layered Permutations. Electron. J. Comb. Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron
2022	J	`jnl`	Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2022	J	`jnl`	On the signed chromatic number of some classes of graphs. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2022	J	`jnl`	Square coloring planar graphs with automatic discharging. CoRR Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron
2022	J	`jnl`	Strengthening a theorem of Meyniel. CoRR Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2022	J	`jnl`	The smallest 5-chromatic tournament. CoRR Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
2022	A*	`conf`	What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC Laurent Feuilloley, Nicolas Bousquet, Théo Pierron
2022	J	`jnl`	What can be certified compactly? CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	B	`conf`	(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC Gabriel Bathie, Nicolas Bousquet, Théo Pierron
2021	J	`jnl`	(Sub)linear kernels for edge modification problems towards structured graph classes. CoRR Gabriel Bathie, Nicolas Bousquet, Théo Pierron
2021	A	`conf`	Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Graph Isomorphism for (H Algorithmica Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
2021	J	`jnl`	Improved pyrotechnics : Closer to the burning graph conjecture. CoRR Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
2021	B	`conf`	Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Local certification of MSO properties for bounded treedepth graphs. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	J	`jnl`	Local certification of graph decompositions and applications to minor-free classes. CoRR Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
2021	B	`conf`	PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. IPEC Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
2021	B	`conf`	PACE Solver Description: μSolver - Heuristic Track. IPEC Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
2021	J	`jnl`	Pushable chromatic number of graphs with degree constraints. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
2020	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2020	J	`jnl`	Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
2020	J	`jnl`	On the signed chromatic number of some classes of graphs. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2019	J	`jnl`	A Brooks-like result for graph powers. CoRR Théo Pierron
2019	J	`jnl`	Coloring squares of graphs with mad constraints. Discret. Appl. Math. Hervé Hocquard, Seog-Jin Kim, Théo Pierron
2019	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. CoRR François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2019	J	`jnl`	Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR Marthe Bonamy, Théo Pierron, Éric Sopena
2019	—	`—`	Induction Schemes : From Language Separation to Graph Colorings. (Schémas d'induction : from languages separation to graph colorings). Théo Pierron
2019	B	`conf`	Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	J	`jnl`	Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	J	`jnl`	Pushable chromatic number of graphs with degree constraints. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
2016	B	`conf`	Quantifier Alternation for Infinite Words. FoSSaCS Théo Pierron, Thomas Place, Marc Zeitoun
2015	J	`jnl`	Quantifier Alternation for Infinite Words. CoRR Théo Pierron, Thomas Place, Marc Zeitoun