2854 search results - page 20 / 571 » A Study of the Genus of a Group |
CHI
2011
ACM
12 years 11 months ago
2011
ACM
This paper reports initial results from a study exploring whether training in meditation or relaxation can improve office workers’ ability to multitask on a computer more effect...
ESE
2000
13 years 7 months ago
2000
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
STOC
2010
ACM
14 years 21 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
APPML
2007
13 years 8 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...