In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Nearly all network applications rely on the global Internet routing infrastructure to compute routes and deliver packets. Unfortunately, false Internet routes can be maliciously in...
If intelligent virtual agents are to become widely adopted it is vital that they can be designed using the user friendly graphical tools that are used in other areas of graphics. H...