default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuhas Thejaswi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Antonis Matakos
, Bruno Ordozgoiti, Suhas Thejaswi:
Fair Column Subset Selection. KDD 2024: 2189-2199- [i10]Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Aristides Gionis:
Diversity-aware clustering: Computational Complexity and Approximation Algorithms. CoRR abs/2401.05502 (2024) - [i9]Ivi Chatzi, Eleni Straitouri, Suhas Thejaswi, Manuel Gomez Rodriguez:
Prediction-Powered Ranking of Large Language Models. CoRR abs/2402.17826 (2024) - [i8]Giovanni De Toni, Nastaran Okati, Suhas Thejaswi, Eleni Straitouri, Manuel Gomez-Rodriguez:
Towards Human-AI Complementarity with Predictions Sets. CoRR abs/2405.17544 (2024) - [i7]Eleni Straitouri, Suhas Thejaswi, Manuel Gomez Rodriguez:
Controlling Counterfactual Harm in Decision Support Systems Based on Prediction Sets. CoRR abs/2406.06671 (2024) - [i6]Seungeon Lee, Nina Corvelo Benz, Suhas Thejaswi, Manuel Gomez-Rodriguez:
Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes. CoRR abs/2407.13052 (2024) - 2023
- [i5]Antonis Matakos, Bruno Ordozgoiti, Suhas Thejaswi:
Fair Column Subset Selection. CoRR abs/2306.04489 (2023) - 2022
- [c4]Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Michal Osadnik:
Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics. KDD 2022: 1749-1759 - 2021
- [c3]Suhas Thejaswi, Bruno Ordozgoiti, Aristides Gionis:
Diversity-Aware k-median: Clustering with Fair Center Representation. ECML/PKDD (2) 2021: 765-780 - [i4]Suhas Thejaswi, Bruno Ordozgoiti, Aristides Gionis:
Diversity-aware k-median : Clustering with fair center representation. CoRR abs/2106.11696 (2021) - [i3]Ameet Gadekar, Bruno Ordozgoiti, Suhas Thejaswi:
Approximation algorithms for k-median with lower-bound constraints. CoRR abs/2112.07030 (2021) - 2020
- [j1]Suhas Thejaswi, Aristides Gionis, Juho Lauri:
Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints. Big Data 8(5): 335-362 (2020) - [c2]Suhas Thejaswi, Aristides Gionis:
Pattern detection in large temporal graphs using algebraic fingerprints. SDM 2020: 37-45 - [i2]Suhas Thejaswi, Aristides Gionis:
Finding temporal patterns using algebraic fingerprints. CoRR abs/2001.07158 (2020) - [i1]Suhas Thejaswi, Aristides Gionis:
Restless reachability in temporal graphs. CoRR abs/2010.08423 (2020)
2010 – 2019
- 2018
- [c1]Petteri Kaski, Juho Lauri, Suhas Thejaswi:
Engineering Motif Search for Large Motifs. SEA 2018: 28:1-28:19
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-10-07 22:22 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:
