Finding k-community structures in special graph classes
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl, Discrete Applied Mathematics (2024) | Artikel
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) | Artikel
Graphs with at most two moplexes
allard, Clément and Ganian, Robert and Hatzel, Meike and Krnc, Matjaž and Milanič, Martin, rnal of Graph Theory (2024) | Artikel
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
allard and Martin Milanič and Kenny Štorgel, urnal of Combinatorial Theory, Series B (2024) | Artikel
Functionality of Box Intersection Graphs
Dallard, C. and Lozin, V. and Milani?, M. and ?torgel, K. and Zamaraev, V., Results in Mathematics (2024) | Artikel
Computing Tree Decompositions with Small Independence Number
Dallard, Clement, Fomin, Fedor V., Golovach, Petr A., Korhonen, Tuukka, Milanic, Martin, ArXiv (2024) | Artikel
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
Darmann, Andreas, Lendl, Stefan, Milanic, Martin, Mursic, Peter, Pferschy, Ulrich, Chiarelli, Nina, Dallard, Clement, ArXiv (2024) | Artikel
Detecting $$K_{2,3}$$ as an Induced Minor
Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon, Clément Dallard (2024)
| Buchkapitel
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) | Konferenz
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) | Artikel
Finding k-community structures in special graph classes
Baghirova, N. and Dallard, C. and Ries, B. and Schindl, D.
, Research Square (2023) | Sonstiges
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) | Artikel
Functionality of box intersection graphs
Dallard, Clement, Lozin, Vadim, Milanic, Martin, Storgel, Kenny, Zamaraev, Viktor, ArXiv (2023) | Artikel
Finding k-community structures in special graph classes
Baghirova, Narmina, Dallard, Clement, Ries, Bernard, Schindl, David, ArXiv (2023) | Artikel
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
Dallard, Clement, Milanič, Martin, Storgel, Kenny, ArXiv (2023) | Artikel
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
Dallard, C. and Milani?, M. and ?torgel, K.
, arXiv (2022) | Sonstiges
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) | Konferenz
Computing Tree Decompositions with Small Independence Number
Dallard, C. and Fomin, F.V. and Golovach, P.A. and Korhonen, T. and Milani?, M.
, arXiv (2022) | Sonstiges
On minimally tough chordal graphs
Dallard, C. and Fernández, B. and Katona, G.Y. and Milani?, M. and Varga, K.
, arXiv (2022) | Sonstiges
Finding $k$-community structures in special graph classes
Baghirova, Narmina and Dallard, Clément and Ries, Bernard and Schindl, David, (2022) | Preprint
Colourful components in k-caterpillars and planar graphs
Janka Chlebíková and Clément Dallard, Theoretical Computer Science (2021) | Artikel
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Clément Dallard and Martin Milanič and Kenny Štorgel, SIAM Journal on Discrete Mathematics (2021) | Artikel
Vertex Cover at Distance on H-Free Graphs
Clément Dallard and Mirza Krbezlija and Martin Milanič,
International Workshop on Combinatorial Algorithms (IWOCA): Springer International Publishing
(2021) | Konferenz
Graphs with Two Moplexes
Clément Dallard and Robert Ganian and Meike Hatzel and Matjaž Krnc and Martin Milanič,
Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS): Elsevier BV
(2021) | Konferenz
Graphs with at most two moplexes
Dallard, C. and Ganian, R. and Hatzel, M. and Krnc, M. and Milani?, M.
, arXiv (2021) | Sonstiges
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs
Nina Chiarelli and Clément Dallard and Andreas Darmann and Stefan Lendl and Martin Milanič and Peter Muršič and Nevena Pivač and Ulrich Pferschy,
Algorithmic Decision Theory (ADT): Springer International Publishing
(2021) | Konferenz
Treewidth versus clique number. I. Graph classes with a forbidden structure
Dallard, Clement, Milanic, Martin, Storgel, Kenny, ArXiv (2021) | Artikel
Colourful components in k-caterpillars and planar graphs
Chlebikova, Janka, Dallard, Clement, ArXiv (2021) | Artikel
Graphs with at most two moplexes
Dallard, Clement, Ganian, Robert, Hatzel, Meike, Krnc, Matjaz, Milanic, Martin, ArXiv (2021) | Artikel
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
rtier, 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) | Konferenz
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) | Konferenz
Graphs without a partition into two proportionally dense subgraphs
azgan, Cristina and Chlebíková, Janka and Dallard, Clément, rm. Process. Lett. (2020) | Artikel
Proportionally dense subgraph of maximum size: Complexity and approximation
azgan, Cristina and Chlebíková, Janka and Dallard, Clément and Pontoizeau, Thomas, ete Appl. Math. (2019) | Artikel
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
hlebíková, Janka and Dallard, Clément,
International Workshop on Combinatorial Algorithms (IWOCA): Cham
(10.7.2019) | Konferenz
Complexity of Scheduling for DARP with Soft Ride Times
hlebíková, Janka and Dallard, Clément and Paulsen, Niklas,
International Conference on Algorithms and Complexity (CIAC): , Cham
(6.4.2019) | Konferenz
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding
allard, Clément and Weller, Mathias and Chateau, Annie and Giroudeau, Rodolphe,
International Conference on Combinatorial Optimization and Applications (COCOA): Cham
(31.10.2016) | Konferenz
A Graph Constraints Formulation for Contigs Scaffolding
ourreau, Éric and Chateau, Annie and Dallard, Clément and Giroudeau, Rodolphe,
(5.9.2016) | Konferenz
