Willkommen auf der Website der Arbeitsgruppe Diskrete Optimierung

Recent Publications of the Group

Publications Prof. Dr. Anand Srivastav:

Books

Submitted

Peer-Revied Articles in Journals, Conference Proceedings and Books

Books

William W. L. Chen, Anand Srivastav, Gioncarlo Travaglini, A Panorama of Discrepancy Theory, Springer-Verlag, 681 pages, 2014.

Submitted

Lasse Kliemann, Jan Schiemann, Anand Srivastav: Finding Euler Tours in the StrSort Model. CoRR abs/1610.03412 (2016)

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav: On the Query Complexity of Black-Peg AB-Mastermind. CoRR abs/1611.05907 (2016)

Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten Reusch, Philip Rosenstiel. An Improved Filtering Algorithm for Big Read Datasets. arXiv:1610.03443 [q-bio.GN] (2016). Submitted to BMC Bioinformatics

Peer-Revied Articles in Journals, Conference Proceedings and Books

2017

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav: Swap Equilibria under Link and Vertex Destruction. Games 8(1), 14; doi:10.3390/g8010014 (registering DOI) .

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav: Price of anarchy for graph coloring games with concave payoff. Journal of Dynamics and Games (JDG) 4(1):41-58 (2017). DOI:10.3934/jdg.2017003

Iris Kriest, Volkmar Sauerland, Samar Khatiwala, Anand Srivastav and Andreas Oschlies: Calibrating a global three-dimensional biogeochemical ocean model (MOPS-1.0). Geoscientific Model Development 10(1): 127-154 (2017). DOI:10.5194/gmd-10-127-2017

2016

Mourad El Ouali, Peter Munstermann, Anand Srivastav: Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74(2): 574-588 (2016). DOI:10.1007/s00453-014-9962-9

Mourad El Ouali, Helena Fohlin, Anand Srivastav: An approximation algorithm for the partial vertex cover problem in hypergraphs. Journal of Combinatorial Optimization 31(2): 846-864 (2016). DOI:10.1007/s10878-014-9793-2

C. Patvardhan, Sulabh Bansal, Anand Srivastav: Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm and Evolutionary Computation 26: 175-190 (2016). DOI:10.1016/j.swevo.2015.09.005

Lasse Kliemann, Christian Schielke, Anand Srivastav: A Streaming Algorithm for the Undirected Longest Path Problem. Proceedings of the 24th Annual European Symposium on Algorithms, Aarhus, Denmark, August 2016 (ESA 2016), pages 56:1–56:17 (2016). DOI:10.4230/LIPIcs.ESA.2016.56

2015

Andreas Baltz, Mourad El Ouali, Gerold Jäger: Volkmar Sauerland, Anand Srivastav. Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. Journal of the Operational Research Society 66(4): 615-626 (2015). DOI:10.1057/jors.2014.17

C Patvardhan, Sulabh Bansal, Anand Srivastav: Quantum-Inspired Evolutionary Algorithm for Difficult Knapsack Problems. Memetic Computing 7(2):135-155 (2015). DOI:10.1007/s12293-015-0162-1

C Patvardhan, Sulabh Bansal, Anand Srivastav: Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. Journal of Computational and Applied Mathematics 285:86-99 (2015). DOI:10.1016/j.cam.2015.02.016

C Patvardhan, Sulabh Bansal, Anand Srivastav: Towards right amount of randomness in Quantum-inspired Evolutionary Algorithms. Soft Computing 2015:1-20 (2015). DOI:10.1007/s00500-015-1880-5

C Patvardhan, Prem Prakash, Anand Srivastav: Fast Heuristics for large instances of the Euclidean Bounded Diameter Minimum Spanning tree problem. Informatica 39:281-292 (2015)

2014

Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the hitting set problem. Theoretical Computer Science 555: 23-34 (2014). DOI:10.1016/j.tcs.2014.03.029

Nils Hebbinghaus, Anand Srivastav:  Discrepancy of Centered Arithmetic Progressions in Zp. European Journal of Combinatorics 35:324-334 (2014)

C Patvardhan, Prem Prakash, Anand Srivastav: Parallel Heuristics for the Bounded Diameter Minimum Spanning Tree Problem. Proceedings of the 11th IEEE India Conference (INDICON 2014), Pune, December 2014, 5 pages. DOI:10.1109/INDICON.2014.7030575

C Patvardhan, Sulabh Bansal, Anand Srivastav: Balanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem. International Journal of Intelligent Systems and Applications 11:1-11 (2014). DOI:10.5815/ijisa.2014.11.01

C Patvardhan, Sulabh Bansal, Anand Srivastav: Solution of ‘hard’ knapsack instances using Quantum Inspired Evolutionary Algorithm. International Journal of Applied Evolutionary Computation 5(1):52-68 (2014). DOI:10.4018/ijaec.2014010104

Nils Hebbinghaus, Anand Srivastav: Multicolor discrepancy of arithmetic structures. In: A Panorama of Discrepancy Theory. Ed. by William W. L. Chen, Anand Srivastav, and Giancarlo Travaglini. Volume 2107 of the series Lecture Notes in Mathematics pp 319-424 Springer-Verlag (2014)

2013

Lasse Kliemann, Anand Srivastav: Deutsch-indische Kooperation im Algorithm Engineering. Informatik Spektrum 36(2): 180-186 (2013). DOI:10.1007/s00287-013-0680-5

Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the hitting set problem. Proceedings of the 7th International Workshop on Algorithms and Computation, Kharagpur, India, February 2013 (WALCOM 2013). Lecture Notes in Computer Science 7748:101–113 (2013). DOI:10.1007/978-3-642-36065-7_11

Lasse Kliemann, Ole Kliemann, C. Patvardhan, Volkmar Sauerland, Anand Srivastav: A new QEA computing near-optimal low-discrepancy colorings in the hypergraph of arithmetic progressions. Proceedings of the 12th International Symposium on Experimental and Efficient Algorithms, Rome, Italy, June 2013 (SEA 2013). Lecture Notes in Computer Science 7933: 67–78 (2013). DOI:10.1007/978-3-642-38527-8_8

2012

Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav: Bipartite Matching in the Semi-streaming Model. Algorithmica 63(1-2): 490-508 (2012). DOI:10.1007/s00453-011-9556-8

Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the partial vertex cover problem in hypergraphs. Proceedings of the 1st Mediterranean Conference on Algorithms, Kibbutz Ein Gedi, Isreal, December 2012 (MedAlg 2012). Lecture Notes in Computer Science 7659: 174–187 (2012). DOI:10.1007/978-3-642-34862-4_13

C. Patvardhan, Prem Prakash, Anand Srivastav: Novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. International Journal of Mathematics in Operational Research 4(2):114–127 (2012). DOI:10.1504/IJMOR.2012.046373

2011

Nils Hebbinghaus, Anand Srivastav: Discrepancy of Centered Arithmetic Progressions in Zp. Electronic Notes in Discrete Mathematics 38: 449-456 (2011)

Mourad El Ouali, Antje Fretwurst, Anand Srivastav: Inapproximability of b-Matching in k-uniform Hypergraphs.  Proceedings of the 5th International Workshop on Algorithms and Computation (WALCOM 2011). Springer Lecture Notes in Computer Science 6552: 57–69 (2011). DOI:10.1007/978-3-642-19094-0_8

2010

C. Patvardhan, Johannes Rückelt, Volkmar Sauerland, Thomas Slawig, Anand Srivastav, Ben 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). DOI:10.1016/j.nonrwa.2010.03.006

Anna Heinle, Andreas Macke, Anand Srivastav: Automatic cloud classification of the whole sky images. Atmospheric Measurement Techniques 3:269–299 (2010). DOI:10.5194/amt-3-557-2010

2009

Andreas Baltz, Anand Srivastav: Multicast routing and design of sparse connectors. In: Algorithmics of Large and Complex Networks. Ed. by Jürgen Lerner, Dorothea Wagner, Katharina Zweig, Springer Lecture Notes in Computer Science 5515: 247–265 (2009). DOI:10.1007/978-3-642-02094-0_12

Nils Hebbinghaus, Tomasz Schoen, Anand Srivastav: One-Sided Discrepancy of linear hyperplanes in finite vector spaces. In: Analytic Number Theory, Essays in Honour of Klaus Roth. Ed. by William W. L. Chen, William T. Gowers, Heini Halberstam, Wolfgang M. Schmidt, Robert Charles Vaughan, Cambridge University Press, Cambridge 2009.

Lasse Kliemann, Anand Srivastav: Models of Non-atomic Congestion Games – From Unicast to Multicast Routing. In: Algorithmics of Large and Complex Networks. Ed. by Jürgen Lerner, Dorothea Wagner, Katharina Zweig, Springer Lecture Notes in Computer Science 5515: 292–318 (2009)

C. Patvardhan, Volkmar Sauerland, Anand Srivastav: Systemic studies on large scale natural systems: An efficient quantum evolutionary algorithm for marine CO2-simulation. Proceedings of the International Conference on Applied Systems Research, Dayalbagh Educational Institute, Agra, India (NSC 2009), pages 44-47 (2009)

C. Patvardhan, Prem Prakash, Anand Srivastav:  A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. Proceedings of the International Conference on Operations Research Applications. 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.

Sebastian Eggert, Lasse Kliemann, Anand Srivastav: Bipartite Graph Matchings in the Semi-Streaming Model.  Proceedings of the 17th European Symposium on Algorithms, Copenhagen, Denmark, September 2009 (ESA 2009). Springer Lecture Notes in Computer Science 5757: 492–503 (2009). DOI:10.1007/978-3-642-04128-0_44

Lasse Kliemann, Anand Srivastav: Experimental Study of Non-Oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.  Proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, Dortmund, Germany, June 2009 (SEA 2009). Springer Lecture Notes in Computer Science 5526: 185–196 (2009)

Michael Gnewuch, Anand Srivastav, Carola Winzen: Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. Journal of Complexity 25(2): 115–127 (2009). DOI:10.1016/j.jco.2008.10.001

2008

Helena Fohlin, Lasse Kliemann, Anand Srivastav: Randomized Algorithms for Mixed Matching and Covering Problems in Brachytherapy. Optimization in Medicine. Ed. by Carlos J. S. Alves, Panos M. Pardalos, Luis N. Vicente, Springer, 2008. DOI:10.1007/978-0-387-73299-2_4

2007

Lasse Kliemann, Anand Srivastav: Parallel Algorithms via the Probabilistic Method. Parallel Computing: Models, Algorithms, and Applications. Ed. by Sanguthevar Rajasekaran, John H. Reif, Chapman & Hall/CRC, chapter 18, 18-1 to 18-61 (2007)

Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav: Cubature formulas for function spaces with moderate smoothness. Journal of Complexity 23(4-6): 828-850 (2007). DOI:10.1016/j.jco.2007.07.002

Ulrich Heute, Jörg Kliewer, Volkmar Sauerland, Anand Srivastav: Fixed-Point FIR filters and filter banks: improved design by randomized quantizations. Proceedings of the 20th IEEE International Symposium on Signal Processing and its Applications, Sharjah, U.A.E., February 2007 (ISSPA 2007), pages 244-248 (2007)

Gerold Jäger, Anand Srivastav, Katja Wolf: Solving Generalized Maximum Dispersion with Linear Programming. Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management, Portland, OR, USA, June 2007 (AAIM 2007). Springer Lecture Notes in Computer Science 4508: 1-10 (2007). DOI:10.1007/978-3-540-72870-2_1

C. Patvardhan, Apurva Nayaran, Anand Srivastav: Enhanced quantum evolutionary algorithm for difficult knapsack problems. Proceedings of the 2nd 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). DOI:10.1007/978-3-540-77046-6_31

Anand Srivastav, Sören Werth: Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. Proceedings of the 27th International Conference on Software Technology and Theoretical Computer Science, New Delhi, India, December 2007 (FSTTCS 2007). Springer Lecture Notes in Computer Science 4855: 497-507 (2007). DOI:10.1007/978-3-540-77050-3_41

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, Anand Srivastav: On the Minimum Load Coloring Problem. Journal of Discrete Algorithms 5(3):533–545 (2007). DOI:10.1016/j.jda.2006.09.001

Andreas Baltz, Devdatt Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Random Structures and Algorithms 30(1-2): 206-225 (2007). DOI:10.1002/rsa.20156

Frank-Andre Siebert, Anand Srivastav, Lasse Kliemann, Helena Fohlin, György Kovács: Three-dimensional reconstruction of seed implants by randomized rounding and visual evaluation. Medical Physics 34(3): 967-957 (2007). DOI:10.1118/1.2436975

2006

Anand Srivastav: The Lovász-Local-Lemma and Scheduling. Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Lecture Notes of Computer Science 3484: 321-347 (2006). DOI:10.1007/11671541_11

Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav. The Price of Anarchy in Selfish Multicast Routing. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, Chester, UK, June 2006 (CAAN 2006). Springer Lecture Notes in Computer Science 4235: 5-18 (2006). DOI:10.1007/11922377_2

2005

Gerold Jäger, Anand Srivastav: Improved Approximation Algorithms for Maximum Graph Partitioning Problems. Journal of Combinatorial Optimization 10(2): 133-167 (2005). DOI:10.1007/978-3-540-30538-5_29

Andreas Baltz, Gerold Jäger, Anand Srivastav: Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45(3): 119-124 (2005). DOI:10.1002/net.20058

Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, December 2005 (FSTTCS 2005), pages 360-371

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, Anand Srivastav: On the Minimum Load Coloring Problem. Proceedings of the 3rd Workshop on Approximation and Online Algorithms, Palma de Mallorca, Spain, October 2005 (WAOA 2005). Springer Lecture Notes in Computer Science 3879: 15–26 (2005)

Benjamin Doerr, Michael Gnewuch, Anand Srivastav: Bounds and constructions for the star-discrepancy via delta-covers. Journal of Complexity 21(5): 691–709 (2005). DOI:10.1016/j.jco.2005.05.002

Andreas Baltz, Anand Srivastav: Approximation algorithms for the Euclidean bipartite TSP. Operations Research Letters 33(4): 403–410 (2005). DOI:10.1016/j.orl.2004.08.002

2004

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. Electronic Notes in Discrete Mathematics 17: 9-13 (2004). DOI:10.1016/j.endm.2004.03.005

Andreas Baltz, Anand Srivastav: Fast Approximation of minimum multicast congestion - Implementation vs. Theory.  RAIRO Operations Research 38(4): 319–344 (2004). DOI:10.1051/ro:2004028

Benjamin Doerr, Anand Srivastav, Petra Wehr: Discrepancy of cartesian products of arithmetic progressions. Electronic Journal of Combinatorics 11(1): 1-16 (2004)

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: Ordered binary decision diagrams and the Shannon effect. Discrete Applied Mathemetics 142(1-3): 67–85 (2004). DOI:10.1016/j.dam.2003.02.003

Gerold Jäger, Anand Srivastav: Improved Approximation Algorithms for Maximum Graph Partitioning Problems. Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, December 2004 (FSTTCS 2004). Notes in Computer Science 3328: 348-359 (2004). DOI:10.1007/b104325

2003

Benjamin Doerr, Anand Srivastav: Multicolour Discrepancies. Combinatorics, Probability and Computing 12(4): 365-399 (2003). DOI:10.1017/S0963548303005662

Andreas Baltz, Gerold Jäger, Anand Srivastav: Elementary constructions of sparse asymmetric connectors.  Proceedings of 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, December 2003 (FSTTCS 2003). Lecture Notes in Computer Science 2914: 13–22 (2003). DOI:10.1007/978-3-540-24597-1_2

Andreas Baltz, Anand Srivastav: Fast Approximation of minimum multicast congestion – Implementation vs. Theory. Proceedings of the 5th Italian Conference on Algorithms and Complexity, Rome, Italy, May 2003 (CIAC 2003). Lecture Notes in Computer Science 2653:165–177 (2003)

2002

Nitin Ahuja, Anand Srivastav: On Constrained Hypergraph Coloring and Scheduling. Proceedings of the 5th International Workshop on Approximation Algorithms and Combinatorial Optimization, Rome, Italy, September 2002 (APPROX 2002). Lecture Notes in Computer Science 2462: 14–25 (2002). DOI:10.1007/3-540-45753-4_4

Anand Srivastav, Hartmut Schroeter, Christoph Michel: Approximation Algorithms for Pick-and-Place Robots. Annals of Operations Research 107(1-4): 321-338 (2002). DOI:10.1023/A:1014923704338

2001

Andreas Baltz, Tomasz Schoen, Anand Srivastav: Probabilistic Analysis of Bipartite Traveling Salesman Problems. Electronic Notes in Discrete Mathematics 7: 42-45 (2001). DOI:10.1016/S1571-0653(04)00220-3

Andreas Baltz, Tomasz Schoen, Anand Srivastav: On the b-partite directed random travelling salesman problem and its assignment relaxation. Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, USA, August 2001 (APPROX RANDOM 2001). Springer Lecture Notes in Computer Science 2129:192–201 (2001). DOI:10.1007/3-540-44666-4_22

Benjamin Doerr, Anand Srivastav: Recursive randomized coloring beats fair dice coloring. Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 2001 (STACS 2001). Springer Lecture Notes in Computer Science 2010: 183–194 (2001). DOI:10.1007/3-540-44693-1_16

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: On the evolution of the worst-case OBDD size. Information Processing Letters 77: 1–7 (2001). DOI:10.1016/S0020-0190(00)00148-4

Anand Srivastav: Derandomization in combinatorial optimization. Handbook of Randomized Computing, Volume II. Ed. by Sanguthevar Rajasekaran, Panos M. Pardalos, John H. Reif and José D.P. Rolim. Dordrecht, Netherlands: Academic Publisher: 731-842 (2001)

 2000

Anand Srivastav, Peter Stangier: On Complexity, Representation and Approximation of Integral Multicommodity Flows. Discrete Applied Mathematics 99(1-3): 183-208 (2000)

Andreas Baltz, Anand Srivastav, Tomasz Schoen: Probabilistic construction of small sum-free sets via large Sidon sets Colloquium Math. 2: 171-176 (2000)

1999

Anand Srivastav, Hartmut Schroeter, Christoph Michel: Alternating TSP and Printed Circuit Board Assembly. Electronic Notes in Discrete Mathematics 3: 179-183 (1999). DOI:10.1016/S1571-0653(05)80051-4

Andreas Baltz, Anand Srivastav, Tomasz Schoen: Probabilistic construction of small sum-free sets via large Sidon sets. Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, USA, August 1999 ( RANDOM 1999). Springer Lecture Notes in Computer Science 1671: 138–143 (1999). DOI:10.1007/978-3-540-48413-4_15

Benjamin Doerr, Anand Srivastav: Approximation of multicolor discrepancy. Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, CA, USA, August 1999 (APPROX 1999). Springer Lecture Notes in Computer Science 1671: 39–50 (1999). DOI:10.1007/978-3-540-48413-4_5

1998

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: Size and structure of random OBDDs. Proceedings of the 15th Annual Symposium on Aspects of Theoretical Computer Science, Paris, France, February 1998 (STACS 1998). Springer Lecture Notes in Computer Science 1373: 238–248 (1998). DOI:10.1007/BFb0028565

Harry Preuß, Anand Srivastav: Blockwise variable orderings for shared BDDs. Proceedings of the 23rd International Symposium on Mathematical Foundation of Computer Science, Brno, Czech Republic, August 1998 (MFCS 1998). Springer Lecture Notes in Computer Science 1450: 636–644 (1998). DOI:10.1007/BFb0055814

Anand Srivastav, Katja Wolf: Finding densest subgraphs with semidefinite programming.  Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Aalborg, Denmark, July 1998 (APPROX 1998). Springer Lecture Notes in Computer Science 1444: 181–193 (1998). DOI:10.1007/BFb0053974

1997

Anand Srivastav, Peter Stangier: A parallel approximation algorithm for resource constrained scheduling and bin packing. Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, Paderborn, Germany, June 1997 (IRREGULAR 1997). Springer Lecture Notes in Computer Science 1253: 147–159 (1997). DOI:10.1007/3-540-63138-0_14

Anand Srivastav, Peter Stangier: Tight approximation for resource constrained scheduling and bin packing. Discrete Applied Mathematics 79(1-3): 223-245 (1997). DOI:10.1016/S0166-218X(97)00045-0

1996

Anand Srivastav, Peter Stangier: Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures and Algorithms 8(1):27–58 (1996). DOI:10.1002/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T

1995

Anand Srivastav, Peter Stangier: Weighted Fractional and Integral K-matching in Hypergraphs. Discrete Applied Mathematics 57(2-3): 255-269 (1995). DOI:10.1016/0166-218X(94)00107-O

1994

Anand Srivastav, Peter Stangier: Tight Approximations for Resource Constrained Scheduling Problems. European Symposium on Algorithms 1994: 307-318

Anand Srivastav, Peter Stangier: Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. International Symposium on Algorithms and Computation1994: 226-233

1993

Anand Srivastav, Peter Stangier: Integer multicommodity flows with reduced demands. Proceedings of the 1st Annual European Symposium on Algorithms, Bonn/Bad Honnef, Germany, September-October 1993 (ESA 1993). Springer Lecture Notes in Computer Science 726: 360–372 (1993). DOI:10.1007/3-540-57273-2_71

Anand Srivastav, Peter Stangier: On quadratic lattice approximations. Proceedings of the 4th International Symposium on Algorithms and Computation, Hong-Kong, December 1993 (ISAAC 1993). Springer Lecture Notes in Computer Science 762: 176–184 (1993). DOI:10.1007/3-540-57568-5_247

1992

Anand Srivastav: Extreme points of positive functionals and spectral states on real Banach algebras. Canadian Journal of Mathematics 44(4): 856–866 (1992). DOI:10.4153/CJM-1992-051-9

1991

Anand Srivastav: Quaternation-valued representation and commutativity criteria for real Banach algebras. Festschrift zum 60. Geburtstag von Professor Dr. George Maltese, Mathematisches Institut, Westfälische Wilhelms Universität Münster, 8 pages (1991)

Anand Srivastav: A generalization of the Gleason-Kahane-Zelazko theorem for real Banach algebras. Indian Journal of Mathematics 32:217–221 (1991)

1990

Anand Srivastav: Commutativity criteria for real Banach algebras. Archiv der Mathematik 54:65–72 (1990). DOI:10.1007/BF01190670

1989

Alexander Bach, Anand Srivastav: A characterization for the classical states of the quantum harmonic oscillator by means of de Finetti's theorem. Communications in Mathematical Physics 123(3): 453–462 (1989). DOI:10.1007/BF01238810

Anand Srivastav: Absolute continuity and Radon-Nikodym type theorems for weights and traces on von Neumann algebras. Rendiconti del Circolo Matematico di Palermo Series 2 37:257–270 (1989). DOI:10.1007/BF02843998