Computer Science and Engineering
Indian Institute of Technology, Kanpur
"Everything in the universe is within you. Ask all from yourself."
Rumi
Embedded Files
I am a Research Fellow at the CSE department of IIT Kanpur, working with Prof. Sanjeev Saxena. My reseach primarily focuses on the design and analysis of algorithms and data structures, with a particular intereset in geometric problems. Additionally, I enjoy exploring the applications of geometric problems in other domains, including stringology and graph algorithms. Further, my research interest also includes (geometric) enumeration problems.
Research Interest
Research Interest
Computational Geometry, String Processing, Enumeration Algorithms, Algorithms, and Data Structures.
Publications
Publications
Consecutive Occurrences with Distance Constraints [ Share Link ]
Waseem Akram and Sanjeev Saxena
Discrete Applied Matchmetaics (DAM), Vol. 380, pages 629-640, November 2025.
Dominance for Enclosure Problems [ DOI ] [ arXiv ]
Waseem Akram and Sanjeev Saxena
Journal of Combinatorial Optimization (JoCO), Vol. 50(4), 41, November 2025.
Point Enclosure Problem for Homothetic Polygons [DOI] [ arXiv ]
Waseem Akram and Sanjeev Saxena
Theoretical Computer Science (TCS), Vol. 1030, 115054, March 2025.
Sorted Consecutive Occurrence Queries in Substrings [ DOI ][ arXiv ]
Waseem Akram and Takuya Mieno
Proceedings 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025), pp. 24: 1 - 24: 15, 2025.
Sorted Range Reporting and Range Minima Queries [ DOI ][ arXiv ]
Waseem Akram and Sanjeev Saxena
Proceedings of the International Conference on Applied Algorithms (ICAA 2025), pp. 15-26, 2025.
Maximizing Weighted Dominance in the Plane [ DOI ] [ arXiv ]
Waseem Akram and Sanjeev Saxena
Proceedings of the 21st International Colloquium on Theoretical Aspects of Computing (ICTAC 2024), pp. 153-163, 2024.
Efficient Enumeration of At Most k-Out Polygons [ WEPA 2024 ] [ arXiv ]
Waseem Akram and Katsuhisa Yamanaka
Presented at the 6th Workshop on Enumeration Problems and Applications (WEPA 2024).
Dominance for Enclosure Problems [ IWOCA 2024 ] [ arXiv ]
Waseem Akram and Sanjeev Saxena
Proceedings of the 35th International Workshop on Combinatorial Algorithms (IWOCA 2024), pp. 408-420, 2024.
Enumerating At Most k-Out Polygons [ paper link ]
Waseem Akram and Katsuhisa Yamanaka
Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), 13:1-13:8, 2024.
Pairwise Triangles Intersection in a Query Rectangle [ paper link ]
Waseem Akram and Sanjeev Saxena
Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), 66:1-66:6, 2024.
Consecutive Occurrences with Distance Constraints [ DOI ] [ slides ]
Waseem Akram and Sanjeev Saxena
10th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024), pp. 3-13, 2024.
Point Enclosure Problem for Homothetic Polygons [ DOI ] [ arXiv ]
Waseem Akram and Sanjeev Saxena
Proceedings of the 34th International Workshop on Combinatorial Algorithms (IWOCA 2023), pp. 13-24, 2023.
Top-k Interval Stabbing Queries [ arXiv ]
Waseem Akram and Sanjeev Saxena
The publication list is also available on Google Scholar and DBLP.
Academic History
Academic History
FARE Research Fellow, Indian Institute of Technology, Kanpur (Jan 2025-Present)
Doctor of Philosophy, Indian Institute of Technology, Kanpur (2018-2025)
Master of Computer Applications (M. C. A), Indian Institute of Technology, Roorkee (2013-2016)
Bachelor of Science (Computer Applications), Aligarh Muslim University, Aligarh (2009-2012)
Contact Details
Contact Details
Address: Emails:
KD-109, akram@iitk.ac.in
KD Building, IIT Kanpur akram@cse.iitk.ac.in
Uttar Pradesh (India), 208016
Page updated
Google Sites
Report abuse