1 citations · 1 across the 1 of their papers we have counts for
3 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…