Integer Multicommodity Flows with Reduced Demands. - Anand Srivastav; Peter Stangier (ESA, 1993)

On Quadratic Lattice Approximations. - Anand Srivastav; Peter Stangier (ISAAC, 1993)

Tight Approximations for Resource Constrained Scheduling Problems. - Anand Srivastav; Peter Stangier (ESA, 1994)

Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. - Anand Srivastav; Peter Stangier (ISAAC, 1994)

Weighted Fractional and Integral K-matching in Hypergraphs. - Anand Srivastav; Peter Stangier (Discret. Appl. Math., 1995)

Algorithmic Chernoff-Hoeffding inequalities in integer programming. - Anand Srivastav; Peter Stangier (Random Struct. Algorithms, 1996)

A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. - Anand Srivastav; Peter Stangier (IRREGULAR, 1997)

Tight Approximations for Resource Constrained Scheduling and Bin Packing. - Anand Srivastav; Peter Stangier (Discret. Appl. Math., 1997)

Finding Dense Subgraphs with Semidefinite Programming. - Anand Srivastav; Katja Wolf (APPROX, 1998)

Blockwise Variable Orderings for Shared BDDs. - Harry Preuß; Anand Srivastav (MFCS, 1998)

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (STACS, 1998)

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. - Andreas Baltz; Tomasz Schoen; Anand Srivastav (RANDOM-APPROX, 1999)

Approximation of Multi-color Discrepancy. - Benjamin Doerr; Anand Srivastav (RANDOM-APPROX, 1999)

Alternating TSP and Printed Circuit Board Assembly. - Anand Srivastav; Hartmut Schroeter; Christoph Michel (Electron. Notes Discret. Math., 1999)

On Complexity, Representation and Approximation of Integral Multicommodity Flows. - Anand Srivastav; Peter Stangier (Discret. Appl. Math., 2000)

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. - Andreas Baltz; Tomasz Schoen; Anand Srivastav (RANDOM-APPROX, 2001)

Recursive Randomized Coloring Beats Fair Dice Random Colorings. - Benjamin Doerr; Anand Srivastav (STACS, 2001)

Approximation Algorithms for Pick-and-Place Robots. - Anand Srivastav; Hartmut Schroeter; Christoph Michel (Ann. Oper. Res., 2001)

Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). - Andreas Baltz; Tomasz Schoen; Anand Srivastav (Electron. Notes Discret. Math., 2001)

Multi-Color Discrepancies - Extended Abstract -. - Benjamin Doerr; Anand Srivastav (Electron. Notes Discret. Math., 2001)

Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. - Benjamin Doerr; Anand Srivastav (Electron. Notes Discret. Math., 2001)

On the evolution of the worst-case OBDD size. - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (Inf. Process. Lett., 2001)

On Constrained Hypergraph Coloring and Scheduling. - Nitin Ahuja; Anand Srivastav (APPROX, 2002)

Constructions of Sparse Asymmetric Connectors: Extended Abstract. - Andreas Baltz; Gerold Jäger; Anand Srivastav (FSTTCS, 2003)

Multicolour Discrepancies. - Benjamin Doerr; Anand Srivastav (Comb. Probab. Comput., 2003)

Discrepancy of Cartesian Products of Arithmetic Progressions. - Benjamin Doerr; Anand Srivastav; Petra Wehr (Electron. J. Comb., 2004)

Ordered binary decision diagrams and the Shannon effect. - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (Discret. Appl. Math., 2004)

Coloring Graphs with Minimal Edge Load. - Nitin Ahuja; Andreas Baltz; Benjamin Doerr; Anand Srivastav (Electron. Notes Discret. Math., 2004)

Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. - Andreas Baltz; Anand Srivastav (RAIRO Oper. Res., 2004)

Bounds and constructions for the star-discrepancy via ?-covers. - Benjamin Doerr; Michael Gnewuch; Anand Srivastav (J. Complex., 2005)

Improved Approximation Algorithms for Maximum Graph Partitioning Problems. - Gerold Jäger; Anand Srivastav (J. Comb. Optim., 2005)

Constructions of sparse asymmetric connectors with number theoretic methods. - Andreas Baltz; Gerold Jäger; Anand Srivastav (Networks, 2005)

Approximation algorithms for the Euclidean bipartite TSP. - Andreas Baltz; Anand Srivastav (Oper. Res. Lett., 2005)

The Price of Anarchy in Selfish Multicast Routing. - Andreas Baltz; Sandro Esquivel; Lasse Kliemann; Anand Srivastav (CAAN, 2006)

The Lovász-Local-Lemma and Scheduling. - Anand Srivastav (Efficient Approximation and Online Algorithms, 2006)

Solving Generalized Maximum Dispersion with Linear Programming. - Gerold Jäger; Anand Srivastav; Katja Wolf (AAIM, 2007)

Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. - Anand Srivastav; Sören Werth (FSTTCS, 2007)

Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations. - Ulrich Heute; Anand Srivastav; Volkmar Sauerland; Jörg Kliewer (ISSPA, 2007)

Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. - C. Patvardhan 001; Apurva Narayan; Anand Srivastav (PReMI, 2007)

Cubature formulas for function spaces with moderate smoothness. - Michael Gnewuch; René Lindloh; Reinhold Schneider; Anand Srivastav (J. Complex., 2007)

On the minimum load coloring problem. - Nitin Ahuja; Andreas Baltz; Benjamin Doerr; Ales Prívetivý; Anand Srivastav (J. Discrete Algorithms, 2007)

Probabilistic analysis for a multiple depot vehicle routing problem. - Andreas Baltz; Devdatt P. Dubhashi; Anand Srivastav; Libertad Tansini; Sören Werth (Random Struct. Algorithms, 2007)

Parallel Algorithms via the Probabilistic Method. - Anand Srivastav; Lasse Kliemann (Handbook of Parallel Computing, 2007)

Multicast Routing and Design of Sparse Connectors. - Andreas Baltz; Anand Srivastav (Algorithmics of Large and Complex Networks, 2009)

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. - Lasse Kliemann; Anand Srivastav (Algorithmics of Large and Complex Networks, 2009)

Bipartite Graph Matchings in the Semi-streaming Model. - Sebastian Eggert; Lasse Kliemann; Anand Srivastav (ESA, 2009)

Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. - Lasse Kliemann; Anand Srivastav (SEA, 2009)

Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. - Michael Gnewuch; Anand Srivastav; Carola Winzen (J. Complex., 2009)

Inapproximability of b-Matching in k-Uniform Hypergraphs. - Mourad El Ouali; Antje Fretwurst; Anand Srivastav (WALCOM, 2011)

Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). - Nils Hebbinghaus; Anand Srivastav (Electron. Notes Discret. Math., 2011)

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. - Mourad El Ouali; Helena Fohlin; Anand Srivastav (MedAlg, 2012)

Bipartite Matching in the Semi-streaming Model. - Sebastian Eggert; Lasse Kliemann; Peter Munstermann; Anand Srivastav (Algorithmica, 2012)

Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. - C. Patvardhan 001; Prem Prakash Vuppuluri; Anand Srivastav (Int. J. Math. Oper. Res., 2012)

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. - Lasse Kliemann; Ole Kliemann; Chellapilla Patvardhan; Volkmar Sauerland; Anand Srivastav (SEA, 2013)

Deutsch-indische Kooperation im Algorithm Engineering. - Lasse Kliemann; Anand Srivastav (Inform. Spektrum, 2013)

Discrepancy of (centered) arithmetic progressions in ZpZp. - Nils Hebbinghaus; Anand Srivastav (Eur. J. Comb., 2014)

Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. - C. Patvardhan 001; Sulabh Bansal; Anand Srivastav (Int. J. Appl. Evol. Comput., 2014)

A randomised approximation algorithm for the hitting set problem. - Mourad El Ouali; Helena Fohlin; Anand Srivastav (Theor. Comput. Sci., 2014)

Price of Anarchy for Graph Coloring Games with Concave Payoff. - Lasse Kliemann; Elmira Shirazi Sheykhdarabadi; Anand Srivastav (CoRR, 2015)

Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. - C. Patvardhan 001; Prem Prakash Vuppuluri; Anand Srivastav (Informatica (Slovenia), 2015)

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (J. Comput. Appl. Math., 2015)

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. - Andreas Baltz; Mourad El Ouali; Gerold Jäger; Volkmar Sauerland; Anand Srivastav (J. Oper. Res. Soc., 2015)

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (Memetic Comput., 2015)

A Streaming Algorithm for the Undirected Longest Path Problem. - Lasse Kliemann; Christian Schielke; Anand Srivastav (ESA, 2016)

Randomized Approximation for the Set Multicover Problem in Hypergraphs. - Mourad El Ouali; Peter Munstermann; Anand Srivastav (Algorithmica, 2016)

Finding Euler Tours in the StrSort Model. - Lasse Kliemann; Jan Schiemann; Anand Srivastav (CoRR, 2016)

An approximation algorithm for the partial vertex cover problem in hypergraphs. - Mourad El Ouali; Helena Fohlin; Anand Srivastav (J. Comb. Optim., 2016)

Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. - C. Patvardhan 001; Sulabh Bansal; Anand Srivastav (Swarm Evol. Comput., 2016)

Bounds for Static Black-Peg AB Mastermind. - Christian Glazik; Gerold Jäger; Jan Schiemann; Anand Srivastav (COCOA (2), 2017)

An improved filtering algorithm for big read datasets and its application to single-cell assembly. - Axel Wedemeyer; Lasse Kliemann; Anand Srivastav; Christian Schielke; Thorsten B. Reusch; Philip Rosenstiel (BMC Bioinform., 2017)

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM. - Christian Glazik; Jan Schiemann; Anand Srivastav (CoRR, 2017)

Swap Equilibria under Link and Vertex Destruction. - Lasse Kliemann; Elmira Shirazi Sheykhdarabadi; Anand Srivastav (Games, 2017)

Towards the right amount of randomness in quantum-inspired evolutionary algorithms. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (Soft Comput., 2017)

On the Query Complexity of Black-Peg AB-Mastermind. - Mourad El Ouali; Christian Glazik; Volkmar Sauerland; Anand Srivastav (Games, 2018)

A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. - Prem Prakash Vuppuluri; C. Patvardhan 001; Anand Srivastav (Eng. Appl. Artif. Intell., 2020)

Approximation of set multi-cover via hypergraph matching. - Abbass Gorgi; Mourad El Ouali; Anand Srivastav; Mohamed Hachimi (Theor. Comput. Sci., 2020)

Bounds for the Static Permutation Mastermind game. - Christian Glazik; Gerold Jäger; Jan Schiemann; Anand Srivastav (Discret. Math., 2021)

Approximation algorithm for the multicovering problem. - Abbass Gorgi; Mourad El Ouali; Anand Srivastav; Mohamed Hachimi (J. Comb. Optim., 2021)

Algorithms for Big Data Problems in de Novo Genome Assembly. - Anand Srivastav; Axel Wedemeyer; Christian Schielke; Jan Schiemann (Algorithms for Big Data, 2022)

A new bound for the Maker-Breaker triangle game. - Christian Glazik; Anand Srivastav (Eur. J. Comb., 2022)

Hemivariational inequalities on graphs. - Nouhayla Ait Oussaid; Khalid Akhlil; Sultana Ben Aadi; Mourad El Ouali; Anand Srivastav (Comput. Appl. Math., 2022)

A One Pass Streaming Algorithm for Finding Euler Tours. - Christian Glazik; Jan Schiemann; Anand Srivastav (Theory Comput. Syst., 2023)

A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game. - Matthias Sowa; Anand Srivastav (Electron. J. Comb., 2025)