Остановите войну!
for scientists:
default search action
Mathieu Liedloff
- > Home > Persons > Mathieu Liedloff
Publications
- 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
- [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) - 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 - 2015
- [c24]Dieter Kratsch, Mathieu Liedloff, Daniel Meister:
End-Vertices of Graph Search Algorithms. CIAC 2015: 300-312 - 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 - 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) - [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 - 2012
- [j14]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (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) - [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) - 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) - [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 - 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
- [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
- [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
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-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint