I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
BISHNOI, ANURAG
68
results:
Search for persons
X
Format
Online (68)
Mediatypes
Articles (Online) (31)
Bookchapter (Online) (1)
OpenAccess-fulltext (36)
Sorted by: Relevance
Sorted by: Year
?
1
Blocking sets, minimal codes and trifferent codes:
Bishnoi, Anurag
;
D'haeseleer, Jozefien
;
Gijswijt, Dion
.
Journal of the London Mathematical Society. 109 (2024) 6 - p. , 2024
Link:
https://doi.org/10.1112/..
?
2
Subspace coverings with multiplicities:
Bishnoi, Anurag
;
Boyadzhiyska, Simona
;
Das, Shagnik
.
Combinatorics, Probability and Computing. 32 (2023) 5 - p. 782-795 , 2023
Link:
https://doi.org/10.1017/..
?
3
On the Minimum Degree of Minimal Ramsey Graphs for Cliques ..:
Bishnoi, Anurag
;
Boyadzhiyska, Simona
;
Clemens, Dennis
...
SIAM Journal on Discrete Mathematics. 37 (2023) 1 - p. 25-50 , 2023
Link:
https://doi.org/10.1137/..
?
4
The minimum degree of minimal Ramsey graphs for cliques:
Bamberg, John
;
Bishnoi, Anurag
;
Lesgourgues, Thomas
Bulletin of the London Mathematical Society. 54 (2022) 5 - p. 1827-1838 , 2022
Link:
https://doi.org/10.1112/..
?
5
Ryser's Conjecture for t-intersecting hypergraphs:
Bishnoi, Anurag
;
Das, Shagnik
;
Morris, Patrick
.
Journal of Combinatorial Theory, Series A. 179 (2021) - p. 105366 , 2021
Link:
https://doi.org/10.1016/..
?
6
Nonintersecting Ryser Hypergraphs:
Bishnoi, Anurag
;
Pepe, Valentina
SIAM Journal on Discrete Mathematics. 34 (2020) 1 - p. 230-240 , 2020
Link:
https://doi.org/10.1137/..
?
7
A Construction for Clique-Free Pseudorandom Graphs:
Bishnoi, Anurag
;
Ihringer, Ferdinand
;
Pepe, Valentina
Combinatorica. 40 (2020) 3 - p. 307-314 , 2020
Link:
https://doi.org/10.1007/..
?
8
Correction to: On Semi-finite Hexagons of Order (2, t) Cont..:
Bishnoi, Anurag
;
De Bruyn, Bart
Annals of Combinatorics. 23 (2019) 2 - p. 423-424 , 2019
Link:
https://doi.org/10.1007/..
?
9
On regular induced subgraphs of generalized polygons:
Bamberg, John
;
Bishnoi, Anurag
;
Royle, Gordon F.
Journal of Combinatorial Theory, Series A. 158 (2018) - p. 254-275 , 2018
Link:
https://doi.org/10.1016/..
?
10
On Zeros of a Polynomial in a Finite Grid:
BISHNOI, ANURAG
;
CLARK, PETE L.
;
POTUKUCHI, ADITYA
.
Combinatorics, Probability and Computing. 27 (2018) 3 - p. 310-333 , 2018
Link:
https://doi.org/10.1017/..
?
11
On generalized hexagons of order (3,t) and (4,t) containing..:
Bishnoi, Anurag
;
De Bruyn, Bart
European Journal of Combinatorics. 62 (2017) - p. 115-123 , 2017
Link:
https://doi.org/10.1016/..
?
12
On Semi-Finite Hexagons of Order (2, t) Containing a Subhex..:
Bishnoi, Anurag
;
De Bruyn, Bart
Annals of Combinatorics. 20 (2016) 3 - p. 433-452 , 2016
Link:
https://doi.org/10.1007/..
?
13
On the Alon-Füredi bound:
Bishnoi, Anurag
;
Clark, Pete L.
;
Potukuchi, Aditya
.
Electronic Notes in Discrete Mathematics. 54 (2016) - p. 57-62 , 2016
Link:
https://doi.org/10.1016/..
?
14
Characterizations of the Suzuki tower near polygons:
Bishnoi, Anurag
;
Bruyn, Bart De
Designs, Codes and Cryptography. 84 (2016) 1-2 - p. 115-133 , 2016
Link:
https://doi.org/10.1007/..
?
15
Strong blocking sets and minimal codes from expander graphs:
Alon, Noga
;
Bishnoi, Anurag
;
Das, Shagnik
.
http://arxiv.org/abs/2305.15297. , 2023
Link:
http://arxiv.org/abs/230..
1-15