default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Mazoit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c7]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
:
Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. STACS 2025: 30:1-30:18- 2024
- [c6]Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas:
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC 2024: 538-548 - 2023
- [c5]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - [i6]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR abs/2307.06635 (2023) - [i5]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. CoRR abs/2307.14292 (2023) - [i4]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR abs/2307.16593 (2023)
2010 – 2019
- 2012
- [j9]Frédéric Mazoit:
Tree-width of hypergraphs and surface duality. J. Comb. Theory B 102(3): 671-687 (2012) - 2010
- [j8]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé:
Partitions versus sets: A case of duality. Eur. J. Comb. 31(3): 681-687 (2010) - [i3]Frédéric Mazoit:
Tree-width of hypergraphs and surface duality. CoRR abs/1006.3167 (2010)
2000 – 2009
- 2009
- [j7]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. 157(12): 2726-2736 (2009) - [j6]Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé:
Submodular partition functions. Discret. Math. 309(20): 6000-6008 (2009) - [j5]Frédéric Mazoit:
Tree-width of graphs and surface duality. Electron. Notes Discret. Math. 32: 93-97 (2009) - [c4]Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca:
Constructing Brambles. MFCS 2009: 223-234 - [i2]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé:
Partitions versus sets : a case of duality. CoRR abs/0903.2100 (2009) - 2008
- [j4]Frédéric Mazoit, Nicolas Nisse:
Monotonicity of non-deterministic graph searching. Theor. Comput. Sci. 399(3): 169-178 (2008) - [i1]Frédéric Mazoit:
Tree-width of hypergraphs and surface duality. CoRR abs/0812.2990 (2008) - 2007
- [c3]Frédéric Mazoit, Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching. WG 2007: 33-44 - 2006
- [j3]Frédéric Mazoit:
Listing all the minimal separators of a 3-connected planar graph. Discret. Math. 306(3): 372-380 (2006) - [c2]Frédéric Mazoit:
The Branch-Width of Circular-Arc Graphs. LATIN 2006: 727-736 - 2005
- [c1]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384 - 2004
- [b1]Frédéric Mazoit:
Décomposition algorithmique des graphes. (algorithmic decomposition of graphs). École normale supérieure de Lyon, France, 2004 - 2003
- [j2]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Chordal embeddings of planar graphs. Discret. Math. 273(1-3): 85-102 (2003) - 2001
- [j1]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Treewidth of planar graphs: connections with duality. Electron. Notes Discret. Math. 10: 34-38 (2001)
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 2025-04-03 01:21 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:
