default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Amburg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Sinan G. Aksoy, Ilya Amburg
, Stephen J. Young:
Scalable Tensor Methods for Nonuniform Hypergraphs. SIAM J. Math. Data Sci. 6(2): 481-503 (2024)- [i10]Tatyana Benko, Martin Buck, Ilya Amburg, Stephen J. Young, Sinan G. Aksoy:
HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network. CoRR abs/2402.09676 (2024) - 2023
- [c4]Shruti Shivakumar, Ilya Amburg, Sinan G. Aksoy, Jiajia Li, Stephen J. Young, Srinivas Aluru:
Fast Parallel Tensor Times Same Vector for Hypergraphs. HiPC 2023: 324-334 - [i9]Sinan G. Aksoy, Ilya Amburg, Stephen J. Young:
Scalable tensor methods for nonuniform hypergraphs. CoRR abs/2306.17825 (2023) - [i8]Jürgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez, Ilya Amburg, Jessalyn Bolkema, Thomas Grubb, Fangfei Lan, Sepideh Maleki, Phil Chodrow, Bill Kay:
Community Detection in Hypergraphs via Mutual Information Maximization. CoRR abs/2308.04537 (2023) - [i7]Matthew R. Oster, Ilya Amburg, Samrat Chatterjee, Daniel A. Eisenberg, Dennis G. Thomas, Feng Pan, Auroop R. Ganguly:
A Tri-Level Optimization Model for Interdependent Infrastructure Network Resilience Against Compound Hazard Events. CoRR abs/2310.10587 (2023) - [i6]Jason Niu, Ilya D. Amburg, Sinan G. Aksoy, Ahmet Erdem Sariyüce:
Size-Aware Hypergraph Motifs. CoRR abs/2311.07783 (2023) - [i5]Shruti Shivakumar, Ilya Amburg, Sinan G. Aksoy, Jiajia Li, Stephen J. Young, Srinivas Aluru:
Fast Parallel Tensor Times Same Vector for Hypergraphs. CoRR abs/2311.08595 (2023) - 2022
- [c3]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Brenda Praggastis, Assefaw H. Gebremedhin:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. IPDPS 2022: 784-794 - [c2]Ilya Amburg, Nate Veldt, Austin R. Benson:
Diverse and Experienced Group Discovery via Hypergraph Clustering. SDM 2022: 145-153 - [i4]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Assefaw H. Gebremedhin, Brenda Praggastis:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. CoRR abs/2201.11326 (2022) - 2020
- [c1]Ilya Amburg, Nate Veldt, Austin R. Benson:
Clustering in graphs and hypergraphs with categorical edge labels. WWW 2020: 706-717 - [i3]Ilya Amburg, Nate Veldt, Austin R. Benson:
Fair Clustering for Diverse and Experienced Groups. CoRR abs/2006.05645 (2020)
2010 – 2019
- 2019
- [i2]Ilya Amburg, Jon M. Kleinberg, Austin R. Benson:
Planted Hitting Set Recovery in Hypergraphs. CoRR abs/1905.05839 (2019) - [i1]Ilya Amburg, Nate Veldt, Austin R. Benson:
Hypergraph clustering with categorical edge labels. CoRR abs/1910.09943 (2019) - 2017
- [j1]Ilya Amburg, Krishna Dasaratha, Laure Flapan, Thomas Garrity, Chansoo Lee, Cornelia Mihaila, Nicholas Neumann-Chun, Sarah Peluse, Matthew Stoffregen:
Stern Sequences for a Family of Multidimensional Continued Fractions: TRIP-Stern Sequences. J. Integer Seq. 20(1): 17.1.7 (2017)
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-08-05 20:21 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:
