Maintaining a k-core decomposition quickly in a dynamic graph has important applications
in network analysis. The main challenge for designing efficient exact algorithms is that a …

We study the problem of coloring a given graph using a small number of colors in several
well-established models of computation for big data. These include the data streaming …

A recent work by Christiansen, Nowicki, and Rotenberg [STOC'23] provides dynamic
algorithms for coloring sparse graphs, concretely as a function of the graph's arboricity α …

Graph coloring is a fundamental problem in computer science. We study the fully dynamic
version of the problem in which the graph is undergoing edge insertions and deletions and …

Motivated by placement of jobs in physical machines, we introduce and analyze the problem
of online recoloring, or online disengagement. In this problem, we are given a set of n …

Given a dynamic graph subject to edge insertions and deletions, we show how to update an
implicit representation of a proper vertex colouring, such that colours of vertices are …

In the implicit dynamic colouring problem, the task is to maintain a representation of a proper
colouring as a dynamic graph is subject to insertions and deletions of edges, while …

We present fully dynamic approximation algorithms for the Maximum Independent Set
problem on several types of geometric objects: intervals on the real line, arbitrary axis …

Irregular applications comprise an increasingly important workload domain for many fields,
including bioinformatics, chemistry, physics, social sciences and machine learning …

The number of vehicles equipped with radars on the road has been increasing for years and
is expected to reach 50% of cars by 2030. This rapid rise in radars will likely increase the …