default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRik Sengupta
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Hadi Hosseini, Andrew McGregor, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Graphical house allocation with identical valuations. Auton. Agents Multi Agent Syst. 38(2): 42 (2024)- [c8]Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Tight Approximations for Graphical House Allocation. AAMAS 2024: 825-833 - [c7]Christian Konrad, Andrew McGregor, Rik Sengupta, Cuong Than:
Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. FSTTCS 2024: 29:1-29:15 - [c6]Adam Lechowicz, Rik Sengupta, Bo Sun, Shahin Kamali, Mohammad Hajiesmaili:
Time Fairness in Online Knapsack Problems. ICLR 2024 - [c5]Andrew McGregor, Rik Sengupta:
Graph Reconstruction from Noisy Random Subgraphs. ISIT 2024: 3462-3467 - [c4]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS 2024: 34:1-34:16 - [i9]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams:
Parallel Play Saves Quantifiers. CoRR abs/2402.10293 (2024) - [i8]Andrew McGregor, Rik Sengupta:
Graph Reconstruction from Noisy Random Subgraphs. CoRR abs/2405.04261 (2024) - [i7]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR abs/2407.00688 (2024) - 2023
- [c3]Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Graphical House Allocation. AAMAS 2023: 161-169 - [c2]Justin Payan, Rik Sengupta, Vignesh Viswanathan:
Relaxations of Envy-Freeness Over Graphs. AAMAS 2023: 2652-2654 - [i6]Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Graphical House Allocation. CoRR abs/2301.01323 (2023) - [i5]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
A Finer Analysis of Multi-Structural Games and Beyond. CoRR abs/2301.13329 (2023) - [i4]Adam Lechowicz, Rik Sengupta, Bo Sun, Shahin Kamali, Mohammad H. Hajiesmaili:
Time Fairness in Online Knapsack Problems. CoRR abs/2305.13293 (2023) - [i3]Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Tight Approximations for Graphical House Allocation. CoRR abs/2307.12482 (2023) - 2022
- [c1]Andrew McGregor, Rik Sengupta:
Graph Reconstruction from Random Subgraphs. ICALP 2022: 96:1-96:18 - [i2]Justin Payan, Rik Sengupta, Vignesh Viswanathan:
Locally EFX Allocations Over a Graph. CoRR abs/2202.10946 (2022)
2010 – 2019
- 2019
- [i1]Neil Immerman, Rik Sengupta:
The k-Dimensional Weisfeiler-Leman Algorithm. CoRR abs/1907.09582 (2019) - 2017
- [j2]Andrey Grinshpun, Raj Raina, Rik Sengupta:
Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques. J. Graph Theory 85(2): 349-362 (2017) - 2014
- [j1]Sebastian A. Csar, Rik Sengupta, Warut Suksompong:
On a Subposet of the Tamari Lattice. Order 31(3): 337-363 (2014)
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-08 01:31 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:
