Pages that link to "Item:Q2816829"
From MaRDI portal
The following pages link to Half-integrality, LP-branching, and FPT Algorithms (Q2816829):
Displaying 33 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Parametric bisubmodular function minimization and its associated signed ring family (Q2357141) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- On $k$-Submodular Relaxation (Q2820856) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5002776) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- (Q5140722) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs (Q6111961) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- Neighborhood persistency of the linear optimization relaxation of integer linear optimization (Q6166912) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)