133 search results - page 8 / 27 » Locally Excluding a Minor |
101
click to vote
JCT
2006
15 years 1 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
156
Voted
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
103
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
Detecting the time of occurrence of an acoustic event (for instance, a cheer) embedded in a longer soundtrack is useful and important for applications such as search and retrieval...
115
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
112
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...