Bhawani Sankar Panda, Mathematics, IIT Delhi

0 comments

No comments yet. Start the thread.

This semester

MTL6011
Discrete Mathematical Structuresrunning now
4 (3-1-0) credits · Slot A · MTh 08:00-09:30
unrated
MTL7350
Data Structures for Applied Mathematicsrunning now
3 (3-0-0) credits · Slot M · MTh 17:00-18:30
unrated
MTL752
Data Structures for Applied Mathematicsrunning now
4 (3-0-2) credits · Slot M · MTh 17:00-18:30
unrated
MTQ312
Seminar Course - Xiirunning now
0 (0-0-0) credits · Slot X
unrated

Earlier

MTL782
Data Mining
4 (3-0-2) credits · Sem 2, 2025-26, Sem 2, 2023-24, Sem 2, 2022-23
unrated
MTN8001
Introduction to Research Methodology and Communication in Mathematics
Sem 2, 2025-26
unrated
MTQ314
Seminar Course - Xivrunning now
0 (0-0-0) credits · Sem 2, 2023-24
unrated
MTL783
Theory of Computationrunning now
3 (3-0-0) credits · Sem 1, 2022-23
unrated

Each course has its own page and discussion.

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

Graph TheoryGraph AlgorithmsCombinatorial OptimizationMachine Learning on Graphs

Publications, via OpenAlex

17h-index

1398Citations

131Works

34i10

Topic clusters

Advanced Graph Theory ResearchComplexity and Algorithms in GraphsGraph Labeling and Dimension ProblemsMobile Ad Hoc NetworksGraph Theory and Algorithms

Most recent

Complexity and algorithms for subset square coloring in subclasses of chordal graphs · Theoretical Computer Science, 2026
Complexity and Approximation Algorithm of 3-Component Domination in Graphs · Lecture notes in computer science, 2026
A sufficient condition for complete multipartite graphs to be of Type 1 · Discrete Mathematics, 2025
Algorithms and complexity of strongly stable non-crossing matchings · Discrete Applied Mathematics, 2025
Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results · Discrete Optimization, 2025

Matched to Bhawani Sankar Panda on OpenAlex. Author matching is by name and institution and can be wrong for common names.

Loading from OpenAlex…