We stand with Ukraine  

Waseem Akram

Orcid: 0009-0007-4960-8673

Affiliations:
  • Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India


According to our database1, Waseem Akram authored at least 9 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Point enclosure problem for homothetic polygons.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
Theor. Comput. Sci., 2025

Sorted Range Selection and Range Minima Queries.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
Proceedings of the Applied Algorithms - Second International Conference, 2025

Sorted Consecutive Occurrence Queries in Substrings.
[BibTeX]
[DOI]
Waseem Akram
,
Takuya Mieno
Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

2024
Top-k Stabbing Interval Queries.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
CoRR, 2024

Dominance for Enclosure Problems.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Maximizing Weighted Dominance in the Plane.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
Proceedings of the Theoretical Aspects of Computing - ICTAC 2024, 2024

Consecutive Occurrences with Distance Constraints.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2022
Dominance for Containment Problems.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
CoRR, 2022

2021
Sorted Range Reporting.
[BibTeX]
[DOI]
Waseem Akram
,
Sanjeev Saxena
CoRR, 2021


  Loading...