Meena Mahajan

Cited by

	All	Since 2017
Citations	2448	996
h-index	21	14
i10-index	45	16

240

120

180

19981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120227 20 30 22 18 36 33 26 45 65 52 96 141 120 150 145 137 137 134 161 168 159 179 221 106

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

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
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Kasturi VaradarajanProfessor of Computer Science, University of IowaVerified email at uiowa.edu
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Anil ShuklaDepartment of CSE, IIT RoparVerified email at iitrpr.ac.in
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaVerified email at cse.iitm.ac.in
Nitin SaurabhTechnion - IITVerified email at cs.technion.ac.il
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.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
Gaurav SoodSenior Research Fellow, The Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Antoine MeyerUniversité Gustave EiffelVerified email at univ-eiffel.fr
Vinodchandran VariyamProfessor, Computer Science and Engineering, University of Nebraska-LincolnVerified email at cse.unl.edu
Srikanth SrinivasanDepartment of Mathematics, Indian Institute of Technology BombayVerified email at math.iitb.ac.in
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Jing-Tang Keith JangUniversity of Texas at AustinVerified email at cs.utexas.edu

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	745	2009
Parameterizing above guaranteed values: MaxSat and MaxCut M Mahajan, V Raman Journal of Algorithms 31 (2), 335-354, 1999	279	1999
Determinant: Combinatorics, Algorithms, and Complexity M Mahajan, V Vinay Chicago Journal of Theoretical Computer Science 1997 (5), 1997	140*	1997
Parameterizing above or below guaranteed values M Mahajan, V Raman, S Sikdar Journal of Computer and System Sciences 75 (2), 137-153, 2009	111	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	110	1998
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	61	2004
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	52	2000
Determinant: Old algorithms, new insights M Mahajan, V Vinay SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999	49	1999
A combinatorial algorithm for the determinant M Mahajan, V Vinay SODA, 730-738, 1997	44	1997
Feasible Interpolation for QBF Resolution Calculi A Shukla, M Mahajan, L Chew, O Beyersdorff Logical Methods in Computer Science 13, 2017	40*	2017
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	34	2010
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	33	2017
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
Algebraic complexity classes M Mahajan Perspectives in Computational Complexity, 51-75, 2014	28	2014
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma Computational Complexity 18 (3), 377-412, 2009	26	2009
Simultaneous matchings: Hardness and approximation M Kutz, K Elbassioni, I Katriel, M Mahajan Journal of Computer and System Sciences 74 (5), 884-897, 2008	25	2008
On the complexity of matrix rank and rigidity M Mahajan, J Sarma MN International Computer Science Symposium in Russia, 269-280, 2007	25	2007
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
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	25	2004
The complexity of planarity testing E Allender, M Mahajan Annual Symposium on Theoretical Aspects of Computer Science, 87-98, 2000	23	2000

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

Follow this author

Cited by

Co-authors