- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

In this paper we investigate the parameterized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellows. LetGbe an arbitrary graph havingnvertices andmedges,… (More)

- Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- WALCOM
- 2009

In the k-means problem, we are given a finite set S of points in $\Re^m$, and integer k ≥ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance… (More)

- Meena Mahajan, Venkatesh Raman, Somnath Sikdar
- J. Comput. Syst. Sci.
- 2009

We consider new parameterizations of NP-optimization problems that have nontrivial lower and/or upper bounds on their optimum solution size. The natural parameter, we argue, is the quantity above the… (More)

- Meena Mahajan, V. Vinay
- Electronic Colloquium on Computational Complexity
- 1997

We prove a new combinatorial characterization of the determinant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) algorithms for the… (More)

- Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
- Electronic Colloquium on Computational Complexity
- 1995

We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circuits. We prove that in the commutative setting, uniform semi-unbounded arithmetic circuits of… (More)

- Eric Allender, Meena Mahajan
- STACS
- 2000

We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L… (More)

- Nutan Limaye, Meena Mahajan, Jayalal Sarma
- Electronic Colloquium on Computational Complexity
- 2006

We revisit monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC 3 in general, and in LogDCFL for the special case of upward… (More)

- Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar
- Int. J. Found. Comput. Sci.
- 2006

We consider the problem BLOCK-SORTING: Given a permutation, sort it by using a minimum number of block moves, where a block is a maximal substring of the permutation which is also a substring of the… (More)

- Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan
- Nord. J. Comput.
- 2007

Given a permutation π, the block sorting problem is to find a shortest series of block moves which, when applied in succession, sorts π. Here a block is a maximal substring of successive integers in… (More)

- Meena Mahajan, Kasturi R. Varadarajan
- STOC
- 2000

It has been known for a long time now that the problem of ounting the number of perfe t mat hings in a planar graph is in NC. This result is based on the notion of a pfaÆan orientation of a graph.… (More)