Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Johannes Schröder

dblp:96/5638 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-2717-1590ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 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
Graph algorithms and graph theory · 70% Computational complexity · 30%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
disjoint paths
1.012026
The Directed Disjoint Paths Problem with Congestion · SODA 2026
Graph algorithms and graph theory
graph algorithms
1.012026
The Directed Disjoint Paths Problem with Congestion · SODA 2026
Computational complexity
parameterized complexity
1.012026
The Directed Disjoint Paths Problem with Congestion · SODA 2026

Methods — techniques the papers use, named apart from their topics

polynomial-time algorithm · 1.0hardness reduction · 1.0
YearPublicationVenuePosition
2026 The Directed Disjoint Paths Problem with Congestion
abstract
The classic result by Fortune, Hopcroft, and Wyllie [TCS ’80] states that the directed disjoint paths problem is NP-complete even for two pairs of terminals. Extending this well-known result, we show that the directed disjoint paths problem is NP-complete for any constant congestion \(c \ge 1\) and \(k \ge 3c - 1\) pairs of terminals. This refutes a conjecture by Giannopoulou et al. [SODA ’22], which says that the directed disjoint paths problem with congestion two is polynomial-time solvable for any constant number \(k\) of terminal pairs. We then consider the cases that are not covered by this hardness result. The first nontrivial case is \(c = 2\) and \(k = 3\). Our second main result is to show that this case is polynomial-time solvable.
Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder
SODA6
2024 Pronoun use in preclinical and early stages of Alzheimer's dementia
abstract
The present study aims at improving the predictive power of the use of pronouns in computational modeling of the risk of Alzheimer's dementia (AD) by (i) further determining the onset of increased pronoun use in AD and (ii) providing insights into the linguistic contexts affected by the increase early on. Pronoun use was compared longitudinally between subjects who either stayed cognitively intact (CTR-group, n = 5) or who had developed AD upon follow-up after 10–12 years (AD-group, n = 5). Data were taken from semi-structured biographical interviews, which stem from the Interdisciplinary Longitudinal Study on Adult Development and Aging (ILSE). The first interview (baseline) was conducted when all participants were still cognitively healthy. Analyses concerned the proportional distribution of 12 pronoun types and linguistic contexts of increased use. Already at baseline, the AD-group produced a significantly higher proportion of D-pronouns (der, die, das, etc.) than the CTR-group. The increase in D-pronouns did not affect linguistic contexts favoring the use of personal pronouns. Instead, we found a significantly higher proportion of D-pronouns referring to family members and a significantly higher proportion of personal pronouns referring to non-family humans in the AD-group than in the CTR-group. Our results suggest that the predictive power of the use of pronouns can be significantly improved in computational modeling of the risk of AD by assessing language material that induces the use of pronouns in linguistic contexts affected by the increase.
Dagmar Bittner, Claudia Frankenberg, Johannes Schröder
Comput. Speech Lang.3
2021 Verbal fluency in normal aging and cognitive decline: Results of a longitudinal study
Claudia Frankenberg, Jochen Weiner, Maren Knebel, Ayimunishagu Abulimiti, Pablo Toro, Christina J. Herold, Tanja Schultz, Johannes Schröder
Comput. Speech Lang.8
2019 Speech Reveals Future Risk of Developing Dementia: Predictive Dementia Screening from Biographic Interviews
abstract
Alzheimer's disease is a progressive incurable condition for which the success of any symptomatic therapy depends crucially on the starting time. Ideally it starts before the disease has caused any cognitive impairments. Our work aims at developing speech-based dementia screening methods that detect dementia as early as possible. Here, we aim to predict the outbreak even before clinical screening tests can diagnose the disease. Using the longitudinal ILSE study, we automatically extract features from biographic interviews and predict the development of dementia 5 and 12 years into the future. Our prediction system achieves results of 73.3% and 75.7% unweighted average recall (UAR), respectively, which clearly outperform a prediction based on prior diagnoses or disease prevalence. Thus, the automated analysis of spoken interviews offers a highly effective prediction procedure that allows for easy-to-use, cost-effective casual testing.
Jochen Weiner, Claudia Frankenberg, Johannes Schröder, Tanja Schultz
ASRU3
2016 Towards Automatic Transcription of ILSE ― an Interdisciplinary Longitudinal Study of Adult Development and Aging
Jochen Weiner, Claudia Frankenberg, Dominic Telaar, Britta Wendelstein, Johannes Schröder, Tanja Schultz
LREC5