default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Chapelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j5]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)- [j4]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose, Vincent Levorato, Maxime Senot:
Abstract geometrical computation 8: Small machines, accumulations & rationality. J. Comput. Syst. Sci. 97: 182-198 (2018) - 2017
- [j3]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216: 114-129 (2017) - [j2]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) - 2015
- [j1]Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora:
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31(6): 2003-2017 (2015) - 2014
- [c4]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
- [c3]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez:
Exact Algorithms for Weak Roman Domination. IWOCA 2013: 81-93 - [c2]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS 2013: 232-243 - [i3]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
TREEWIDTH and PATHWIDTH parameterized by vertex cover. CoRR abs/1305.0433 (2013) - [i2]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose, Vincent Levorato, Maxime Senot:
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality. CoRR abs/1307.6468 (2013) - 2011
- [b1]Mathieu Chapelle:
Décompositions de graphes : quelques limites et obstructions. (Graphs decompositions: some limites and obstructions). University of Orléans, France, 2011 - 2010
- [i1]Mathieu Chapelle:
Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs. CoRR abs/1004.2642 (2010)
2000 – 2009
- 2009
- [c1]Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca:
Constructing Brambles. MFCS 2009: 223-234
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-08-05 20:22 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:
