Keerti Choudhary, Computer Science and Engineering, IIT Delhi

0 comments

No comments yet. Start the thread.

This semester

COL7004
Mathematical Foundations of Computingrunning now
4 (3-1-0) credits · Slot A · MTh 08:00-09:30
unrated

Earlier

COL1000
Introduction to Programmingrunning now
4 (3-0-2) credits · Sem 2, 2025-26
unrated
COL7151
Algorithmic Graph Theory
3 (3-0-0) credits · Sem 1, 2025-26
unrated
COL751
Algorithmic Graph Theory
3 (3-0-0) credits · Sem 1, 2025-26, Sem 1, 2024-25, Sem 1, 2023-24
unrated
COL351
Analysis and Design of Algorithmsrunning now
4 (3-1-0) credits · Sem 2, 2024-25, Sem 2, 2023-24, Sem 1, 2022-23
unrated
COQ301
Seminar Course - Irunning now
1 (0-0-2) credits · Sem 1, 2024-25
unrated
COQ304
Seminar Course - IVrunning now
1 (0-0-2) credits · Sem 1, 2023-24
unrated
COL106
Data Structures & Algorithms
5 (3-0-4) credits · Sem 2, 2022-23
unrated

Each course has its own page and discussion.

Doing a BTP, MTP, PhD, internship or RA position under Choudhary, 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

Fault-Tolerant AlgorithmsExtremal Graph StructuresDynamic ..

Publications, via OpenAlex

10h-index

200Citations

50Works

10i10

Topic clusters

Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchGraph Theory and AlgorithmsAlgorithms and Data CompressionGraph Labeling and Dimension Problems

Most recent

Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications · arXiv (Cornell University), 2026
Near-Optimal Replacement Path Coverings · arXiv (Cornell University), 2026
Simpler and Improved Replacement Path Coverings · Repository KITopen (Karlsruhe Institute of Technology), 2026
Fault-Tolerant ST-Diameter Oracles · Algorithmica, 2026
Simpler and Improved Replacement Path Coverings · arXiv (Cornell University), 2026

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

Loading from OpenAlex…