default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Knittel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Marina Knittel:
Fair and Scalable Algorithms on Massive Graphs. University of Maryland, College Park, MD, USA, 2023- [c12]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. ICML 2023: 17218-17242 - [c11]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. NeurIPS 2023 - [c10]AmirMohsen Ahanchi
, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong:
Massively Parallel Tree Embeddings for High Dimensional Spaces. SPAA 2023: 77-88 - [i7]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair Polylog-Approximate Low-Cost Hierarchical Clustering. CoRR abs/2311.12501 (2023) - 2022
- [c9]Marina Knittel, Samuel Dooley, John P. Dickerson:
The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations. IJCAI 2022: 356-362 - [c8]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-Round Tree Contraction. ITCS 2022: 83:1-83:23 - [c7]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. SPAA 2022: 23-33 - [i6]Marina Knittel, Samuel Dooley, John P. Dickerson:
The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations. CoRR abs/2202.11095 (2022) - [i5]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. CoRR abs/2205.14101 (2022) - [i4]Marina Knittel, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. CoRR abs/2205.14198 (2022) - 2021
- [j1]Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, Yi-Chieh Wu:
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2144-2156 (2021) - [c6]Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff:
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI 2021: 5277-5285 - [i3]MohammadTaghi Hajiaghayi, Marina Knittel:
Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees. CoRR abs/2101.04818 (2021) - [i2]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-round Tree Contraction. CoRR abs/2111.01904 (2021) - 2020
- [c5]MohammadTaghi Hajiaghayi, Marina Knittel:
Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees. AAMAS 2020: 1864-1866 - [c4]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. NeurIPS 2020 - [i1]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. CoRR abs/2006.10221 (2020)
2010 – 2019
- 2019
- [c3]Jordan R. Abrahams, David A. Chu, Grace Diehl, Marina Knittel, Judy Lin, William Lloyd, James C. Boerkoel Jr., Frank Jeremy:
DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling. ICAPS 2019: 3-12 - [c2]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA 2019: 15:1-15:14 - [c1]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3
Coauthor Index
aka: MohammadTaghi Hajiaghayi
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-06-13 21:45 CEST 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:
