default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmeya Hate
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j5]Elliot Anshelevich
, Ameya Hate, Malik Magdon-Ismail:
Seeding influential nodes in non-submodular models of information diffusion. Auton. Agents Multi Agent Syst. 29(1): 131-159 (2015)- 2014
- [j4]Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. Theory Comput. Syst. 54(3): 407-430 (2014) - 2013
- [j3]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. Theory Comput. Syst. 52(2): 200-220 (2013) - [j2]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. Theory Comput. Syst. 53(1): 73-85 (2013) - [c6]Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail:
Seeding influential nodes in non-submodular models of information diffusion. AAMAS 2013: 1305-1306 - [i1]Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail:
Seeding Influential Nodes in Non-Submodular Models of Information Diffusion. CoRR abs/1302.5455 (2013) - 2012
- [b1]Ameya Hate:
Optimizing diffusion and pricing in networks of independent agents. Rensselaer Polytechnic Institute, USA, 2012 - [j1]Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy:
Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012) - [c5]Elliot Anshelevich, Ameya Hate, Koushik Kar, Michael Usher:
Stable and efficient pricing for inter-domain traffic forwarding. SIGMETRICS 2012: 381-382 - 2011
- [c4]Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. SAGT 2011: 278-289 - 2010
- [c3]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. SAGT 2010: 42-53 - [c2]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. WAOA 2010: 1-12
2000 – 2009
- 2009
- [c1]Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy:
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983
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:23 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:
