Scholar
Amadeus Reinald
Google Scholar ID: Yc1-CigAAAAJ
LIRMM
Graph Theory
Parameterized Complexity
Combinatorics
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
142
H-index
5
i10-index
2
Publications
8
Co-authors
18
list available
Contact
Email
prénom.nom@lirmm.fr
CV
Open ↗
Twitter
Open ↗
GitHub
Open ↗
Publications
9 items
Forbidding anticomplete planar minors: Induced Erdős--Pósa property and Maximum Independent Set in QP
2026
Cited
0
Induced Erdős--Pósa property for long holes, long thetas, and beyond
2026
Cited
0
Dynamic Detours
2026
Cited
0
Inversion diameter and 2-edge-colored homomorphisms
2026
Cited
0
Plane Strong Connectivity Augmentation
2025
Cited
0
Making an oriented graph acyclic using inversions of bounded or prescribed size
2025
Cited
0
Twin-width one
2025
Cited
0
Brooks-type colourings of digraphs in linear time
arXiv.org · 2024
Cited
1
Load more
Resume (English only)
Background
3rd-year PhD student at LIRMM, University of Montpellier, France
Member of the AlGCo research team
Research area: discrete mathematics and theoretical computer science, specifically graph theory and parameterized complexity
Current focus on topics related to directed graphs
Interested in structural properties of (di)graph classes forbidding a given subgraph
Co-authors
18 total
Stéphan Thomassé
École Normale Supérieure de Lyon
Édouard Bonnet
ENS Lyon, LIP, France
Eun Jung Kim
KAIST, CNRS
Picasarri-Arrieta Lucas
National Institute of Informatics
Tomáš Masařík
University of Warsaw
Co-author 6
Ueverton S. Souza
Fluminense Federal University
Marcin Pilipczuk
Instytut Informatyki, Uniwersytet Warszawski