Rohit Vaish, Computer Science and Engineering, IIT Delhi

0 comments

No comments yet. Start the thread.

This semester

COL351
Analysis and Design of Algorithmsrunning now
4 (3-1-0) credits · Slot E · TWF 10:00-11:00
unrated

Earlier

COL8184
Special Topics in Economics and Computation
Sem 2, 2025-26
unrated
COL749
Computational Social Choice
3 (3-0-0) credits · Sem 2, 2024-25
unrated
COL351
Analysis and Design of Algorithmsrunning now
4 (3-1-0) credits · Sem 1, 2024-25
unrated
COL202
Discrete Mathematical Structuresrunning now
4 (3-1-0) credits · Sem 2, 2023-24, Sem 2, 2022-23
unrated
COL866
Special Topics in Algorithms
3 (3-0-0) credits · Sem 1, 2023-24, Sem 1, 2022-23
unrated
COQ303
Seminar Course - IIIrunning now
1 (0-0-2) credits · Sem 1, 2023-24
unrated

Each course has its own page and discussion.

Doing a BTP, MTP, PhD, internship or RA position under Vaish, scored on five separate axes.

Filter by role

All 0

Aggregate bars appear once there are 3 reviews. None yet — if you have worked with this professor, yours would be the first.

Write a supervision reviewStart

Your role *When *

A review is close to worthless without knowing whether this was a one-semester BTP or four years of a PhD.

Mentorship5

1 · left yourself to itclosely guided · 10

Availability5

1 · weeks to get a replyresponds same day · 10

Freedom5

1 · told exactly what to dopicked my own direction · 10

Workload5

1 · lightpunishing · 10

Credit5

1 · contribution went unacknowledgedscrupulously fair on authorship · 10

These are deliberately not all “high is good”. Someone who wants heavy guidance and someone who wants total autonomy are looking for opposite ends of the Freedom axis. Answer honestly about what it was like; readers will judge fit.

Would you work with them again? *

YesNo

Anything else (optional)

One review per person per professor; you can edit it later. Posted under an anonymous handle.

No reviews yet.

Areas listed by the department

AlgorithmsEconomicsArtificial IntelligenceComputational ..

Publications, via OpenAlex

12h-index

506Citations

46Works

13i10

Topic clusters

Game Theory and Voting SystemsOptimization and Search ProblemsConstraint Satisfaction and OptimizationComplexity and Algorithms in GraphsAdvanced Graph Theory Research

Most recent

Finding Representative and Approximately Efficient Committees · arXiv (Cornell University), 2026
Easier, but Not Easy: Nash Welfare under Lexicographic Valuations · arXiv (Cornell University), 2026
Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling · arXiv (Cornell University), 2026
To EFX OR to MMS, That is the Question · arXiv (Cornell University), 2026
Fair Allocation under Conflict Constraints · arXiv (Cornell University), 2026

Matched to Rohit Vaish on OpenAlex. Author matching is by name and institution and can be wrong for common names.

Loading from OpenAlex…