default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWaseem Akram 0002
Person information
- affiliation: Indian Institute of Technology Kanpur, Department of Computer Science and Engineering, India
Other persons with the same name
- Waseem Akram 0001
![[0000-0002-7401-5120]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-7401-5120")
— Khalifa University of Science and Technology, Abu Dhabi, UAE - Waseem Akram 0003 — National Yunlin University of Science and Technology, Douliu, Taiwan (and 1 more)
- Waseem Akram 0004 (aka: Muhammad Waseem Akram 0004) — TeCIP Institute, Scuola Superiore Sant'Anna, Pisa, Italy
- Waseem Akram 0005 (aka: Muhammad Waseem Akram 0005) — COMSATS University Islamabad, Islamabad, Pakistan
- Waseem Akram 0006 — Jammu University, India
- Waseem Akram 0007 — Beijing Institute of Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j3]Waseem Akram, Sanjeev Saxena:
Consecutive occurrences with distance constraints. Discret. Appl. Math. 380: 629-640 (2026)- 2025
- [j2]Waseem Akram, Sanjeev Saxena:
Dominance for enclosure problems. J. Comb. Optim. 50(4): 41 (2025) - [j1]Waseem Akram, Sanjeev Saxena:
Point enclosure problem for homothetic polygons. Theor. Comput. Sci. 1030: 115054 (2025) - [c6]Waseem Akram, Takuya Mieno:
Sorted Consecutive Occurrence Queries in Substrings. CPM 2025: 24:1-24:15 - [c5]Waseem Akram, Sanjeev Saxena:
Sorted Range Selection and Range Minima Queries. ICAA 2025: 15-26 - [i7]Waseem Akram, Katsuhisa Yamanaka:
Efficient Enumeration of At Most k-Out Polygons. CoRR abs/2509.12696 (2025) - 2024
- [c4]Waseem Akram, Sanjeev Saxena:
Consecutive Occurrences with Distance Constraints. CALDAM 2024: 3-13 - [c3]Waseem Akram, Sanjeev Saxena:
Maximizing Weighted Dominance in the Plane. ICTAC 2024: 153-163 - [c2]Waseem Akram, Sanjeev Saxena:
Dominance for Enclosure Problems. IWOCA 2024: 408-420 - [i6]Waseem Akram, Sanjeev Saxena:
Maximizing Weighted Dominance in the Plane. CoRR abs/2405.15811 (2024) - [i5]Waseem Akram, Sanjeev Saxena:
Top-k Stabbing Interval Queries. CoRR abs/2411.03037 (2024) - [i4]Waseem Akram, Takuya Mieno:
Sorted Consecutive Occurrence Queries in Substrings. CoRR abs/2411.12099 (2024) - 2023
- [c1]Waseem Akram, Sanjeev Saxena:
Point Enclosure Problem for Homothetic Polygons. IWOCA 2023: 13-24 - 2022
- [i3]Waseem Akram, Sanjeev Saxena:
Dominance for Containment Problems. CoRR abs/2212.10247 (2022) - 2021
- [i2]Waseem Akram, Sanjeev Saxena:
Sorted Range Reporting. CoRR abs/2104.02461 (2021) - [i1]Waseem Akram, Sanjeev Saxena:
Point Enclosure Problem for Homothetic Polygons. CoRR abs/2112.01860 (2021)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-09 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
