2007 |
15 | EE | 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) |
14 | EE | 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 |
13 | EE | Andreas Baltz,
Sandro Esquivel,
Lasse Kliemann,
Anand Srivastav:
The Price of Anarchy in Selfish Multicast Routing.
CAAN 2006: 5-18 |
2005 |
12 | EE | 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 |
11 | EE | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the Minimum Load Coloring Problem.
WAOA 2005: 15-26 |
10 | EE | Andreas Baltz,
Peter Hegarty,
Jonas Knape,
Urban Larsson,
Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc.
Electr. J. Comb. 12: (2005) |
9 | EE | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks 45(3): 119-124 (2005) |
8 | EE | Andreas Baltz,
Anand Srivastav:
Approximation algorithms for the Euclidean bipartite TSP.
Oper. Res. Lett. 33(4): 403-410 (2005) |
2004 |
7 | EE | Andreas Baltz,
Lasse Kliemann:
Spectral Analysis.
Network Analysis 2004: 373-416 |
6 | EE | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
Electronic Notes in Discrete Mathematics 17: 9-13 (2004) |
2003 |
5 | EE | Andreas Baltz,
Anand Srivastav:
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory.
CIAC 2003: 165-177 |
4 | EE | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract.
FSTTCS 2003: 13-22 |
2001 |
3 | EE | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
RANDOM-APPROX 2001: 192-201 |
2 | EE | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electronic Notes in Discrete Mathematics 7: 42-45 (2001) |
1999 |
1 | | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
RANDOM-APPROX 1999: 138-143 |