default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShiva Kintali
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j9]Shiva Kintali:
Directed width parameters and circumference of digraphs. Theor. Comput. Sci. 659: 83-87 (2017)- [j8]Shiva Kintali, Qiuyi Zhang:
Forbidden directed minors and Kelly-width. Theor. Comput. Sci. 662: 40-47 (2017) - 2015
- [j7]Shiva Kintali:
Algorithms Unplugged by B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, and D. Wagner: The Power of Algorithms by Giorgio Ausiello and Rossella Petreschi. SIGACT News 46(4): 14-16 (2015) - [j6]Shiva Kintali, Nishad Kothari
, Akash Kumar:
Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562: 365-376 (2015) - 2014
- [j5]Shiva Kintali:
Review of boosting: foundations and algorithms by Robert E. Schapire and Yoav Freund. SIGACT News 45(1): 41-43 (2014) - [i12]Shiva Kintali:
Directed Width Parameters and Circumference of Digraphs. CoRR abs/1401.2662 (2014) - 2013
- [j4]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j3]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. SIAM J. Comput. 42(6): 2063-2113 (2013) - [i11]Shiva Kintali, Qiuyi Zhang:
Forbidden Directed Minors and Kelly-width. CoRR abs/1308.5170 (2013) - 2012
- [j2]Shiva Kintali:
Review of elements of automata theory, by Jacques Sakarovitch, Translator (from French) Reuben Thomas. SIGACT News 43(3): 45-47 (2012) - [i10]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs. CoRR abs/1203.1940 (2012) - [i9]Shiva Kintali, Asaf Shapira:
A Note on the Balanced ST-Connectivity. CoRR abs/1204.0816 (2012) - [i8]Shiva Kintali, Sinziana Munteanu:
Computing Bounded Path Decompositions in Logspace. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i7]Shiva Kintali, Nishad Kothari, Akash Kumar:
Approximation Algorithms for Directed Width Parameters. CoRR abs/1107.4824 (2011) - 2010
- [i6]Shiva Kintali:
Realizable Paths and the NL vs L Problem. CoRR abs/1011.3840 (2010) - [i5]Shiva Kintali:
Realizable Paths and the NL vs L Problem. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c3]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. FOCS 2009: 283-292 - [i4]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. CoRR abs/0904.1435 (2009) - [i3]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i2]Shiva Kintali:
Betweenness Centrality : Algorithms and Lower Bounds. CoRR abs/0809.1906 (2008) - [i1]Shiva Kintali:
Scarf is Ppad-Complete. CoRR abs/0812.1601 (2008) - 2007
- [c2]Chun Chen, Jaewook Shin, Shiva Kintali, Jacqueline Chame, Mary W. Hall:
Model-Guided Empirical Optimization for Multimedia Extension Architectures: A Case Study. IPDPS 2007: 1-8 - [c1]David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail:
Approximating Betweenness Centrality. WAW 2007: 124-137 - 2006
- [j1]Shiva Prasad Kintali:
MxYacc: parser generator for mixed languages. ACM SIGPLAN Notices 41(2): 25-28 (2006)
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-04-24 23:05 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:
