default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnand Srivastav
Person information
- affiliation: University of Kiel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j48]Christian Glazik, Jan Schiemann, Anand Srivastav:
A One Pass Streaming Algorithm for Finding Euler Tours. Theory Comput. Syst. 67(4): 671-693 (2023)- 2022
- [j47]Nouhayla Ait Oussaid
, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav:
Hemivariational inequalities on graphs. Comput. Appl. Math. 41(4) (2022) - [j46]Christian Glazik, Anand Srivastav:
A new bound for the Maker-Breaker triangle game. Eur. J. Comb. 104: 103536 (2022) - [p2]Anand Srivastav, Axel Wedemeyer, Christian Schielke, Jan Schiemann:
Algorithms for Big Data Problems in de Novo Genome Assembly. Algorithms for Big Data 2022: 229-251 - 2021
- [j45]Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav:
Bounds for the Static Permutation Mastermind game. Discret. Math. 344(3): 112253 (2021) - [j44]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41(2): 433-450 (2021) - 2020
- [j43]Prem Prakash Vuppuluri, C. Patvardhan, Anand Srivastav:
A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. Eng. Appl. Artif. Intell. 87 (2020) - [j42]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation of set multi-cover via hypergraph matching. Theor. Comput. Sci. 845: 136-143 (2020) - [i6]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the Multicovering Problem. CoRR abs/2003.06936 (2020)
2010 – 2019
- 2018
- [j41]Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav:
On the Query Complexity of Black-Peg AB-Mastermind. Games 9(1): 2 (2018) - 2017
- [j40]Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. Reusch, Philip Rosenstiel:
An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC Bioinform. 18(1): 324 (2017) - [j39]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Swap Equilibria under Link and Vertex Destruction. Games 8(1): 14 (2017) - [j38]Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav:
Towards the right amount of randomness in quantum-inspired evolutionary algorithms. Soft Comput. 21(7): 1765-1784 (2017) - [c34]Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav:
Bounds for Static Black-Peg AB Mastermind. COCOA (2) 2017: 409-424 - [i5]Christian Glazik, Jan Schiemann, Anand Srivastav:
Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM. CoRR abs/1710.04091 (2017) - 2016
- [j37]Mourad El Ouali, Peter Munstermann, Anand Srivastav:
Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74(2): 574-588 (2016) - [j36]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
An approximation algorithm for the partial vertex cover problem in hypergraphs. J. Comb. Optim. 31(2): 846-864 (2016) - [j35]C. Patvardhan, Sulabh Bansal, Anand Srivastav:
Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm Evol. Comput. 26: 175-190 (2016) - [c33]Lasse Kliemann, Christian Schielke, Anand Srivastav:
A Streaming Algorithm for the Undirected Longest Path Problem. ESA 2016: 56:1-56:17 - [i4]Lasse Kliemann, Jan Schiemann, Anand Srivastav:
Finding Euler Tours in the StrSort Model. CoRR abs/1610.03412 (2016) - [i3]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Swap Equilibria under Link and Vertex Destruction. CoRR abs/1611.05656 (2016) - [i2]Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav:
On the Query Complexity of Black-Peg AB-Mastermind. CoRR abs/1611.05907 (2016) - 2015
- [j34]C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav:
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica (Slovenia) 39(3) (2015) - [j33]Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav:
Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. J. Comput. Appl. Math. 285: 86-99 (2015) - [j32]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. J. Oper. Res. Soc. 66(4): 615-626 (2015) - [j31]Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav:
Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. Memetic Comput. 7(2): 135-155 (2015) - [i1]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Price of Anarchy for Graph Coloring Games with Concave Payoff. CoRR abs/1507.08249 (2015) - 2014
- [j30]Nils Hebbinghaus, Anand Srivastav:
Discrepancy of (centered) arithmetic progressions in ZpZp. Eur. J. Comb. 35: 324-334 (2014) - [j29]C. Patvardhan, Sulabh Bansal, Anand Srivastav:
Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. Int. J. Appl. Evol. Comput. 5(1): 52-68 (2014) - [j28]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555: 23-34 (2014) - 2013
- [j27]Lasse Kliemann, Anand Srivastav:
Deutsch-indische Kooperation im Algorithm Engineering. Inform. Spektrum 36(2): 180-186 (2013) - [c32]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Hitting Set Problem. WALCOM 2013: 101-113 - [c31]Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav:
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. SEA 2013: 67-78 - 2012
- [j26]Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav:
Bipartite Matching in the Semi-streaming Model. Algorithmica 63(1-2): 490-508 (2012) - [j25]C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav:
Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. Int. J. Math. Oper. Res. 4(2): 114-127 (2012) - [c30]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. MedAlg 2012: 174-187 - 2011
- [j24]Nils Hebbinghaus, Anand Srivastav:
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). Electron. Notes Discret. Math. 38: 449-456 (2011) - [c29]Mourad El Ouali, Antje Fretwurst, Anand Srivastav:
Inapproximability of b-Matching in k-Uniform Hypergraphs. WALCOM 2011: 57-69
2000 – 2009
- 2009
- [j23]Michael Gnewuch, Anand Srivastav, Carola Winzen:
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. J. Complex. 25(2): 115-127 (2009) - [c28]Andreas Baltz, Anand Srivastav:
Multicast Routing and Design of Sparse Connectors. Algorithmics of Large and Complex Networks 2009: 247-265 - [c27]Lasse Kliemann, Anand Srivastav:
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks 2009: 292-318 - [c26]Sebastian Eggert, Lasse Kliemann, Anand Srivastav:
Bipartite Graph Matchings in the Semi-streaming Model. ESA 2009: 492-503 - [c25]Lasse Kliemann, Anand Srivastav:
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA 2009: 185-196 - 2007
- [j22]Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav:
Cubature formulas for function spaces with moderate smoothness. J. Complex. 23(4-6): 828-850 (2007) - [j21]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) - [j20]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) - [c24]Gerold Jäger, Anand Srivastav, Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming. AAIM 2007: 1-10 - [c23]Anand Srivastav, Sören Werth:
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. FSTTCS 2007: 497-507 - [c22]Ulrich Heute, Anand Srivastav, Volkmar Sauerland, Jörg Kliewer:
Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations. ISSPA 2007: 1-4 - [c21]C. Patvardhan, Apurva Narayan, Anand Srivastav:
Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. PReMI 2007: 252-260 - [r1]Anand Srivastav, Lasse Kliemann:
Parallel Algorithms via the Probabilistic Method. Handbook of Parallel Computing 2007 - 2006
- [c20]Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav:
The Price of Anarchy in Selfish Multicast Routing. CAAN 2006: 5-18 - [p1]Anand Srivastav:
The Lovász-Local-Lemma and Scheduling. Efficient Approximation and Online Algorithms 2006: 321-347 - 2005
- [j19]Benjamin Doerr, Michael Gnewuch, Anand Srivastav:
Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. 21(5): 691-709 (2005) - [j18]Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J. Comb. Optim. 10(2): 133-167 (2005) - [j17]Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45(3): 119-124 (2005) - [j16]Andreas Baltz, Anand Srivastav:
Approximation algorithms for the Euclidean bipartite TSP. Oper. Res. Lett. 33(4): 403-410 (2005) - [c19]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 - [c18]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
On the Minimum Load Coloring Problem. WAOA 2005: 15-26 - 2004
- [j15]Benjamin Doerr, Anand Srivastav, Petra Wehr:
Discrepancy of Cartesian Products of Arithmetic Progressions. Electron. J. Comb. 11(1) (2004) - [j14]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142(1-3): 67-85 (2004) - [j13]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load. Electron. Notes Discret. Math. 17: 9-13 (2004) - [j12]Andreas Baltz, Anand Srivastav:
Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. RAIRO Oper. Res. 38(4): 319-344 (2004) - [c17]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load. CTW 2004: 16-20 - [c16]Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS 2004: 348-359 - 2003
- [j11]Benjamin Doerr, Anand Srivastav:
Multicolour Discrepancies. Comb. Probab. Comput. 12(4): 365-399 (2003) - [c15]Andreas Baltz, Anand Srivastav:
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. CIAC 2003: 165-177 - [c14]Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS 2003: 13-22 - 2002
- [c13]Nitin Ahuja, Anand Srivastav:
On Constrained Hypergraph Coloring and Scheduling. APPROX 2002: 14-25 - 2001
- [j10]Anand Srivastav, Hartmut Schroeter, Christoph Michel:
Approximation Algorithms for Pick-and-Place Robots. Ann. Oper. Res. 107(1-4): 321-338 (2001) - [j9]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electron. Notes Discret. Math. 7: 42-45 (2001) - [j8]Benjamin Doerr, Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. 7: 78-81 (2001) - [j7]Benjamin Doerr, Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. 8: 27-30 (2001) - [j6]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77(1): 1-7 (2001) - [c12]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. RANDOM-APPROX 2001: 192-201 - [c11]Benjamin Doerr, Anand Srivastav:
Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS 2001: 183-194 - 2000
- [j5]Anand Srivastav, Peter Stangier:
On Complexity, Representation and Approximation of Integral Multicommodity Flows. Discret. Appl. Math. 99(1-3): 183-208 (2000)
1990 – 1999
- 1999
- [j4]Anand Srivastav, Hartmut Schroeter, Christoph Michel:
Alternating TSP and Printed Circuit Board Assembly. Electron. Notes Discret. Math. 3: 179-183 (1999) - [c10]Benjamin Doerr, Anand Srivastav:
Approximation of Multi-color Discrepancy. RANDOM-APPROX 1999: 39-50 - [c9]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. RANDOM-APPROX 1999: 138-143 - 1998
- [c8]Anand Srivastav, Katja Wolf:
Finding Dense Subgraphs with Semidefinite Programming. APPROX 1998: 181-191 - [c7]Harry Preuß, Anand Srivastav:
Blockwise Variable Orderings for Shared BDDs. MFCS 1998: 636-644 - [c6]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS 1998: 238-248 - 1997
- [j3]Anand Srivastav, Peter Stangier:
Tight Approximations for Resource Constrained Scheduling and Bin Packing. Discret. Appl. Math. 79(1-3): 223-245 (1997) - [c5]Anand Srivastav, Peter Stangier:
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. IRREGULAR 1997: 147-158 - 1996
- [j2]Anand Srivastav, Peter Stangier:
Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Struct. Algorithms 8(1): 27-58 (1996) - 1995
- [j1]Anand Srivastav, Peter Stangier:
Weighted Fractional and Integral K-matching in Hypergraphs. Discret. Appl. Math. 57(2-3): 255-269 (1995) - 1994
- [c4]Anand Srivastav, Peter Stangier:
Tight Approximations for Resource Constrained Scheduling Problems. ESA 1994: 307-318 - [c3]Anand Srivastav, Peter Stangier:
Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. ISAAC 1994: 226-233 - 1993
- [c2]Anand Srivastav, Peter Stangier:
Integer Multicommodity Flows with Reduced Demands. ESA 1993: 360-371 - [c1]Anand Srivastav, Peter Stangier:
On Quadratic Lattice Approximations. ISAAC 1993: 176-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
