Pages that link to "Item:Q3596727"
From MaRDI portal
The following pages link to Graph Layout Problems Parameterized by Vertex Cover (Q3596727):
Displaying 50 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Group activity selection with few agent types (Q2701380) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- (Q5075791) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
