Meena Mahajan - Google Scholar Citations

Cited by

	All	Since 2015
Citations	1890	799
h-index	18	12
i10-index	32	15

180

135

1997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920207 9 19 25 22 20 35 31 25 42 56 49 87 136 109 137 136 124 127 120 164 179 158 48

Co-authors

Nutan LimayeAssociate Professor, Computer Science and Engineering, Indian Institute of Technology, Bombay, IndiaVerified email at cse.iitb.ac.in
Vinay VAti Motors Pvt LtdVerified email at atimotors.com
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in
Kasturi VaradarajanProfessor of Computer Science, University of IowaVerified email at uiowa.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaVerified email at cse.iitm.ac.in
Leroy ChewResearch Fellow, University of LeedsVerified email at leeds.ac.uk
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Nitin SaurabhMax Planck Intitute for InformaticsVerified email at mpi-inf.mpg.de
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Raghav KulkarniCentre for Quantum Technologies, SingaporeVerified email at cs.uchicago.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Antoine MeyerUniversité Paris Est - Marne-la-ValléeVerified email at univ-mlv.fr
Srikanth SrinivasanDepartment of Mathematics, Indian Institute of Technology BombayVerified email at math.iitb.ac.in

Meena Mahajan

Professor at The Institute of Mathematical Sciences, HBNI, Chennai, India

Verified email at imsc.res.in - Homepage

computational complexity discrete algorithms automata theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The planar k-means problem is NP-hard M Mahajan, P Nimbhorkar, K Varadarajan International Workshop on Algorithms and Computation, 274-285, 2009	517	2009
Parameterizing above guaranteed values: MaxSat and MaxCut M Mahajan, V Raman J. Algorithms 31 (2), 335-354, 1999	247	1999
A combinatorial algorithm for the determinant M Mahajan, V Vinay SODA, 730-738, 1997	145*	1997
Parameterizing above or below guaranteed values M Mahajan, V Raman, S Sikdar Journal of Computer and System Sciences 75 (2), 137-153, 2009	107*	2009
Non-commutative arithmetic circuits: depth reduction and size lower bounds E Allender, J Jiao, M Mahajan, V Vinay Theoretical Computer Science 209 (1-2), 47-86, 1998	96	1998
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117, 2004	72*	2004
Determinant: Old algorithms, new insights M Mahajan, V Vinay SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999	42	1999
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs M Mahajan, KR Varadarajan Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	41	2000
The combinatorial approach yields an NC algorithm for computing Pfaffians M Mahajan, PR Subramanya, V Vinay Discrete Applied Mathematics 143 (1-3), 1-16, 2004	39*	2004
Simultaneous matchings: Hardness and approximation M Kutz, K Elbassioni, I Katriel, M Mahajan Journal of Computer and System Sciences 74 (5), 884-897, 2008	35*	2008
Feasible interpolation for QBF resolution calculi O Beyersdorff, L Chew, M Mahajan, A Shukla International Colloquium on Automata, Languages, and Programming, 180-192, 2015	33	2015
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma Computational Complexity 18 (3), 377, 2009	33*	2009
Planarity, determinants, permanents, and (unique) matchings S Datta, R Kulkarni, N Limaye, M Mahajan ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010	31	2010
Arithmetic complexity, Kleene closure, and formal power series E Allender, V Arvind, M Mahajan Theory of Computing Systems 36 (4), 303-328, 2003	30*	2003
Are Short Proofs Narrow? QBF Resolution Is Not So Simple O Beyersdorff, L Chew, M Mahajan, A Shukla ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017	28	2017
Approximate block sorting M Mahajan, R Rama, V Raman, S Vijaykumar International Journal of Foundations of Computer Science 17 (02), 337-355, 2006	25*	2006
On the complexity of matrix rank and rigidity M Mahajan, J Sarma International Computer Science Symposium in Russia, 269-280, 2007	23	2007
Arithmetizing Classes Around NC^1 and L N Limaye, M Mahajan, BVR Rao Theory of Computing Systems 46 (3), 499-522, 2010	19*	2010
Small-space analogues of Valiant’s classes M Mahajan, BVR Rao International Symposium on Fundamentals of Computation Theory, 250-261, 2009	18	2009
Longest paths in planar dags in unambiguous logspace N Limaye, M Mahajan, P Nimbhorkar arXiv preprint arXiv:0802.1699, 2008	17	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors