Agents operating in the real world often have limited time available for planning their next
actions. Producing optimal plans is infeasible in these scenarios. Instead, agents must be …

This article studies the fundamental problem of graph coloring in fully dynamic graphs. Since
the problem of computing an optimal coloring, or even approximating it to within n1-ε for any …

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 give improved algorithms for maintaining edge-orientations of a fully-dynamic graph,
such that the maximum out-degree is bounded. On one hand, we show how to orient the …

A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph
changes that consist of multiple edge updates at a time. In this paper we focus on fully …

We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph,
such that the out-degree of each vertex is bounded. On one hand, we show how to orient the …

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 …

Accomplishing an effective routing of emergency vehicle will minimize its response time and
will thus improve the response performance. Traffic congestion is a critical problem in urban …

Solving problems on graphs dynamically calls for algorithms to function under repeated
modifications to the graph and to be more efficient than solving the problem for the whole …

Vertex and edge orderings of graphs are commonly used in algorithmic graph theory. Such
orderings can encode structural properties of graphs in a condensed way and, thus, they …