On the Parameterized Approximability of Contraction to Classes of Chordal Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Spoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. In Jaroslaw Byrka, Raghu Meka, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. Volume 176 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

This author has not been identified. Look up 'Spoorthy Gunda' in GoogleThis author has not been identified. Look up 'Pallavi Jain 0001' in GoogleThis author has not been identified. Look up 'Daniel Lokshtanov' in GoogleThis author has not been identified. Look up 'Saket Saurabh 0001' in GoogleThis author has not been identified. Look up 'Prafullkumar Tale' in Google

runs on WebDSL