![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sreyash Kenkre
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j7]Srinivas Karthik
, Jayant R. Haritsa, Sreyash Kenkre, Vinayaka Pandit, Lohit Krishnan:
Platform-Independent Robust Query Processing. IEEE Trans. Knowl. Data Eng. 31(1): 17-31 (2019) - [c8]Swapnil Gupta, Sreyash Kenkre, Partha P. Talukdar:
CaRe: Open Knowledge Graph Embeddings. EMNLP/IJCNLP (1) 2019: 378-388 - 2018
- [j6]Srinivas Karthik Venkatesh, Jayant R. Haritsa, Sreyash Kenkre, Vinayaka Pandit:
A Concave Path to Low-overhead Robust Query Processing. Proc. VLDB Endow. 11(13): 2183-2195 (2018) - [i5]Disha Shrivastava, Sreyash Kenkre, Santosh Penubothula:
Hypernyms Through Intra-Article Organization in Wikipedia. CoRR abs/1809.00414 (2018) - 2017
- [j5]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. Algorithmica 78(4): 1182-1205 (2017) - 2016
- [c7]Srinivas Karthik, Jayant R. Haritsa, Sreyash Kenkre, Vinayaka Pandit:
Platform-independent robust query processing. ICDE 2016: 325-336 - [c6]Venkatesan T. Chakaravarthy, Sreyash Kenkre, Sakib A. Mondal
, Vinayaka Pandit, Yogish Sabharwal:
Reusable Resource Scheduling via Colored Interval Covering. IPDPS 2016: 1003-1012 - 2015
- [c5]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. ESA 2015: 792-803 - [i4]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. CoRR abs/1507.00662 (2015) - 2013
- [j4]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, chromatic number and online coloring. Comb. 33(3): 319-334 (2013) - 2012
- [c4]Sreyash Kenkre, Ranganath Kondapally, Vinayaka Pandit:
Algorithmic Aspects of Planning under Uncertainty for Service Delivery Organizations. ICSOC 2012: 615-622 - [c3]Srinivas Karthik, Sreyash Kenkre, Krishnasuri Narayanam, Vinayaka Pandit:
Recourse aware resource allocation for contingency planning in distributed service delivery. SOLI 2012: 48-53 - [c2]Srinivas Karthik, Sreyash Kenkre, Krishnasuri Narayanam, Vinayaka Pandit:
Resiliency Analytics Framework for Service Delivery Organizations. SRII Global Conference 2012: 672-681 - 2011
- [c1]Vinayaka Pandit, Sreyash Kenkre, Arindam Khan:
Discovering Bucket Orders from Data. SDM 2011: 872-883 - 2010
- [j3]Sreyash Kenkre, Sundar Vishwanathan:
Approximation algorithms for the Bipartite Multicut problem. Inf. Process. Lett. 110(8-9): 282-287 (2010)
2000 – 2009
- 2008
- [j2]Sreyash Kenkre, Sundar Vishwanathan:
The common prefix problem on trees. Inf. Process. Lett. 105(6): 245-248 (2008) - [i3]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, Chromatic Number and Online Coloring. CoRR abs/0809.1710 (2008) - 2007
- [j1]Sreyash Kenkre, Sundar Vishwanathan:
A bound on the chromatic number using the longest odd cycle length. J. Graph Theory 54(4): 267-276 (2007) - 2006
- [i2]Sreyash Kenkre, Sundar Vishwanathan:
Approximation Algorithms for the Bipartite Multi-cut Problem. CoRR abs/cs/0609031 (2006) - [i1]Sreyash Kenkre, Sundar Vishwanathan:
The Common Prefix Problem On Trees. CoRR abs/cs/0612060 (2006)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22: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