19 citations · 31 across the 26 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 2 cited
A Dirac-type Characterization of k-chordal Graphs
R. Krithika, Rogers Mathew, N. S. Narayanaswamy +1
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordles…
cs.DS2012★ 19 cited
Faster Parameterized Algorithms using Linear Programming
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman +2
We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) re…