Approximating betweenness centrality DA Bader, S Kintali, K Madduri, M Mihail Algorithms and Models for the Web-Graph: 5th International Workshop, WAW …, 2007 | 483 | 2007 |
Betweenness Centrality: Algorithms and Lower Bounds S Kintali Arxiv preprint arXiv:0809.1906, 2008 | 85 | 2008 |
Reducibility among fractional stability problems S Kintali, LJ Poplawski, R Rajaraman, R Sundaram, SH Teng SIAM Journal on Computing 42 (6), 2063-2113, 2013 | 73 | 2013 |
Scarf is PPAD-complete S Kintali arXiv preprint arXiv:0812.1601, 2008 | 15* | 2008 |
Model-guided empirical optimization for multimedia extension architectures: A case study C Chen, J Shin, S Kintali, J Chame, M Hall 2007 IEEE International Parallel and Distributed Processing Symposium, 1-8, 2007 | 13 | 2007 |
Forbidden directed minors and Kelly-width S Kintali, Q Zhang Theoretical Computer Science 662, 40-47, 2017 | 12 | 2017 |
A distributed protocol for fractional stable paths problem S Kintali Georgia Tech, College of Computing Technical Report GT-CS-08-06; Presented …, 2008 | 10 | 2008 |
Graph pricing problem on bounded treewidth, bounded genus and k-partite graphs P Chalermsook, S Kintali, R Lipton, D Nanongkai arXiv preprint arXiv:1203.1940, 2012 | 8 | 2012 |
Computing bounded path decompositions in logspace S Kintali, S Munteanu Electronic Colloquim on Computational Complexity, 2012 | 8 | 2012 |
Approximation algorithms for digraph width parameters S Kintali, N Kothari, A Kumar arXiv preprint arXiv:1107.4824, 2011 | 7* | 2011 |
Approximation algorithms for directed width parameters S Kintali, N Kothari, A Kumar Preprint, 2011 | 7 | 2011 |
Forbidden directed minors and directed pathwidth S Kintali, Q Zhang Reseach report, 2015 | 6 | 2015 |
Directed minors iii. directed linked decompositions S Kintali arXiv preprint arXiv:1404.5976, 2014 | 5 | 2014 |
Forbidden directed minors and kelly-width S Kintali, Q Zhang arXiv preprint arXiv:1308.5170, 2013 | 4 | 2013 |
Realizable paths and the NL vs L problem S Kintali Georgia Institute of Technology, 2011 | 4 | 2011 |
Directed width parameters and circumference of digraphs S Kintali Theoretical Computer Science 659, 83-87, 2017 | 3 | 2017 |
Review of boosting: foundations and algorithms by Robert E. Schapire and Yoav Freund S Kintali ACM SIGACT News 45 (1), 41-43, 2014 | 2 | 2014 |
A Generalization of Erdös’s Proof of Bertrand-Chebyshev Theorem S Kintali Georgia Institute of Technology, 2008 | 2 | 2008 |
Algorithms and Models for Web-Graph D Bader, S Kintali, K Madduri, M Mihail Springer, 2007 | 2 | 2007 |
A Note on the Balanced ST-Connectivity S Kintali, A Shapira arXiv preprint arXiv:1204.0816, 2012 | | 2012 |