List partitions T Feder, P Hell, S Klein, R Motwani SIAM Journal on Discrete Mathematics 16 (3), 449-478, 2003 | 185 | 2003 |

Complexity of graph partition problems T Feder, P Hell, S Klein, R Motwani Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 149 | 1999 |

Partitioning chordal graphs into independent sets and cliques P Hell, S Klein, LT Nogueira, F Protti Discrete Applied Mathematics 141 (1-3), 185-194, 2004 | 102 | 2004 |

Finding skew partitions efficiently CMH de Figueiredo, S Klein, Y Kohayakawa, BA Reed Journal of Algorithms 37 (2), 505-521, 2000 | 74 | 2000 |

The homogeneous set sandwich problem MR Cerioli, H Everett, CMH de Figueiredo, S Klein Information Processing Letters 67 (1), 31-35, 1998 | 58 | 1998 |

List matrix partitions of chordal graphs T Feder, P Hell, S Klein, LT Nogueira, F Protti Theoretical Computer Science 349 (1), 52-66, 2005 | 55 | 2005 |

The NP-completeness of multi-partite cutset testing S Klein, CMH De Figueiredo Congressus Numerantium, 217-222, 1996 | 50 | 1996 |

The graph sandwich problem for 1-join composition is NP-complete CMH de Figueiredo, S Klein, K Vušković Discrete applied mathematics 121 (1-3), 73-82, 2002 | 38 | 2002 |

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs CMH de Figueiredo, L Faria, S Klein, R Sritharan Theoretical Computer Science 381 (1-3), 57-67, 2007 | 34 | 2007 |

Finding H-partitions efficiently S Dantas, CMH de Figueiredo, S Gravier, S Klein RAIRO-Theoretical Informatics and Applications 39 (1), 133-144, 2005 | 34 | 2005 |

Characterization and recognition of P4-sparse graphs partitionable into k independent sets and ℓ cliques RSF Bravo, S Klein, LT Nogueira, F Protti Discrete Applied Mathematics 159 (4), 165-173, 2011 | 30 | 2011 |

Characterizing (k, l)–partitionable Cographs R de Souza Francisco, S Klein, LT Nogueira Electronic Notes in Discrete Mathematics 22, 277-280, 2005 | 29 | 2005 |

An algorithm for finding homogeneous pairs H Everett, S Klein, B Reed Discrete Applied Mathematics 72 (3), 209-218, 1997 | 25 | 1997 |

Odd cycle transversals and independent sets in fullerene graphs L Faria, S Klein, M Stehlik SIAM Journal on Discrete Mathematics 26 (3), 1458-1469, 2012 | 22 | 2012 |

The graph sandwich problem for P4-sparse graphs S Dantas, S Klein, CP De Mello, A Morgana Discrete Mathematics 309 (11), 3664-3673, 2009 | 21 | 2009 |

An optimal algorithm for finding clique-cross partitions H Everett, S Klein, B Reed Congressus Numerantium, 171-178, 1998 | 18 | 1998 |

Cycle transversals in perfect graphs and cographs A Brandstädt, S Brito, S Klein, LT Nogueira, F Protti Theoretical Computer Science 469, 15-23, 2013 | 16 | 2013 |

Packing *r*-Cliques in Weighted Chordal GraphsP Hell, S Klein, LT Nogueira, F Protti Annals of Operations Research 138, 179-187, 2005 | 16 | 2005 |

On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph SR Alves, KK Dabrowski, L Faria, S Klein, I Sau, US Souza Theoretical Computer Science 746, 36-48, 2018 | 14 | 2018 |

On generalized split graphs P Hell, S Klein, F Protti, L Tito Electronic Notes in Discrete Mathematics 7, 98-101, 2001 | 13 | 2001 |