54 citations · 62 across the 9 of their papers we have counts for
19 papers
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach +3
We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A…
Scheduling with Obligatory Tests
Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang
Motivated by settings such as medical treatments or aircraft maintenance, we consider a scheduling problem with jobs that consist of two operations, a test and a processing part. T…
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer +2
Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a…
Sorting and Hypergraph Orientation under Uncertainty with Predictions
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow +1
Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of unce…
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
Banu Baklan Şen, Öznur Yaşar Diner, Thomas Erlebach
Given a graph and a list of available colors for each vertex , where , List -Coloring refers to the problem of assi…
Parameterized temporal exploration problems
Thomas Erlebach, Jakob T. Spooner
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal explorat…