Kernelization Lower Bounds Through Colors and IDs von Dom, Michael, Lokshtanov, Daniel, Saurabh, Saket

Volltext

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems von Dom, Michael, Guo, Jiong, Niedermeier, Rolf

Volltext

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments von Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf, Truß, Anke

Volltext

Capacitated Domination and Covering: A Parameterized Perspective von Dom, Michael, Lokshtanov, Daniel, Saurabh, Saket, Villanger, Yngve

Volltext

Incompressibility through Colors and IDs von Dom, Michael, Lokshtanov, Daniel, Saurabh, Saket

Volltext

Fixed-parameter tractability results for feedback set problems in tournaments von Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf, Truss, Anke

Volltext

Aspects of a multivariate complexity analysis for Rectangle Tiling von Nichterlein, André, Dom, Michael, Niedermeier, Rolf

Volltext

The Parameterized Complexity of Stabbing Rectangles von Dom, Michael, Fellows, Michael R., Rosamond, Frances A., Sikdar, Somnath

Volltext

Minimum Membership Set Covering and the Consecutive Ones Property von Dom, Michael, Guo, Jiong, Niedermeier, Rolf, Wernicke, Sebastian

Volltext

Error compensation in leaf power problems von DOM, Michael, JIONG GUO, HÜFFNER, Falk, NIEDERMEIER, Rolf

Volltext

Extending the Tractability Border for Closest Leaf Powers von Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf

Volltext

Red-blue covering problems and the consecutive ones property von Dom, Michael, Guo, Jiong, Niedermeier, Rolf, Wernicke, Sebastian

Volltext

Closest 4-leaf power is fixed-parameter tractable von Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf

Volltext

Error Compensation in Leaf Root Problems von Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf

Volltext

Compact Routing von Dom, Michael

Volltext

Bounded Degree Closest k-Tree Power Is NP-Complete von Dom, Michael, Guo, Jiong, Niedermeier, Rolf

Volltext

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants von Dom, Michael, Sikdar, Somnath

Volltext

Driving Desired Futures: Turning Design Thinking into Real Innovation von Shamiyeh, Michael

Volltext

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane von Dom, Michael, Fellows, Michael R., Rosamond, Frances A.

Volltext

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems von Dom, Michael, Guo, Jiong, Niedermeier, Rolf

Volltext