Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ferdinand Ihringer
dblp:145/7258
· DBLP profile ↗
12ranked-venue papers
5as first author
6since 2021 · last 2026
0000-0001-5939-5623ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 3 first-author · 3 since 2021Theory of computation · 6 · 2 first-author · 3 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 50% Combinatorics and discrete mathematics · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics
algebraic combinatorics |
0.4 | 1 | 2020 | On the Algebraic Combinatorics of Injections and its Applications to Injection Codes · IEEE Trans. Inf. Theory 2020 |
Coding theory › error-correcting codes › coding bounds
linear programming bounds |
0.4 | 1 | 2020 | On the Algebraic Combinatorics of Injections and its Applications to Injection Codes · IEEE Trans. Inf. Theory 2020 |
Methods — techniques the papers use, named apart from their topics
spherical functions · 0.4representation theory · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On the twin-width of near-regular graphs
Irene Heinrich, Ferdinand Ihringer, Simon Raßmann, Lena Volk |
Discret. Appl. Math. | 2 |
| 2025 | Affine vector space partitionsabstractAbstract An affine vector space partition of $${{\,\textrm{AG}\,}}(n,q)$$ AG ( n , q ) is a set of proper affine subspaces that partitions the set of points. Here we determine minimum sizes and enumerate equivalence classes of affine vector space partitions for small parameters. We also give parametric constructions for arbitrary field sizes. John Bamberg, Yuval Filmus, Ferdinand Ihringer, Sascha Kurz |
Des. Codes Cryptogr. | 3 |
| 2025 | A common generalization of hypercube partitions and ovoids in polar spaces
Jozefien D'haeseleer, Ferdinand Ihringer, Kai-Uwe Schmidt |
Des. Codes Cryptogr. | 2 |
| 2024 | The strongly regular twisted D5,5(q) graph
Ferdinand Ihringer |
Discret. Appl. Math. | 1 |
| 2023 | The least Euclidean distortion constant of a distance-regular graph
Sebastian M. Cioaba, Ferdinand Ihringer, Hirotake Kurihara |
Discret. Appl. Math. | 3 |
| 2023 | The proportion of non-degenerate complementary subspaces in classical spaces
Stephen P. Glasby, Ferdinand Ihringer, Sam Mattheus |
Des. Codes Cryptogr. | 2 |
| 2020 | On the Algebraic Combinatorics of Injections and its Applications to Injection CodesabstractWe consider the algebraic combinatorics of the set of injections from a k-element set to an n-element set. In particular, we give a new combinatorial formula for the spherical functions of the Gelfand pair (Sk× Sn, diag(Sk) × Sn-k). We use this combinatorial formula to give new Delsarte linear programming bounds on the size of codes over injections. Peter Dukes, Ferdinand Ihringer, Nathan Lindzey |
IEEE Trans. Inf. Theory | 2 |
| 2019 | Regular intersecting families
Ferdinand Ihringer, Andrey Kupavskii |
Discret. Appl. Math. | 1 |
| 2019 | Correction to: Miklós-Manickam-Singhi conjectures on partial geometries
Ferdinand Ihringer, Karen Meagher |
Des. Codes Cryptogr. | 1 |
| 2018 | Infection in hypergraphs
Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy, Boting Yang, Guanglong Yu |
Discret. Appl. Math. | 4 |
| 2018 | Miklós-Manickam-Singhi conjectures on partial geometries
Ferdinand Ihringer, Karen Meagher |
Des. Codes Cryptogr. | 1 |
| 2014 | On the maximum size of Erdős-Ko-Rado sets in $$H(2d+1, q^2)$$
Ferdinand Ihringer, Klaus Metsch |
Des. Codes Cryptogr. | 1 |