The following pages link to Michael Dom (Q408397):
Displaying 19 items.
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Error compensation in leaf power problems (Q2498407) (← links)
- (Q3397627) (← links)
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments (Q3434567) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Incompressibility through Colors and IDs (Q3638049) (← links)
- Kernelization Lower Bounds Through Colors and IDs (Q4962171) (← links)
- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems (Q5425481) (← links)
- Algorithms and Computation (Q5712129) (← links)
- Computing and Combinatorics (Q5716998) (← links)
- Minimum Membership Set Covering and the Consecutive Ones Property (Q5757903) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897573) (← links)
