Waseem Akram

According to our database, Waseem Akram authored at least 10 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Efficient Enumeration of At Most <i>k</i>-Out Polygons.

Waseem Akram, Katsuhisa Yamanaka

CoRR, September, 2025

Sorted Range Selection and Range Minima Queries.

Waseem Akram, Sanjeev Saxena

Proceedings of the Applied Algorithms - Second International Conference, 2025

Sorted Consecutive Occurrence Queries in Substrings.

Waseem Akram, Takuya Mieno

Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

2024

Top-k Stabbing Interval Queries.

Waseem Akram, Sanjeev Saxena

CoRR, 2024

Dominance for Enclosure Problems.

Waseem Akram, Sanjeev Saxena

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Maximizing Weighted Dominance in the Plane.

Waseem Akram, Sanjeev Saxena

Proceedings of the Theoretical Aspects of Computing - ICTAC 2024, 2024

Consecutive Occurrences with Distance Constraints.

Waseem Akram, Sanjeev Saxena

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Point Enclosure Problem for Homothetic Polygons.

Waseem Akram, Sanjeev Saxena

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Dominance for Containment Problems.

Waseem Akram, Sanjeev Saxena

CoRR, 2022

2021

Sorted Range Reporting.

Waseem Akram, Sanjeev Saxena

CoRR, 2021