The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anand Srivastav: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nitin Ahuja, Anand Srivastav
    On Constrained Hypergraph Coloring and Scheduling. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:14-25 [Conf]
  2. Anand Srivastav, Katja Wolf
    Finding Dense Subgraphs with Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:181-191 [Conf]
  3. Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
    The Price of Anarchy in Selfish Multicast Routing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:5-18 [Conf]
  4. Andreas Baltz, Anand Srivastav
    Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:165-177 [Conf]
  5. Anand Srivastav, Peter Stangier
    Integer Multicommodity Flows with Reduced Demands. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:360-371 [Conf]
  6. Anand Srivastav, Peter Stangier
    Tight Approximations for Resource Constrained Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:307-318 [Conf]
  7. Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
    Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:360-371 [Conf]
  8. Andreas Baltz, Gerold Jäger, Anand Srivastav
    Constructions of Sparse Asymmetric Connectors: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:13-22 [Conf]
  9. Gerold Jäger, Anand Srivastav
    Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:348-359 [Conf]
  10. Anand Srivastav, Peter Stangier
    A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:147-158 [Conf]
  11. Anand Srivastav, Peter Stangier
    On Quadratic Lattice Approximations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:176-184 [Conf]
  12. Anand Srivastav, Peter Stangier
    Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:226-233 [Conf]
  13. Harry Preuß, Anand Srivastav
    Blockwise Variable Orderings for Shared BDDs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:636-644 [Conf]
  14. Andreas Baltz, Tomasz Schoen, Anand Srivastav
    On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:192-201 [Conf]
  15. Andreas Baltz, Tomasz Schoen, Anand Srivastav
    Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:138-143 [Conf]
  16. Benjamin Doerr, Anand Srivastav
    Approximation of Multi-color Discrepancy. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:39-50 [Conf]
  17. Benjamin Doerr, Anand Srivastav
    Recursive Randomized Coloring Beats Fair Dice Random Colorings. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:183-194 [Conf]
  18. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:238-248 [Conf]
  19. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
    On the Minimum Load Coloring Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:15-26 [Conf]
  20. Benjamin Doerr, Anand Srivastav, Petra Wehr
    Discrepancy of Cartesian Products of Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  21. Benjamin Doerr, Anand Srivastav
    Multicolour Discrepancies. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:4, pp:365-399 [Journal]
  22. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    Ordered binary decision diagrams and the Shannon effect. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:67-85 [Journal]
  23. Anand Srivastav, Peter Stangier
    On Complexity, Representation and Approximation of Integral Multicommodity Flows. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:183-208 [Journal]
  24. Anand Srivastav, Peter Stangier
    Weighted Fractional and Integral K-matching in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:2-3, pp:255-269 [Journal]
  25. Anand Srivastav, Peter Stangier
    Tight Approximations for Resource Constrained Scheduling and Bin Packing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:223-245 [Journal]
  26. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    On the evolution of the worst-case OBDD size. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:1-7 [Journal]
  27. Benjamin Doerr, Michael Gnewuch, Anand Srivastav
    Bounds and constructions for the star-discrepancy via ?-covers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:5, pp:691-709 [Journal]
  28. Gerold Jäger, Anand Srivastav
    Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:2, pp:133-167 [Journal]
  29. Andreas Baltz, Gerold Jäger, Anand Srivastav
    Constructions of sparse asymmetric connectors with number theoretic methods. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:119-124 [Journal]
  30. Andreas Baltz, Anand Srivastav
    Approximation algorithms for the Euclidean bipartite TSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:403-410 [Journal]
  31. Anand Srivastav, Peter Stangier
    Algorithmic Chernoff-Hoeffding inequalities in integer programming. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:8, n:1, pp:27-58 [Journal]
  32. Gerold Jäger, Anand Srivastav, Katja Wolf
    Solving Generalized Maximum Dispersion with Linear Programming. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:1-10 [Conf]

  33. Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. [Citation Graph (, )][DBLP]


  34. Multicast Routing and Design of Sparse Connectors. [Citation Graph (, )][DBLP]


  35. Bipartite Graph Matchings in the Semi-streaming Model. [Citation Graph (, )][DBLP]


  36. Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  37. Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002