Clément Dallard

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 39

Top Topics

Fixed Parameter Tractability

Tree Decompositions

Top Venues

Discret. Appl. Math.

Publications

Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory, Ser. B 164 (2024)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. J. Comb. Theory B 167 (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an induced minor. CoRR (2024)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. ICALP (2024)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR (2024)
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
Finding k-community structures in special graph classes. Discret. Appl. Math. 359 (2024)
Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an Induced Minor. IWOCA (2024)
Janka Chlebíková, Clément Dallard, Niklas Paulsen
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems. Theor. Comput. Sci. 960 (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334 (2023)
Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
Functionality of box intersection graphs. CoRR (2023)
Ferdinando Cicalese, Clément Dallard, Martin Milanic
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC (2022)
Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga
Conditions for minimally tough graphs. CoRR (2022)
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
Finding k-community structures in special graph classes. CoRR (2022)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of Indivisible Items with Individual Preference Graphs. CoRR (2022)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR (2022)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. CoRR (2022)
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Graphs with at most two moplexes. CoRR (2021)
Clément Dallard, Mirza Krbezlija, Martin Milanic
Vertex Cover at Distance on H-Free Graphs. IWOCA (2021)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. Algorithmica 83 (9) (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. 35 (4) (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Tree decompositions with bounded independence number and their algorithmic applications. CoRR (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Graphs with Two Moplexes. LAGOS (2021)
Janka Chlebíková, Clément Dallard
-caterpillars and planar graphs. Theor. Comput. Sci. 895 (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number in graph classes with a forbidden structure. CoRR (2020)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ISAAC (2020)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On girth and the parameterized complexity of token sliding and token jumping. CoRR (2020)
Cristina Bazgan, Janka Chlebíková, Clément Dallard
Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155 (2020)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG (2020)
Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270 (2019)
Janka Chlebíková, Clément Dallard, Niklas Paulsen
Complexity of Scheduling for DARP with Soft Ride Times. CIAC (2019)
Janka Chlebíková, Clément Dallard
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. IWOCA (2019)
Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau
Proportionally dense subgraph of maximum size: complexity and approximation. CoRR (2019)
Janka Chlebíková, Clément Dallard
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. CoRR (2019)
Cristina Bazgan, Janka Chlebíková, Clément Dallard
Graphs without a partition into two proportionally dense subgraphs. CoRR (2018)
Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica 80 (6) (2018)
Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA (2016)