|Algorithms Seminar||Research Interests|
Algorithms for Modern Data Sets
Algorithms for Data Science
Course Notes: Notes on Algorithm DesignFree Text Book: Introduction to Theory of Computation
analysis, and implementation of algorithms:
I am interested in sequential, parallel, distributed, multi-core, external memory, big and small data algorithms for problems that fit within the framework of the design and analysis of algorithms. I mainly work in Geometric and Graph Algorithms.
Discrete Mathematics: All
sorts of discrete math problems - problems in graph
theory, combinatorics, building discrete structures,
finding applications in other fields.
web-page for the seminars in our group and I am
interested in most of these topics.
Have a look into my publications and this will give some ideas on my research interests.
I am looking for Ph.D., Masters and Honors Students.
Honors Thesis/Project will typically be implementation oriented, unless the student comes up with an interesting topic along my research interests.
Masters thesis will have a mix of theory and implementation in the broad area of the design and analysis of algorithms. I do not supervise Masters Projects.
Ph.D. Thesis will have foundational theoretical work possibly supported by experimental studies. The research topics include computational geometry, graph algorithms, discrete mathematics, and problems that in general obey the framework of the design and analysis of discrete algorithms. (See the recent journals and conference proceedings, e.g., Jl. ACM, SIAM Jl. Computing, Algorithmica, Discrete and Computational Geometry, CGTA, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Proceedings of Computational Geometry Conference, CCCGs). For list of my graduate students refer to my CV. The following requirements are essential if you want me to supervise: