We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Traditionally, Human-Computer Interaction (HCI) is a highly interdisciplinary field bridging the research between psychological research and computer science. This paper places gr...
As noted almost a decade ago, HCI (Human-Computer Interaction) aspects of visual language environments are under-developed. This remains a fact, in spite of the central role playe...
Abstract. In Aspect-Oriented Programming we decompose a problem into a number of functional components as well as a number of aspects and then we compose these components and aspec...