Publications

Book Chapters

• Multicast routing and design of sparse connectors. A. Baltz, A. Srivastav. In: J. Lerner, D. Wagner, K.A. Zweig (eds.), Algorithmics of Large and Complex Networks, Springer Lecture Notes in Computer Science 5515, 247–265, 2009.
• One-Sided Discrepancy of linear hyperplanes in finite vector spaces. N. Hebbinghaus, T. Schoen, A. Srivastav. In: W.W.L. Chen, W.T. Gowers, H. Halberstam, W.M. Schmidt, R.C. Vaughan (eds.), Analytic Number Theory, Essays in Honour of Klaus Roth, 205–223, Cambridge University Press, Cambridge 2009.
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing. L. Kliemann, A. Srivastav. In: J. Lerner, D. Wagner, K.A. Zweig (eds.). Algorithmics of Large and Complex Networks, Springer Lecture Notes in Computer Science 5515, 292–318, 2009. The original publication is available at www.springerlink.com.
• Parallel Algorithms via the Probabilistic Method. L. Kliemann, A. Srivastav. In: S. Rajasekaran, J.H. Reif (eds.). Parallel Computing: Models, Algorithms, and Applications, 18–61, Chapman & Hall/CRC, 2008. Preliminary version.
• Randomized Algorithms for Mixed Matching and Covering Problems in Brachytherapy. H. Fohlin, L. Kliemann, A. Srivastav. In: C.J.S. Alves, P.M. Pardalos, L.N. Vicente (eds.). Optimization in Medicine, 71–102, Springer, 2008. Preliminary version.
• The Lovasz Local Lemma and Scheduling. A. Srivastav. In: E. Bampis, K. Jansen (eds.), Efficient Approximation and On-Line Algorithms, Springer Lecture Notes in Computer Science 3484, 321–347, 2006.
• Derandomization in Combinatorial Optimization. A. Srivastav. In: Pardalos, Rajasekaran, Reif, Rolim (eds.), Handbook of Randomized Computing, Volume II, Chapter 18, 731–842, Kluwer Academic Publishers, 2001.

Preprints

• Solving the TSP with multiple time windows – Exact and Approximate Algorithms. A. Baltz, M. El Ouali, V. Sauerland, A. Srivastav. 14 pages, Institut für Informatik, CAU Kiel, 2009.
• Efficient linear optimization for asset liability management. C. Krapp, V. Sauerland, A. Srivastav. Institut für Informatik, CAU Kiel, 2009.

Journal Publications

• S. Eggert, L. Kliemann, P. Munstermann, A. Srivastav. Bipartite Matching in the Semi-Streaming Model. Document ID: 519a88bb-5f5a-409d-8293-13cd80a66b36. Algorithmica, 2011. DOI: 10.1007/s00453-011-9556-8. Conference version in proceedings of ESA 2009.
• C. Patvardhan, J. Rückelt, V. Sauerland, T. Slawig, A. Srivastav, B. Ward. Parameter Optimization and Uncertainty Analysis in a Model of Oceanic CO2-Uptake using a Hybrid Algorithm and Algorithmic Differentiation. Nonlinear Analysis B: Real World Applications 11, 3992–4009, 2010.
• Automatic cloud classification of the whole sky images. A. Heinle, A. Macke, A. Srivastav. Atmospheric Measurement Techniques 3, 269–299, 2010.
• Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. M. Gnewuch, A. Srivastav, C. Winzen. Journal of Complexity 25, 115–127, 2009.
• On the Minimum Load Coloring Problem. N. Ahuja, A. Baltz, B. Doerr, A. Privetivy, A. Srivastav. Journal of Discrete Algorithms 5, 533–545, 2007.
• Cubature formulas for function spaces with moderate smoothness. M. Gnewuch, R. Lindloh, R. Schneider, A. Srivastav. Journal of Complexity 23(4–6), 828–850, 2007. Preprint.
• Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. A. Baltz, D. Dubhashi, A. Srivastav, L. Tansini, S. Werth. Random Structures and Algorithms 30, 206–225, 2007. Preprint.
• Three-dimensional reconstruction of seed implants by randomized rounding and visual evaluation. F.-A. Siebert, A. Srivastav, L. Kliemann, H. Fohlin, G. Kovács. Medical Physics 34(3), 967–957 2007.
• Bounds and constructions for the star-discrepancy via delta-covers. B. Doerr, M. Gnewuch, A. Srivastav. Journal of Complexity 21(5), 691–709, 2005.
• Constructions of sparse asymmetric connectors with number-theoretic methods. A. Baltz, G. Jäger, A. Srivastav. Networks 45 (3), 1–6, 2005.
• Approximation algorithms for the Euclidean bipartite TSP. A. Baltz, A. Srivastav. Operations Research Letters 33, 403–410, 2005.
• Improved approximation algorithms for maximum graph partitioning problems. G. Jäger, A. Srivastav. Journal of Combinatorial Optimization 10(2), 133–167, 2005.
• Fast Approximation of minimum multicast congestion - Implementation vs. Theory. A. Baltz, A. Srivastav. RAIRO Operations Research 38, 319–344, 2004.
• Discrepancy of cartesian products of arithmetic progressions. B. Doerr, A. Srivastav, P. Wehr. Electronic Journal of Combinatorics 11(1), 16 pages, 2004.
• Ordered binary decision diagrams and the Shannon effect. C. Gröpl, H.J. Prömel, A. Srivastav. Discrete Applied Math. 142, 67–85, 2004.
• Multicolor discrepancy. B. Doerr, A. Srivastav. Combinatorics, Probability and Computing, 12, 365–399, 2003.
• Approximation algorithms for pick-and-place robots. C. Michel, H. Schroeter, A. Srivastav. Annals of Operations Research 107, 321–333, 2002.
• On the evolution of the worst-case OBDD size. C. Gröpl, H. J. Prömel, A. Srivastav. Information Processing Letters 77, 1–7, 2001.
• Probabilistic construction of small sum-free sets via large Sidon sets. A. Baltz, A. Srivastav, T. Schoen. Colloquium Math. 2, 171–176, 2000.
• Complexity, representation and approximation of integral multicommodity flows. A. Srivastav, P. Stangier. Discrete Applied Math. 99, 183–208, 2000.
• Tight approximation for resource constrained scheduling and bin packing. A. Srivastav, P. Stangier. Disc. Appl. Math. 79, 223–245, 1997.
• Algorithmic Chernoff-Hoeffding inequalities in integer programming. A. Srivastav, P. Stangier. Random Structures and Algorithms 8 (1), 27–58, 1996.
• Weighted fractional and integral k-matching in hypergraphs. A. Srivastav, P. Stangier. Disc. Appl. Math. 57, 255–269, 1995.
• Extreme points of positive functionals and spectral states on real Banach algebras. A. Srivastav. Can. J. Math. Vol. 44 (4), 856–866, 1992.
• Quaternation-valued representation and commutativity criteria for real Banach algebras. A. Srivastav. 8 pages. In: Festschrift zum 60. Geburtstag von Professor Dr. George Maltese, Mathematisches Institut, Westfälische Wilhelms Universität Münster, 1991.
• A generalization of the Gleason-Kahane-Zelazko theorem for real Banach algebras. A. Srivastav. Indian Journal of Mathematics 32, 217–221, 1991.
• Commutativity criteria for real Banach algebras. A. Srivastav. Arch. Math. 54, 65–72, 1990.
• A characterization for the classical states of the quantum harmonic oscillator by means of de Finetti's theorem. A. Bach, A. Srivastav. Comm. Math. Phys. 123, 453–462, 1989.
• Absolute continuity and Radon-Nikodym type theorems for weights and traces on von Neumann algebras. A. Srivastav. Rendiconti del Circolo Matematico di Palermo, Series 2, Vol. 37, 257–270, 1989.

Refereed Conference Publications

• C. Patvardhan, V. Sauerland, A. Srivastav. Systemic studies on large scale natural systems: An efficient quantum evolutionary algorithm for marine CO2-simulation. In: Proceedings of the International Conference on Applied Systems Research, Dayalbagh Educational Instute, Agra, India, 2009, NSC 2009, pages 44-47, 2009.
• C. Patvardhan, P. Prakash, A. Srivastav. A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. In: Proceedings of the International Conference on Operations Research Applications In Engineering And Management, Tiruchirappalli, India, May 2009, ICOREM 2009, pages 2061-2064, 2009. Best OR Application in Engineering Award, sponsored by the Anna University, Tiruchirappalli. Accepted at the International Journal of Mathematics in Operations Research.
• N. Hebbinghaus, A. Srivastav. Discrepancy of Centered Arithmetic Progressions in Zp. To appear in Proceedings of EuroComb 2011.
• Inapproximability of b-Matching in k-uniform Hypergraphs. M. El Ouali, A. Fretwurst, A. Srivastav. In: N. Katoh, A. Kumar (eds.). Proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, Springer Lecture Notes in Computer Science 6552, 57–69, 2011.
• Bipartite Graph Matchings in the Semi-Streaming Model. S. Eggert, L. Kliemann, A. Srivastav. In: A. Fiat, P. Sanders (eds.). Proceedings of the 17th European Symposium on Algorithms, ESA 2009, Springer Lecture Notes in Computer Science 5757, 492–503, 2009. The original publication is available at www.springerlink.com. Also presented at MADALGO Workshop on Massive Data Algorithmics, 2009.
• Experimental Study of Non-Oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. L. Kliemann, A. Srivastav. In: Jan Vahrenhold (ed.). Proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, SEA 2009, Springer Lecture Notes in Computer Science 5526, 185–196, 2009. The original publication is available at www.springerlink.com.
• Fixed-Point FIR filters and filter banks: improved design by randomized quantizations. U. Heute, J. Kliewer, V. Sauerland, A. Srivastav. In: Proceedings of the 20th IEEE International Symposium on Signal Processing and its Applications, ISSPA 2007, 4 pages, Sharjah, U.A.E., 2007.
• Solving Generalized Maximum Dispersion with Linear Programming. G. Jäger, A. Srivastav, Katja Wolf. In: Ming-Yang Kao, Xiang-Yang Li (eds.): Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6–8, 2007, Proceedings. Springer Lecture Notes in Computer Science 4508, 1–10, 2007.
• Enhanced quantum evolutionary algorithm for difficult knapsack problems. C. Patvardhan, A. Nayaran, A. Srivastav. In: A. Ghosh, R.K. De, S.K. Pal (eds.): Second International Conference on Pattern Recognition and Machine Intelligence, Premi 2007, Indian Statistical Institute, Kolkata, India, Springer Lecture Notes in Computer Science 4814, 252–260, 2007.
• Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. A. Srivastav, S. Werth. In: V. Arvind, S. Prasad (eds.) Foundations of Software Technology and theoretical Computer Science, 27th International Conference, FSTTCS 2007. New Delhi, India, December 12–14, 2007, Proceedings. Springer Lecture Notes in Computer Science 4855, 497–507, 2007. Preliminary version.
• The Price of Anarchy in Selfish Multicast Routing. A. Baltz, Sandro Esquivel, L. Kliemann, A. Srivastav. In: Thomas Erlebach (ed.). 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2006, Springer Lecture Notes in Computer Science 4235, 5–18, 2006. The original publication is available at www.springerlink.com.
• On the Minimum Load Coloring Problem. N. Ahuja, A. Baltz, B. Doerr, A. Privetivy, A. Srivastav. In: T. Erlebach, G. Persiano (eds.), Third Workshop on Approximation and Online Algorithms, WAOA 2005, Palma de Mallorca, Spain, October 6–7, 2005, Springer Lecture Notes in Computer Science 3879, 15–26, 2005.
• Improved approximation algorithms for maximum graph partitioning problems. G. Jäger, A. Srivastav. In: Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, Madras, India, December 16–18, 2004, Springer Lecture Notes in Computer Science 3328, 348–359, 2004.
• Elementary constructions of sparse asymmetric connectors. A. Baltz, G. Jäger, A. Srivastav. In: Proceedings of 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, Mumbai, India, December 15–17, 2003, Lecture Notes in Computer Science 2914, 13–22, 2003.
• Fast Approximation of minimum multicast congestion – Implementation vs. Theory. A. Baltz, A. Srivastav. In: Proceedings of 5th Italian Conference on Algorithms and Complexity, CIAC 2003, Rome, Italy, May 2003, Lecture Notes in Computer Science Vol. 2653, 165–177, 2003.
• On Constrained Hypergraph Coloring and Scheduling. N. Ahuja, A. Srivastav. In: Proceedings of the 5th International Workshop on Approximation Algorithms and Combinatorial Optimization, APPROX 2002, Rome, 2002, Springer Lecture Notes in Computer Science 2462, 14–25, 2002.
• On the b-partite directed random travelling salesman problem and its assignment relaxation. A. Baltz, T. Schoen, A. Srivastav. In: Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, California, Springer Lecture Notes in Computer Science 2129, 192–201, 2001.
• Recursive randomized coloring beats fair dice coloring. B. Doerr, A. Srivastav. In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001, Springer Lecture Notes in Computer Science 2010, 183–194, 2001.
• Probabilistic construction of small sum-free sets via large Sidon sets. A. Baltz, A. Srivastav, T. Schoen. In: Proceedings of 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 1999, Berkeley, California, Springer Lecture Notes in Computer Science 1671, 138–143, 1999.
• Approximation of multicolor discrepancy. B. Doerr, A. Srivastav. In: Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1999, Berkeley, California, Springer Lecture Notes in Computer Science 1671, 39–50, 1999.
• Size and structure of random OBDDs. C. Gröpl, H.J. Prömel, A. Srivastav. In: Proceedings of the 15th Annual Symposium on Aspects of Theoretical Computer Science, STACS 1998, Paris, M. Morvan, C. Meinel, D. Korb (eds.), Springer Lecture Notes in Computer Science 1373, 238–248, 1998.
• Blockwise variable orderings for shared BDDs. H. Preuß, A. Srivastav. In: Proceedings of the Symposium on Mathematical Foundation of Computer Science, MFCS 1998, Brno, Czech Republic, L. Brim, J. Gruska, J. Zlatuska (eds.), Springer Lecture Notes in Computer Science 1450, 636–644, 1998.
• Finding densest subgraphs with semidefinite programming. A. Srivastav, K. Wolf. In: Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998, July 1998, Aalborg, Denmark, K. Jansen, J. Rolim (eds.), Springer Lecture Notes in Computer Science 1444, 181–193, 1998.
• A parallel approximation algorithm for resource constrained scheduling and bin packing. A. Srivastav, P. Stangier. In: Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, G. Bilardi, A. Ferreira, R. Lüling, J. Rolim (eds.), Springer Lecture Notes in Computer Science 1253, 147–159, 1997.
• Integer multicommodity flows with reduced demands. A. Srivastav, P. Stangier. In: Proceedings of the 1st Annual European Symposium on Algorithms, ESA 1993, Bonn/Bad Honnef, T. Lengauer (ed.), Springer Lecture Notes in Computer Science 726, 360–372, 1993.
• On quadratic lattice approximations. A. Srivastav, P. Stangier. In: Proceedings of the 4th International Symposium on Algorithms and Computation, ISAAC 1993, Hong-Kong, K.W. Ng, P. Raghavan, N.V. Balasubramanian (eds.), Springer Lecture Notes in Computer Science 762, 176–184, 1993.

Theses (Diplom, Dissertation, Habilitation)

• Derandomized Algorithms in Combinatorial Optimization. A. Srivastav. 180 pages. Habilitation, Institut für Informatik, Freie Universität Berlin, 1995.
• Charakterisierungssätze für reelle Banach Algebren und Sätze vom Radon-Nikodym Typ für Spuren auf C*- und W*-Algebren. A. Srivastav. 112 pages, Doctoral Dissertation, Mathematisches Institut, Westfälische Wilhelms-Universität Münster, 1987.
• Ladungswolken und Stromverteilung in angeregten Wasserstoffatomen. A. Srivastav. 80 pages, Diploma Thesis, Institut für Theoretische Physik, Westfälische Wilhelms-Universität Münster, 1988.
• Charakterisierung von C*-Algebren mit Hilfe des Berkson-Glickfeld Theorems. A. Srivastav. 98 pages, Diploma Thesis, Mathematisches Institut, Westfälische Wilhelms-Universität Münster, 1984.