{\rtf1\ansi\deff0\deftab360

{\fonttbl
{\f0\fswiss\fcharset0 Arial}
{\f1\froman\fcharset0 Times New Roman}
{\f2\fswiss\fcharset0 Verdana}
{\f3\froman\fcharset2 Symbol}
}

{\colortbl;
\red0\green0\blue0;
}

{\info
{\author Biblio}{\operator }{\title Biblio RTF Export}}

\f1\fs24
\paperw11907\paperh16839
\pgncont\pgndec\pgnstarts1\pgnrestart
Pal, KK, Sudeep KS.\'a0 2016.\'a0\'a0Preprocessing for image classification by convolutional neural networks, 20 May. Recent Trends in Electronics, Information & Communication Technology (RTEICT), IEEE International Conference on. :1778-1781., Bengaluru\par \par Howlader, P, Sudeep KS.\'a0 2016.\'a0\'a0Degree centrality, eigenvector centrality and the relation between them in Twitter. Recent Trends in Electronics, Information & Communication Technology (RTEICT), IEEE International Conference on. :678-682., Bengaluru: IEEE\par \par Thomas, TK, Sudeep KS.\'a0 2016.\'a0\'a0An improved PageRank algorithm to handle polysemous queries. Computing, Analytics and Security Trends (CAST), International Conference on. :106-111., Pune: IEEE\par \par Viswakarma, A, Sudeep KS.\'a0 2013.\'a0\'a0Node Assignment Problem, February 2013. IEEE Sponsored International Conference On Information Communication & Embedded Systems ICICES 2013. , Chennai\par \par Sudeep, KS.\'a0 2013.\'a0\'a0Role of Social Media in the Arab Spring and beyond.  UGC-Sponsored International Seminar on Society, Culture and Politics in West Asia : Post-Arab Spring Dynamics. , University of Kerala, Thriruvananthapuram\par \par Salam, SM, Parvathy KN, Muralikrishnan K, Sudeep KS.\'a0 2011.\'a0\'a0On the Complexity of Edge Packing and Vertex Packing, 04/2011. , Calicut: CoRR abs/1103.5560\par \par Vishwanathan, S, Sudeep KS.\'a0 2008.\'a0\'a0Matched-Factor d-Domatic Coloring of Graphs. SIAM J. Discrete Math.. 21(4):1071-1082.\par \par Vishwanathan, S, Sudeep KS.\'a0 2007.\'a0\'a0Some results in square-free and strong square-free edge-colorings of graphs. Discrete Mathematics. 307(14):1818-1824.\par \par Vishwanathan, S, Sudeep KS.\'a0 2005.\'a0\'a0A technique for multicoloring triangle-free hexagonal graphs. Discrete Mathematics. 300(1-3):256-259.\par \par }