The following pages link to Michael R. Fellows (Q175527):
Displaying 50 items.
- A Linear Kernel for Co-Path/Cycle Packing (Q3578360) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833) (← links)
- Quadratic Kernelization for Convex Recoloring of Trees (Q3608834) (← links)
- On the Complexity of Some Colorful Problems Parameterized by Treewidth (Q3611990) (← links)
- Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
- Distortion Is Fixed Parameter Tractable (Q3638056) (← links)
- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology (Q3651529) (← links)
- What Makes Equitable Connected Partition Easy (Q3656856) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- (Q3775581) (← links)
- (Q3798235) (← links)
- Nonconstructive tools for proving polynomial-time decidability (Q3798236) (← links)
- (Q3800059) (← links)
- (Q3833615) (← links)
- Searching for<i>K</i><sub>3,3</sub>in linear time (Q3978382) (← links)
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design (Q3989017) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- (Q4017175) (← links)
- (Q4017197) (← links)
- (Q4027320) (← links)
- (Q4038748) (← links)
- (Q4217593) (← links)
- (Q4249534) (← links)
- (Q4252027) (← links)
- (Q4263467) (← links)
- (Q4273844) (← links)
- (Q4273870) (← links)
- (Q4279511) (← links)
- (Q4281497) (← links)
- (Q4281539) (← links)
- The Private Neighbor Cube (Q4287938) (← links)
- (Q4313178) (← links)
- (Q4314356) (← links)
- (Q4318710) (← links)
- (Q4375789) (← links)
- (Q4393480) (← links)
- (Q4417671) (← links)
- (Q4472448) (← links)
- (Q4474097) (← links)
- (Q4501141) (← links)
- (Q4503944) (← links)
- A note on the computability of graph minor obstruction sets for monadic second order ideals (Q4520519) (← links)
- Constructions of large planar networks with given degree and diameter (Q4540082) (← links)
- Constructivity issues in graph algorithms (Q4594259) (← links)
- Transversals of Vertex Partitions in Graphs (Q4712708) (← links)
