Share This Author
The planar k-means problem is NP-hard
Parameterizing above Guaranteed Values: MaxSat and MaxCut
This paper investigates the parameterized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellows, and shows that these problems remain fixed-parameter tractable even under this parameterization, and gives an algorithm for finding a cut of size at leastk.
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
Parameterizing above or below guaranteed values
Determinant: Combinatorics, Algorithms, and Complexity
- M. Mahajan, V. Vinay
- Computer Science, MathematicsChicago journal of theoretical computer science
- 31 December 1997
It is proved that the complexity class GapL characterizes the complexity of computing the determinant of matrices over the integers, and a direct proof of this characterization is presented.
The complexity of planarity testing
Approximate Block Sorting
- M. Mahajan, R. Rama, Venkatesh Raman, S. Vijaykumar
- Mathematics, Computer ScienceInt. J. Found. Comput. Sci.
- 1 April 2006
This paper considers the problem of block-SORTING, where a block is a maximal substring of the permutation which is also a subst ring of thepermutation, and proposes a solution by using a minimum number of block moves.
A Combinatorial Algorithm for Pfaffians
This work presents the first completely combinatorial algorithm for computing the Pfaffian in polynomial time and shows that it can be computed in the complexity class GapL; this result was not known before.
Block Sorting: A Characterization and some Heuristics
This paper presents a combinatorial characterization of optimal solutions of block sorting and uses it to prove various computationally important properties of the problem and identifies certain block moves that are provably optimal.
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
This work alters the algorithm of Gallucio and Loebl to show that counting the number of perfect matchings in graphs of small genus is in NC, and rekindles the hope for an NC-algorithm to find a perfect matching in a non-bipart i te planar graph.