SOFSEM 2004: Theory and Practice of Computer Science
DOI10.1007/B95046zbMATH Open1202.68212OpenAlexW2916538296MaRDI QIDQ5902007FDOQ5902007
Authors: Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier 
Publication date: 4 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95046
Recommendations
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
- Permuting matrices to avoid forbidden submatrices
- Matrices with forbidden submatrices
- On forbidden submatrices
- On linear forbidden submatrices
- A general approach to avoiding two by two submatrices
- scientific article; zbMATH DE number 1463403
- Forbidden submatrices
- Forbidden submatrices: some new bounds and constructions
- Matrices with forbidden subconfigurations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cited In (6)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
- Permuting matrices to avoid forbidden submatrices
This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902007)
