Items where Author is "Srivastav, Anand"

Up a level
Export as [feed] RSS [feed] RSS 3.0
Group by: Document type | Year of publication | No Grouping
Number of items: 50.

Articles in a Scientific Journal - peer-reviewed

[img]

Sauerland, V., Löptien, U. , Leonhard, C., Oschlies, A. and Srivastav, A. (2018) Error assessment of biogeochemical models by lower bound methods (NOMMA-1.0). Open Access Geoscientific Model Development, 11 (3). pp. 1181-1198. DOI 10.5194/gmd-2017-133.


El Ouali, M., Glazik, C., Sauerland, V. and Srivastav, A. (2018) On the Query Complexity of Black-Peg AB-Mastermind. Open Access Games, 9 (1). p. 2. DOI 10.3390/g9010002.

[img]

Wedemeyer, A., Kliemann, L., Srivastav, A., Schielke, C., Reusch, T. B. H. and Rosenstiel, P. (2017) An improved filtering algorithm for big read datasets and its application to single-cell assembly. Open Access BMC Bioinformatics, 18 (1). p. 324. DOI 10.1186/s12859-017-1724-7.

[img] [img]

Kriest, I. , Sauerland, V., Khatiwala, S., Srivastav, A. and Oschlies, A. (2017) Calibrating a global three-dimensional biogeochemical ocean model (MOPS-1.0). Open Access Geoscientific Model Development, 10 . pp. 127-154. DOI 10.5194/gmd-10-127-2017.


Kliemann, L., Shirazi Sheykhdarabadi, E. and Srivastav, A. (2017) Swap Equilibria under Link and Vertex Destruction. Games, 8 (1). p. 14. DOI 10.3390/g8010014.


Patvardhan, C., Bansal, S. and Srivastav, A. (2017) Towards the right amount of randomness in quantum-inspired evolutionary algorithms. Soft Computing, 21 (7). pp. 1765-1784. DOI 10.1007/s00500-015-1880-5.


El Ouali, M., Fohlin, H. and Srivastav, A. (2016) An approximation algorithm for the partial vertex cover problem in hypergraphs. Journal of Combinatorial Optimization, 31 (2). pp. 846-864. DOI 10.1007/s10878-014-9793-2.


El Ouali, M., Munstermann, P. and Srivastav, A. (2016) Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica, 74 (2). pp. 574-588. DOI 10.1007/s00453-014-9962-9.


Kliemann, L., Sheykhdarabadi, E. S. and Srivastav, A. (2016) Price of anarchy for graph coloring games with concave payoff. Journal of Dynamics and Games, 4 (1). p. 3. DOI 10.3934/jdg.2017003.


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


Baltz, A., El Ouali, M., Jager, G., Sauerland, V. and Srivastav, A. (2015) Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. Journal of the Operational Research Society, 66 (4). pp. 615-626.


Patvardhan, C., Bansal, S. and Srivastav, A. (2015) Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. Journal of Computational and Applied Mathematics, 285 . pp. 86-99.


Patvardhan, C., Bansal, S. and Srivastav, A. (2015) Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. Memetic Computing, 7 (2). pp. 135-155.


Patvardhan, C., Prakash, P. and Srivastav, A. (2015) Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem. Informatica, 39 (3). pp. 281-292.


El Ouali, M., Fohlin, H. and Srivastav, A. (2014) A randomised approximation algorithm for the hitting set problem. Theoretical Computer Science, 555 . pp. 23-34.


Hebbinghaus, N. and Srivastav, A. (2014) Discrepancy of (centered) arithmetic progressions in Z(p). European Journal of Combinatorics, 35 . pp. 324-334.


Hebbinghaus, N. and Srivastav, A. (2014) Discrepancy of centered arithmetic progressions in Zp. European Journal of Combinatorics, 35 . pp. 324-334.


Patvardhan, C., Bansal, S. and Srivastav, A. (2014) Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. International Journal of Applied Evolutionary Computation, 5 (1). pp. 52-68. DOI 10.4018/ijaec.2014010104.


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


Kliemann, L. and Srivastav, A. (2013) Deutsch-indische Kooperation im Algorithm Engineering. Informatik-Spektrum, 36 (2). pp. 180-186. DOI 10.1007/s00287-013-0680-5.


Kliemann, L., Kliemann, O., Patvardhan, C., Sauerland, V. and Srivastav, A. (2013) A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, 7933 . pp. 67-78. DOI 10.1007/978-3-642-38527-8_8.


Eggert, S., Kliemann, L., Munstermann, P. and Srivastav, A. (2012) Bipartite Matching in the Semi-streaming Model. Algorithmica, 63 (1-2). pp. 490-508. DOI 10.1007/s00453-011-9556-8.


Patvardhan, C., Prakash, V. P. and Srivastav, A. (2012) Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. International Journal of Mathematics in Operational Research, 4 (2). p. 114. DOI 10.1504/IJMOR.2012.046373.

[img]

Heinle, A., Macke, A. and Srivastav, A. (2010) Automatic cloud classification of whole sky images. Open Access Atmospheric Measurement Techniques, 3 (3). pp. 557-567. DOI 10.5194/amt-3-557-2010.


Ruckelt, J., Sauerland, V., Slawig, T., Srivastav, A., Ward, B. and Patvardhan, C. (2010) Parameter optimization and uncertainty analysis in a model of oceanic CO2 uptake using a hybrid algorithm and algorithmic differentiation. Nonlinear Analysis-Real World Applications, 11 (5). pp. 3993-4009.

[img]

Gnewuch, M., Srivastav, A. and Winzen, C. (2009) Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. Open Access Journal of Complexity, 25 (2). pp. 115-127. DOI 10.1016/j.jco.2008.10.001.


Patvardhan, C., Sauerland, V. and Srivastav, A. (2009) 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 . pp. 44-47.


Ahuja, N., Baltz, A., Doerr, B., Privetivy, A. and Srivastav, A. (2007) On the Minimum Load Coloring Problem. Journal of Discrete Algorithms, 5 (3). pp. 533-545.


Baltz, A., Dubhashi, D., Werth, S., Tansini, L. and Srivastav, A. (2007) Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Random Structures and Algorithms, 30 .


Gnewuch, M., Lindloh, R., Srivastav, A. and Schneider, R. (2007) Cubature formulas for function spaces with moderate smoothness. Journal of Complexity, 23 (4-6). pp. 828-850.


Heute, U., Srivastav, A., Sauerland, V. and Kliewer, J. (2007) Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations. Signal Processing and Its Applications, 2007. ISSPA 2007. 9th International Symposium on Signal Processing and Its Applications . pp. 1-4. DOI 10.1109/ISSPA.2007.4555335.


Siebert, F. A., Srivastav, A., Kliemann, L., Fohlin, H. and Kovács, G. (2007) Three-dimensional reconstruction of seed implants by randomized rounding and visual evaluation. Medical Physics, 34 (3). pp. 967-975. DOI 10.1118/1.2436975.

Books


Chen, W. W. L., Srivastav, A. and Travaglini, G., eds. (2014) Panorama of discrepancy theory. . Springer International Publishing, Basel, 695 pp. ISBN 978-3-319-04695-2


Ouali, M. E., Fohlin, H. and Srivastav, A. (2012) A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. , Design and Analysis of Algorithms . Theoretical Computer Science and General Issues, 7659 . Springer-Verlag Berlin Heidelberg, pp 174-187 , 174-187 pp. ISBN 978-3-642-34861-7

Book chapters


Glazik, C., Jäger, G., Schiemann, J. and Srivastav, A. (2017) Bounds for Static Black-Peg AB Mastermind. In: Combinatorial Optimization and Applications. ; 10628 . Springer, Cham, pp. 409-424. DOI 10.1007/978-3-319-71147-8_28.


Kliemann, L., Schielke, C. and Srivastav, A. (2016) A Streaming Algorithm for the Undirected Longest Path Problem. In: 24th Annual European Symposium on Algorithms (ESA 2016). . Leibniz International Proceedings in Informatics (LIPIcs), 57 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 56:1-56:17. ISBN 978-3-95977-015-6


Hebbinghaus, N. and Srivastav, A. (2014) Multicolor Discrepancy of Arithmetic Structures. In: A Panorama of Discrepancy Theory. ; 2107 . Springer, Cham, pp. 319-424. DOI 10.1007/978-3-319-04696-9_5.


Patvardhan, C., Prakash, V. P. and Srivastav, A. (2014) Parallel heuristics for the bounded diameter minimum spanning tree problem. In: 2014 Annual IEEE India Conference (INDICON). . , pp. 1-5. DOI 10.1109/INDICON.2014.7030575.


Kliemann, L., Kliemann, O., Patvardhan, C., Sauerland, V. and Srivastav, A. (2013) A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. In: Experimental Algorithms. . Lecture Notes in Computer Science, 7933 . Springer Berlin Heidelberg, Berlin Heidelberg, pp. 67-78. ISBN 978-3-642-38526-1 DOI 10.1007/978-3-642-38527-8_8.


Patvardhan, C., Prakash, V. P. and Srivastav, A. (2012) Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. In: Proceedings of the International Conference on Operations Research Applications In Engineering And Management. ; 4 . , pp. 114-127. DOI 10.1504/IJMOR.2012.046373.


El Ouali, M., Fretwurst, A. and Srivastav, A. (2011) Inapproximability of b-Matching in k-Uniform Hypergraphs. In: WALCOM: Algorithms and Computation. ; 6552 . Springer, Berlin, Heidelberg, pp. 57-69. DOI 10.1007/978-3-642-19094-0_8.


Baltz, A. and Srivastav, A. (2009) Multicast Routing and Design of Sparse Connectors. In: Algorithmics of Large and Complex Networks. ; 5515 . Springer, Berlin, pp. 247-265. DOI 10.1007/978-3-642-02094-0_12.


Eggert, S., Kliemann, L. and Srivastav, A. (2009) Bipartite Graph Matchings in the Semi-streaming Model. In: Algorithms - ESA 2009. ; 5757 . Springer, Berlin, Heidelberg, pp. 492-503. DOI 10.1007/978-3-642-04128-0_44.


Hebbinghaus, N., Schoen, T. and Srivastav, A. (2009) One-sided discrepancy of linear hyperplanes in finite vector spaces. In: Analytic Number Theory, Essays in Honour of Klaus Roth. . Cambridge University Press, Cambridge, pp. 205-223.


Kliemann, L. and Srivastav, A. (2009) Models of Non-atomic Congestion Games – From Unicast to Multicast Routing. In: Algorithmics of Large and Complex Networks. ; 5515 . Springer, Berlin, Heidelberg, pp. 292-318. DOI 10.1007/978-3-642-02094-0_14.


Kliemann, L. and Srivastav, A. (2009) Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. In: Experimental Algorithms. ; 5526 . Springer, Berlin, Heidelberg, pp. 185-196. DOI 10.1007/978-3-642-02011-7_18.


Fohlin, H., Kliemann, L. and Srivastav, A. (2008) Randomized algorithms for mixed matching and covering in hypergraphs in 3D seed reconstruction in brachytherapy. In: Optimization in Medicine. ; 12 . Springer, New York, pp. 71-102. DOI 10.1007/978-0-387-73299-2_4.


Kliemann, L. and Srivastav, A. (2008) Parallel Algorithms via the Probabilistic Method. In: Handbook of Parallel Computing Models, Algorithms and Applications. . Chapman and Hall/CRC, 18:1-18:54. ISBN 978-1-58488-623-5


Jäger, G., Srivastav, A. and Wolf, K. (2007) Solving Generalized Maximum Dispersion with Linear Programming. In: Algorithmic Aspects in Information and Management. ; 4508 . Springer, Berlin, Heidelberg, pp. 1-10. DOI 10.1007/978-3-540-72870-2_1.


Srivastav, A. and Werth, S. (2007) Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. ; 4855 . Springer, Berlin, Heidelberg, pp. 497-507. DOI 10.1007/978-3-540-77050-3_41.

This list was generated on Tue Jun 18 15:56:20 2019 CEST.