Anand Srivastav

From MaRDI portal
Person:247943

Available identifiers

zbMath Open srivastav.anandMaRDI QIDQ247943

List of research outcomes

PublicationDate of PublicationType
A one pass streaming algorithm for finding Euler tours2023-08-17Paper
A new bound for the Maker-Breaker triangle game2022-05-31Paper
Hemivariational inequalities on graphs2022-05-23Paper
Approximation algorithm for the multicovering problem2021-05-11Paper
Bounds for the static permutation mastermind game2021-01-27Paper
Repeated randomized algorithm for the Multicovering Problem2021-01-22Paper
Approximation of set multi-cover via hypergraph matching2020-10-22Paper
Swap equilibria under link and vertex destruction2018-08-01Paper
On the query complexity of black-peg AB-mastermind2018-07-10Paper
Bounds for static black-peg AB mastermind2018-03-26Paper
A Streaming Algorithm for the Undirected Longest Path Problem2018-03-02Paper
Price of anarchy for graph coloring games with concave payoff2017-01-10Paper
https://portal.mardi4nfdi.de/entity/Q28160202016-07-01Paper
Randomized approximation for the set multicover problem in hypergraphs2016-03-29Paper
An approximation algorithm for the partial vertex cover problem in hypergraphs2016-02-23Paper
Multicolor Discrepancy of Arithmetic Structures2015-07-24Paper
Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm2015-05-22Paper
A randomised approximation algorithm for the hitting set problem2014-10-06Paper
Discrepancy of (centered) arithmetic progressions in \({\mathbb{Z}_p}\)2014-07-29Paper
https://portal.mardi4nfdi.de/entity/Q28573862013-11-01Paper
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs2013-04-19Paper
A Randomised Approximation Algorithm for the Hitting Set Problem2013-04-12Paper
Bipartite matching in the semi-streaming model2012-04-26Paper
Inapproximability of b-Matching in k-Uniform Hypergraphs2011-02-20Paper
Bipartite Graph Matchings in the Semi-streaming Model2009-10-29Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
Multicast Routing and Design of Sparse Connectors2009-07-09Paper
Models of Non-atomic Congestion Games – From Unicast to Multicast Routing2009-07-09Paper
Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems2009-06-11Paper
https://portal.mardi4nfdi.de/entity/Q36139112009-03-16Paper
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem2008-04-24Paper
The Price of Anarchy in Selfish Multicast Routing2008-04-17Paper
The Lovász-Local-Lemma and Scheduling2008-03-14Paper
On the minimum load coloring problem2008-01-11Paper
Cubature formulas for function spaces with moderate smoothness2008-01-09Paper
Solving Generalized Maximum Dispersion with Linear Programming2008-01-04Paper
Coloring Graphs with Minimal Edge Load2007-05-29Paper
Approximation and Online Algorithms2007-02-12Paper
Probabilistic analysis for a multiple depot vehicle routing problem2007-02-07Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Improved approximation algorithms for maximum graph partitioning problems2006-02-08Paper
Bounds and constructions for the star-discrepancy via \(\delta\)-covers2005-12-27Paper
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory2005-09-28Paper
Approximation algorithms for the Euclidean bipartite TSP2005-08-25Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
Constructions of sparse asymmetric connectors with number theoretic methods2005-06-01Paper
Ordered binary decision diagrams and the Shannon effect2004-08-19Paper
Multicolour Discrepancies2004-05-18Paper
Discrepancy of cartesian products of arithmetic progressions2004-02-05Paper
https://portal.mardi4nfdi.de/entity/Q44375062003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44112742003-07-07Paper
https://portal.mardi4nfdi.de/entity/Q47807942002-11-21Paper
https://portal.mardi4nfdi.de/entity/Q49418322002-09-16Paper
On the evolution of the worst-case OBDD size2002-07-25Paper
Approximation algorithms for pick-and-place robots2002-06-09Paper
https://portal.mardi4nfdi.de/entity/Q27625042002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27414622001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q27414712001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q27413662001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q45257052001-01-24Paper
Probabilistic construction of small strongly sum-free sets via large Sidon sets2001-01-07Paper
https://portal.mardi4nfdi.de/entity/Q47886132001-01-01Paper
On complexity, representation and approximation of integral multicommodity flows2000-12-18Paper
https://portal.mardi4nfdi.de/entity/Q49418252000-10-08Paper
https://portal.mardi4nfdi.de/entity/Q42684351999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q44008561999-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42181411999-03-02Paper
Tight approximations for resource constrained scheduling and bin packing1998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q48682651996-09-15Paper
Weighted fractional and integral \(k\)-matching in hypergraphs1995-04-10Paper
Extreme Points of Positive Functionals and Spectral States on Real Banach Algebras1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q47134121992-06-25Paper
Commutativity criteria for real Banach algebras1990-01-01Paper
Absolute continuity and Radon-Nikodym type theorems for weights and traces on von Neumann algebras1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38061901987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Anand Srivastav