دانلود کتاب Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings

فهرست مطالب :

Front Matter....Pages -
The Complexity of Satisfaction on Sparse Graphs....Pages 1-2
Protrusions in Graphs and Their Applications....Pages 3-3
Parameterized Complexity Results in Symmetry Breaking....Pages 4-13
On the Kernelization Complexity of Colorful Motifs....Pages 14-25
Partial Kernelization for Rank Aggregation: Theory and Experiments....Pages 26-37
Enumerate and Measure: Improving Parameter Budget Management....Pages 38-49
On the Exact Complexity of Evaluating Quantified k -CNF....Pages 50-59
Cluster Editing: Kernelization Based on Edge Cuts....Pages 60-71
Computing the Deficiency of Housing Markets with Duplicate Houses....Pages 72-83
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application....Pages 84-94
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion....Pages 95-106
Multivariate Complexity Analysis of Swap Bribery....Pages 107-122
Parameterizing by the Number of Numbers....Pages 123-134
Are There Any Good Digraph Width Measures?....Pages 135-146
On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems....Pages 147-157
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming....Pages 158-169
On the Grundy Number of a Graph....Pages 170-179
Exponential Time Complexity of Weighted Counting of Independent Sets....Pages 180-191
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected....Pages 192-203
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting....Pages 204-215
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier....Pages 216-227
Proper Interval Vertex Deletion....Pages 228-238
Back Matter....Pages -