A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discovering temporal relations in molecular pathways using protein-protein interactions
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
2-tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics - Special issue: Max-algebra
Partitioned probe comparability graphs
Theoretical Computer Science
A characterization of cycle-free unit probe interval graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
2-Tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics
A polynomial time algorithm for finding linear interval graph patterns
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Characterisations and linear-time recognition of probe cographs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Adjacency matrices of probe interval graphs
Discrete Applied Mathematics
Theoretical Computer Science
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Canonical data structure for interval probe graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Recognition of probe proper interval graphs
Discrete Applied Mathematics
Hi-index | 0.00 |