Pages that link to "Item:Q5710807"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710807):

Displaying 47 items.

• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Data reduction for graph coloring problems (Q393081) (← links)
• On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
• Parameterizing role coloring on forests (Q831825) (← links)
• An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
• Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
• A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
• Minimum leaf out-branching and related problems (Q1035689) (← links)
• A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
• Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
• A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
• Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
• Induced star partition of graphs (Q2161236) (← links)
• List-coloring -- parameterizing from triviality (Q2173305) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
• On the kernelization of split graph problems (Q2636501) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
• Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
• Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
• On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
• Data Reduction for Graph Coloring Problems (Q3088272) (← links)
• Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
• Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• (Q5743378) (← links)
• Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
• Parameterized certificate dispersal and its variants (Q5964075) (← links)
• Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)