research
∙
05/17/2023
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
Given a graph G=(V, E) and a list of available colors L(v) for each vert...
share
research
∙
05/16/2023
Sorting and Hypergraph Orientation under Uncertainty with Predictions
Learning-augmented algorithms have been attracting increasing interest, ...
research
∙
12/03/2022
Parameterized temporal exploration problems
In this paper we study the fixed-parameter tractability of the problem o...
research
∙
09/25/2022
Package Delivery Using Drones with Restricted Movement Areas
For the problem of delivering a package from a source node to a destinat...
research
∙
06/30/2022
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
We study how to utilize (possibly erroneous) predictions in a model for ...
research
∙
07/01/2021
Orienting (hyper)graphs under explorable stochastic uncertainty
Given a hypergraph with uncertain node weights following known probabili...
research
∙
01/13/2021
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
The area of computing with uncertainty considers problems where some inf...
research
∙
11/14/2020
Untrusted Predictions Improve Trustable Query Policies
We study how to utilize (possibly machine-learned) predictions in a mode...
research
∙
08/19/2019
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
This paper considers a game in which a single cop and a single robber ta...
research
∙
04/19/2019
An Efficient Algorithm for the Fast Delivery Problem
We study a problem where k autonomous mobile agents are initially locate...
research
∙
07/05/2018
