Jozefien D'haeseleer

dblp:200/1900 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0001-8333-7546ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 7 · 3 first-author · 5 since 2021
YearPublicationVenuePosition
2026 Generalized Hamming weights of additive codes and geometric counterparts
Jozefien D'haeseleer, Sascha Kurz
Des. Codes Cryptogr.1
2025 A common generalization of hypercube partitions and ovoids in polar spaces
Jozefien D'haeseleer, Ferdinand Ihringer, Kai-Uwe Schmidt
Des. Codes Cryptogr.1
2022 Neumaier graphs with few eigenvalues
abstract
Abstract A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue $$-2$$ - 2 .
Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer, Jack H. Koolen
Des. Codes Cryptogr.3
2022 Correction to: Cameron-Liebler sets of k-spaces in ${{\, \mathrm{PG}\, }}(n, q)$
Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer
Des. Codes Cryptogr.3
2022 On the sunflower bound for k-spaces, pairwise intersecting in a point
Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer
Des. Codes Cryptogr.3
2019 Cameron-Liebler sets of k-spaces in $${{\mathrm{PG}}}(n, q)$$ PG ( n , q )
Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer
Des. Codes Cryptogr.3
2017 On the maximality of a set of mutually orthogonal Sudoku Latin Squares
Jozefien D'haeseleer, Klaus Metsch, Leo Storme, Geertrui Van de Voorde
Des. Codes Cryptogr.1