Anil Maheshwari   (अनिल माहेश्वरी)

    Professor & Graduate Director
    Computational Geometry Lab
     School of Computer Science
    Carleton University
    1125 Colonel By Drive, Ottawa,
     ON, K1S 5B6,  Canada

    E-mail: anil@scs.carleton.ca
    Phone: + 1-613 - 520 - 2600 Ext. 3907

Useful Pointers

Algorithms Seminar Research Interests
 
My Schedule General

CV

Teaching

    COMP 5703   COMP 3801   

Publications

    See: DBLPMathSciNet,  ScholarScopus

    Text Book: 
Introduction to Theory of Computation

    Course Notes:  Topics in Algorithm Design 

Upcoming Events:

    3rd CALDAM & Indo-German Workshop (Goa, February 2017)


Research Interests

Design, analysis, and implementation of  algorithms:
My main interest is in all sorts of algorithmic problems in computational geometry and graph theory. I am interested in sequential, parallel, distributed, multi-core,  external memory, big and small data algorithms for problems which fit within the framework of the design and analysis of algorithms.  

Discrete Mathematics: All sorts of discrete math problems - problems in graph theory, combinatorics, building discrete structures, finding applications in other fields.

I am also interested in developing innovative ways to teach  Mathematics to School Age Children, especially designing material on the web. Also check this 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.

Students looking for a supervisor:
I am looking for Ph.D., Masters and Honors Students. Honors Project will typically be implementation oriented, unless the student comes up with an interesting topic along my research interests. Masters thesis will typically have a mix of theory and implementation in the broad area of design and analysis of algorithms. Ph.D. Thesis will have foundational theoretical work possibly supported by experimental studies. The research topics include parallel computation, 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:

Education
General