MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. On the complexity of the highway problem
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and René Sitters
    Theoretical Computer Science 460: 70-77, 2012
  2. Max-coloring and online coloring with bandwidths on interval graphs
    Sriram V. Pemmaraju, Rajiv Raman, and Kasturi Varadarajan
    ACM Transactions on Algorithms 7 (3): 35:1-35:21, 2011
  3. On the Approximability of the Maximum Interval Constrained Coloring Problem
    Stefan Canzar, Khaled Elbassioni, Amr Elmasry, and Rajiv Raman
    In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, Jeju Island, Korea, 2010, 168-179
  4. Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
    Jose R. Correa, Nicole Megow, Rajiv Raman, and Karol Suchan
    In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), Paris, France, 2009, 347-350
  5. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, Paphos, Cyprus, 2009, 275-286
    [PDF: Download: 0901.1140v2.pdf]
  6. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 1210-1219, paper no. 12.B.