Pages that link to "Item:Q4268849"

The following pages link to Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (Q4268849):

Displaying 50 items.

• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• Planar disjoint-paths completion (Q329285) (← links)
• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
• Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• Parameterized coloring problems on chordal graphs (Q820152) (← links)
• Minimal proper interval completions (Q963366) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Chordal deletion is fixed-parameter tractable (Q973007) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• Parameterized complexity of vertex colouring (Q1811065) (← links)
• Proper interval vertex deletion (Q1949742) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
• Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
• Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
• Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
• An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
• A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
• A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
• Searching for better fill-in (Q2453556) (← links)
• On the interval completion of chordal graphs (Q2492201) (← links)
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
• Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• Parameterized Enumeration for Modification Problems (Q2799203) (← links)
• Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
• Planar Disjoint-Paths Completion (Q2891339) (← links)
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
• The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
• Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
• Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
• On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
• (Q5111890) (← links)
• (Q5126619) (← links)
• Customizable Contraction Hierarchies (Q5266613) (← links)
• Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
• (Q5743514) (← links)
• (Q5874519) (← links)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)