Meena Mahajan

Cited by

	All	Since 2019
Citations	2830	1049
h-index	23	14
i10-index	46	19

200

100

150

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320247 10 20 30 23 23 38 34 27 48 64 53 89 112 117 150 140 132 134 132 158 176 159 180 196 177 192 132

Public access

View all

16 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nutan LimayeAssociate Professor, Computer Science, IT University of Copenhagen, DenmarkVerified email at itu.dk
Vinay VJed-i Technologies Pvt LtdVerified email at jed-i.in
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Venkatesh RamanProfessor, IMSc ChennaiVerified email at imsc.res.in
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
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 SaurabhIIT HyderabadVerified email at cse.iith.ac.in
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 SoodAssistant Professor, Indian Institute of Technology, MandiVerified email at iitmandi.ac.in
Tomáš PeitlTU WienVerified email at ac.tuwien.ac.at
Yogesh DahiyaThe Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
Arkadev ChattopadhyayProfessor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Antoine MeyerUniversité Gustave EiffelVerified email at univ-eiffel.fr

Meena Mahajan

The Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), 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 Theoretical Computer Science 442, 13-21, 2012	900	2012
Parameterizing above guaranteed values: MaxSat and MaxCut M Mahajan, V Raman Journal of Algorithms 31 (2), 335-354, 1999	310	1999
Determinant: Combinatorics, Algorithms, and Complexity M Mahajan, V Vinay Chicago Journal of Theoretical Computer Science 1997 (5), 1997	162	1997
Parameterizing above or below guaranteed values M Mahajan, V Raman, S Sikdar Journal of Computer and System Sciences 75 (2), 137-153, 2009	127	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	113	1998
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	66	2004
A combinatorial algorithm for the determinant M Mahajan, V Vinay SODA, 730-738, 1997	58	1997
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	55	2000
Determinant: Old algorithms, new insights M Mahajan, V Vinay SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999	47	1999
Feasible interpolation for QBF resolution calculi O Beyersdorff, L Chew, M Mahajan, A Shukla International Colloquium on Automata, Languages, and Programming, 180-192, 2015	42	2015
Algebraic complexity classes M Mahajan Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014	40	2014
Arithmetic complexity, Kleene closure, and formal power series E Allender, V Arvind, M Mahajan Theory of Computing Systems 36, 303-328, 2003	36*	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	35	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	35	2010
Approximate block sorting M Mahajan, R Rama, V Raman, S Vijaykumar International Journal of Foundations of Computer Science 17 (02), 337-355, 2006	28	2006
On the complexity of matrix rank and rigidity M Mahajan, J Sarma MN International Computer Science Symposium in Russia, 269-280, 2007	27	2007
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	27	2004
The complexity of planarity testing E Allender, M Mahajan Annual Symposium on Theoretical Aspects of Computer Science, 87-98, 2000	26	2000
A combinatorial algorithm for Pfaffians M Mahajan, PR Subramanya, V Vinay International Computing and Combinatorics Conference, 134-143, 1999	26	1999
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma Computational Complexity 18 (3), 377-412, 2009	25	2009

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

Cited by

Co-authors