| Ph.D. (Ohio State University), Professor 305 Julian Science Center Phone: (765) 658-4738 E-mail: manickam@depauw.edu |
![]() |
Research
[1] N. Manickam. Distribution Invariants of Association Schemes. Ph.D. Thesis, The Ohio State University (1986).
[2] N. Manickam and T. Bier. The First Distribution Invariant of the Johnson Scheme. SEAMS Bull.Math. Vol.11 no.1(1987) 61-68
[3] N. Manickam. W-Complement d-spreads and Singleton systems. European Journal of Combinatorics(1987) 8, 437-439.
[4] N.Manickam and N. M. Singhi. First Distribution Invariants and E-K-R theorems. Journal of Combinatorial Theory(A), May 1988, pages 91-103.
[5] N. Manickam.Distribution Invariants of Association schemes. In Proc.Int. Conf. On Combinatorics, Graph Theory, and Computing, page 41 (1988).
[6] N. Manickam. Distribution Invariants of Association schemes.Congress Numerantum 61 (1988), Pages 121-131.
[7] N. Manickam and D. Miklos. On the number of non-negative partial sums of a non-negative sum. COLLOQUIA MATHMATICA SOCIETATIS JANOS BOLYAI, 52(1987), pages 385-392.
[8] N Manickam. First Distributed Sets in the Association Scheme of Bilinear Forms. Colloquia Mathematica Societatis Janos Bolyai (1991), Vol 60, Pages 465-468.
[9] N. Manickam. Number of Weighted Edges In a Weighted Graph. Graph Theory Notes of New York, Vol XXII, (1992).
[10] N. Manickam. Algebraic Combinatorics, NSF proposal, Proposal Number DMS-9202357.
[11] N. Manickam, N. S. V. Rao and V. Protoposcu. Cooperative Terrain Model Acquisition by a team of Two or Three Point-Robots. Proceedings of the 1996 IEEE International Conference on Robotics and Automation, pages 1427-1433,1996.
[12] N. Manickam, N. S. V. Rao and V. Protoposcu. Connectivity of Visibility Graphs and Terrain Model Acquisition by Robot Teams. Congress Numerantum 120 1996,pages 129-137.
[13] N. Manickam, N. S. V. Rao and V. Protoposcu. Connectivity of Visibility Graphs and Terrain Model Acquisition by Robot Teams. In Proc. Int. Conf. On Combinatorics, Graph Theory,and Computing, page 41, 1996.
[14] N. Manickam, C. Connor and N. Fouts. A Simulation of Robotic Model Acquisition of Unknown Terrains., seventh Annual Argonne Symposium for Undergraduate Research, Argonne National Laboratory , November 1996, Abstracts with Programs.
[15] N. Manickam. Association Schemes. Topics in Discrete Mathematics. New Age International Publishers, pages 139-149, 1997.
[16] N. Manickam, C. Connor , D.King , S. Pixley and H.Roinstead. Terrain Modeling and Path Planning Simulations by Robot Teams. Eighth Annual Argonne Symposium for Undergraduate Research, Argonne National Laboratory, November 1997, Abstracts with Programs.
[17] N. Manickam, C. Connor , D.King , S. Pixley and H.Roinstead. Terrain Modeling and Path Planning Simulations by Robot Teams. In Proc of Tenth Annual Butler University Undergraduate Research Conference, April 10th 1997.
[18] N. Manickam and Brandon Whitham. Uniform Central Graphs.In Proc Tenth Annual Butler University Undergraduate Research Conference, April 10th 1998.
[19] N. Manickam and S. Y. Choi. Uniform Central Graphs. In Proc.Int. Conf. On Combinatorics, Graph Theory and Computing, page 112, 1998.
[20] N. Manickam and S. Y. Choi. Uniform Central Graphs. Congress Numerantum, 130, pp.89-94, 1998.
[21] N. Manickam, P. Avilez, Kasube and Pitzer. Use of Single Paths and Multipaths for Solving General Quickest Path Problem. In Proc. Ninth Annual Argonne Symposium for Undergraduate Research, Argonne National Laboratory, November 1998.
[22] N. Manickam, P. Avilez, Kasube and Pitzer. Use of Single Paths and Multipaths for Solving General Quickest Path Problem, submitted.
[23] N. Manickam. Distribution Invariants of Association Schemes. In Proc. 935th American Mathematical Society Meeting, DePaul University, Page 404,1998.
[24] N. Manickam, Ann Grace, Jason Miele and Katherine Berinato. Multi-Path Networks: The Quicker Way To Transfer Messages. In Proc. Tenth Annual Argonne Symposium for Undergraduate Research, Argonne National Laboratory, November 1999.
[25] N. Manickam and N. S. V. Rao. On General Quickest Path problem and Path-Tables. In Proc. Int. Conf. On Combinatorics, Graph Theory, and Computing, page 127,2001.
[26] N. Manickam and N. S. V. Rao. Cooperative Terrain Model Acquisition by Robot Teams. Proc. Int. Conf. On Combinatorics, Graph Theory, and Computing, page 131, 2001.
[27] N. Manickam, N. S.V. Rao, W. Grimmell, S. Radhakrishnan and Y.C. Bang. Quickest Paths For Different Network Router Mechanisms. Proceedings of ACDOM International Conference to be in Dec 2001.
[28] N. Manickam and N. S. V. Rao. General Quickest Paths and Path-Tables. International Journal of Computer systems: Science and Engineering (2002) 4/5 235-239.
[29] N. Manickam, Application to Terrain Model Acquisition using Robot Teams” was published in Rev. Bull. Cal. Math Soc., 14, (2) 179-188 (2006).
[30] N. Manickam, A survey of results on distribution invariants of association schemes, Proceedings of Algebraic Combinatorics International Conference, Sendai, 113-118, June 2006.
Some Papers I Have Presented
1. American Mathematical Society meeting - held in San Antonio during the last week of January 1986.
Title: Distribution Invariants and E-K-R theorems
2. Southeastern International Conference on Graph theory, Combinatorics and Computer science - held in Boca Raton, Fl, during the last week of Feb 1986.
Title: Existence of W-complement d-spreads.
3. I was invited to give a colloquium talk at Western Michigan University, Kalamazoo, on November 5, 87.
Title: Distribution Invariants of Association Schemes.
4. I gave a talk in a discrete math seminar held on Nov13, 87, at the Wright State University in Dayton, Ohio.
Title: Number of non-negative partial sums of a non-negative sum.
5. Presented a paper in the AMS winter meeting at New Orleans in Jan 1985.
6. Presented a paper in the Denison regional conference in
April 85.
7. Presented a paper on "Partial Sums" at the R.C. Bose memorial conference, Calcutta, in Dec 88.
8. Delivered an invited talk on 'Combinatories' during Oct. 1988 in NGM College, India.
9. Delivered and invited talk on 'Distribution Invariants Association Schemes' in Central College, Bangolore (Feb.89)
10. Also gave a Seminar on the same topic as in (3) in Tata Institute of Fundamental Research, Bangalore, (March 89)India.
11. Gave a Seminar on 'Distribution Invariants and EKR Theorems in Computer and Automation Science Dept., Indian Institute of Science, Bangalore, India.
12. One of the invited speakers at a seminar on 'Recent Developments in Applied Mathematics' held at NGM College, India.
13. Invited to deliver a few lectures on 'Association Schemes" in All India Winter School in Discrete Mathematics held at Poona Univ., India, from Nov. 9-Nov. 26, 1989.
14. Delivered an invited lecture on 'Four Color Theorem' at Bangalore University during the 2nd week of Aug. 1990.
15. Participated and gave an invited talk in an international conference on "Sets, Graphs and Numbers" held in Budapest, HUNGARY, during Jan 20-26, 1991.
16. Participated and presented a paper in an international conference on "Designs, Codes and Finite Geometry" held at Shanghai Jiao Tong University, Shanghai, CHINA, during May 23-28.
17. Participated and gave an invited talk in an international conference on "Algebraic Combinatorics" held at Kyushu University, Fukuoka, JAPAN, during Nov 22-23, 1993.
18. Gave a seminar on the topic "some recent developments in algebraic combinatorics" in Seoul National University, SOUTH KOREA, Dec 1993.
19. Gave a Colloquium talk in the CESAR lab, ORNL, TN, Feb 1996.
20. Presented the paper "Connectivity of Visibility Graphs and Terrain Model Acquisition by Robot Teams" in the Southeastern international conference on Combinatorics, Graph Theory and Computing held Baton Rouge, LA, in Feb 1996.
21. Gave a talk on ‘Uniform Central Graphs’ at the Southeastern international conference in March 97.
22. Presented a paper titled "Distribution Invariants of Association Schemes" in AMS meeting at Detroit in May 97.
23. During my visit to India in Aug 98, I gave talks on ‘computer Networks’ at Bharathiyar University, N.G.M. CollegeAnd Kumaraguru Engineering College.
24. Gave a talk on ‘Distribution Invariants of the Johnson Scheme’ at the 935th AMS meeting in Chicago in September 98.
25. Presented a paper titled ‘Cooperative Terrain Model Acquisition by Robot Teams’ at the Southeastern International Conference in March 2001.
26. Presented a paper titled ‘Terrain Model Acquisition by Robot Teams’ at MIGHTY Conference XXXIV on Oct 13, 2001.
27. I have been invited to give a Math and Computer Science combined colloquium talk at Ball State University on November 28, 2001.
28. Several talks given at various places during my last two visits to India.
29. Gave in invited inaugural address at “International Symposium on Recent Advances in Mathematics and its Applications” on Dec17, 2005, organized by the Calcutta Mathematical Society.
30. Gave an invited on the topic “A survey of results on Distribution Invariants of Association Schemes” in an international conference on Algebraic Combinatorics held in Sendai, Japan during the last week of June.
31. I was invited by the Calcutta Mathematical Society to give one of their main invited talks on the topic “A Partial Sum Problem” in their annual conference “International Symposium on Recent Advances in Mathematics and its Applications”. I delivered this talk on Dec 18, 2006.
32. gave a talk on “Terrain Model Acquisition by Robot Teams” in the Midwest Graph Theory Conference “MIGHTY” held at The Ohio State University on April 18, 2006.
Honors and Memberships
UGC Merit Scholarship at Panjab University
Indian National Scholarship for study abroad.
Pew Summer Research Grant
NSF-REU Summer Research Grant(1995-99)
Member of American Mathematical Society
Member of Indian Association of Mathematics
Visiting Scientist, Oak Ridge National Lab
Faculty Fellowship at DePauw
Ian Rolland Endowed Chair
University Professor