Arundhati Raychaudhuri is a Professor of Mathematics at College of Staten Island, CUNY. She has a PhD degree in Mathematics from Rutgers University, an MS degrees in Electrical engineering and in Applied Math from SUNY, StonyBrook and a B.Tech (Hons.) degree in Electrical Engineering from the Indian Institute of Technology (IIT), Kharagpur, India. Her research and teaching interests are in combinatorics, graph theory and operations research. Prof. Raychaudhuri served as Chair of the Mathematics department at CSI during the period 2001-2008.
Degrees
B. Tech, Indian Institute of Technology
M. S. in Electrical Engineering, SUNY, StonyBrook
M. S. in Applied mathematics, SUNY, StonyBrook
Ph. D in Mathematics, Rutgers University
1. Generalized Competition Graphs and Their Applications," (with F.S. Roberts), Methods of Operations Research, P. Brucker and R. Pauly (eds.), Anton Hain, Konigstein, West Germany, (1985), 295-311.
2. "On Powers of Interval and Unit Interval Graphs." Congressus Numerantium, Volume 59, (1987), 235-242.
3. "Intersection Number and Edge Clique Graphs of Chordal and Strongly Chordal Graphs," Congressus Numerantium, Volume 67, (1988), 197-204.
4. "Optimal Scheduling of Subtasks under Compatibility and Precedence Constraints," Congressus Numerantium, (1990) Volume 73, 223-234.
5. "Edge clique Graphs of Some Important Classes of Graphs," Ars Combinatoria, 32, (1991) 269-278.
6. "On Powers of Strongly Chordal and Circular Arc Graphs," Ars Combinatoria, 34, (1992), 147-160.
7. "Optimal Multiple Interval Assignments in Traffic Phasing," Discrete Applied Mathematics, 40, (1992), 319-332.
8. "Further Results on T Coloring and Frequency Assignment Problems." SIAM Journal on Discrete Mathematics, Vol.7, No.4, (1994), 605-613
9. "Total Interval Number of a Tree and Hamiltonian Completion Number of Its Line Graph," Journal of Information Letters, Vol. 56, (1995), 299-306.
10. "On Hamiltonian Path Completion Number of an Interval Graph" Congressus Numerantium, Volume 138, (1999), 193-198.
11. “A Note on Unit Interval Number and Proper Interval Number of Graphs”, Ars Combinatoria, Vol.57, (2000), 83-86.
12. A Note on Distance-k Labeling and kth power of Graphs", Congressus Numerantium, Volume 144, (2000), 89-95.
13. M. “Distance-2 Labeling of Strongly Chordal Graphs”, Congressus Numeratium, Volume 149, (2001), 55-63
14. “Optimal Hamiltonian Completions and Path Covers for Trees and a reduction to Maximum flow” (with D. Franzblau), Australian and New Zealand Industrial and Applied Mathematics Journal, (formerly known as Journal of Australian Mathematics, Series B), Vol.44, April (2002), 193-204.
15. “Distance-2 Labeling of Threshold Graphs”, Congressus Numerantium, Volume 199, (2009), 57-73.
16. Distance -k Labeling of some subclasses of strongly chordal graphs Congressus Numerantium, Volume 230, (2018), 267-292
