Sulamita Klein

Instituição:

Universidade Federal do Rio de Janeiro

Centro:

Centro de Ciências Matemáticas e da Natureza

Unidade:

Instituto de Matemática

Departamento:

Departamento de Ciência da Computação/I Mat

ORCID:

https://orcid.org/0000-0003-1524-1264


Formação:

  • Université Pierre et Marie Curie

    | Pós-Doutorado | 1999 - 2000

  • Universidade Federal do Rio de Janeiro

    Engenharia de Sistemas e Computação | Doutorado | 1990 - 1994

  • Pontifícia Universidade Católica do Rio de Janeiro

    Analise de Sistemas | Especialização | 1987 - 1988

  • Pontifícia Universidade Católica do Rio de Janeiro

    Matemática | Mestrado | 1972 - 1976

  • Pontifícia Universidade Católica do Rio de Janeiro

    Bacharelado Em Matematica | Graduação | 1969 - 1972
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:

(75.93% artigos com DOI)

Titulo DOI Ano
Partitions and well-coveredness: The graph sandwich problem 10.1016/j.disc.2022.113253 2023
On the absolute and relative oriented clique problems? time complexity 10.1016/j.procs.2023.08.238 2023
Characterizations, probe and sandwich problems on ( k , - ) -cographs 10.1016/j.dam.2020.04.002 2020
Maximum cuts in edge-colored graphs 10.1016/j.dam.2019.02.038 2020
FPT algorithms to recognize well covered graphs 10.23638/DMTCS-21-1-3 2019
On the forbidden induced subgraph probe and sandwich problems 10.1016/j.dam.2016.04.005 2018
On the (parameterized) complexity of recognizing well-covered ( r , - )-graph 10.1016/j.tcs.2018.06.024 2018
Chordal-(2,1) graph sandwich problem with boundary conditions 10.1016/j.endm.2018.07.036 2018
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs 10.23638/DMTCS-19-1-14 2017
Maximum Cuts in Edge-colored Graphs 10.1016/j.endm.2017.10.016 2017
Parameterized Complexity Dichotomy for (r, -)-Vertex Deletion 10.1007/s00224-016-9716-y 2016
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs 10.1016/j.dam.2015.06.023 2016
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs 10.1016/j.endm.2015.07.023 2015
Fixed-parameter algorithms for the cocoloring problem 10.1016/j.dam.2013.11.010 2014
(k,l)-sandwich problems: why not ask for special kinds of bread?. 2014
Chordal- ( k , - )and strongly chordal- ( k , - )graph sandwich problems 10.1186/s13173-014-0016-6 2014
The Arboreal Jump Number of an Order 10.1007/s11083-012-9246-4 2013
Cycle transversals in perfect graphs and cographs 10.1016/j.tcs.2012.10.030 2013
Recognizing Well Covered Graphs of Families with Special P 4-Components 10.1007/s00373-011-1123-1 2013
Clique cycle transversals in graphs with few P4's 2013
Corrigendum to -Cycle transversals in perfect graphs and cographs- [Theoret. Comput. Sci. 469 (2013) 15-23] 10.1016/j.tcs.2013.03.022 2013
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs 10.1016/j.endm.2013.10.030 2013
Sandwich problems on orientations 10.1007/s13173-012-0065-7 2012
Partitioning extended -laden graphs into cliques and stable sets 10.1016/j.ipl.2012.07.011 2012
Odd Cycle Transversals and Independent Sets in Fullerene Graphs 10.1137/120870463 2012
On clique-colouring of graphs with few P 4¿s 10.1007/s13173-011-0053-3 2012
The chain graph sandwich problem 10.1007/s10479-010-0792-0 2011
Characterization and recognition of -sparse graphs partitionable into independent sets and cliques 10.1016/j.dam.2010.10.019 2011
Cycle transversals in bounded degree graphs 2011
vertex-set partition into nonempty parts 10.1016/j.disc.2009.11.030 2010
The Graph Sandwich Problem for -sparse graphs 10.1016/j.disc.2008.01.014 2009
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs 10.1016/j.tcs.2007.04.007 2007
Extended skew partition problem 10.1016/j.disc.2005.12.034 2006
The perfection and recognition of bull-reducible Berge graphs 10.1051/ita:2005009 2005
Finding H -partitions efficiently 10.1051/ita:2005008 2005
Packing r-Cliques in Weighted Chordal Graphs 10.1007/s10479-005-2452-3 2005
List matrix partitions of chordal graphs 10.1016/j.tcs.2005.09.030 2005
Graph covers using t-colourable vertex sets 2004
Partitioning chordal graphs into independent sets and cliques 10.1016/s0166-218x(03)00371-8 2004
Stable skew partition problem 10.1016/j.dam.2004.01.001 2004
Optimal grid representations 10.1002/net.20032 2004
How is a chordal graph like a supersolvable binary matroid? 10.1016/j.disc.2004.08.004 2004
List Partitions 10.1137/s0895480100384055 2003
A representation for the modules of a graph and applications 10.1590/s0104-65002003000200002 2003
The graph sandwich problem for 1-join composition is NP-complete 2002
Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques 2002
Finding Skew Partitions Efficiently 10.1006/jagm.1999.1122 2000
The Homogeneous Set Sandwich Problem 1998
Maximum Vertex-Weighted Matching in Strongly Chordal Graphs 1998
AN OPTIMAL ALGORITHM FOR FINDING CLIQUE-CROSS PARTITIONS 1998
An Algorithm for Finding Homogeneous Pairs 1997
THE NP-COMPLETENESS OF MULTIPARTITE CUTSET TESTING 1996
Sobre a Complexidade do problema Corte multipartido Completo 1994
Ordens Indiferenca 1993
Eventos:

(1.00% eventos com DOI)

Titulo DOI Ano
A complexidade do número cromático orientado para subgrafos de grades. 2022
O Problema do Número Clique Orientado Absoluto é NP-completo. 2022
The time complexity of oriented chromatic number for subgraphs of grids 2022
O Número Cromático Total de Grafos Split 2-admissíveis 2022
Providing a new approach to the study of split edge coloring classification problem 2022
On the Oriented Coloring of the Disjoint Union of Graphs. 2021
Graph sandwich problem for the property of being well-covered and partitionable into k independent sets and l cliques. 2020
Structural characterizations for polynomially-time recognizable (r, l)-well covered graphs 2018
O problema probe particionado split bem-coberto é polinomial 2018
Caracterização estrutural de grafos-(1, 2) bem-cobertos 2018
Grafos Half-Cut 2017
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs 2016
Well-covered split graph characterization 2016
Frustração de Arestas em (3,6)-Fullerenes 2016
On Colored Edge Cuts in Graphs 2016
(3,4,6)-Fullerenes graphs 2016
On the (Parameterized) Complexity of Recognizing Well-Covered (r,ℓ)-graphs. 2016
Sobre Cortes em Grafos Aresta-Coloridos 2016
Frustração de Arestas e Conjuntos Independentes de (3,6)-Fullerenes 2016
Grafos Split Bem Cobertos 2016
On Maximum Colored Cuts in Edge Colored Graphs 2016
Cograph-(k,l) graph sandwich problem. 2015
Chordal-(2,1) graph sandwich problem with boundary conditions 2014
Chordal-(k,l) and Strongly Chordal(k,l) Graph Sandwich Problem 2014
A complexidade do problema sanduíche para grafos fortemente cordais-(k,l) e cordais- (k,l) 2014
Approximation algorithms for simple maxcut of split graphs 2014
Appoximative algorithms for the maxcut of chordal graphs 2014
Complexity of the oriented coloring in planar, cubic, oriented graphs 2014
Diameter of a symmetric icosahedral fullerene graph 2014
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3 2013
On specifying boundary conditions for the graph sandwich problems 2013
On (k,l) graph sandwich problems 2013
A Complexidade do Problema do Corte Máximo para Grafos Fortemente Cordais 2013
Coloração Orientada de grafos com grau máximo 3 2013
On the Oriented Chromatic Number of Union og Graphs 2012
A complexidade do Problema Sanduiche para grafos fortemente cordais-(2,1) 2012
A clique-forest partition of extended P_4-laden graphs 2012
(k,l)-Sandwich Problem: Why not ask for special kinds of bread? 2012
Arboreal Jump Number of an Order 2012
Clique-forest partitions of P_4-tidy graphs 2012
Uma caracterização dos grafos com número cromático orientado 3 e sobre o número cromático orientado de união de grafos 2011
Uma generalização do conceito de saltos em ordens parciais 2011
Two Fixed-Parameter algorithms for the cocoloring problem 2011
Partição dos grafos P4-laden em conjuntos independentes e cliques 2011
Advances on the List Stubborn Problem 2010
Characterization and recognition of P_4-sparse graphs partitionable into k independent sets and l cliques 2010
Partição dos grafos P4-tidy em conjuntos independentes e cliques 2010
Sparse/dense triangle transversals 2010
Cycle Transversals 2009
Caracterização e reconhecimento dos cografos-(k,l) 2009
Número arbóreo de saltos de uma ordem parcial 2009
Cycle-transversals in bounded degree graphs 2009
(k,l)-P_4-sparse graphs (poster) 2009
Forest-clique partitions of cographs 2008
Partição Floresta-Clique de Cografos 2008
Forbidden configurations for (k,l)-cographs 2008
Well covered graphs with few P4´s 2008
2K2 vertex-set partition into nonemptyparts 2008
Computing minimum H-transversals of some special classes of graphs 2007
Finding small transversals in some classes of graphs 2007
Colouring the maximal cliques of graphs with few P4´s 2007
The (k,l)-Cograph Partition Problem 2006
On clique-colouring of graphs 2006
Metaheuristics applied to the Cluster Editing Problem for weighted graphs 2006
Uma representação para pares-modulares de grafos P4-redutíveis 2005
Obstruções de cografos-(k,l) 2005
A representation for the modular-pairs of a P4-reducible graph 2005
The P4-sparse Graph Sandwich Problem 2005
Characterizing (k,l)-partitionable Cographs 2005
List Partitions of Chordal Graphs 2004
Generalized Skew Partitions 2004
A representation for the modular pairs of a cograph by modular decomposition 2004
On b-perfect graphs 2004
Chordal graph extensions 2003
The stable Skew partition problem 2003
Extensao-(0,L) e (1,L) de Grafos Cordais 2003
On H-Partition Problems 2003
Uma Representação para Pares Modulares de um Grafo 2003
Finding Independent K'rs in Chordal Graphs 2002
Independent K_r's in Chordal graphs 2002
Modelagem de Teias Alimentares por Grafos de Competicao: Novos resultados 2002
Particionamento de grafos cordais em conjuntos independentes e cliques 2001
Minimizacao de Modelos de Grafos 2-Dir Puros 2001
Bull-reducible graphs are perfect 2001
On generalized split graphs 2001
Finding Skew Partitions Efficiently 2000
The graph sandwich problem for 1-join composition is NP-complete 2000
Complexity of graph partition problems 10.1145/301250.301373 1999
Caracterizacao e Reconhecimento de Grafos Cordais-(2,1) 1999
Complexity of graph partition problems 1999
Two graph Composition Sandwich Problems 1998
Algorithms for Homogeneous Sets of Graphs 1998
Uma Nota sobre Centro de Grafos e Grafos Bem-Cobertos 1997
Emparelhamento com Peso de Vertices Maximos em Grafos Fortemente Cordais 1997
Algumas Questoes sobre Grafos Cordais Bem-Cobertos 1997
The Homogeneous Set sandwich Problem 1996
An Algorithm for Finding Clique -Cross Partitions 1994
An Algorithm for Finding Homogeneous Pairs 1994
Sobre a Complexidade do Problema Corte Multipartido Completo 1994
Maximal Cliques in Split indifference Graphs 1993
Publicações:
Minha Rede: