AcaRevival Initiative

Experienced academic misconduct or bullying? We're building a real weapon against it.

Read Manifesto →
MC

Moses Charikar

Stanford University

No ratings yetBe the first to rate
Loading...

About Moses Charikar at Stanford University (Stanford)

Moses Charikar is a researcher based at Stanford University. They specialize in Complexity and Algorithms in Graphs, Optimization and Search Problems, and Advanced Graph Theory Research, with ongoing contributions to these areas. Their academic career is distinguished by over 14,749 citations, demonstrating their leading role in the global research community. With a formidable H-index of 53, Moses Charikar continues to drive innovation in their area of expertise.

Research Areas

Complexity and Algorithms in GraphsOptimization and Search ProblemsAdvanced Graph Theory ResearchMachine Learning and AlgorithmsAlgorithms and Data Compression

Academic Impact Matrix

Research output metrics for Moses Charikar aggregated from public academic databases. Student lab experience data is pending.

Academic data verified · April 2026 · Next sync: May 2026

Research Output

Total Citations14,749

Top 15% in field

Publications208

Active researcher

h-index53

Field leader

i10-index111

Broad impact

Lab Environment

No lab data yet for Moses Charikar

+ Contribute First Review
  • Supervisionawaiting data
  • Responsivenessawaiting data
  • Fundingawaiting data
  • Communicationawaiting data
  • Work-Life Balanceawaiting data

Reviews (0)

No reviews yet for this supervisor.

Be the first to share your experience!

Is your PI driving you crazy?

Featured Article

The Sunday Night Dread: Surviving a Micromanaging PhD Supervisor

Real advice from PhD students on recognizing and navigating difficult supervisor relationships

Your experience matters. After reading the guide, share your review to help other PhD students.

Frequently Asked Questions

Not sure how to interpret mixed signals? A structured decision guide can help you think through high-risk supervision choices more clearly. Download the free guide.