2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DS2013★ 1 cited
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
M. S. Ramanujan, Saket Saurabh
A skew-symmetric graph is a directed graph with an involution on the set of vertices and arcs. In this paper, we introduce a separation problem, -Skew-Symm…
cs.CR2012★ 2 cited
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
J. Crampton, R. Crowston, G. Gutin +2
The workflow satisfiability problem is concerned with determining whether it is possible to find an allocation of authorized users to the steps in a workflow in such a way that all…
cs.DS2012
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan +2
We study the parameterized complexity of the directed variant of the classical {\sc Steiner Tree} problem on various classes of directed sparse graphs. While the parameterized comp…