Pages that link to "Item:Q627124"

The following pages link to On the complexity of some colorful problems parameterized by treewidth (Q627124):

Displaying 49 items.

• The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Data reduction for graph coloring problems (Q393081) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
• A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model (Q2019203) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
• An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
• Parameterized complexity of fair deletion problems (Q2174554) (← links)
• Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
• Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
• Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
• Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
• On the complexity of restoring corrupted colorings (Q2424718) (← links)
• Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
• Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842) (← links)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
• Data Reduction for Graph Coloring Problems (Q3088272) (← links)
• (Q3304104) (← links)
• Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
• (Q5009486) (← links)
• Iterated Type Partitions (Q5041190) (← links)
• Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
• (Q5743487) (← links)
• (Q5874480) (← links)
• Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
• Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
• Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
• Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
• On the complexity of coloring ‐graphs (Q6092550) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
• Fair division with minimal withheld information in social networks (Q6113835) (← links)
• Fair division with minimal withheld information in social networks (Q6122612) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) (← links)