On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Acte de colloque

Open Access

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau et Uéverton dos Santos Souza

10th International Conference on Combinatorial Optimization and Applications, Vol.LNCS(10043), pp.423-437

Combinatorial Optimization and Applications

COCOA: Conference on Combinatorial Optimization and Applications (Hong Kong, China, 16/12/2016)

2016

Fichiers et liens (2)

url

Find in HALAfficher

url

https://doi.org/10.1007/978-3-319-48749-6_31Afficher

Published (Version of record) Ouvrir

1 Consultations de la notice

Titre: On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs
Créateurs - sans rôle: Sancrey Rodrigues Alves - Fundação de Apoio à Escola Técnica
Konrad K. Dabrowski - Durham University
Luerbio Faria - Universidade do Estado do Rio de Janeiro
Sulamita Klein - Universidade Federal do Rio de Janeiro
Ignasi Sau - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Uéverton dos Santos Souza - Centro Federal de Educação Tecnológica Celso Suckow da Fonseca [Rio de Janeiro]
Détails de publication: 10th International Conference on Combinatorial Optimization and Applications, Vol.LNCS(10043), pp.423-437
Colloque: COCOA: Conference on Combinatorial Optimization and Applications (Hong Kong, China, 16/12/2016)
Publications en série: Combinatorial Optimization and Applications
Identifiants: 99150336209311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-01481787