Anurag Bishnoi

Anurag Bishnoi

Technische Universiteit Delft

H-index: 7

Europe-Netherlands

About Anurag Bishnoi

Anurag Bishnoi, With an exceptional h-index of 7 and a recent h-index of 6 (since 2020), a distinguished researcher at Technische Universiteit Delft, specializes in the field of discrete mathematics, finite geometry, extremal combinatorics, algebraic combinatorics, polynomial methods.

His recent articles reflect a diverse array of research interests and contributions to the field:

Strong blocking sets and minimal codes from expander graphs

Covering grids with multiplicity

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

Blocking sets, minimal codes and trifferent codes

Subspace coverings with multiplicities

Expander graphs, strong blocking sets and minimal codes

A new upper bound on the minimum degree of minimal Ramsey graphs

Restricted Variable Chevalley-Warning Theorems

Anurag Bishnoi Information

University

Position

Assistant Professor at

Citations(all)

161

Citations(since 2020)

127

Cited By

78

hIndex(all)

7

hIndex(since 2020)

6

i10Index(all)

2

i10Index(since 2020)

2

Email

University Profile Page

Technische Universiteit Delft

Google Scholar

View Google Scholar Profile

Anurag Bishnoi Skills & Research Interests

discrete mathematics

finite geometry

extremal combinatorics

algebraic combinatorics

polynomial methods

Top articles of Anurag Bishnoi

Title

Journal

Author(s)

Publication Date

Strong blocking sets and minimal codes from expander graphs

arXiv preprint arXiv:2305.15297

Noga Alon

Anurag Bishnoi

Shagnik Das

Alessandro Neri

2023/5/24

Covering grids with multiplicity

arXiv preprint arXiv:2305.00825

Anurag Bishnoi

Simona Boyadzhiyska

Shagnik Das

Yvonne den Bakker

2023/5/1

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

SIAM Journal on Discrete Mathematics

Anurag Bishnoi

Simona Boyadzhiyska

Dennis Clemens

Pranshu Gupta

Thomas Lesgourgues

...

2023/3/31

Blocking sets, minimal codes and trifferent codes

arXiv preprint arXiv:2301.09457

Anurag Bishnoi

Jozefien D'haeseleer

Dion Gijswijt

Aditya Potukuchi

2023/1/23

Subspace coverings with multiplicities

Combinatorics, Probability and Computing

Anurag Bishnoi

Simona Boyadzhiyska

Shagnik Das

Tamás Mészáros

2023/9

Expander graphs, strong blocking sets and minimal codes

European Conference on Combinatorics, Graph Theory and Applications

Noga Alon

Anurag Bishnoi

Shagnik Das

Alessandro Neri

2023/8/28

A new upper bound on the minimum degree of minimal Ramsey graphs

arXiv preprint arXiv:2209.05147

Anurag Bishnoi

Thomas Lesgourgues

2022/9/12

Restricted Variable Chevalley-Warning Theorems

arXiv preprint arXiv:2201.11236

Anurag Bishnoi

Pete L Clark

2022/1/26

The minimum degree of minimal Ramsey graphs for cliques

Bulletin of the London Mathematical Society

John Bamberg

Anurag Bishnoi

Thomas Lesgourgues

2022/10

A construction for clique-free pseudorandom graphs

Combinatorica

Anurag Bishnoi

Ferdinand Ihringer

Valentina Pepe

2020/3/5

Ryser's Conjecture for t-intersecting hypergraphs

Journal of Combinatorial Theory, Series A

Anurag Bishnoi

Shagnik Das

Patrick Morris

Tibor Szabó

2021/4/1

Nonintersecting Ryser Hypergraphs

SIAM Journal on Discrete Mathematics

Anurag Bishnoi

Valentina Pepe

2020

See List of Professors in Anurag Bishnoi University(Technische Universiteit Delft)

Co-Authors

H-index: 115
Noga Alon

Noga Alon

Tel Aviv University

H-index: 37
Alessandro Neri

Alessandro Neri

Università degli Studi Roma Tre

H-index: 21
Pete L. Clark

Pete L. Clark

University of Georgia

H-index: 15
Dion Gijswijt

Dion Gijswijt

Technische Universiteit Delft

H-index: 12
John R. Schmitt

John R. Schmitt

Middlebury College

H-index: 11
Shagnik Das

Shagnik Das

Freie Universität Berlin

academic-engine