#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1989

2018

- This year (3)
- Last 5 years (25)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Meena Mahajan, Venkatesh Raman
- Electronic Colloquium on Computational Complexity
- 1997

In this paper we investigate the parametrized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellowss7]. Let G be an arbitrary graph having n vertices and mâ€¦ (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 determiAbstract-1 nant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known)â€¦ (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 Rm, 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 ofâ€¦ (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)

- 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)

- Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
- CATS
- 2009

Reachability and distance computation are known to be NL-complete in general graphs, but within UL âˆ© co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, evenâ€¦ (More)

- Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan
- J. Comput. Syst. Sci.
- 2008

Given a bipartite graph G = (X âˆªÌ‡ D, E âŠ† X Ã— D), an X-perfect matching is a matching in G that covers every node in X. In this paper we study the following generalisation of the X-perfect matchingâ€¦ (More)

- Meena Mahajan, Anil Shukla
- Inf. Process. Lett.
- 2016