The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Recently, the opportunity of extracting structured data from the Web has been identified by a number of research projects. One such example is that millions of relational-style H...
Daisy Zhe Wang, Xin Luna Dong, Anish Das Sarma, Mi...
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...