Laurent Lyaudet

According to our database, Laurent Lyaudet authored at least 9 papers between 2007 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

On finite width questionable representations of orders.

Laurent Lyaudet

CoRR, 2019

2018

A class of orders with linear? time sorting algorithm.

Laurent Lyaudet

CoRR, 2018

2013

Distance Preserving Subtrees in Minimum Average Distance Spanning Trees.

Laurent Lyaudet, Paulin Melatagia Yonta, Maurice Tchuenté, René Ndoundam

Discret. Math. Algorithms Appl., 2013

2010

NP-hard and linear variants of hypergraph partitioning.

Laurent Lyaudet

Theor. Comput. Sci., 2010

On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth.

Uffe Flarup, Laurent Lyaudet

Theory Comput. Syst., 2010

Partitions versus sets: A case of duality.

Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé

Eur. J. Comb., 2010

2008

On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).

Uffe Flarup, Laurent Lyaudet

Proceedings of the Computer Science, 2008

2007

Graphes et hypergraphes : complexités algorithmique et algébrique. (Graphs and hypergraphs : algorithmic and algebraic complexities).

Laurent Lyaudet

PhD thesis, 2007

On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices.

Uffe Flarup, Pascal Koiran, Laurent Lyaudet

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007