Pages that link to "Item:Q1774147"

The following pages link to Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (Q1774147):

Displaying 18 items.

• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
• Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
• Parameterized complexity of the maximum independent set problem and the speed of hereditary properties (Q2851451) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• max-cut and Containment Relations in Graphs (Q3057609) (← links)
• (Q4972036) (← links)
• NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
• (Q5009461) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)