418 search results - page 1 / 84 » Separation Results on the "One-More" Computational... |
CTRSA
2008
Springer
13 years 6 months ago
2008
Springer
In 2001, Bellare, Namprempre, Pointcheval and Semanko introduced
MFCS
1989
Springer
13 years 9 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
MP
2010
13 years 3 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
DM
2008
13 years 5 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
STACS
2010
Springer
13 years 12 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...