default search action
Abdul Basit 0001
Person information
- affiliation: Johns Hopkins University, USA
- affiliation (former): University of Notre Dame, IL, USA
- affiliation (former): Rutgers University, New Brunswick, NY, USA
- affiliation (former): LUMS, Lahore, Pakistan
Other persons with the same name
- Abdul Basit — disambiguation page
- Abdul Basit 0002
— Asian Institute of Technology Pathumthani, Klung Luang, Thailand
- Abdul Basit 0003
- Abdul Basit 0004
- Abdul Basit 0005
- Abdul Basit 0007
- Abdul Basit 0008
- Abdul Basit 0009
- Abdul Basit 0010
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Abdul Basit
Generalized Tuza's Conjecture for Random Hypergraphs. SIAM J. Discret. Math. 38(3): 2260-2288 (2024) - [c3]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. SoCG 2024: 8:1-8:15 - [i3]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. CoRR abs/2403.02627 (2024) - 2023
- [j8]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - 2022
- [j7]Abdul Basit
Improved Bounds on a Generalization of Tuza's Conjecture. Electron. J. Comb. 29(4) (2022) - [i2]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning axis-parallel lines in 3D. CoRR abs/2204.01772 (2022) - 2021
- [j6]Abdul Basit
On the Independent Set Sequence of a Tree. Electron. J. Comb. 28(3): 3 (2021)
2010 – 2019
- 2019
- [j5]Abdul Basit
On the Number of Ordinary Lines Determined by Sets in Complex Space. Discret. Comput. Geom. 61(4): 778-808 (2019) - [j4]Abdul Basit
An Improved Sum-Product Bound for Quaternions. SIAM J. Discret. Math. 33(2): 1044-1060 (2019) - 2017
- [c2]Abdul Basit
On the Number of Ordinary Lines Determined by Sets in Complex Space. SoCG 2017: 15:1-15:15 - 2016
- [i1]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the number of ordinary lines determined by sets in complex space. CoRR abs/1611.08740 (2016) - 2014
- [j3]Abdul Basit
Incidences with k-non-degenerate sets and their applications. J. Comput. Geom. 5(1): 284-302 (2014) - 2010
- [j2]Abdul Basit
Centerpoints and Tverberg's technique. Comput. Geom. 43(6-7): 593-600 (2010) - [j1]Abdul Basit
Hitting Simplices with Points in R3. Discret. Comput. Geom. 44(3): 637-644 (2010) - [c1]Abdul Basit
Improving the first selection lemma in R3. SCG 2010: 354-357
Coauthor Index
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 2024-12-10 21:46 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: