Charlene Weiß

Diskrete Mathematik
charlene.weiss@uni-paderborn.de
ID
70420

5 Publications

Mark all

[5]
2023 | Journal Article | LibreCat-ID: 50298
Schmidt, K.-U., & Weiß, C. (2023). Packings and Steiner systems in polar spaces. Combinatorial Theory, 3(1). https://doi.org/10.5070/c63160424
LibreCat | DOI
 
[4]
2023 | Journal Article | LibreCat-ID: 50297
Schmidt, K., & Weiß, C. (2023). Existence of small ordered orthogonal arrays. Journal of Combinatorial Designs, 31(9), 422–431. https://doi.org/10.1002/jcd.21903
LibreCat | DOI
 
[3]
2023 | Dissertation | LibreCat-ID: 50300
Weiß, C. (2023). Linear programming bounds in classical association schemes. https://doi.org/10.17619/UNIPB/1-1672
LibreCat | DOI
 
[2]
2023 | Preprint | LibreCat-ID: 50299
Weiß, C. (n.d.). Nontrivial $t$-designs in polar spaces exist for all $t$. In arXiv:2311.08288.
LibreCat | arXiv
 
[1]
2023 | Report | LibreCat-ID: 52127
Moura, L., Nakic, A., Östergård, P., Wassermann, A., & Weiß, C. (2023). Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161) (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/DagRep.13.4.40
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

5 Publications

Mark all

[5]
2023 | Journal Article | LibreCat-ID: 50298
Schmidt, K.-U., & Weiß, C. (2023). Packings and Steiner systems in polar spaces. Combinatorial Theory, 3(1). https://doi.org/10.5070/c63160424
LibreCat | DOI
 
[4]
2023 | Journal Article | LibreCat-ID: 50297
Schmidt, K., & Weiß, C. (2023). Existence of small ordered orthogonal arrays. Journal of Combinatorial Designs, 31(9), 422–431. https://doi.org/10.1002/jcd.21903
LibreCat | DOI
 
[3]
2023 | Dissertation | LibreCat-ID: 50300
Weiß, C. (2023). Linear programming bounds in classical association schemes. https://doi.org/10.17619/UNIPB/1-1672
LibreCat | DOI
 
[2]
2023 | Preprint | LibreCat-ID: 50299
Weiß, C. (n.d.). Nontrivial $t$-designs in polar spaces exist for all $t$. In arXiv:2311.08288.
LibreCat | arXiv
 
[1]
2023 | Report | LibreCat-ID: 52127
Moura, L., Nakic, A., Östergård, P., Wassermann, A., & Weiß, C. (2023). Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161) (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/DagRep.13.4.40
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed