Anurag Bishnoi

Orcid: 0000-0003-0232-428X

Affiliations:
  • Delft University of Technology, The Netherlands


According to our database1, Anurag Bishnoi authored at least 20 papers between 2016 and 2026.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The Generalized Trifference Problem.
IEEE Trans. Inf. Theory, May, 2026

Explicit Constructions of Optimal Blocking Sets and Minimal Codes.
Comb., April, 2026

2025
A note on the minimum degree of minimal Ramsey graphs.
Australas. J Comb., June, 2025

Covering half-grids with lines and planes.
CoRR, January, 2025

2023
Subspace coverings with multiplicities.
Comb. Probab. Comput., September, 2023

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles.
SIAM J. Discret. Math., March, 2023

Strong blocking sets and minimal codes from expander graphs.
CoRR, 2023

Blocking sets, minimal codes and trifferent codes.
CoRR, 2023

Covering grids with multiplicity.
Comb. Theory, 2023

2021
Ryser's Conjecture for <i>t</i>-intersecting hypergraphs.
J. Comb. Theory A, 2021

2020
Nonintersecting Ryser Hypergraphs.
SIAM J. Discret. Math., 2020

A Construction for Clique-Free Pseudorandom Graphs.
Comb., 2020

2018
On regular induced subgraphs of generalized polygons.
J. Comb. Theory A, 2018

On Zeros of a Polynomial in a Finite Grid.
Comb. Probab. Comput., 2018

Minimal Multiple Blocking Sets.
Electron. J. Comb., 2018

2017
On generalized hexagons of order (3, t) and (4, t) containing a subhexagon.
Eur. J. Comb., 2017

Characterizations of the Suzuki tower near polygons.
Des. Codes Cryptogr., 2017

Some non-existence results for distance-$j$ ovoids in small generalized polygons.
Contributions Discret. Math., 2017

2016
On the Alon-Füredi bound.
Electron. Notes Discret. Math., 2016

A New Near Octagon and the Suzuki Tower.
Electron. J. Comb., 2016


  Loading...