Sulamita Klein

84 papers A* 1B 5C 8Journal 68Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Filling some gaps on the edge coloring problem of split graphs.
Discret. Appl. Math.
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
2025 J jnl
New results on edge-coloring and total-coloring of split graphs.
Discret. Appl. Math.
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
2025 J jnl
On the absolute and relative oriented clique problems' time complexity.
Discret. Appl. Math.
Erika M. M. Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein
2025 C conf
The oriented chromatic number of a wheel and of the disjoint union of a wheel with a complete graph.
LAGOS
Erika M. M. Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein
2024 J jnl
Canonical cuts of path powers.
Contributions Discret. Math.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez, Sulamita Klein, Uéverton S. Souza, Rubens Sucupira
2024 J jnl
Filling some gaps on the edge coloring problem of split graphs.
CoRR
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
2024 J jnl
On the oriented coloring of the disjoint union of graphs.
RAIRO Oper. Res.
Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein
2023 J jnl
New Results on Edge-coloring and Total-coloring of Split Graphs.
CoRR
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
2023 C conf
On the absolute and relative oriented clique problems' time complexity.
LAGOS
Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein
2023 J jnl
Partitions and well-coveredness: The graph sandwich problem.
Discret. Math.
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
2021 C conf
On the Oriented Coloring of the Disjoint Union of Graphs.
IWOCA
Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein
2020 J jnl
Characterizations, probe and sandwich problems on (k, ℓ)-cographs.
Discret. Appl. Math.
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
2020 B conf
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.
LATIN
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
2020 J jnl
Maximum cuts in edge-colored graphs.
Discret. Appl. Math.
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2019 J jnl
FPT algorithms to recognize well covered graphs.
Discret. Math. Theor. Comput. Sci.
Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
2018 J jnl
Chordal-(2, 1) graph sandwich problem with boundary conditions.
Electron. Notes Discret. Math.
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2018 J jnl
FPT algorithms to recognize well covered graphs.
CoRR
Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
2018 J jnl
Maximum cuts in edge-colored graphs.
CoRR
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2018 J jnl
On the (parameterized) complexity of recognizing well-covered (
Theor. Comput. Sci.
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2018 J jnl
On the forbidden induced subgraph probe and sandwich problems.
Discret. Appl. Math.
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2017 J jnl
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Discret. Math. Theor. Comput. Sci.
Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
2017 J jnl
Maximum Cuts in Edge-colored Graphs.
Electron. Notes Discret. Math.
Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017 J jnl
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.
CoRR
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017 J jnl
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.
Theory Comput. Syst.
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2016 C conf
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
COCOA
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza
2016 J jnl
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
Discret. Appl. Math.
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2015 J jnl
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
CoRR
Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
2015 B conf
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
WG
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
2015 C conf
On the forbidden induced subgraph probe problem.
CTW
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2015 J jnl
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion.
CoRR
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2015 J jnl
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
Electron. Notes Discret. Math.
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
2014 J jnl
Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems.
J. Braz. Comput. Soc.
Fernanda Couto, Luérbio Faria, Sulamita Klein
2014 J jnl
Fixed-parameter algorithms for the cocoloring problem.
Discret. Appl. Math.
Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva
2013 C conf
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.
CTW
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2013 J jnl
Clique cycle transversals in graphs with few P
Discret. Math. Theor. Comput. Sci.
Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013 J jnl
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23].
Theor. Comput. Sci.
Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013 J jnl
Cycle transversals in perfect graphs and cographs.
Theor. Comput. Sci.
Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013 — conf
On (
FAW-AAIM
Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira
2013 C conf
On specifying boundary conditions for the graph sandwich problem.
CTW
Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013 J jnl
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
Electron. Notes Discret. Math.
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2013 J jnl
Recognizing Well Covered Graphs of Families with Special P 4-Components.
Graphs Comb.
Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
2013 J jnl
The Arboreal Jump Number of an Order.
Order
Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter
2012 J jnl
Odd Cycle Transversals and Independent Sets in Fullerene Graphs.
SIAM J. Discret. Math.
Luérbio Faria, Sulamita Klein, Matej Stehlík
2012 J jnl
On clique-colouring of graphs with few P 4's.
J. Braz. Comput. Soc.
Sulamita Klein, Aurora Morgana
2012 C conf
On the Oriented Chromatic Number of Union of Graphs.
CTW
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
2012 J jnl
Partitioning extended P
Inf. Process. Lett.
Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio
2012 J jnl
Sandwich problems on orientations.
J. Braz. Comput. Soc.
Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, Zoltán Szigeti
2011 J jnl
Characterization and recognition of P
Discret. Appl. Math.
Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2011 J jnl
Cycle transversals in bounded degree graphs.
Discret. Math. Theor. Comput. Sci.
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2011 J jnl
The chain graph sandwich problem.
Ann. Oper. Res.
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
2011 B conf
Two Fixed-Parameter Algorithms for the Cocoloring Problem.
ISAAC
Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva
2010 J jnl
2K
Discret. Math.
Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
2010 — conf
Advances on the List Stubborn Problem.
CATS
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2009 J jnl
Cycle transversals in bounded degree graphs.
Electron. Notes Discret. Math.
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2009 J jnl
The Graph Sandwich Problem for P
Discret. Math.
Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
2008 J jnl
2K
Electron. Notes Discret. Math.
Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
2007 J jnl
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci.
Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan
2006 J jnl
Extended skew partition problem.
Discret. Math.
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
2005 J jnl
A representation for the modular-pairs of a P
Electron. Notes Discret. Math.
Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter
2005 J jnl
Characterizing (k, l)-partitionable Cographs.
Electron. Notes Discret. Math.
Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira
2005 J jnl
Finding H-partitions efficiently.
RAIRO Theor. Informatics Appl.
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
2005 J jnl
List matrix partitions of chordal graphs.
Theor. Comput. Sci.
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005 J jnl
Packing
Ann. Oper. Res.
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005 J jnl
The P
Electron. Notes Discret. Math.
Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
2005 J jnl
The perfection and recognition of bull-reducible Berge graphs.
RAIRO Theor. Informatics Appl.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2004 J jnl
A representation for the modular-pairs of a cograph by modular decomposition.
Electron. Notes Discret. Math.
Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter
2004 J jnl
Graph covers using t-colourable vertex sets.
Discret. Math.
Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein
2004 J jnl
How is a chordal graph like a supersolvable binary matroid?
Discret. Math.
Raul Cordovil, David Forge, Sulamita Klein
2004 B conf
List Partitions of Chordal Graphs.
LATIN
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2004 J jnl
Optimal grid representations.
Networks
Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo
2004 J jnl
Partitioning chordal graphs into independent sets and cliques.
Discret. Appl. Math.
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2004 J jnl
Stable skew partition problem.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2003 J jnl
A Representation for the Modules of a Graph and applications.
J. Braz. Comput. Soc.
Sulamita Klein, Jayme Luiz Szwarcfiter
2003 J jnl
List Partitions.
SIAM J. Discret. Math.
Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
2002 J jnl
The graph sandwich problem for 1-join composition is NP-complete.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic
2001 J jnl
Bull-Reducible Berge Graphs are Perfect.
Electron. Notes Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2001 J jnl
On generalized split graphs.
Electron. Notes Discret. Math.
Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira
2000 B conf
Finding Skew Partitions Efficiently.
LATIN
Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000 J jnl
Finding Skew Partitions Efficiently.
J. Algorithms
Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000 J jnl
The graph sandwich problem for 1-join composition is NP-complete.
Electron. Notes Discret. Math.
Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic
1999 A* conf
Complexity of Graph Partition Problems.
STOC
Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
1998 J jnl
Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
Discret. Appl. Math.
Manoel B. Campêlo, Sulamita Klein
1998 J jnl
The Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein
1997 J jnl
An Algorithm for Finding Homogeneous Pairs.
Discret. Appl. Math.
Hazel Everett, Sulamita Klein, Bruce A. Reed