अनिल माहेश्वरी
Anil Maheshwari 
Computational Geometry Lab
School of Computer Science
Carleton University
1125 Colonel By Drive, Ottawa,
ON, K1S 5B6,  Canada

E-mail: anil@scs.carleton.ca
Office: 5125b HP

Useful Pointers:

Algorithms Seminar Research Interests
My Schedule Publications

CV General


Fall 2022

COMP 3801

Algorithms for Modern Data Sets

Fall 2022

COMP 3804

Design and Analysis of Algorithms
Winter 2023

COMP 5112

Algorithms for Data Science

Past Courses:


Course Notes:  Notes on Algorithm Design

Free Text Book:  Introduction to Theory of Computation

Research Papers:  See DBLPScholarScopus

Upcoming Events:

    CALDAM 2023 (DAIICT)

    ISAAC 2022 (Seoul)

    CCCG 2022 (Ryerson University)

    SWAT 2022 (Faroe Island)

Research Interests:

Design, 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.

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 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: