Clément Dallard
Scholar

Clément Dallard

Google Scholar ID: 3NaVESEAAAAJ
Department of Informatics, University of Fribourg
Graph Theory
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
220
 
H-index
8
 
i10-index
6
 
Publications
20
 
Co-authors
32
list available
Contact
Emailclement.dallard@unifr.ch
Publications
8 items
Awesome graph parameters
2025
Cited
1
Layered tree-independence number and clique-based separators
2025
Cited
0
On Constrained Intersection Representations of Graphs and Digraphs
International Symposium on Algorithms and Computation · 2025
Cited
1
Sufficient conditions for polynomial-time detection of induced minors
2024
Cited
0
Detecting K2, 3 as an induced minor
International Workshop on Combinatorial Algorithms · 2024
Cited
6
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
arXiv.org · 2024
Cited
0
On minimally tough chordal graphs
2022
Cited
0
Computing Tree Decompositions with Small Independence Number
International Colloquium on Automata, Languages and Programming · 2022
Cited
24
Resume (English only)
Co-authors
32 total
Martin Milanič
Martin Milanič
University of Primorska, Koper, Slovenia
Co-author 2
Co-author 2
Co-author 3
Co-author 3
Co-author 4
Co-author 4
Matjaž Krnc
Matjaž Krnc
University of Primorska
Nicolas Bousquet
Nicolas Bousquet
CNRS, LIRIS, University Lyon 1, Univ. de Lyon
Ulrich Pferschy
Ulrich Pferschy
University of Graz
Co-author 8
Co-author 8