Clément Dallard

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Sufficient conditions for polynomial-time detection of induced minors	2024	Clément Dallard Maël Dumas Claire Hilaire Anthony Perez
+	Graphs with at most two moplexes	2024	Clément Dallard Robert Ganian Meike Hatzel Matjaž Krnc Martin Milanič
+	Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2024	Clément Dallard Martin Milanič Kenny Štorgel
+ PDF Chat	Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star	2024	Clément Dallard Matjaž Krnc O‐joung Kwon Martin Milanič Andrea Munaro Kenny Štorgel Sebastian Wiederrecht
+ PDF Chat	Detecting $K_{2,3}$ as an induced minor	2024	Clément Dallard Maël Dumas Claire Hilaire Martin Milanič Anthony Perez Nicolas Trotignon
+ PDF Chat	Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction	2024	Nina Chiarelli Clément Dallard Andreas Darmann Stefan Lendl Martin Milanič Peter Muršič Ulrich Pferschy
+ PDF Chat	Functionality of Box Intersection Graphs	2024	Clément Dallard Vadim Lozin Martin Milanič Kenny Štorgel Viktor Zamaraev
+	Detecting $$K_{2,3}$$ as an Induced Minor	2024	Clément Dallard Maël Dumas Claire Hilaire Martin Milanič Anthony Perez Nicolas Trotignon
+ PDF Chat	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items Under a Common Preference Graph	2024	Nina Chiarelli Clément Dallard Andreas Darmann Stefan Lendl Martin Milanič Peter Muršič Ulrich Pferschy
+	Treewidth versus clique number. II. Tree-independence number	2023	Clément Dallard Martin Milanič Kenny Štorgel
+ PDF Chat	Finding k-community structures in special graph classes	2023	Narmina Baghirova Clément Dallard Bernard Ries David Schindl
+	Allocation of indivisible items with individual preference graphs	2023	Nina Chiarelli Clément Dallard Andreas Darmann Stefan Lendl Martin Milanič Peter Muršič Ulrich Pferschy Nevena Pivač
+	Functionality of box intersection graphs	2023	Clément Dallard Vadim Lozin Martin Milanič Kenny Štorgel Viktor Zamaraev
+	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph	2023	Nina Chiarelli Clément Dallard Andreas Darmann Stefan Lendl Martin Milanič Peter Muršič Ulrich Pferschy
+	Allocation of Indivisible Items with Individual Preference Graphs	2022	Nina Chiarelli Clément Dallard Andreas Darmann Stefan Lendl Martin Milanič Peter Muršič Ulrich Pferschy Nevena Pivač
+	Finding $k$-community structures in special graph classes	2022	Narmina Baghirova Clément Dallard Bernard Ries David Schindl
+	Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2022	Clément Dallard Martin Milanič Kenny Štorgel
+	Computing Tree Decompositions with Small Independence Number	2022	Clément Dallard Fedor V. Fomin Petr A. Golovach Tuukka Korhonen Martin Milanič
+	On minimally tough chordal graphs	2022	Clément Dallard Blas Fernández Gyula Y. Katona Martin Milanič Kitti Varga
+	Tree decompositions with bounded independence number and their algorithmic applications.	2021	Clément Dallard Martin Milanič Kenny Štorgel
+ PDF Chat	Tree decompositions with bounded independence number and their algorithmic applications	2021	Clément Dallard Martin Milanič Kenny Štorgel
+ PDF Chat	Colourful components in k-caterpillars and planar graphs	2021	Janka Chlebı́ková Clément Dallard
+ PDF Chat	On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	2021	Valentin Bartier Nicolás Bousquet Clément Dallard Kyle Lomer Amer E. Mouawad
+ PDF Chat	Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	2021	Clément Dallard Martin Milanič Kenny Štorgel
+	Graphs with at most two moplexes	2021	Clément Dallard Robert Ganian Meike Hatzel Matjaž Krnc Martin Milanič
+	Treewidth versus clique number. II. Tree-independence number	2021	Clément Dallard Martin Milanič Kenny Štorgel
+	On girth and the parameterized complexity of token sliding and token jumping.	2020	Valentin Bartier Nicolás Bousquet Clément Dallard Kyle Lomer Amer E. Mouawad
+	Treewidth versus clique number in graph classes with a forbidden structure	2020	Clément Dallard Martin Milanič Kenny Štorgel
+	On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.	2020	Valentin Bartier Nicolás Bousquet Clément Dallard Kyle Lomer Amer E. Mouawad
+	On girth and the parameterized complexity of token sliding and token jumping	2020	Valentin Bartier Nicolás Bousquet Clément Dallard Kyle Lomer Amer E. Mouawad
+ PDF Chat	Graphs without a partition into two proportionally dense subgraphs	2019	Cristina Bazgan Janka Chlebı́ková Clément Dallard
+	Proportionally dense subgraph of maximum size: Complexity and approximation	2019	Cristina Bazgan Janka Chlebı́ková Clément Dallard Thomas Pontoizeau
+	A Complexity Dichotomy for Colourful Components Problems on $k$-caterpillars and Small-Degree Planar Graphs	2019	Janka Chlebı́ková Clément Dallard
+	Colourful components in $k$-caterpillars and planar graphs	2019	Janka Chlebı́ková Clément Dallard
+ PDF Chat	Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs	2019	Janka Chlebı́ková Clément Dallard
+	Colourful components in $k$-caterpillars and planar graphs	2019	Janka Chlebı́ková Clément Dallard
+	Graphs without $2$-community structures	2018	Cristina Bazgan Janka Chlebı́ková Clément Dallard

Common Coauthors

Coauthor	Papers Together
Martin Milanič	22
Kenny Štorgel	11
Janka Chlebı́ková	8
Stefan Lendl	5
Peter Muršič	5
Ulrich Pferschy	5
Andreas Darmann	5
Nina Chiarelli	5
Kyle Lomer	4
Valentin Bartier	4
Amer E. Mouawad	4
Nicolás Bousquet	4
Cristina Bazgan	3
Maël Dumas	3
Matjaž Krnc	3
Anthony Perez	3
Claire Hilaire	3
Viktor Zamaraev	2
Robert Ganian	2
Nicolas Trotignon	2
Nevena Pivač	2
Bernard Ries	2
David Schindl	2
Meike Hatzel	2
Vadim Lozin	2
Narmina Baghirova	2
Gyula Y. Katona	1
Blas Fernández	1
Petr A. Golovach	1
Fedor V. Fomin	1
Tuukka Korhonen	1
Kitti Varga	1
Andrea Munaro	1
O‐joung Kwon	1
Thomas Pontoizeau	1
Sebastian Wiederrecht	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Partial Characterizations of 1‐Perfectly Orientable Graphs	2016	Tatiana Romina Hartinger Martin Milanič	5
+ PDF Chat	Problems from the world surrounding perfect graphs	1987	András Gyárfás	5
+	A survey of χ‐boundedness	2020	Alex Scott Paul Seymour	4
+	In-Tournament Digraphs	1993	Jørgen Bang‐Jensen Jing Huang Erich Prisner	4
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml10" display="inline" overflow="scroll" altimg="si1.gif"><mml:mn>1</mml:mn></mml:math>-perfectly orientable <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml11" display="inline" overflow="scroll" altimg="si11.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-minor-free and outerplanar graphs	2017	Boštjan Brešar Tatiana Romina Hartinger Tim Kos Martin Milanič	4
+ PDF Chat	Avoidable Vertices and Edges in Graphs	2019	Jesse Beisegel Maria Chudnovsky Vladimir Gurvich Martin Milanič Mary Servatius	4
+ PDF Chat	Combinatorial Problems on H-graphs	2017	Steven Chaplick Peter Zeman	4
+	A general view on computing communities	2013	Martin Olsen	3
+ PDF Chat	Precoloring extension. I. Interval graphs	1992	Miklós Bíró Mihály Hujter Zs. Tuza	3
+	Maximum weight independent set for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml3" display="inline" overflow="scroll" altimg="si3.gif"><mml:mi>ℓ</mml:mi></mml:math>claw-free graphs in polynomial time	2017	Andreas Brandstädt Raffaele Mosca	3
+ PDF Chat	Minimal triangulations of graphs: A survey	2006	Pinar Heggernes	3
+	Separability generalizes Dirac's theorem	1998	Anne Berry Jean-Paul Bordat	3
+ PDF Chat	Algorithmic and Hardness Results for the Colorful Components Problems	2014	Anna Adamaszek Alexandru Popa	3
+ PDF Chat	Kernelization of Graph Hamiltonicity: Proper $H$-Graphs	2021	Steven Chaplick Fedor V. Fomin Petr A. Golovach Dušan Knop Peter Zeman	3
+	Upper and lower bounds for finding connected motifs in vertex-colored graphs	2010	Michael R. Fellows Guillaume Fertin Danny Hermelin Stéphane Vialette	3
+ PDF Chat	Induced Minor Free Graphs: Isomorphism and Clique-Width	2016	Rémy Belmonte Yota Otachi Pascal Schweitzer	3
+ PDF Chat	Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset	2014	Dániel Marx Igor Razgon	3
+	The Complexity of Coloring Circular Arcs and Chords	1980	M. R. Garey David S. Johnson Gary L. Miller Christos H. Papadimitriou	3
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	3
+ PDF Chat	Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	2021	Clément Dallard Martin Milanič Kenny Štorgel	3
+ PDF Chat	Twin-width I: Tractable FO Model Checking	2021	Édouard Bonnet Eun Jung Kim Stéphan Thomassé Rémi Watrigant	3
+ PDF Chat	Parameterized Complexity and Approximation Issues for the Colorful Components Problems	2016	Riccardo Dondi Florian Sikora	3
+	SOME POLYNOMIAL ALGORITHMS FOR CERTAIN GRAPHS AND HYPERGRAPHS.	1976	András Frank	3
+ PDF Chat	On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five	2020	Maria Chudnovsky Marcin Pilipczuk Michał Pilipczuk Stéphan Thomassé	3
+	Clustering and domination in perfect graphs	1984	Derek G. Corneil Yehoshua Perl	2
+	Classes of graphs with small rank decompositions are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math>-bounded	2012	Zdeněk Dvořák Daniel Kráľ	2
+ PDF Chat	Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas	2015	Amer E. Mouawad Naomi Nishimura Vinayak Pathak Venkatesh Raman	2
+	Tree-decompositions with bags of small diameter	2006	Yon Dourisboure Cyril Gavoille	2
+ PDF Chat	Induced trees in graphs of large chromatic number	1997	Alex Scott	2
+ PDF Chat	The Pathwidth and Treewidth of Cographs	1993	Hans L. Bodlaender Rolf H. Möhring	2
+ PDF Chat	Large Induced Subgraphs via Triangulations and CMSO	2015	Fedor V. Fomin Ioan Todinca Yngve Villanger	2
+	Fair assignment of indivisible objects under ordinal preferences	2015	Haris Aziz Serge Gaspers Simon Mackenzie Toby Walsh	2
+ PDF Chat	Finding topological subgraphs is fixed-parameter tractable	2011	Martin Grohe Ken‐ichi Kawarabayashi Dániel Marx Paul Wollan	2
+ PDF Chat	Towards an Isomorphism Dichotomy for Hereditary Graph Classes	2017	Pascal Schweitzer	2
+	The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>	1995	Jeong Han Kim	2
+	Flip distance between two triangulations of a point set is NP-complete	2014	Anna Lubiw Vinayak Pathak	2
+ PDF Chat	Connectedness of the graph of vertex-colourings	2007	Luis Cereceda Jan van den Heuvel Matthew Johnson	2
+	Graph classes and Ramsey numbers	2014	Rémy Belmonte Pinar Heggernes Pim van ’t Hof Arash Rafiey Reza Saei	2
+	A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphs	1982	Dale Skrien	2
+ PDF Chat	Vertex Colouring and Forbidden Subgraphs ? A Survey	2004	Bert Randerath Ingo Schiermeyer	2
+	Lower bound of the hadwiger number of graphs by their average degree	1984	Alexandr Kostochka	2
+	Detecting induced subgraphs	2009	Benjamin Lévêque David Y. Lin Frédéric Maffray Nicolas Trotignon	2
+	Asymptotic lower bounds for Ramsey functions	1977	Joel Spencer	2
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty	2
+	The satisfactory partition problem	2006	Cristina Bazgan Źsolt Tuza Daniel Vanderpooten	2
+	Bandwidth and density for block graphs	1998	Le Tu Quoc Hung Maciej M. Sysło Margaret L. Weaver Douglas B. West	2
+	Approximating clique-width and branch-width	2006	Sang‐il Oum Paul Seymour	2
+	Subgraphs and well‐quasi‐ordering	1992	Guoli Ding	2
+ PDF Chat	A Characterization of Certain Ptolemaic Graphs	1965	David C. Kay Gary Chartrand	2
+	On lower bounds for the chromatic number in terms of vertex degree	2011	Manouchehr Zaker	2