Anand Srivastav

93 papers A 6B 8C 3Journal 56Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game. Electron. J. Comb. Matthias Sowa, Anand Srivastav
2025	J	`jnl`	Asymptotic Thresholds for (a:b) Minimum-Degree Games. Games Adnane Fouadi, Mourad El Ouali, Anand Srivastav
2023	J	`jnl`	A One Pass Streaming Algorithm for Finding Euler Tours. Theory Comput. Syst. Christian Glazik, Jan Schiemann, Anand Srivastav
2022	J	`jnl`	A new bound for the Maker-Breaker triangle game. Eur. J. Comb. Christian Glazik, Anand Srivastav
2022	—	`ch.`	Algorithms for Big Data Problems in de Novo Genome Assembly. Algorithms for Big Data Anand Srivastav, Axel Wedemeyer, Christian Schielke, Jan Schiemann
2022	J	`jnl`	Hemivariational inequalities on graphs. Comput. Appl. Math. Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav
2021	J	`jnl`	Approximation algorithm for the multicovering problem. J. Comb. Optim. Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2021	J	`jnl`	Bounds for the Static Permutation Mastermind game. Discret. Math. Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
2020	J	`jnl`	A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. Eng. Appl. Artif. Intell. Prem Prakash Vuppuluri, C. Patvardhan, Anand Srivastav
2020	J	`jnl`	Approximation algorithm for the Multicovering Problem. CoRR Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2020	J	`jnl`	Approximation of set multi-cover via hypergraph matching. Theor. Comput. Sci. Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2018	J	`jnl`	On the Query Complexity of Black-Peg AB-Mastermind. Games Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
2017	J	`jnl`	An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC Bioinform. Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. Reusch, Philip Rosenstiel
2017	—	`conf`	Bounds for Static Black-Peg AB Mastermind. COCOA (2) Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
2017	J	`jnl`	Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM. CoRR Christian Glazik, Jan Schiemann, Anand Srivastav
2017	J	`jnl`	Swap Equilibria under Link and Vertex Destruction. Games Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
2017	J	`jnl`	Towards the right amount of randomness in quantum-inspired evolutionary algorithms. Soft Comput. Patvardhan Chellapilla, Sulabh Bansal, Anand Srivastav
2016	A	`conf`	A Streaming Algorithm for the Undirected Longest Path Problem. ESA Lasse Kliemann, Christian Schielke, Anand Srivastav
2016	J	`jnl`	An approximation algorithm for the partial vertex cover problem in hypergraphs. J. Comb. Optim. Mourad El Ouali, Helena Fohlin, Anand Srivastav
2016	J	`jnl`	Finding Euler Tours in the StrSort Model. CoRR Lasse Kliemann, Jan Schiemann, Anand Srivastav
2016	J	`jnl`	On the Query Complexity of Black-Peg AB-Mastermind. CoRR Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
2016	J	`jnl`	Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm Evol. Comput. C. Patvardhan, Sulabh Bansal, Anand Srivastav
2016	J	`jnl`	Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica Mourad El Ouali, Peter Munstermann, Anand Srivastav
2016	J	`jnl`	Swap Equilibria under Link and Vertex Destruction. CoRR Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
2015	J	`jnl`	Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. J. Oper. Res. Soc. Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav
2015	J	`jnl`	Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica (Slovenia) C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav
2015	J	`jnl`	Price of Anarchy for Graph Coloring Games with Concave Payoff. CoRR Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
2015	J	`jnl`	Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. Memetic Comput. Patvardhan Chellapilla, Sulabh Bansal, Anand Srivastav
2015	J	`jnl`	Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. J. Comput. Appl. Math. Patvardhan Chellapilla, Sulabh Bansal, Anand Srivastav
2014	J	`jnl`	A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. Mourad El Ouali, Helena Fohlin, Anand Srivastav
2014	J	`jnl`	Discrepancy of (centered) arithmetic progressions in Eur. J. Comb. Nils Hebbinghaus, Anand Srivastav
2014	J	`jnl`	Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. Int. J. Appl. Evol. Comput. C. Patvardhan, Sulabh Bansal, Anand Srivastav
2013	B	`conf`	A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. SEA Lasse Kliemann, Ole Kliemann, Patvardhan Chellapilla, Volkmar Sauerland, Anand Srivastav
2013	B	`conf`	A Randomised Approximation Algorithm for the Hitting Set Problem. WALCOM Mourad El Ouali, Helena Fohlin, Anand Srivastav
2013	J	`jnl`	Deutsch-indische Kooperation im Algorithm Engineering. Inform. Spektrum Lasse Kliemann, Anand Srivastav
2012	—	`conf`	A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. MedAlg Mourad El Ouali, Helena Fohlin, Anand Srivastav
2012	J	`jnl`	Bipartite Matching in the Semi-streaming Model. Algorithmica Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav
2012	J	`jnl`	Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. Int. J. Math. Oper. Res. C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav
2011	J	`jnl`	Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). Electron. Notes Discret. Math. Nils Hebbinghaus, Anand Srivastav
2011	B	`conf`	Inapproximability of WALCOM Mourad El Ouali, Antje Fretwurst, Anand Srivastav
2009	A	`conf`	Bipartite Graph Matchings in the Semi-streaming Model. ESA Sebastian Eggert, Lasse Kliemann, Anand Srivastav
2009	B	`conf`	Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA Lasse Kliemann, Anand Srivastav
2009	J	`jnl`	Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. J. Complex. Michael Gnewuch, Anand Srivastav, Carola Winzen
2009	—	`conf`	Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks Lasse Kliemann, Anand Srivastav
2009	—	`conf`	Multicast Routing and Design of Sparse Connectors. Algorithmics of Large and Complex Networks Andreas Baltz, Anand Srivastav
2007	J	`jnl`	Cubature formulas for function spaces with moderate smoothness. J. Complex. Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav
2007	—	`conf`	Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. PReMI C. Patvardhan, Apurva Narayan, Anand Srivastav
2007	—	`conf`	Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations. ISSPA Ulrich Heute, Anand Srivastav, Volkmar Sauerland, Jörg Kliewer
2007	J	`jnl`	On the minimum load coloring problem. J. Discrete Algorithms Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2007	—	`ch.`	Parallel Algorithms via the Probabilistic Method. Handbook of Parallel Computing Anand Srivastav, Lasse Kliemann
2007	—	`conf`	Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. FSTTCS Anand Srivastav, Sören Werth
2007	J	`jnl`	Probabilistic analysis for a multiple depot vehicle routing problem. Random Struct. Algorithms Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth
2007	C	`conf`	Solving Generalized Maximum Dispersion with Linear Programming. AAIM Gerold Jäger, Anand Srivastav, Katja Wolf
2006	—	`ch.`	The Lovász-Local-Lemma and Scheduling. Efficient Approximation and Online Algorithms Anand Srivastav
2006	—	`conf`	The Price of Anarchy in Selfish Multicast Routing. CAAN Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
2005	J	`jnl`	Approximation algorithms for the Euclidean bipartite TSP. Oper. Res. Lett. Andreas Baltz, Anand Srivastav
2005	J	`jnl`	Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. Benjamin Doerr, Michael Gnewuch, Anand Srivastav
2005	J	`jnl`	Constructions of sparse asymmetric connectors with number theoretic methods. Networks Andreas Baltz, Gerold Jäger, Anand Srivastav
2005	J	`jnl`	Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J. Comb. Optim. Gerold Jäger, Anand Srivastav
2005	B	`conf`	On the Minimum Load Coloring Problem. WAOA Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2005	—	`conf`	Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
2004	C	`conf`	Coloring Graphs with Minimal Edge Load. CTW Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004	J	`jnl`	Coloring Graphs with Minimal Edge Load. Electron. Notes Discret. Math. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004	J	`jnl`	Discrepancy of Cartesian Products of Arithmetic Progressions. Electron. J. Comb. Benjamin Doerr, Anand Srivastav, Petra Wehr
2004	J	`jnl`	Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. RAIRO Oper. Res. Andreas Baltz, Anand Srivastav
2004	—	`conf`	Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS Gerold Jäger, Anand Srivastav
2004	J	`jnl`	Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
2003	—	`conf`	Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS Andreas Baltz, Gerold Jäger, Anand Srivastav
2003	C	`conf`	Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. CIAC Andreas Baltz, Anand Srivastav
2003	J	`jnl`	Multicolour Discrepancies. Comb. Probab. Comput. Benjamin Doerr, Anand Srivastav
2002	—	`conf`	On Constrained Hypergraph Coloring and Scheduling. APPROX Nitin Ahuja, Anand Srivastav
2001	J	`jnl`	Approximation Algorithms for Pick-and-Place Robots. Ann. Oper. Res. Anand Srivastav, Hartmut Schroeter, Christoph Michel
2001	J	`jnl`	Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. Benjamin Doerr, Anand Srivastav
2001	J	`jnl`	Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. Benjamin Doerr, Anand Srivastav
2001	—	`conf`	On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. RANDOM-APPROX Andreas Baltz, Tomasz Schoen, Anand Srivastav
2001	J	`jnl`	On the evolution of the worst-case OBDD size. Inf. Process. Lett. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
2001	J	`jnl`	Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electron. Notes Discret. Math. Andreas Baltz, Tomasz Schoen, Anand Srivastav
2001	A	`conf`	Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS Benjamin Doerr, Anand Srivastav
2000	J	`jnl`	On Complexity, Representation and Approximation of Integral Multicommodity Flows. Discret. Appl. Math. Anand Srivastav, Peter Stangier
1999	J	`jnl`	Alternating TSP and Printed Circuit Board Assembly. Electron. Notes Discret. Math. Anand Srivastav, Hartmut Schroeter, Christoph Michel
1999	—	`conf`	Approximation of Multi-color Discrepancy. RANDOM-APPROX Benjamin Doerr, Anand Srivastav
1999	—	`conf`	Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. RANDOM-APPROX Andreas Baltz, Tomasz Schoen, Anand Srivastav
1998	B	`conf`	Blockwise Variable Orderings for Shared BDDs. MFCS Harry Preuß, Anand Srivastav
1998	—	`conf`	Finding Dense Subgraphs with Semidefinite Programming. APPROX Anand Srivastav, Katja Wolf
1998	A	`conf`	Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
1997	—	`conf`	A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. IRREGULAR Anand Srivastav, Peter Stangier
1997	J	`jnl`	Tight Approximations for Resource Constrained Scheduling and Bin Packing. Discret. Appl. Math. Anand Srivastav, Peter Stangier
1996	J	`jnl`	Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Struct. Algorithms Anand Srivastav, Peter Stangier
1995	J	`jnl`	Weighted Fractional and Integral K-matching in Hypergraphs. Discret. Appl. Math. Anand Srivastav, Peter Stangier
1994	B	`conf`	Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. ISAAC Anand Srivastav, Peter Stangier
1994	A	`conf`	Tight Approximations for Resource Constrained Scheduling Problems. ESA Anand Srivastav, Peter Stangier
1993	A	`conf`	Integer Multicommodity Flows with Reduced Demands. ESA Anand Srivastav, Peter Stangier
1993	B	`conf`	On Quadratic Lattice Approximations. ISAAC Anand Srivastav, Peter Stangier