default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Liedloff
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
showing all ?? records
2020 – today
- 2022
[j35]Vincent T'kindt
, Federico Della Croce, Mathieu Liedloff:
Moderate exponential-time algorithms for scheduling problems. 4OR 20(4): 533-566 (2022)- [c29]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Minimal Connected Dominating Sets. ESA 2022: 1:1-1:15 - [i10]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Connected Dominating Sets. CoRR abs/2205.00086 (2022)
2010 – 2019
- 2019
- [j34]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica 81(3): 986-1005 (2019) - [j33]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of maximal irredundant sets for chordal graphs. Discret. Appl. Math. 265: 69-85 (2019) - [j32]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of minimal dominating sets for chordal graphs. Theor. Comput. Sci. 783: 41-52 (2019) - 2018
- [j31]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica 80(4): 1146-1169 (2018) - [j30]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez:
Exact algorithms for weak Roman domination. Discret. Appl. Math. 248: 79-92 (2018) - [j29]Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt:
Exact exponential algorithms for 3-machine flowshop scheduling problems. J. Sched. 21(2): 227-233 (2018) - [j28]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. Theor. Comput. Sci. 711: 66-78 (2018) - [j27]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - 2017
- [j26]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216: 114-129 (2017) - [j25]Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact exponential algorithms to find tropical connected sets of minimum size. Theor. Comput. Sci. 676: 33-41 (2017) - [c28]Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumerating Minimal Tropical Connected Sets. SOFSEM 2017: 217-228 - [c27]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. WG 2017: 289-302 - 2016
- [c26]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c25]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [i9]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. CoRR abs/1607.06911 (2016) - 2015
- [b2]Mathieu Liedloff:
Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement. University of Orléans, France, 2015 - [j24]Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan:
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180: 89-100 (2015) - [j23]Jean-François Couturier, Romain Letourneur, Mathieu Liedloff:
On the number of minimal dominating sets on some graph classes. Theor. Comput. Sci. 562: 634-642 (2015) - [j22]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On finding optimal polytrees. Theor. Comput. Sci. 592: 49-58 (2015) - [c24]Dieter Kratsch, Mathieu Liedloff, Daniel Meister:
End-Vertices of Graph Search Algorithms. CIAC 2015: 300-312 - [c23]Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski:
Fixing Improper Colorings of Graphs. SOFSEM 2015: 266-276 - [c22]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. WG 2015: 499-512 - [i8]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination. CoRR abs/1506.07260 (2015) - 2014
- [j21]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Discret. Appl. Math. 168: 60-68 (2014) - [j20]Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca:
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169: 119-134 (2014) - [c21]Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. IPEC 2014: 147-158 - [c20]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT 2014: 182-193 - [i7]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR abs/1404.3882 (2014) - 2013
- [j19]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013) - [j18]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)L(2, 1)-span in polynomial space. Discret. Appl. Math. 161(13-14): 2052-2061 (2013) - [j17]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin:
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (2013) - [j16]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. 505: 42-54 (2013) - [j15]Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt:
On an extension of the Sort & Search method with application to scheduling theory. Theor. Comput. Sci. 511: 13-22 (2013) - [c19]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez:
Exact Algorithms for Weak Roman Domination. IWOCA 2013: 81-93 - [c18]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS 2013: 232-243 - [i6]Jean-François Couturier, Mathieu Liedloff:
A tight bound on the number of minimal dominating sets in split graph. CTW 2013: 67-70 - [i5]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
TREEWIDTH and PATHWIDTH parameterized by vertex cover. CoRR abs/1305.0433 (2013) - 2012
- [j14]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012) - [j13]Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discret. Math. Theor. Comput. Sci. 14(1): 29-42 (2012) - [c17]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. AAAI 2012: 750-756 - [c16]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137 - [i4]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012) - 2011
- [j12]Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) - [j11]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011) - [j10]Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk:
Breaking the 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011) - [j9]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3): 252-262 (2011) - [j8]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011) - [c15]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93 - [c14]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178 - 2010
- [j7]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010) - [j6]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010) - [c13]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An Exact Algorithm for Connected Red-Blue Dominating Set. CIAC 2010: 25-36 - [c12]Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith:
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. CIAC 2010: 311-322 - [c11]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG 2010: 88-99 - [i3]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. CoRR abs/1007.1733 (2010) - [i2]Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. CoRR abs/1009.1381 (2010)
2000 – 2009
- 2009
- [j5]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009) - [j4]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca:
Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6(1): 9:1-9:21 (2009) - [c10]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible:
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209 - [c9]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172 - [i1]Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles. CoRR abs/0909.4224 (2009) - 2008
- [j3]Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Efficient algorithms for Roman domination on some classes of graphs. Discret. Appl. Math. 156(18): 3400-3415 (2008) - [j2]Mathieu Liedloff:
Finding a dominating set on bipartite graphs. Inf. Process. Lett. 107(5): 154-157 (2008) - [c8]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative Compression and Exact Algorithms. MFCS 2008: 335-346 - [c7]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. WG 2008: 171-182 - 2007
- [b1]Mathieu Liedloff:
Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations. (Excat exponential time algorithms for NP-hard problems : domination, variants and generalizations). University of Metz, France, 2007 - [j1]Dieter Kratsch, Mathieu Liedloff:
An exact algorithm for the minimum dominating clique problem. Theor. Comput. Sci. 385(1-3): 226-240 (2007) - [c6]Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524 - [c5]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518 - 2006
- [c4]Dieter Kratsch, Mathieu Liedloff:
An Exact Algorithm for the Minimum Dominating Clique Problem. IWPEC 2006: 130-141 - [c3]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159 - [c2]Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89 - 2005
- [c1]Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Roman Domination over Some Graph Classes. WG 2005: 103-114
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-09-05 01:13 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:
