Michelle Döring

24 papers A* 5A 1B 3Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Cost-Free Neutrality for the River Method.
AAAI
Michelle Döring, Jannes Malanowski, Stefan Neubert
2026 J jnl
FO and MSO Model Checking on Temporal Graphs.
CoRR
Michelle Döring, Jessica A. Enright, Laura Larios-Jones, George Skretas
2026 A* conf
The River Voting Method.
AAAI
Michelle Döring, Markus Brill, Jobst Heitzig
2025 J jnl
Cost-Free Neutrality for the River Method.
CoRR
Michelle Döring, Jannes Malanowski, Stefan Neubert
2025 A* conf
Dynamic Network Discovery via Infection Tracing.
IJCAI
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2025 A* conf
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.
AAAI
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025 J jnl
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025 B conf
Parameterized Complexity of Vehicle Routing.
IPEC
Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025 J jnl
Parameterized Complexity of Vehicle Routing.
CoRR
Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025 B conf
Realization of Temporally Connected Graphs Based on Degree Sequences.
ISAAC
Arnaud Casteigts, Michelle Döring, Nils Morawietz
2025 J jnl
Realization of Temporally Connected Graphs Based on Degree Sequences.
CoRR
Arnaud Casteigts, Michelle Döring, Nils Morawietz
2025 B conf
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs.
ISAAC
Michelle Döring
2025 J jnl
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs.
CoRR
Michelle Döring
2025 J jnl
The River Method.
CoRR
Michelle Döring, Markus Brill, Jobst Heitzig
2024 J jnl
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.
Inf. Comput.
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2024 J jnl
Catch Me If You Can: Finding the Source of Infections in Temporal Networks.
CoRR
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2024 J jnl
Dynamic Network Discovery via Infection Tracing.
CoRR
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2024 J jnl
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2024 J jnl
Margin of Victory for Weighted Tournament Solutions.
CoRR
Michelle Döring, Jannik Peters
2023 J jnl
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023 A conf
Margin of Victory for Weighted Tournament Solutions.
AAMAS
Michelle Döring, Jannik Peters
2023 — conf
Schelling Games with Continuous Types (short paper).
ICTCS
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
2023 A* conf
Schelling Games with Continuous Types.
IJCAI
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
2023 J jnl
Schelling Games with Continuous Types.
CoRR
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt