The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
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
A note on finding all homogeneous set sandwiches
Information Processing Letters
On decision and optimization (k, l)-graph sandwich problems
Discrete Applied Mathematics
Note on the homogeneous set sandwich problem
Information Processing Letters
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
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
Theoretical Computer Science
Note on the Homogeneous Set Sandwich Problem
Information Processing Letters
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
Information Processing Letters
The polynomial dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics
Complexity issues for the sandwich homogeneous set problem
Discrete Applied Mathematics
The external constraint 4 nonempty part sandwich problem
Discrete Applied Mathematics
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
| Hi-index | 0.89 |