research
∙
09/16/2023
Parallel Longest Common SubSequence Analysis In Chapel
One of the most critical problems in the field of string algorithms is t...
share
research
∙
01/13/2023
Quick Minimization of Tardy Processing Time on a Single Machine
We consider the problem of minimizing the total processing time of tardy...
research
∙
12/14/2022
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput
Motivated by baterryless IoT devices, we consider the following scheduli...
research
∙
11/07/2022
Partially Disjoint k Shortest Paths
A solution of the k shortest paths problem may output paths that are ide...
research
∙
07/03/2019
Generalized Assignment via Submodular Optimization with Reserved Capacity
We study a variant of the generalized assignment problem ( GAP) with gro...
research
∙
02/10/2019
Scalable Fair Clustering
We study the fair variant of the classic k-median problem introduced by ...
research
∙
11/18/2018
The Preemptive Resource Allocation Problem
We revisit a classical scheduling model to incorporate modern trends in ...
research
∙
08/30/2018
Fully Dynamic MIS in Uniformly Sparse Graphs
We consider the problem of maintaining a maximal independent set (MIS) i...
research
∙
06/26/2018
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
The first fully dynamic algorithm for maintaining a maximal independent ...
research
∙
02/27/2018
Fully Dynamic Maximal Independent Set with Sublinear Update Time
A maximal independent set (MIS) can be maintained in an evolving m-edge ...
research
∙
10/29/2017
