( en | de | ru )

 

Disambiguation of "Srivastav, Anand"

Author of the publication

copydeleteadd this publication to your clipboard
Constructions of Sparse Asymmetric Connectors: Extended Abstract.

, , and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 13-22. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anand Srivastav

Abhinav Srivastav

Shiela Srivastav

Davinder Kumar Anand

Madhankumar Anandhakrishnan

 

Other publications of authors with the same name

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs., , and . MedAlg, volume 7659 of Lecture Notes in Computer Science, page 174-187. Springer, (2012)Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory., and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 165-177. Springer, (2003)Constructions of Sparse Asymmetric Connectors: Extended Abstract., , and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 13-22. Springer, (2003)Bounds and constructions for the star-discrepancy via ?-covers., , and . J. Complex., 21 (5): 691-709 (2005)Approximation Algorithms for Pick-and-Place Robots., , and . Ann. Oper. Res., 107 (1-4): 321-338 (2001)Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems., , and . PReMI, volume 4815 of Lecture Notes in Computer Science, page 252-260. Springer, (2007)Bounds for Static Black-Peg AB Mastermind., , , and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 409-424. Springer, (2017)Multicast Routing and Design of Sparse Connectors., and . Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, page 247-265. Springer, (2009)Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching., and . SEA, volume 5526 of Lecture Notes in Computer Science, page 185-196. Springer, (2009)Price of Anarchy for Graph Coloring Games with Concave Payoff., , and . CoRR, (2015)