Journal of the ACM (JACM)
File organization: the consecutive retrieval property
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Algorithms for Finding Gene Clusters
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Physical Mapping with Strict Chimerism
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Polyhedral Aspects of the Consecutive Ones Problem
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Maintaining the Mental Map for Circular Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Finding All Common Intervals of k Permutations
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
SNPs Problems, Complexity, and Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A General Method for Graph Isomorphism
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Recognizing Graphs without Asteroidal Triples
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Zero-Error Source Coding with Maximum Distortion Criterion
DCC '02 Proceedings of the Data Compression Conference
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
An improved algorithm for the p-center problem on interval graphs with unit lengths
Computers and Operations Research
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
The neighbour-scattering number can be computed in polynomial time for interval graphs
Computers & Mathematics with Applications
On the generation of bicliques of a graph
Discrete Applied Mathematics
Paired domination on interval and circular-arc graphs
Discrete Applied Mathematics
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas–Eddy class
Theoretical Computer Science
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
Approximation algorithm for coloring of dotted interval graphs
Information Processing Letters
Consecutive block minimization is 1.5-approximable
Information Processing Letters
DNA Physical Mapping on a Reconfigurable Platform
ARC '08 Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Preemptive scheduling and antichain polyhedra
Discrete Applied Mathematics
Finding Total and Partial Orders from Data for Seriation
DS '08 Proceedings of the 11th International Conference on Discovery Science
Graph Simultaneous Embedding Tool, GraphSET
Graph Drawing
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The simultaneous consecutive ones problem
Theoretical Computer Science
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Prediction of Contiguous Regions in the Amniote Ancestral Genome
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Discrete Applied Mathematics
Discrete Applied Mathematics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
Reconstruction of Interval Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On the Generalised Character Compatibility Problem for Non-branching Character Trees
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics
Distance paired-domination problems on subclasses of chordal graphs
Theoretical Computer Science
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Discrete Applied Mathematics
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Decomposition of integer matrices and multileaf collimator sequencing
Discrete Applied Mathematics
Discrete Applied Mathematics
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
Information Processing Letters
A simulated annealing algorithm for determining the thickness of a graph
Information Sciences: an International Journal
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Information Processing Letters
Reconstruction of interval graphs
Theoretical Computer Science
On the minimality and decomposability of constraint networks
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Algorithms and complexity for reasoning about time
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Breakpoint distance and PQ-trees
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Finding maximum edge bicliques in convex bipartite graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Inferring social networks from outbreaks
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Information and Computation
Automation and Remote Control
On counting interval lengths of interval graphs
Discrete Applied Mathematics
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Filters for efficient composition of weighted finite-state transducers
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Blocks of hypergraphs: applied to hypergraphs and outerplanarity
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
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
Tractability results for the consecutive-ones property with multiplicity
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Counting the orderings for multisets in consecutive ones property and PQ-trees
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Dominating set counting in graph classes
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Bandwidth of convex bipartite graphs and related graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Consecutive ones property testing: cut or swap
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Gapped permutation patterns for comparative genomics
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Listing chordal graphs and interval graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
GD'05 Proceedings of the 13th international conference on Graph Drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
A new method for efficiently generating planar graph visibility representations
GD'05 Proceedings of the 13th international conference on Graph Drawing
New tools and simpler algorithms for branchwidth
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing common intervals of K permutations, with applications to modular decomposition of graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Complexity and exact algorithms for multicut
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Using PQ trees for comparative genomics
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Additional PC-Tree planarity conditions
GD'04 Proceedings of the 12th international conference on Graph Drawing
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
An O(n2)-time algorithm for the minimal interval completion problem
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Canonical data structure for interval probe graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics
Edge search number of cographs
Discrete Applied Mathematics
Fixed parameter tractability of independent set in segment intersection graphs
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
A PQ framework for reconstructions of common ancestors and phylogeny
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
On planar supports for hypergraphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Bandwidth of convex bipartite graphs and related graphs
Information Processing Letters
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Clone structures in voters' preferences
Proceedings of the 13th ACM Conference on Electronic Commerce
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Backup 2-center on interval graphs
Theoretical Computer Science
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Computer Science Review
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Set covering with almost consecutive ones property
Discrete Optimization
A good submatrix is hard to find
Operations Research Letters
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters
Stable matching with preferences derived from a psychological model
Operations Research Letters
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Information Processing Letters
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Security limitations of using secret sharing for data outsourcing
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Hardness results on the gapped consecutive-ones property problem
Discrete Applied Mathematics
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On the complexity of the max-edge-coloring problem with its variants
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Extending partial representations of function graphs and permutation graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Polynomial time and parameterized approximation algorithms for boxicity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Preserving inversion phylogeny reconstruction
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Machine scheduling with contiguous processing constraints
Information Processing Letters
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
Discrete Applied Mathematics
Computing a minimum outer-connected dominating set for the class of chordal graphs
Information Processing Letters
An O( n2)-time algorithm for the minimal interval completion problem
Theoretical Computer Science
Kemeny elections with bounded single-peaked or single-crossing width
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Graph classes with structured neighborhoods and algorithmic applications
Theoretical Computer Science
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
Crossing-constrained hierarchical drawings
Journal of Discrete Algorithms
Edge-intersection graphs of grid paths: The bend-number
Discrete Applied Mathematics
Recognition of probe proper interval graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |
A data structure called a PQ-tree is introduced. PQ-trees can be used to represent the permutations of a set U in which various subsets of U occur consecutively. Efficient algorithms are presented for manipulating PQ-trees. Algorithms using PQ-trees are then given which test for the consecutive ones property in matrices and for graph planarity. The consecutive ones test is extended to a test for interval graphs using a recently discovered fast recognition algorithm for chordal graphs. All of these algorithms require a number of steps linear in the size of their input.