|
Search the dblp DataBase
Sriram V. Pemmaraju:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. [Citation Graph (0, 0)][DBLP] ALENEX/ANALCO, 2005, pp:167-179 [Conf]
- Lenwood S. Heath, Sriram V. Pemmaraju
Recognizing Leveled-Planar Dags in Linear Time. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1995, pp:300-311 [Conf]
- Sriram V. Pemmaraju, Rajiv Raman
Approximation Algorithms for the Max-coloring Problem. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1064-1075 [Conf]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
Hardness of Approximating Independent Domination in Circle Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:56-69 [Conf]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:70-82 [Conf]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
Automatic Data Decomposition for Message-Passing Machines. [Citation Graph (0, 0)][DBLP] LCPC, 1997, pp:64-78 [Conf]
- Sriram V. Pemmaraju, Imran A. Pirwani
Energy conservation via domatic partitions. [Citation Graph (0, 0)][DBLP] MobiHoc, 2006, pp:143-154 [Conf]
- Sukumar Ghosh, Kevin M. Lillis, Saurav Pandit, Sriram V. Pemmaraju
Robust Topology Control Protocols. [Citation Graph (0, 0)][DBLP] OPODIS, 2004, pp:94-109 [Conf]
- Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
Distributed Spanner Construction in Doubling Metric Spaces. [Citation Graph (0, 0)][DBLP] OPODIS, 2006, pp:157-171 [Conf]
- Kevin M. Lillis, Sriram V. Pemmaraju
Topology Control with Limited Geometric Information. [Citation Graph (0, 0)][DBLP] OPODIS, 2005, pp:427-442 [Conf]
- Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
Local approximation schemes for topology control. [Citation Graph (0, 0)][DBLP] PODC, 2006, pp:208-217 [Conf]
- Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju
Fault-Containing Self-Stabilizing Algorithms. [Citation Graph (0, 0)][DBLP] PODC, 1996, pp:45-54 [Conf]
- Sukumar Ghosh, Sriram V. Pemmaraju
Trade-offs in Fault-Containing Self-Stabilization. [Citation Graph (0, 0)][DBLP] PODC, 1997, pp:289- [Conf]
- Mehmet Hakan Karaata, Sriram V. Pemmaraju, Steven C. Bruell, Sukumar Ghosh
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees. [Citation Graph (0, 0)][DBLP] PODC, 1994, pp:374- [Conf]
- Sriram V. Pemmaraju
Equitable Coloring Extends Chernoff-Hoeffding Bounds. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:285-296 [Conf]
- Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju
Fault-containing network protocols. [Citation Graph (0, 0)][DBLP] SAC, 1997, pp:431-437 [Conf]
- Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
On the polynomial time computation of equilibria for certain exchange economies. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:72-81 [Conf]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
A (2 + epsilon)-approximation scheme for minimum domination on circle graphs. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:672-679 [Conf]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
Computing optimal alpha-fat and alpha-small decompositions. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:338-339 [Conf]
- Sriram V. Pemmaraju
Equitable colorings extend Chernoff-Hoeffding bounds. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:924-925 [Conf]
- Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka
Equitable colorings with constant number of colors. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:458-459 [Conf]
- Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
Buffer minimization using max-coloring. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:562-571 [Conf]
- Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2004, pp:399-416 [Conf]
- Sukumar Ghosh, Sriram V. Pemmaraju
Tradeoffs in fault-containing self-stabilization. [Citation Graph (0, 0)][DBLP] WSS, 1997, pp:157-169 [Conf]
- Teodor Rus, Sriram V. Pemmaraju
Using Graph Coloring in an Algebraic Compiler. [Citation Graph (0, 0)][DBLP] Acta Inf., 1997, v:34, n:3, pp:191-209 [Journal]
- Mirela Damian, Sriram V. Pemmaraju
Computing Optimal Diameter-Bounded Polygon Partitions. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:1, pp:1-14 [Journal]
- Lenwood S. Heath, Sriram V. Pemmaraju
New Results for the Minimum Weight Triangulation Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 1994, v:12, n:6, pp:533-552 [Journal]
- Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju
A Self-Stabilizing Algorithm for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP] Distributed Computing, 1997, v:10, n:4, pp:167-180 [Journal]
- Mirela Damian, Sriram V. Pemmaraju
APX-hardness of domination problems in circle graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:6, pp:231-237 [Journal]
- Ted Herman, Sriram V. Pemmaraju
Error-detecting codes and fault-containing self-stabilization. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:1-2, pp:41-46 [Journal]
- Sriram V. Pemmaraju, Clifford A. Shaffer
Analysis of the Worst Case Space Complexity of a PR Quadtree. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:5, pp:263-267 [Journal]
- Mirela Damian-Iordache, Sriram V. Pemmaraju
A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:42, n:2, pp:255-276 [Journal]
- Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
Approximating interval coloring and max-coloring in chordal graphs. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
- Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, Sriram V. Pemmaraju
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:2, pp:600-614 [Journal]
- Lenwood S. Heath, Sriram V. Pemmaraju
Stack and Queue Layouts of Directed Acyclic Graphs: Part II. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:5, pp:1588-1626 [Journal]
- Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
Stack and Queue Layouts of Directed Acyclic Graphs: Part I. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:4, pp:1510-1539 [Journal]
- Lenwood S. Heath, Sriram V. Pemmaraju
Stack and Queue Layouts of Posets. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1997, v:10, n:4, pp:599-625 [Journal]
- Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
On Equitable Coloring of d-Degenerate Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:1, pp:83-95 [Journal]
- Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pirwani
Topology Control and Geographic Routing in Realistic Wireless Networks. [Citation Graph (0, 0)][DBLP] ADHOC-NOW, 2007, pp:15-31 [Conf]
- Sriram V. Pemmaraju, Imran A. Pirwani
Good Quality Virtual Realization of Unit Ball Graphs. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:311-322 [Conf]
- Ted Herman, Sriram V. Pemmaraju, Laurence Pilard, Morten Mjelde
Temporal Partition in Sensor Networks. [Citation Graph (0, 0)][DBLP] SSS, 2007, pp:325-339 [Conf]
- Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju
Fault-containing self-stabilizing distributed protocols. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2007, v:20, n:1, pp:53-73 [Journal]
Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network. [Citation Graph (, )][DBLP]
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. [Citation Graph (, )][DBLP]
The Randomized Coloring Procedure with Symmetry-Breaking. [Citation Graph (, )][DBLP]
Greedy Routing with Bounded Stretch. [Citation Graph (, )][DBLP]
Return of the primal-dual: distributed metric facilitylocation. [Citation Graph (, )][DBLP]
Brief announcement: a framework for building self-stabilizing overlay networks. [Citation Graph (, )][DBLP]
Rapid randomized pruning for fast greedy distributed algorithms. [Citation Graph (, )][DBLP]
On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. [Citation Graph (, )][DBLP]
Sub-coloring and Hypo-coloring Interval Graphs. [Citation Graph (, )][DBLP]
Finding Facilities Fast. [Citation Graph (, )][DBLP]
Local Approximation Schemes for Topology Control [Citation Graph (, )][DBLP]
Localized Spanners for Wireless Networks [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.326secs
|