Pages that link to "Item:Q1749387"
From MaRDI portal
The following pages link to The complexity landscape of decompositional parameters for ILP (Q1749387):
Displaying 21 items.
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Backdoors to planning (Q2321271) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5111743) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- (Q5874480) (← links)
- (Q5874501) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5918790) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
