Amites Sarkar's homepage
  1. Extremal graphs for weights, Discrete Mathematics 200 (1999), 5-19 (with Béla Bollobás and Paul Erdős)
  2. Paths in graphs, Studia Scientiarum Mathematicarum Hungarica 38 (2001), 115-137 (with Béla Bollobás)
  3. Paths of length four, Discrete Mathematics 265 (2003), 357-363 (with Béla Bollobás)
  4. Connectivity of random k-nearest-neighbour graphs, Advances in Applied Probability 37 (2005), 1-24 (with Paul Balister, Béla Bollobás and Mark Walters)
  5. Reliable density estimates for achieving coverage and connectivity in thin strips of finite length, ACM MobiCom (2007), 75-86 (with Paul Balister, Béla Bollobás and Santosh Kumar)
  6. Connectivity of a gaussian network, Int. J. Ad Hoc and Ubiquitous Computing 3 (2008), 204-213 (with Paul Balister, Béla Bollobás and Mark Walters)
  7. Highly connected random geometric graphs, Discrete Applied Mathematics 157 (2009), 309-320 (with Paul Balister, Béla Bollobás and Mark Walters)
  8. A critical constant for the k-nearest-neighbour model, Advances in Applied Probability 41 (2009), 1-12 (with Paul Balister, Béla Bollobás and Mark Walters)
  9. Percolation, connectivity, coverage and colouring of random geometric graphs, in Handbook of Large-Scale Random Networks, Springer (2009) (with Paul Balister and Béla Bollobás)
  10. The Linus sequence, Combinatorics, Probability and Computing 19 (2010), 21-46 (with Paul Balister and Steve Kalikow)
  11. Sentry selection in wireless networks, Advances in Applied Probability 42 (2010), 1-25 (with Paul Balister, Béla Bollobás and Mark Walters)
  12. The simple random walk on a random Voronoi tiling, manuscript (with Louigi Addario-Berry)
  13. Secrecy coverage, Internet Mathematics 9 (2013), 199-216 (with Martin Haenggi)
    conference version, 44th Asilomar Conference on Signals, Systems, and Computers (2010) (with Martin Haenggi)
  14. Percolation in the secrecy graph, Discrete Applied Mathematics 161 (2013), 2120-2132 (with Martin Haenggi)
    conference version, Information Theory and Applications Workshop, San Diego (2011) (with Martin Haenggi)
    related conference paper, Information Theory Workshop, Paraty, Brazil (2011) (with Martin Haenggi)
  15. Secrecy coverage in two dimensions, Advances in Applied Probability 48 (2016), 1-12
    conference version, Information Theory and Applications Workshop, San Diego (2014)
  16. Barrier coverage, Random Structures and Algorithms 49 (2016), 429-478 (with Paul Balister and Béla Bollobás)
  17. Sentry selection in sensor networks: theory and algorithms, Int. J. Sensor Networks 24 (2017), 139-148 (with Paul Balister, Béla Bollobás, Martin Haenggi and Mark Walters)
  18. Rainbow Turán problems for paths and forests of stars, Electronic Journal of Combinatorics 24 (2017), Paper 1.34 (with Dan Johnston and Cory Palmer)
  19. Unique coverage in Boolean models, Statistics and Probability Letters 123 (2017), 1-7 (with Martin Haenggi)
  20. Continuum percolation with holes, Statistics and Probability Letters 126 (2017), 212-218 (with Martin Haenggi)
  21. Highly connected subgraphs of graphs with given independence number, submitted (with Shinya Fujita and Henry Liu)
    conference version, Electronic Notes in Discrete Mathematics 54 (2016), 103-108 (with Shinya Fujita and Henry Liu)