Clément Dallard

48 papers A* 1B 3C 6Journal 36Unranked 2

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