Ildikó Schlotter

activity

20082026

most citedComplexity of Stability in Trading Networks

5 citations · 17 across the 24 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Arborescences, Colorful Forests, and Popularity

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter +1

Our input is a directed, rooted graph $G = (V \cup {r}, E)$ where each vertex in $V$ has a partial order preference over its incoming edges. The preferences of a vertex extend nat…

cs.DS2023

Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions

Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3

We consider the Shortest Odd Path problem, where given an undirected graph $G$ , a weight function on its edges, and two vertices $s$ and $t$ in $G$ , the aim is to find an $(s, t)$ -p…

cs.DS2023

Shortest two disjoint paths in conservative graphs

Ildikó Schlotter

We consider the following problem that we call the Shortest Two Disjoint Paths problem: given an undirected graph $G = (V, E)$ with edge weights $w : E \to R$ , two term…