Scholar
Clément Dallard
Google Scholar ID: 3NaVESEAAAAJ
Department of Informatics, University of Fribourg
Graph Theory
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
220
H-index
8
i10-index
6
Publications
20
Co-authors
32
list available
Contact
Email
clement.dallard@unifr.ch
Publications
9 items
Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs
2026
Cited
0
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
Load more
Co-authors
12 total
Martin Milanič
University of Primorska, Koper, Slovenia
Matjaž Krnc
University of Primorska
Nicolas Bousquet
CNRS, LIRIS, University Lyon 1, Univ. de Lyon
Ulrich Pferschy
University of Graz
Andreas Darmann
Universität Graz
Mathias Weller
LIGM, Paris, France
Petr Golovach
University of Bergen
Tuukka Korhonen
University of Copenhagen
