For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
-- In the past decade there has been spectacular growth in the number and size of third-party libraries, frameworks, toolkits and other Application Programming Interfaces (APIs) av...
Daniel S. Eisenberg, Jeffrey Stylos, Andrew Faulri...
Abstract--The inadequate quality of context forces the context consumers in pervasive environments to reason about the quality and relevance of context to be confident of its worth...
Atif Manzoor, Hong Linh Truong, Christoph Dorn, Sc...
Few web developers have been explicitly trained to create accessible web pages, and are unlikely to recognize subtle accessibility and usability concerns that disabled people face...
Jeffrey P. Bigham, Jeremy T. Brudvik, Bernie Zhang
The acceleration of rhythm of everyday life requires efficiency and flexibility in daily routines. The real expectations and needs of people concerning intelligent home devices sh...