A survey of graph layout problems
ACM Computing Surveys (CSUR)
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Complexity of (k, l)-Graph Sandwich Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Incomplete Directed Perfect Phylogeny
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A note on finding all homogeneous set sandwiches
Information Processing Letters
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On decision and optimization (k, l)-graph sandwich problems
Discrete Applied Mathematics
The sandwich problem for cutsets: clique cutset, k-star cutset
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
The pair completion algorithm for the homogeneous set sandwich problem
Information Processing Letters
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
Theoretical Computer Science
Partitioned probe comparability graphs
Theoretical Computer Science
Probe Matrix Problems: Totally Balanced Matrices
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Tree Projections: Game Characterization and Computational Aspects
Graph Theory, Computational Intelligence and Thought
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
Information Processing Letters
Clustering with partial information
Theoretical Computer Science
Near-optimal solutions for the generalized max-controlled set problem
Computers and Operations Research
On the complexity of computing treelength
Discrete Applied Mathematics
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science
The polynomial dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics
Probe distance-hereditary graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
The external constraint 4 nonempty part sandwich problem
Discrete Applied Mathematics
Recognition of probe ptolemaic graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On a conjecture about compatibility of multi-states characters
WABI'11 Proceedings of the 11th 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
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Efficient enumeration of the directed binary perfect phylogenies from incomplete data
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
On the complexity of computing treelength
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |