On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids

Abstract

Full Citation:

Fahad Panolan, M. S. Ramanujan, Saket Saurabh. On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 566-577, 2015.