A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
— In this paper, single carrier frequency domain equalization with space time transmit diversity was implemented and evaluated in real-time using a DSP-based wireless MIMO test-b...
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
It is great practical interest to decide when to stop testing a software system in development phase and transfer it to the user. This problem is called as the optimal software re...
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...