Sylvain Legay

According to our database1, Sylvain Legay authored at least 12 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the Complexity of Computing Treebreadth.
Algorithmica, 2020

2019
On the Iterated Edge-Biclique Operator.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the edge-biclique graph and the iterated edge-biclique operator.
CoRR, 2019

2018
Safe sets, network majority on weighted trees.
Networks, 2018

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

2017
Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes. (A Few Problems of Algorithm and Complexity in Graph Theory).
PhD thesis, 2017

The complexity of tropical graph homomorphisms.
Discret. Appl. Math., 2017

2016
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discret. Math. Theor. Comput. Sci., 2016

On computing tree and path decompositions with metric constraints on the bags.
CoRR, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Linear time algorithms for weighted offensive and powerful alliances in trees.
Theor. Comput. Sci., 2015


  Loading...