 | 2009 |
|---|
| 46 |       | Andreas Baltz,
Anand Srivastav:
Multicast Routing and Design of Sparse Connectors.
Algorithmics of Large and Complex Networks 2009: 247-265 |
| 45 | | Lasse Kliemann,
Anand Srivastav:
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.
Algorithmics of Large and Complex Networks 2009: 292-318 |
| 44 | | Sebastian Eggert,
Lasse Kliemann,
Anand Srivastav:
Bipartite Graph Matchings in the Semi-streaming Model.
ESA 2009: 492-503 |
| 43 | | Lasse Kliemann,
Anand Srivastav:
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.
SEA 2009: 185-196 |
| 2007 |
|---|
| 42 | | Gerold Jäger,
Anand Srivastav,
Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming.
AAIM 2007: 1-10 |
| 41 | | Anand Srivastav,
Sören Werth:
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem.
FSTTCS 2007: 497-507 |
| 40 | | Michael Gnewuch,
René Lindloh,
Reinhold Schneider,
Anand Srivastav:
Cubature formulas for function spaces with moderate smoothness.
J. Complexity 23(4-6): 828-850 (2007) |
| 39 | | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the minimum load coloring problem.
J. Discrete Algorithms 5(3): 533-545 (2007) |
| 38 | | Andreas Baltz,
Devdatt P. Dubhashi,
Anand Srivastav,
Libertad Tansini,
Sören Werth:
Probabilistic analysis for a multiple depot vehicle routing problem.
Random Struct. Algorithms 30(1-2): 206-225 (2007) |
| 2006 |
|---|
| 37 | | Andreas Baltz,
Sandro Esquivel,
Lasse Kliemann,
Anand Srivastav:
The Price of Anarchy in Selfish Multicast Routing.
CAAN 2006: 5-18 |
| 2005 |
|---|
| 36 | | Andreas Baltz,
Devdatt P. Dubhashi,
Libertad Tansini,
Anand Srivastav,
Sören Werth:
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem.
FSTTCS 2005: 360-371 |
| 35 | | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the Minimum Load Coloring Problem.
WAOA 2005: 15-26 |
| 34 | | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
J. Comb. Optim. 10(2): 133-167 (2005) |
| 33 | | Benjamin Doerr,
Michael Gnewuch,
Anand Srivastav:
Bounds and constructions for the star-discrepancy via ?-covers.
J. Complexity 21(5): 691-709 (2005) |
| 32 | | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks 45(3): 119-124 (2005) |
| 31 | | Andreas Baltz,
Anand Srivastav:
Approximation algorithms for the Euclidean bipartite TSP.
Oper. Res. Lett. 33(4): 403-410 (2005) |
| 2004 |
|---|
| 30 | | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
FSTTCS 2004: 348-359 |
| 29 | | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect.
Discrete Applied Mathematics 142(1-3): 67-85 (2004) |
| 28 | | Benjamin Doerr,
Anand Srivastav,
Petra Wehr:
Discrepancy of Cartesian Products of Arithmetic Progressions.
Electr. J. Comb. 11(1): (2004) |
| 27 | | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
Electronic Notes in Discrete Mathematics 17: 9-13 (2004) |
| 2003 |
|---|
| 26 | | Andreas Baltz,
Anand Srivastav:
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory.
CIAC 2003: 165-177 |
| 25 | | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract.
FSTTCS 2003: 13-22 |
| 24 |  | Benjamin Doerr,
Anand Srivastav:
Multicolour Discrepancies.
Combinatorics, Probability & Computing 12(4): 365-399 (2003) |
| 2002 |
|---|
| 23 | | Nitin Ahuja,
Anand Srivastav:
On Constrained Hypergraph Coloring and Scheduling.
APPROX 2002: 14-25 |
| 2001 |
|---|
| 22 | | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
RANDOM-APPROX 2001: 192-201 |
| 21 | | Benjamin Doerr,
Anand Srivastav:
Recursive Randomized Coloring Beats Fair Dice Random Colorings.
STACS 2001: 183-194 |
| 20 | | Anand Srivastav,
Hartmut Schroeter,
Christoph Michel:
Approximation Algorithms for Pick-and-Place Robots.
Annals OR 107(1-4): 321-338 (2001) |
| 19 | | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electronic Notes in Discrete Mathematics 7: 42-45 (2001) |
| 18 | | Benjamin Doerr,
Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -.
Electronic Notes in Discrete Mathematics 7: 78-81 (2001) |
| 17 | | Benjamin Doerr,
Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.
Electronic Notes in Discrete Mathematics 8: 27-30 (2001) |
| 16 | | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
On the evolution of the worst-case OBDD size.
Inf. Process. Lett. 77(1): 1-7 (2001) |
| 2000 |
|---|
| 15 | | Anand Srivastav,
Peter Stangier:
On Complexity, Representation and Approximation of Integral Multicommodity Flows.
Discrete Applied Mathematics 99(1-3): 183-208 (2000) |
| 1999 |
|---|
| 14 | | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
RANDOM-APPROX 1999: 138-143 |
| 13 | | Benjamin Doerr,
Anand Srivastav:
Approximation of Multi-color Discrepancy.
RANDOM-APPROX 1999: 39-50 |
| 12 | | Anand Srivastav,
Hartmut Schroeter,
Christoph Michel:
Alternating TSP and Printed Circuit Board Assembly.
Electronic Notes in Discrete Mathematics 3: 179-183 (1999) |
| 1998 |
|---|
| 11 | | Anand Srivastav,
Katja Wolf:
Finding Dense Subgraphs with Semidefinite Programming.
APPROX 1998: 181-191 |
| 10 | | Harry Preuß,
Anand Srivastav:
Blockwise Variable Orderings for Shared BDDs.
MFCS 1998: 636-644 |
| 9 | | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).
STACS 1998: 238-248 |
| 1997 |
|---|
| 8 | | Anand Srivastav,
Peter Stangier:
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing.
IRREGULAR 1997: 147-158 |
| 7 | | Anand Srivastav,
Peter Stangier:
Tight Approximations for Resource Constrained Scheduling and Bin Packing.
Discrete Applied Mathematics 79(1-3): 223-245 (1997) |
| 1996 |
|---|
| 6 | | Anand Srivastav,
Peter Stangier:
Algorithmic Chernoff-Hoeffding inequalities in integer programming.
Random Struct. Algorithms 8(1): 27-58 (1996) |
| 1995 |
|---|
| 5 | | Anand Srivastav,
Peter Stangier:
Weighted Fractional and Integral K-matching in Hypergraphs.
Discrete Applied Mathematics 57(2-3): 255-269 (1995) |
| 1994 |
|---|
| 4 | | Anand Srivastav,
Peter Stangier:
Tight Approximations for Resource Constrained Scheduling Problems.
ESA 1994: 307-318 |
| 3 | | Anand Srivastav,
Peter Stangier:
Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming.
ISAAC 1994: 226-233 |
| 1993 |
|---|
| 2 | | Anand Srivastav,
Peter Stangier:
Integer Multicommodity Flows with Reduced Demands.
ESA 1993: 360-371 |
| 1 | | Anand Srivastav,
Peter Stangier:
On Quadratic Lattice Approximations.
ISAAC 1993: 176-184 |
