Follow
Clément Dallard
Clément Dallard
Department of Informatics, University of Fribourg
Verified email at unifr.ch - Homepage
Title
Cited by
Year
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
C Dallard, M Milanič, K Štorgel
Journal of Combinatorial Theory, Series B 167, 338-391, 2024
142024
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
C Dallard, M Krnc, O Kwon, M Milanič, A Munaro, K Štorgel, ...
arXiv preprint arXiv:2402.11222, 2024
2024
Detecting as an induced minor
C Dallard, M Dumas, C Hilaire, M Milanič, A Perez, N Trotignon
arXiv preprint arXiv:2402.08332, 2024
2024
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
arXiv preprint arXiv:2402.00921, 2024
2024
Functionality of box intersection graphs
C Dallard, V Lozin, M Milanič, K Štorgel, V Zamaraev
Results in Mathematics 79 (1), 48, 2024
2024
Treewidth versus clique number. II. Tree-independence number
C Dallard, M Milanič, K Štorgel
Journal of Combinatorial Theory, Series B 164, 404-442, 2024
21*2024
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
arXiv preprint arXiv:2312.01804, 2023
2023
Allocation of indivisible items with individual preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
Discrete Applied Mathematics 334, 45-62, 2023
22023
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
J Chlebíková, C Dallard, N Paulsen
Theoretical Computer Science 960, 113923, 2023
12023
On minimally tough chordal graphs
C Dallard, B Fernández, GY Katona, M Milanič, K Varga
arXiv preprint arXiv:2210.00383, 2022
2022
Computing tree decompositions with small independence number
C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič
arXiv preprint arXiv:2207.09993, 2022
132022
Finding -community structures in special graph classes
N Baghirova, C Dallard, B Ries, D Schindl
arXiv preprint arXiv:2206.14738, 2022
2022
Treewidth versus clique number. II
C Dallard, M Milanič, K Štorgel
Tree-independence number. CoRR, abs/2111.04543, 2022
52022
On Constrained Intersection Representations of Graphs and Digraphs
F Cicalese, C Dallard, M Milanič
33rd International Symposium on Algorithms and Computation (ISAAC 2022), 2022
2022
Conditions for minimally tough graphs
C Dallard, B Fernández, GY Katona, M Milanic, K Varga
arXiv preprint arXiv:2210.00383, 2022
12022
Colourful components in k-caterpillars and planar graphs
J Chlebíková, C Dallard
Theoretical Computer Science 895, 137-150, 2021
2021
Vertex Cover at Distance on H-Free Graphs
C Dallard, M Krbezlija, M Milanič
International Workshop on Combinatorial Algorithms, 237-251, 2021
2021
Graphs with at most two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
arXiv preprint arXiv:2106.10049, 2021
12021
Graphs with two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
Procedia Computer Science 195, 248-256, 2021
32021
Allocating indivisible items with minimum dissatisfaction on preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ...
Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021
32021
The system can't perform the operation now. Try again later.
Articles 1–20