Pages that link to "Item:Q5311126"

The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311126):

Displaying 12 items.

• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
• Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
• A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Fixed-parameter tractability and data reduction for multicut in trees (Q3367053) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• (Q5111743) (← links)
• The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)