Sylvain Legay

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the edge‐biclique graph and the iterated edge‐biclique operator Journal of Graph Theory	2023-10-05	Paper
On the iterated edge-biclique operator (available as arXiv preprint)	2022-04-27	Paper
On the complexity of computing treebreadth Algorithmica	2020-04-14	Paper
Safe sets, network majority on weighted trees Networks	2019-08-12	Paper
Safe sets in graphs: graph classes and structural parameters Journal of Combinatorial Optimization	2018-12-06	Paper
The complexity of tropical graph homomorphisms Discrete Applied Mathematics	2017-07-27	Paper
Network majority on tree topological network	2017-02-13	Paper
Safe sets in graphs: graph classes and structural parameters Combinatorial Optimization and Applications	2017-02-01	Paper
On the complexity of computing treebreadth Lecture Notes in Computer Science	2016-09-29	Paper
Connected tropical subgraphs in vertex-colored graphs Discrete Mathematics and Theoretical Computer Science. DMTCS	2016-08-23	Paper
Linear time algorithms for weighted offensive and powerful alliances in trees Theoretical Computer Science	2015-04-29	Paper

Research outcomes over time

This page was built for person: Sylvain Legay