C. Pandu Rangan

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Cache Me if You Can: Capacitated Selfish Replication Games in Networks	2019	Ragavendran Gopalakrishnan Dimitrios Kanoulas Naga Naresh Karuturi C. Pandu Rangan Rajmohan Rajaraman Ravi Sundaram
+	Reoptimization of Path Vertex Cover Problem	2019	Mehul Kumar Amit Kumar C. Pandu Rangan
+ PDF Chat	Reoptimization of Path Vertex Cover Problem	2019	Mehul Kumar Amit Kumar C. Pandu Rangan
+	Stable Marriage Problem with Ties and Incomplete bounded length preference list under social stability	2016	Ashish Shrivastava C. Pandu Rangan
+	Stable Marriage Problem with Ties and Incomplete bounded length preference list under social stability	2016	Ashish Shrivastava C. Pandu Rangan
+	Rational Secret Sharing Over an Asynchronous Broadcast Channel With Information Theoretic Security	2011	William K. Moses C. Pandu Rangan
+	Identity based ring signcryption schemes revisited	2011	S. Sharmila Deva Selvi S. Sree Vivek C. Pandu Rangan
+	Cache Me If You Can: Capacitated Selfish Replication Games in Networks	2010	Ragavendran Gopalakrishnan Dimitrios Kanoulas Naga Naresh Karuturi C. Pandu Rangan Rajmohan Rajaraman Ravi Sundaram
+	Communication and Round Efficient Information Checking Protocol	2010	Arpita Patra C. Pandu Rangan
+	AN IDENTITY BASED RING SIGNCRYPTION SCHEME WITH PUBLIC VERIFIABILITY	2010	S. Sharmila Deva Selvi S. Sree Vivek Sakhi S. Anand C. Pandu Rangan
+	Cache Me If You Can: Capacitated Selfish Replication Games in Networks	2010	Ragavendran Gopalakrishnan Dimitrios Kanoulas Naga Naresh Karuturi C. Pandu Rangan Rajmohan Rajaraman Ravi Sundaram
+	On the Security of Identity Based Ring Signcryption Schemes	2009	S. Sharmila Deva Selvi S. Sree Vivek C. Pandu Rangan
+	On perfectly secure communication over arbitrary networks	2002	Manoranjan Kumar P.R. Goundan Kannan Srinathan C. Pandu Rangan
+	On perfectly secure communication over arbitrary networks	2002	Manoranjan Kumar P.R. Goundan K Srinathan C. Pandu Rangan
+	Algorithmic aspects of clique-transversal and clique-independent sets	2000	Venkatesan Guruswami C. Pandu Rangan
+	None	2000	Stefan Felsner Ravi Kant C. Pandu Rangan Dorothea Wagner
+	Symmetric Min-Max heap: A simpler data structure for double-ended priority queue	1999	Asha Arvind C. Pandu Rangan
+	The Duchet conjecture	1998	Prakash Veeraraghavan K. R. Parthasarathy C. Pandu Rangan
+	Restrictions of Minimum Spanner Problems	1997	G. Venkatesan Udi Rotics M.S. Madanlal Johann A. Makowsky C. Pandu Rangan
+	Weighted independent perfect domination on cocomparability graphs	1995	Gerard J. Chang C. Pandu Rangan S. Coorg
+	A linear algorithm for centering a spanning tree of a biconnected graph	1994	K. S. Easwarakumar C. Pandu Rangan Grant A. Cheston
+	Optimal path cover problem on block graphs and bipartite permutation graphs	1993	R. Srikant Ravi Sundaram Karan Sher Singh C. Pandu Rangan
+ PDF Chat	Weighted independent perfect domination on cocomparability graphs	1993	Gerard J. Chang C. Pandu Rangan S. Coorg
+ PDF Chat	Generalized vertex covering in interval graphs	1992	Madhav Marathe R. Ravi C. Pandu Rangan
+	On finding the minimum bandwidth of interval graphs	1991	R. Mahesh C. Pandu Rangan Aravind Srinivasan
+	Linear algorithm for optimal path cover problem on interval graphs	1990	Srinivasa R. Arikati C. Pandu Rangan
+	Linear algorithm for domatic number problem on interval graphs	1989	Anup Rao C. Pandu Rangan
+ PDF Chat	Algorithms for weighted graph problems on the modified cellular graph automaton	1989	Suresh Venkatasubramanian Kamala Krithivasan C. Pandu Rangan
+	On the minimum number of additions required to compute a quadratic form	1983	C. Pandu Rangan

Common Coauthors

Coauthor	Papers Together
S. Sree Vivek	3
Ravi Sundaram	3
Rajmohan Rajaraman	3
Dimitrios Kanoulas	3
Naga Naresh Karuturi	3
S. Sharmila Deva Selvi	3
Ragavendran Gopalakrishnan	3
Gerard J. Chang	2
Manoranjan Kumar	2
Ashish Shrivastava	2
Amit Kumar	2
S. Coorg	2
P.R. Goundan	2
Mehul Kumar	2
Venkatesan Guruswami	1
K. S. Easwarakumar	1
Udi Rotics	1
Kannan Srinathan	1
William K. Moses	1
Dorothea Wagner	1
M.S. Madanlal	1
R. Srikant	1
R. Ravi	1
Kamala Krithivasan	1
Johann A. Makowsky	1
Ravi Kant	1
Arpita Patra	1
Ravi Sundaram	1
K. R. Parthasarathy	1
A. Arvind	1
Aravind Srinivasan	1
Stefan Felsner	1
Sakhi S. Anand	1
Karan Sher Singh	1
K Srinathan	1
G. Venkatesan	1
Madhav Marathe	1
Grant A. Cheston	1
Anup Rao	1
R. Mahesh	1
Prakash Veeraraghavan	1
Suresh Venkatasubramanian	1
Srinivasa R. Arikati	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Linear algorithm for domatic number problem on interval graphs	1989	Anup Rao C. Pandu Rangan	5
+	Formal Proofs for the Security of Signcryption	2002	Joonsang Baek Ron Steinfeld Yuliang Zheng	3
+	Minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path vertex cover	2011	Boštjan Brešar František Kardoš Ján Katrenič Gabriel Semanišin	2
+	Optimal data placement on networks with a constant number of clients	2013	Éric Angel Evripidis Bampis Gerasimos G. Pollatos Vassilis Zissimopoulos	2
+	Color-coding	1994	Noga Alon Raphy Yuster Uri Zwick	2
+	Perfect codes in graphs	1973	Norman Biggs	2
+	On the Security of Identity Based Ring Signcryption Schemes	2009	S. Sharmila Deva Selvi S. Sree Vivek C. Pandu Rangan	2
+	On the weighted <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path vertex cover problem	2014	Boštjan Brešar Rastislav Krivoš-Belluš Gabriel Semanišin P. Šparl	2
+ PDF Chat	Settling the complexity of computing two-player Nash equilibria	2009	Xi Chen Xiaotie Deng Shang‐Hua Teng	2
+	Matrix multiplication via arithmetic progressions	1987	Don Coppersmith S. Winograd	2
+	How to Leak a Secret	2001	Ronald L. Rivest Adi Shamir Yael Tauman	2
+	Permanents, Pfaffian orientations, and even directed circuits (extended abstract)	1997	William McCuaig Neil Robertson Paul Seymour Robin Thomas	2
+	Pure Nash Equilibrium in Capacitated Selfish Replication (CSR) Game.	2014	S. Rasoul Etesami Tamer Başar	1
+	Discrete location theory	1991	Bhaba R. Sarker	1
+	Chains, antichains, and fibres	1987	Zbigniew Lonc Ivan Rival	1
+	New sparseness results on graph spanners	1992	Barun Chandra Gautam Das Giri Narasimhan José Soares	1
+	Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs	1996	László Babai Anna Gál Janós Kollár Lajos Rónyai Tibor Szabó Avi Wigderson	1
+	Extremal Graph Theory	1978	Béla Bollobás	1
+	Linear algorithm for optimal path cover problem on interval graphs	1990	Srinivasa R. Arikati C. Pandu Rangan	1
+	Rational Secret Sharing and Multiparty Computation: Extended Abstract	2006	Joseph Y. Halpern Vanessa Teague	1
+ PDF Chat	Permanents, Pfaffian Orientations, and Even Directed Circuits	1999	Neil Robertson Paul Seymour Robin Thomas	1
+	Partitioning a Graph into Small Pieces with Applications to Path Transversal	2017	Euiwoong Lee	1
+	Characterizations of strongly chordal graphs	1983	Martin Farber	1
+ PDF Chat	Advances on the Hamiltonian Completion Problem	1975	S. E. Goodman Stephen T. Hedetniemi Peter J. B. Slater	1
+	Covering all cliques of a graph	1990	Źsolt Tuza	1
+	Graph spanners	1989	David Peleg Alejandro A. Schäffer	1
+	A topological approach to evasiveness	1984	Jeff Kahn Michael Saks Dean Sturtevant	1
+	Totally-Balanced and Greedy Matrices	1985	Alan J. Hoffman Antoon Kolen Michel Sakarovitch	1
+	Approximation Algorithm for the Binary-Preference Capacitated Selfish Replication Game and a Tight Bound on its Price of Anarchy	2015	S. Rasoul Etesami Tamer Başar	1
+	An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs	1994	Alan Sprague	1
+	An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals	1990	Glenn K. Manacher Terrance A. Mankus C. Smith	1
+	A Linear Recognition Algorithm for Cographs	1985	Derek G. Corneil Yehoshua Perl Laura K. Stewart	1
+	On recognizing graph properties from adjacency matrices	1976	Ronald L. Rivest Jean Vuillemin	1
+	Neighborhood perfect graphs	1986	Jenö Lehel Zs. Tuza	1