#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1991

2018

- This year (2)
- Last 5 years (22)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sriram V. Pemmaraju, Rajiv Raman
- ICALP
- 2005

Given a graph G = (V, E) and positive integral vertex weights w : V â†’ N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize âˆ‘k i=1â€¦ (More)

- Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
- SIAM J. Comput.
- 1999

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process schedulingâ€¦ (More)

- Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju
- PODC
- 1996

Self-stabilization provides a non-masking approach to fault tolerance. Given this fact, one would hope that in a self-stabilizing system, the amount of disruption caused by a fault is proportional toâ€¦ (More)

- Lenwood S. Heath, Sriram V. Pemmaraju
- Algorithmica
- 1994

Given a finite set of points in a plane, a triangulation is a maximal set of nonintersecting line segments connecting the points. The weight of a triangulation is the sum of the Euclidean lengths ofâ€¦ (More)

Given a graph <i>G</i> = (<i>V,E</i>) and positive integral vertex weights <i>w</i> : <i>V</i> â†’ N, the <i>max-coloring problem</i> seeks to find a proper vertex coloring of <i>G</i> whose colorâ€¦ (More)

- Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, Sriram V. Pemmaraju
- SIAM J. Comput.
- 1999

The problem of computing equilibria for exchange economies has recently started to receive a great deal of attention in the theoretical computer science community. It has been shown that equilibriaâ€¦ (More)

- Sriram V. Pemmaraju, Imran A. Pirwani
- MobiHoc
- 2006

Using a dominating set as a coordinator in wireless networks has been proposed in many papers as an energy conservation technique. Since the nodes in a dominating set have the extra burden ofâ€¦ (More)

- Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
- ACM Journal of Experimental Algorithmics
- 2004

We consider two coloring problems: interval coloring and max-coloring for chordal graphs. Given a graph <i>G</i> = (<i>V</i>, <i>E</i>) and positive-integral vertex weights <i>w</i>:<i>V</i> â†’â€¦ (More)

- Sriram V. Pemmaraju, Aravind Srinivasan
- ICALP
- 2008

A basic randomized coloring procedure has been used in probabilistic proofs to obtain remarkably strong results on graph coloring. These results include the asymptotic version of the List Coloringâ€¦ (More)