Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

71

CPM
2010
Springer

favoriteEmaildiscussreport

134views Combinatorics» more CPM 2010»

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs

15 years 2 months ago

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs

Download cs.nyu.edu

Minghui Jiang

Real-time Traffic

CPM 2010 |

claim paper

Related Content

» On the Complexity of Some Colorful Problems Parameterized by Treewidth

» The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Si...

» Bidimensionality and Kernels

» A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem

» Using Generalized Annotated Programs to Solve Social Network Optimization Problems

» On Approximating Optimal Weighted Lobbying and Frequency of Correctness Versus AverageCase...

» Emergence of Complex Networks through Local Optimization

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

» Probabilistic graph and hypergraph matching

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	CPM
Authors	Minghui Jiang

Comments (0)