Abstract. This paper contains the summary of a panel on authentication in constrained environments held during the Secure MADNES’05 Workshop. These were transcribed from hand-wri...
Mike Burmester, Virgil D. Gligor, Evangelos Kranak...
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
: This research note both confirms and extends the value relevance of information technology announcements found by Im et al (2001) and Dos Santos et al. (1993). We extend their wo...
The first Technical Note in this series [1] introduced the international standard ISO 10303, informally known as STEP (STandard for the Exchange of Product model data). Subsequent...
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender