Demo Data from EDBT 2026 / reviewers in the wild / expert
Jorke M. de Vlas
dblp:346/4928
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0004-4981-2410ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Theory of computation · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 77% Graph algorithms and graph theory · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
constraint satisfaction |
1.0 | 1 | 2026 | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables · ICALP 2026 |
Graph algorithms and graph theory › graph theory › graph parameters › graph width parameters
twin-width |
0.3 | 1 | 2026 | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables · ICALP 2026 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables
Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlström |
ICALP | 3 |
| 2026 | Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity ClassificationabstractThe simple temporal problem (STP) and its generalization allowing disjunctive constraints (DTP) are some of the most influential reasoning formalisms for temporal information in AI. We study the problem of resolving inconsistency of data encoded in the DTP, i.e. given a DTP instance, find the minimum number of constraints to remove to make it satisfiable. While this problem is NP-hard in general, it is reasonable to assume that the amount of erroneous data will be small in practical instances. We therefore study the parameterized complexity of this problem parameterized by the number of constraints to be removed to achieve satisfiability, and obtain full P/NP-hard and FPT/W[1]-hard dichotomies for all binary DTP languages. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Jorke M. de Vlas |
KR | 5 |
| 2024 | On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper)
Jorke M. de Vlas |
CP | 1 |
| 2024 | On the Parameterized Complexity of the Perfect Phylogeny Problem
Jorke M. de Vlas |
SOFSEM | 1 |