Demo Data from EDBT 2026 / reviewers in the wild / expert
Sebastian Meyer 0009
dblp:221/6538-9
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0006-8810-9423ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 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 |
Computational complexity · 61% Graph algorithms and graph theory · 30% Combinatorics and discrete mathematics · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › constraint satisfaction
dichotomy theorem |
0.9 | 1 | 2025 | A topological proof of the Hell-Nešetřil dichotomy · SODA 2025 |
Graph algorithms and graph theory
graph homomorphism |
0.9 | 1 | 2025 | A topological proof of the Hell-Nešetřil dichotomy · SODA 2025 |
Computational complexity › constraint satisfaction › dichotomy theorem
graph homomorphism dichotomy |
0.9 | 1 | 2025 | A topological proof of the Hell-Nešetřil dichotomy · SODA 2025 |
Combinatorics and discrete mathematics
topological combinatorics |
0.3 | 1 | 2025 | A topological proof of the Hell-Nešetřil dichotomy · SODA 2025 |
Methods — techniques the papers use, named apart from their topics
topological combinatorics · 0.9algebraic approach to CSP · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A topological proof of the Hell-Nešetřil dichotomyabstractWe provide a new proof of a theorem of Hell and Nešetřil [J. Comb. Theory B, 48(1):92-110, 1990] using tools from topological combinatorics based on ideas of Lovász [J. Comb. Theory, Ser. A, 25(3):319-324, 1978]. The Hell-Nešetřil Theorem provides a dichotomy of the graph homomorphism problem. It states that deciding whether there is a graph homomorphism from a given graph to a fixed graph H is in P if H is bipartite (or contains a self-loop), and is NP-complete otherwise. In our proof we combine topological combinatorics with the algebraic approach to constraint satisfaction problem. Sebastian Meyer 0009, Jakub Oprsal |
SODA | 1 |