Anand Srivastav

  • University of Kiel, Germany

According to our database1, Anand Srivastav authored at least 78 papers between 1993 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




Approximation algorithm for the multicovering problem.
J. Comb. Optim., 2021

Bounds for the Static Permutation Mastermind game.
Discret. Math., 2021

Approximation of set multi-cover via hypergraph matching.
Theor. Comput. Sci., 2020

A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem.
Eng. Appl. Artif. Intell., 2020

On the Query Complexity of Black-Peg AB-Mastermind.
Games, 2018

Towards the right amount of randomness in quantum-inspired evolutionary algorithms.
Soft Comput., 2017

Swap Equilibria under Link and Vertex Destruction.
Games, 2017

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM.
CoRR, 2017

An improved filtering algorithm for big read datasets and its application to single-cell assembly.
BMC Bioinform., 2017

Bounds for Static Black-Peg AB Mastermind.
Proceedings of the Combinatorial Optimization and Applications, 2017

Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems.
Swarm Evol. Comput., 2016

An approximation algorithm for the partial vertex cover problem in hypergraphs.
J. Comb. Optim., 2016

Finding Euler Tours in the StrSort Model.
CoRR, 2016

Randomized Approximation for the Set Multicover Problem in Hypergraphs.
Algorithmica, 2016

A Streaming Algorithm for the Undirected Longest Path Problem.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems.
Memetic Comput., 2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc., 2015

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm.
J. Comput. Appl. Math., 2015

Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem.
Informatica (Slovenia), 2015

Price of Anarchy for Graph Coloring Games with Concave Payoff.
CoRR, 2015

A randomised approximation algorithm for the hitting set problem.
Theor. Comput. Sci., 2014

Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm.
Int. J. Appl. Evol. Comput., 2014

Discrepancy of (centered) arithmetic progressions in <i>Z</i><sub><i>p</i></sub>Zp.
Eur. J. Comb., 2014

Deutsch-indische Kooperation im Algorithm Engineering.
Inform. Spektrum, 2013

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem.
Int. J. Math. Oper. Res., 2012

Bipartite Matching in the Semi-streaming Model.
Algorithmica, 2012

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
Proceedings of the Design and Analysis of Algorithms, 2012

Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract).
Electron. Notes Discret. Math., 2011

Inapproximability of <i>b</i>-Matching in <i>k</i>-Uniform Hypergraphs.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems.
J. Complex., 2009

Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Bipartite Graph Matchings in the Semi-streaming Model.
Proceedings of the Algorithms, 2009

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Multicast Routing and Design of Sparse Connectors.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Parallel Algorithms via the Probabilistic Method.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Probabilistic analysis for a multiple depot vehicle routing problem.
Random Struct. Algorithms, 2007

On the minimum load coloring problem.
J. Discrete Algorithms, 2007

Cubature formulas for function spaces with moderate smoothness.
J. Complex., 2007

Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems.
Proceedings of the Pattern Recognition and Machine Intelligence, 2007

Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations.
Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007

Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Solving Generalized Maximum Dispersion with Linear Programming.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

The Lovász-Local-Lemma and Scheduling.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

The Price of Anarchy in Selfish Multicast Routing.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Approximation algorithms for the Euclidean bipartite TSP.
Oper. Res. Lett., 2005

Constructions of sparse asymmetric connectors with number theoretic methods.
Networks, 2005

Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
J. Comb. Optim., 2005

Bounds and constructions for the star-discrepancy via ?-covers.
J. Complex., 2005

Fast approximation of minimum multicast congestion - Implementation VERSUS Theory.
RAIRO Oper. Res., 2004

Coloring Graphs with Minimal Edge Load.
Electron. Notes Discret. Math., 2004

Ordered binary decision diagrams and the Shannon effect.
Discret. Appl. Math., 2004

Discrepancy of Cartesian Products of Arithmetic Progressions.
Electron. J. Comb., 2004

Multicolour Discrepancies.
Comb. Probab. Comput., 2003

Constructions of Sparse Asymmetric Connectors: Extended Abstract.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

On Constrained Hypergraph Coloring and Scheduling.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

On the evolution of the worst-case OBDD size.
Inf. Process. Lett., 2001

Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.
Electron. Notes Discret. Math., 2001

Multi-Color Discrepancies - Extended Abstract -.
Electron. Notes Discret. Math., 2001

Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electron. Notes Discret. Math., 2001

Approximation Algorithms for Pick-and-Place Robots.
Ann. Oper. Res., 2001

Recursive Randomized Coloring Beats Fair Dice Random Colorings.
Proceedings of the STACS 2001, 2001

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
Proceedings of the Approximation, 2001

On Complexity, Representation and Approximation of Integral Multicommodity Flows.
Discret. Appl. Math., 2000

Alternating TSP and Printed Circuit Board Assembly.
Electron. Notes Discret. Math., 1999

Approximation of Multi-color Discrepancy.
Proceedings of the Randomization, 1999

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
Proceedings of the Randomization, 1999

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).
Proceedings of the STACS 98, 1998

Blockwise Variable Orderings for Shared BDDs.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Finding Dense Subgraphs with Semidefinite Programming.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Tight Approximations for Resource Constrained Scheduling and Bin Packing.
Discret. Appl. Math., 1997

A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Algorithmic Chernoff-Hoeffding inequalities in integer programming.
Random Struct. Algorithms, 1996

Weighted Fractional and Integral K-matching in Hypergraphs.
Discret. Appl. Math., 1995

Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Tight Approximations for Resource Constrained Scheduling Problems.
Proceedings of the Algorithms, 1994

On Quadratic Lattice Approximations.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Integer Multicommodity Flows with Reduced Demands.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993