Sulamita Klein

According to our database, Sulamita Klein authored at least 68 papers between 1997 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

New results on edge-coloring and total-coloring of split graphs.

Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein

Discret. Appl. Math., 2025

2024

On the oriented coloring of the disjoint union of graphs.

Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein

RAIRO Oper. Res., January, 2024

2023

Partitions and well-coveredness: The graph sandwich problem.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Discret. Math., 2023

On the absolute and relative oriented clique problems' time complexity.

Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2020

Maximum cuts in edge-colored graphs.

Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira

Discret. Appl. Math., 2020

Characterizations, probe and sandwich problems on (k, ℓ)-cographs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Discret. Appl. Math., 2020

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

FPT algorithms to recognize well covered graphs.

Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza

Discret. Math. Theor. Comput. Sci., 2019

2018

On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza

Theor. Comput. Sci., 2018

Chordal-(2, 1) graph sandwich problem with boundary conditions.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Electron. Notes Discret. Math., 2018

On the forbidden induced subgraph probe and sandwich problems.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Discret. Appl. Math., 2018

FPT algorithms to recognize well covered graphs.

Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza

CoRR, 2018

2017

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.

Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau

Theory Comput. Syst., 2017

Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.

Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira

Discret. Math. Theor. Comput. Sci., 2017

2016

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Discret. Appl. Math., 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Electron. Notes Discret. Math., 2015

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the forbidden induced subgraph probe problem.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems.

Fernanda Couto, Luérbio Faria, Sulamita Klein

J. Braz. Comput. Soc., 2014

Fixed-parameter algorithms for the cocoloring problem.

Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva

Discret. Appl. Math., 2014

2013

Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23].

Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Theor. Comput. Sci., 2013

Cycle transversals in perfect graphs and cographs.

Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Theor. Comput. Sci., 2013

The Arboreal Jump Number of an Order.

Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter

Order, 2013

Recognizing Well Covered Graphs of Families with Special P 4-Components.

Sulamita Klein, Célia Picinin de Mello, Aurora Morgana

Graphs Comb., 2013

Clique cycle transversals in graphs with few P₄'s.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Discret. Math. Theor. Comput. Sci., 2013

On specifying boundary conditions for the graph sandwich problem.

Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

On (<i>k</i>, ℓ)-Graph Sandwich Problems.

Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Odd Cycle Transversals and Independent Sets in Fullerene Graphs.

Luérbio Faria, Sulamita Klein, Matej Stehlík

SIAM J. Discret. Math., 2012

On clique-colouring of graphs with few P 4's.

Sulamita Klein, Aurora Morgana

J. Braz. Comput. Soc., 2012

Sandwich problems on orientations.

Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, Zoltán Szigeti

J. Braz. Comput. Soc., 2012

Partitioning extended P₄-laden graphs into cliques and stable sets.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio

Inf. Process. Lett., 2012

On the Oriented Chromatic Number of Union of Graphs.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Characterization and recognition of P₄-sparse graphs partitionable into k independent sets and <i>l</i> cliques.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Discret. Appl. Math., 2011

The chain graph sandwich problem.

Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray

Ann. Oper. Res., 2011

Two Fixed-Parameter Algorithms for the Cocoloring Problem.

Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

2K₂ vertex-set partition into nonempty parts.

Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein

Discret. Math., 2010

Advances on the List Stubborn Problem.

Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Proceedings of the Theory of Computing 2010, 2010

2009

Cycle transversals in bounded degree graphs.

Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Electron. Notes Discret. Math., 2009

The Graph Sandwich Problem for P₄-sparse graphs.

Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana

Discret. Math., 2009

2008

2K₂ vertex-set partition into nonempty parts.

Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein

Electron. Notes Discret. Math., 2008

2007

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.

Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan

Theor. Comput. Sci., 2007

2006

Extended skew partition problem.

Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein

Discret. Math., 2006

2005

List matrix partitions of chordal graphs.

Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Theor. Comput. Sci., 2005

The perfection and recognition of bull-reducible Berge graphs.

Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed

RAIRO Theor. Informatics Appl., 2005

Finding H-partitions efficiently.

Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein

RAIRO Theor. Informatics Appl., 2005

A representation for the modular-pairs of a P₄-reducible graph by modular decomposition.

Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2005

Characterizing (k, l)-partitionable Cographs.

Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira

Electron. Notes Discret. Math., 2005

The P₄-sparse Graph Sandwich Problem.

Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana

Electron. Notes Discret. Math., 2005

Packing <i>r</i>-Cliques in Weighted Chordal Graphs.

Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Ann. Oper. Res., 2005

2004

Optimal grid representations.

Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo

Networks, 2004

A representation for the modular-pairs of a cograph by modular decomposition.

Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2004

Graph covers using t-colourable vertex sets.

Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein

Discret. Math., 2004

How is a chordal graph like a supersolvable binary matroid?

Raul Cordovil, David Forge, Sulamita Klein

Discret. Math., 2004

Partitioning chordal graphs into independent sets and cliques.

Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Discret. Appl. Math., 2004

Stable skew partition problem.

Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed

Discret. Appl. Math., 2004

List Partitions of Chordal Graphs.

Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

List Partitions.

Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani

SIAM J. Discret. Math., 2003

A Representation for the Modules of a Graph and applications.

Sulamita Klein, Jayme Luiz Szwarcfiter

J. Braz. Comput. Soc., 2003

2002

The graph sandwich problem for 1-join composition is NP-complete.

Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic

Discret. Appl. Math., 2002

2001

On generalized split graphs.

Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira

Electron. Notes Discret. Math., 2001

Bull-Reducible Berge Graphs are Perfect.

Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed

Electron. Notes Discret. Math., 2001

2000

Finding Skew Partitions Efficiently.

Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed

J. Algorithms, 2000

1999

Complexity of Graph Partition Problems.

Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

The Homogeneous Set Sandwich Problem.

Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein

Inf. Process. Lett., 1998

Maximum Vertex-weighted Matching in Strongly Chordal Graphs.

Manoel B. Campêlo, Sulamita Klein

Discret. Appl. Math., 1998

1997

An Algorithm for Finding Homogeneous Pairs.

Hazel Everett, Sulamita Klein, Bruce A. Reed

Discret. Appl. Math., 1997