An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
On physical mapping and the consecutive ones property for sparse matrices
Discrete Applied Mathematics - Special volume on computational molecular biology
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
On the consecutive ones property
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Approximation algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A simple test for the consecutive ones property
Journal of Algorithms
A note on the consecutive ones submatrix problem
Information Processing Letters
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing
Invitation to data reduction and problem kernelization
ACM SIGACT News
Layered graph drawing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Computing H/D-exchange speeds of single residues from data of peptic fragments
Proceedings of the 2008 ACM symposium on Applied computing
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
The simultaneous consecutive ones problem
Theoretical Computer Science
Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Two-Layer planarization: improving on parameterized algorithmics
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Set covering with almost consecutive ones property
Discrete Optimization
The weighted consecutive ones problem for a fixed number of rows or columns
Operations Research Letters
Parameterized Complexity
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Measuring indifference: unit interval vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Two-Layer planarization parameterized by feedback edge set
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Information Processing Letters
Two-Layer Planarization parameterized by feedback edge set
Theoretical Computer Science
| Hi-index | 0.00 |
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining submatrix has the C1P.