: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
We give an elementary proof for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has ...
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
A graph theoretical model is presented for constructing calendars for sports leagues where balancing requirement have to be considered with respect to the different venues where c...
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257
Christos Kaklamanis, Danny Krizanc, Manuela Montan...