![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Laurent Lyaudet
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i5]Laurent Lyaudet:
On finite width questionable representations of orders. CoRR abs/1903.02028 (2019) - 2018
- [i4]Laurent Lyaudet:
A class of orders with linear? time sorting algorithm. CoRR abs/1809.00954 (2018) - 2013
- [j4]Laurent Lyaudet, Paulin Melatagia Yonta
, Maurice Tchuenté, René Ndoundam:
Distance Preserving Subtrees in Minimum Average Distance Spanning Trees. Discret. Math. Algorithms Appl. 5(3) (2013) - 2010
- [j3]Laurent Lyaudet, Frédéric Mazoit
, Stéphan Thomassé
:
Partitions versus sets: A case of duality. Eur. J. Comb. 31(3): 681-687 (2010) - [j2]Uffe Flarup, Laurent Lyaudet:
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth. Theory Comput. Syst. 46(4): 761-791 (2010) - [j1]Laurent Lyaudet:
NP-hard and linear variants of hypergraph partitioning. Theor. Comput. Sci. 411(1): 10-21 (2010)
2000 – 2009
- 2009
- [i3]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
:
Partitions versus sets : a case of duality. CoRR abs/0903.2100 (2009) - 2008
- [c2]Uffe Flarup, Laurent Lyaudet:
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract). CSR 2008: 180-193 - [i2]Uffe Flarup, Laurent Lyaudet:
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth. CoRR abs/0801.3408 (2008) - 2007
- [b1]Laurent Lyaudet:
Graphes et hypergraphes : complexités algorithmique et algébrique. (Graphs and hypergraphs : algorithmic and algebraic complexities). École normale supérieure de Lyon, France, 2007 - [c1]Uffe Flarup, Pascal Koiran, Laurent Lyaudet:
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. ISAAC 2007: 124-136 - [i1]Laurent Lyaudet, Pascal Koiran, Uffe Flarup:
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices. CoRR abs/0705.3751 (2007)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint