The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Journal of the ACM (JACM)
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On problems without polynomial kernels
Journal of Computer and System Sciences
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a @P-graph for @P-graphs being one of the following four classes of graphs: Eulerian graphs, even graphs, odd graphs, and connected odd graphs. We also consider the parameterized complexity of their parametric dual problems. For these sixteen problems, we show that eight of them are fixed parameter tractable and four are W[1]-hard. Our main techniques are the color-coding method of Alon, Yuster and Zwick, and the random separation method of Cai, Chan and Chan.