The following pages link to Rajiv Raman (Q690480):
Displayed 27 items.
- On the complexity of the highway problem (Q690481) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Constant factor approximation for the weighted partial degree bounded edge packing problem (Q1631679) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- On the Approximability of the Maximum Interval Constrained Coloring Problem (Q3060771) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Max-coloring and online coloring with bandwidths on interval graphs (Q3189018) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Approximating interval coloring and max-coloring in chordal graphs (Q3507752) (← links)
- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems (Q3648863) (← links)
- (Q4606318) (← links)
- (Q4633936) (← links)
- (Q5009639) (← links)
- An experimental study of different approaches to solve the market equilibrium problem (Q5269284) (← links)
- Algorithms – ESA 2005 (Q5475821) (← links)
- (Q5501309) (← links)
- Automata, Languages and Programming (Q5716853) (← links)
- Sub-coloring and Hypo-coloring Interval Graphs (Q5851099) (← links)
- (Q5874550) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- (Q6187793) (← links)