New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
: An autonomic network must work unsupervised, therefore must be able to respond to unpredictable situations. The BIONETS project is working towards resilient network services that...
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
We present Subversion Statistics Sifter, a visualisation and statistics system for exploring the structure and evolution of data contained in Subversion repositories with respect t...