The following pages link to (Q4636646):
Displaying 17 items.
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- (Q5090494) (← links)
- (Q5111743) (← links)
- (Q5140719) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- (Q5874501) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
