Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy, Discrete Optimization (2025) | Journal article
Computing Tree Decompositions with Small Independence Number
Petr A. Golovach, Tuukka Korhonen, Martin Milanič, Clément Dallard, Fedor V. Fomin, ACM Transactions on Algorithms (2025) | Journal article
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez (2025)
| Book chapter
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
Clément Dallard, Martin Milanič, Kenny Štorgel, Journal of Combinatorial Theory, Series B (2024) | Journal article
Graphs with at most two moplexes
Dallard, Clément and Ganian, Robert and Hatzel, Meike and Krnc, Matjaž and Milanič, Martin, Journal of Graph Theory (2024) | Journal article
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
Dallard, Clément and Krnc, Matjaž and Kwon, O-joung and Milanič, Martin and Munaro, Andrea and Štorgel, Kenny and Wiederrecht, Sebastian, (2024) | Preprint
Detecting $K_{2,3}$ as an induced minor
Dallard, Clément and Dumas, Maël and Hilaire, Claire and Milanič, Martin and Perez, Anthony and Trotignon, Nicolas, (2024) | Preprint
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
Chiarelli, Nina and Dallard, Clément and Darmann, Andreas and Lendl, Stefan and Milanič, Martin and Muršič, Peter and Pferschy, Ulrich, (2024) | Preprint
Treewidth versus clique number. II. Tree-independence number
Clément Dallard and Martin Milanič and Kenny Štorgel, Journal of Combinatorial Theory, Series B (2024) | Journal article
Functionality of Box Intersection Graphs
Dallard, C. and Lozin, V. and Milani?, M. and ?torgel, K. and Zamaraev, V., Results in Mathematics (2024) | Journal article
Computing Tree Decompositions with Small Independence Number
Clément Dallard, Fedor V. Fomin, Petr Golovach, Tuukka Korhonen, Martin Milanič,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik:
(2024) | Conference
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
Chiarelli, Nina and Dallard, Clément and Darmann, Andreas and Lendl, Stefan and Milanič, Martin and Muršič, Peter and Pferschy, Ulrich, (2023) | Preprint
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
Chlebíková, J. and Dallard, C. and Paulsen, N., Theoretical Computer Science (2023) | Journal article
Allocation of indivisible items with individual preference graphs
Chiarelli, N. and Dallard, C. and Darmann, A. and Lendl, S. and Milani?, M. and Mur?i?, P. and Pferschy, U. and Piva?, N., Discrete Applied Mathematics (2023) | Journal article
On Constrained Intersection Representations of Graphs and Digraphs
Cicalese, Ferdinando and Dallard, Clément and Milanič, Martin,
International Symposium on Algorithms and Computation: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
(2022) | Conference
On minimally tough chordal graphs
Dallard, C. and Fernández, B. and Katona, G.Y. and Milani?, M. and Varga, K.
, arXiv (2022) | Other
Finding $k$-community structures in special graph classes
Baghirova, Narmina and Dallard, Clément and Ries, Bernard and Schindl, David, (2022) | Preprint
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
Bartier, Valentin and Bousquet, Nicolas and Dallard, Clément and Lomer, Kyle and Mouawad, Amer E,
International Symposium on Algorithms and Computation (ISAAC):
(4.12.2020) | Conference
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure
Clément Dallard, Martin Milanič, Kenny Štorgel,
Graph-Theoretic Concepts in Computer Science (WG):
(9.10.2020) | Conference
Graphs without a partition into two proportionally dense subgraphs
Bazgan, Cristina and Chlebíková, Janka and Dallard, Clément, Inform. Process. Lett. (2020) | Journal article
Proportionally dense subgraph of maximum size: Complexity and approximation
Bazgan, Cristina and Chlebíková, Janka and Dallard, Clément and Pontoizeau, Thomas, Discrete Appl. Math. (2019) | Journal article
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
Chlebíková, Janka and Dallard, Clément,
International Workshop on Combinatorial Algorithms (IWOCA): Springer, Cham
(10.7.2019) | Conference
Complexity of Scheduling for DARP with Soft Ride Times
Chlebíková, Janka and Dallard, Clément and Paulsen, Niklas,
International Conference on Algorithms and Complexity (CIAC): Springer, Cham
(6.4.2019) | Conference
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding
Dallard, Clément and Weller, Mathias and Chateau, Annie and Giroudeau, Rodolphe,
International Conference on Combinatorial Optimization and Applications (COCOA): Springer, Cham
(31.10.2016) | Conference
A Graph Constraints Formulation for Contigs Scaffolding
Bourreau, Éric and Chateau, Annie and Dallard, Clément and Giroudeau, Rodolphe,
(5.9.2016) | Conference
