Publications

Export 25 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is graph theory  [Clear All Filters]
2012
Han B, Hui P, Kumar VSA, Marathe MV, Shao J, Srinivasan A.  2012.  Mobile Data Offloading through Opportunistic Communications and Social Participation. Mobile Computing, IEEE Transactions on. 11(5):821-834.
2011
Liu M-Y, Tuzel O, Ramalingam S, Chellappa R.  2011.  Entropy rate superpixel segmentation. 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). :2097-2104.
Rodrigues EM, Milic-Frayling N, Smith M, Shneiderman B, Hansen D.  2011.  Group-in-a-Box Layout for Multi-faceted Analysis of Communities. Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom). :354-361.
Narayanan A, Elaine Shi, Rubinstein BIP.  2011.  Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge. :1825-1834.
DuBois T, Golbeck J, Srinivasan A.  2011.  Predicting Trust and Distrust in Social Networks. Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom). :418-424.
Lieberman MD, Taheri S, Guo H, Mirrashed F, Yahav I, Aris A, Shneiderman B.  2011.  Visual Exploration across Biomedical Databases. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8(2):536-550.
2009
Wu Y, Raschid L.  2009.  ApproxRank: Estimating Rank for a Subgraph. IEEE 25th International Conference on Data Engineering, 2009. ICDE '09. :54-65.
2008
Chafekar D, Kumart VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2008.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1166-1174.
Sundaresan A, Chellappa R.  2008.  Model Driven Segmentation of Articulating Humans in Laplacian Eigenspace. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 30(10):1771-1785.
Nagarajan N, Kingsford C.  2008.  Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques. IEEE International Conference on Bioinformatics and Biomedicine, 2008. BIBM '08. :223-230.
2006
Perer A, Shneiderman B.  2006.  Balancing Systematic and Flexible Exploration of Social Networks. IEEE Transactions on Visualization and Computer Graphics. 12(5):693-700.
De Floriani L, Hui A.  2006.  A Dimension-Independent Representation for Multiresolution Nonmanifold Meshes. Journal of Computing and Information Science in Engineering. 6(4):397-404.
Haim F, Sen M, Ko D-I, Bhattacharyya SS, Wolf W.  2006.  Mapping Multimedia Applications Onto Configurable Hardware With Parameterized Cyclo-Static Dataflow Graphs. Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on. 3:III-III.
2005
Kianzad V, Bhattacharyya SS, Qu G.  2005.  CASPER: an integrated energy-driven approach for task graph scheduling on distributed embedded systems. Application-Specific Systems, Architecture Processors, 2005. ASAP 2005. 16th IEEE International Conference on. :191-197.
2004
Rao Y, Mundur P, Yesha Y.  2004.  Automatic video summarization for wireless and mobile environments. 2004 IEEE International Conference on Communications. 3:1532-1536Vol.3-1532-1536Vol.3.
Mishra A, Shin M H, Petroni NL, Clancy TC, Arbaugh WA.  2004.  Proactive key distribution using neighbor graphs. IEEE Wireless Communications. 11(1):26-36.
Seo J, Shneiderman B.  2004.  A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections. IEEE Symposium on Information Visualization, 2004. INFOVIS 2004. :65-72.
2002
Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2002.  Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
2001
Li Y, Long PM, Srinivasan A.  2001.  The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory. 47(3):1257-1261.
2000
Srinivasan A, Ramakrishnan KG, Kumaran K, Aravamudan M, Naqvi S.  2000.  Optimal design of signaling networks for Internet telephony. IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 2:707-716vol.2-707-716vol.2.
1998
Leighton T, Rao S, Srinivasan A.  1998.  Multicommodity flow and circuit switching. , Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998. 7:459-465vol.7-459-465vol.7.
1997
Srinivasan A.  1997.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings. :416-425.
1993
Hannenhalli S, Perumalla K, Chandrasekharan N, Sridhar R.  1993.  A distributed algorithm for ear decomposition. , Fifth International Conference on Computing and Information, 1993. Proceedings ICCI '93. :180-184.
1992
Chandrasekharan N, Hannenhalli S.  1992.  Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs. , Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI '92. :42-45.
Botafogo RA, Rivlin E, Shneiderman B.  1992.  Structural analysis of hypertexts: identifying hierarchies and useful metrics. ACM Transactions on Information Systems. 10(2):142-180.