Pages that link to "Item:Q3499742"
From MaRDI portal
The following pages link to Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems (Q3499742):
Displaying 46 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Homogeneous string segmentation using trees and weighted independent sets (Q972999) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Segmenting Strings Homogeneously Via Trees (Q3508569) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- (Q5116487) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Parameterized Complexity of Directed Spanner Problems. (Q6089656) (← links)