Rajiv Raman |
|||
|
|
|
|
|
Journals |
|||
|
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function,
with T-H. Hubert Chan, Kevin L. Chang and Rajiv Raman. Algorithmica 2013.
On the complexity of the highway problem., with Khaled M. Elbassioni, Saurabh Ray, René Sitters: Theor. Comput. Sci. 460: 70-77 2012 Colouring vertices of triangle-free graphs without forests. with Konrad Dabrowski, Vadim V. Lozin, Bernard Ries Discrete Mathematics 312(7): 1372-1385, 2012 Max-coloring and online coloring with bandwidths on interval graphs,with Sriram V. Pemmaraju, Kasturi R. Varadarajan ACM Transactions on Algorithms 7(3): 35, 2011 Sub-Coloring and Hypo-Coloring Interval Graphs, with Rajiv Gandhi, Brad Greening, Sriram Pemmaraju Discrete Mathematics, Algorithms and Applications. Vol.2, Issue 3, 2010. Max-coloring and online coloring with bandwidths on interval graphs, with Sriram V. Pemmaraju, Kasturi R. Varadarajan ACM Transactions on Algorithms 7(3): 35 (2011) Sub-Coloring and Hypo-Coloring Interval Graphs,with Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju. Discrete Math., Alg. and Appl. 2(3): 331-346 (2010) An experimental study of different approaches to solve the market equilibrium problem., with Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Kasturi R. Varadarajan ACM Journal of Experimental Algorithmics 12 (2008) Approximating interval coloring and max-coloring in chordal graphs. , with Sriram V. Pemmaraju, Sriram Penumatcha. ACM Journal of Experimental Algorithmics 10 (2005) |
|||
Conferences |
|||
|
On the Approximability of the Maximum Interval Constrained Coloring Problem. Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman ISAAC (2) 2010: 168-179, 2009 Colouring Vertices of Triangle-Free Graphs. , with Konrad Dabrowski, Vadim V. Lozin, Bernard Ries WG 2010: 184-195 Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.,with J. Correa, Nicole Megow, Karol Suchan CTW 2009: 347-350 An SDP primal-dual algorithm for approximating the Lovász-theta function. T.-H. Hubert Chan, Kevin L. Chang, ISIT 2009: 2808-2812 On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. Khaled M. Elbassioni, Saurabh Ray, René Sitters SAGT 2009: 275-286 On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, RenĂ© Sitters SODA 2009: 1210-1219 Sub-coloring and Hypo-coloring Interval Graphs., with Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju. WG 2009: 122-132 An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Kasturi R. Varadarajan ALENEX/ANALCO 2005: 167-179 Computing Equilibrium Prices: Does Theory Meet Practice?. , with Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan. ESA 2005: 83-94 Approximation Algorithms for the Max-coloring Problem., with Sriram V. Pemmaraju. ICALP 2005: 1064-1075 Buffer minimization using max-coloring. Sriram V. Pemmaraju, Kasturi R. Varadarajan SODA 2004: 562-571 Approximating Interval Coloring and Max-Coloring in Chordal Graphs. . with Sriram V. Pemmaraju, Sriram Penumatcha WEA 2004: 399-416 |
|||