default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Dallard
Person information
- affiliation: University of Orléans, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Narmina Baghirova
, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. Discret. Appl. Math. 359: 159-175 (2024)- [j10]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory B 164: 404-442 (2024) - [j9]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: 338-391 (2024) - [c11]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. ICALP 2024: 51:1-51:18 - [c10]Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
Detecting K2,3 as an Induced Minor. IWOCA 2024: 151-164 - [i17]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 abs/2402.00921 (2024) - [i16]Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
Detecting K2, 3 as an induced minor. CoRR abs/2402.08332 (2024) - [i15]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 abs/2402.11222 (2024) - 2023
- [j8]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: 45-62 (2023) - [j7]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: 113923 (2023) - [i14]Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev:
Functionality of box intersection graphs. CoRR abs/2301.09493 (2023) - [i13]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 abs/2312.01804 (2023) - 2022
- [c9]Ferdinando Cicalese, Clément Dallard, Martin Milanic:
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC 2022: 38:1-38:15 - [i12]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 abs/2202.04465 (2022) - [i11]Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. CoRR abs/2206.14738 (2022) - [i10]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR abs/2206.15092 (2022) - [i9]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. CoRR abs/2207.09993 (2022) - [i8]Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga:
Conditions for minimally tough graphs. CoRR abs/2210.00383 (2022) - 2021
- [j6]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): 2914-2951 (2021) - [j5]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. 35(4): 2618-2646 (2021) - [j4]Janka Chlebíková, Clément Dallard:
Colourful components in k-caterpillars and planar graphs. Theor. Comput. Sci. 895: 137-150 (2021) - [c8]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: 243-257 - [c7]Clément Dallard, Mirza Krbezlija, Martin Milanic:
Vertex Cover at Distance on H-Free Graphs. IWOCA 2021: 237-251 - [c6]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - [i7]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with at most two moplexes. CoRR abs/2106.10049 (2021) - [i6]Clément Dallard, Martin Milanic, Kenny Storgel:
Tree decompositions with bounded independence number and their algorithmic applications. CoRR abs/2111.04543 (2021) - 2020
- [j3]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155 (2020) - [c5]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: 44:1-44:17 - [c4]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG 2020: 92-105 - [i5]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number in graph classes with a forbidden structure. CoRR abs/2006.06067 (2020) - [i4]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 abs/2007.01673 (2020)
2010 – 2019
- 2019
- [j2]Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270: 25-36 (2019) - [c3]Janka Chlebíková, Clément Dallard, Niklas Paulsen:
Complexity of Scheduling for DARP with Soft Ride Times. CIAC 2019: 149-160 - [c2]Janka Chlebíková, Clément Dallard:
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. IWOCA 2019: 136-147 - [i3]Janka Chlebíková, Clément Dallard:
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. CoRR abs/1902.11191 (2019) - [i2]Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: complexity and approximation. CoRR abs/1903.06579 (2019) - 2018
- [j1]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): 1771-1803 (2018) - [i1]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. CoRR abs/1806.10963 (2018) - 2016
- [c1]Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA 2016: 294-308
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
