default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSulamita Klein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j57]Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein:
New results on edge-coloring and total-coloring of split graphs. Discret. Appl. Math. 360: 297-306 (2025)- 2023
- [j56]Sancrey Rodrigues Alves, Fernanda Couto
, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza:
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346(3): 113253 (2023) - [i9]Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein:
New Results on Edge-coloring and Total-coloring of Split Graphs. CoRR abs/2303.05723 (2023) - 2021
- [c11]Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein:
On the Oriented Coloring of the Disjoint Union of Graphs. IWOCA 2021: 194-207 - 2020
- [j55]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos:
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. Discret. Appl. Math. 281: 118-133 (2020) - [j54]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281: 229-234 (2020) - [c10]Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza:
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN 2020: 587-599
2010 – 2019
- 2019
- [j53]Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza:
FPT algorithms to recognize well covered graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - 2018
- [j52]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe and sandwich problems. Discret. Appl. Math. 234: 56-66 (2018) - [j51]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69: 277-284 (2018) - [j50]Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. Theor. Comput. Sci. 746: 36-48 (2018) - [i8]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. CoRR abs/1805.00858 (2018) - [i7]Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza:
FPT algorithms to recognize well covered graphs. CoRR abs/1810.08276 (2018) - 2017
- [j49]Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira:
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j48]Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62: 87-92 (2017) - [j47]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61(3): 777-794 (2017) - [i6]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR abs/1705.09177 (2017) - 2016
- [j46]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198: 109-117 (2016) - [c9]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza:
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437 - 2015
- [j45]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos:
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. Electron. Notes Discret. Math. 50: 133-138 (2015) - [c8]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos:
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. WG 2015: 312-324 - [i5]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe problem. CTW 2015: 231-234 - [i4]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR abs/1504.05515 (2015) - [i3]Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira:
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. CoRR abs/1512.05223 (2015) - 2014
- [j44]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva:
Fixed-parameter algorithms for the cocoloring problem. Discret. Appl. Math. 167: 52-60 (2014) - [j43]Fernanda Couto, Luérbio Faria, Sulamita Klein:
Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems. J. Braz. Comput. Soc. 20(1): 19:1-19:10 (2014) - 2013
- [j42]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Clique cycle transversals in graphs with few P4's. Discret. Math. Theor. Comput. Sci. 15(3): 13-20 (2013) - [j41]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Electron. Notes Discret. Math. 44: 195-200 (2013) - [j40]Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
Recognizing Well Covered Graphs of Families with Special P 4-Components. Graphs Comb. 29(3): 553-567 (2013) - [j39]Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter:
The Arboreal Jump Number of an Order. Order 30(1): 339-350 (2013) - [j38]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. 469: 15-23 (2013) - [j37]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. 487: 103-105 (2013) - [c7]Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On (k, ℓ)-Graph Sandwich Problems. FAW-AAIM 2013: 187-197 - [i2]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58 - [i1]Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66 - 2012
- [j36]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio:
Partitioning extended P4-laden graphs into cliques and stable sets. Inf. Process. Lett. 112(21): 829-834 (2012) - [j35]Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, Zoltán Szigeti:
Sandwich problems on orientations. J. Braz. Comput. Soc. 18(2): 85-93 (2012) - [j34]Sulamita Klein, Aurora Morgana:
On clique-colouring of graphs with few P 4's. J. Braz. Comput. Soc. 18(2): 113-119 (2012) - [j33]Luérbio Faria, Sulamita Klein, Matej Stehlík:
Odd Cycle Transversals and Independent Sets in Fullerene Graphs. SIAM J. Discret. Math. 26(3): 1458-1469 (2012) - [c6]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the Oriented Chromatic Number of Union of Graphs. CTW 2012: 88-91 - 2011
- [j32]Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray:
The chain graph sandwich problem. Ann. Oper. Res. 188(1): 133-139 (2011) - [j31]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques. Discret. Appl. Math. 159(4): 165-173 (2011) - [j30]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Discret. Math. Theor. Comput. Sci. 13(1): 45-66 (2011) - [c5]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva:
Two Fixed-Parameter Algorithms for the Cocoloring Problem. ISAAC 2011: 634-642 - 2010
- [j29]Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Discret. Math. 310(6-7): 1259-1264 (2010) - [c4]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Advances on the List Stubborn Problem. CATS 2010: 65-70
2000 – 2009
- 2009
- [j28]Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The Graph Sandwich Problem for P4-sparse graphs. Discret. Math. 309(11): 3664-3673 (2009) - [j27]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35: 189-195 (2009) - 2008
- [j26]Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30: 291-296 (2008) - 2007
- [j25]Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan:
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theor. Comput. Sci. 381(1-3): 57-67 (2007) - 2006
- [j24]Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Extended skew partition problem. Discret. Math. 306(19-20): 2438-2449 (2006) - 2005
- [j23]Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Packing r-Cliques in Weighted Chordal Graphs. Ann. Oper. Res. 138(1): 179-187 (2005) - [j22]Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The P4-sparse Graph Sandwich Problem. Electron. Notes Discret. Math. 22: 185-188 (2005) - [j21]Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a P4-reducible graph by modular decomposition. Electron. Notes Discret. Math. 22: 267-270 (2005) - [j20]Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira:
Characterizing (k, l)-partitionable Cographs. Electron. Notes Discret. Math. 22: 277-280 (2005) - [j19]Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Finding H-partitions efficiently. RAIRO Theor. Informatics Appl. 39(1): 133-144 (2005) - [j18]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39(1): 145-160 (2005) - [j17]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List matrix partitions of chordal graphs. Theor. Comput. Sci. 349(1): 52-66 (2005) - 2004
- [j16]Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Partitioning chordal graphs into independent sets and cliques. Discret. Appl. Math. 141(1-3): 185-194 (2004) - [j15]Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed:
Stable skew partition problem. Discret. Appl. Math. 143(1-3): 17-22 (2004) - [j14]Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein:
Graph covers using t-colourable vertex sets. Discret. Math. 278(1-3): 61-80 (2004) - [j13]Raul Cordovil, David Forge, Sulamita Klein:
How is a chordal graph like a supersolvable binary matroid? Discret. Math. 288(1-3): 167-172 (2004) - [j12]Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a cograph by modular decomposition. Electron. Notes Discret. Math. 18: 165-169 (2004) - [j11]Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo:
Optimal grid representations. Networks 44(3): 187-193 (2004) - [c3]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108 - 2003
- [j10]Sulamita Klein, Jayme Luiz Szwarcfiter:
A Representation for the Modules of a Graph and applications. J. Braz. Comput. Soc. 9(1): 9-16 (2003) - [j9]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
List Partitions. SIAM J. Discret. Math. 16(3): 449-478 (2003) - 2002
- [j8]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Discret. Appl. Math. 121(1-3): 73-82 (2002) - 2001
- [j7]Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. Electron. Notes Discret. Math. 7: 98-101 (2001) - [j6]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10: 93-95 (2001) - 2000
- [j5]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Electron. Notes Discret. Math. 5: 89-92 (2000) - [j4]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000) - [c2]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. LATIN 2000: 163-172
1990 – 1999
- 1999
- [c1]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
Complexity of Graph Partition Problems. STOC 1999: 464-472 - 1998
- [j3]Manoel B. Campêlo, Sulamita Klein:
Maximum Vertex-weighted Matching in Strongly Chordal Graphs. Discret. Appl. Math. 84(1-3): 71-77 (1998) - [j2]Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein:
The Homogeneous Set Sandwich Problem. Inf. Process. Lett. 67(1): 31-35 (1998) - 1997
- [j1]Hazel Everett, Sulamita Klein, Bruce A. Reed:
An Algorithm for Finding Homogeneous Pairs. Discret. Appl. Math. 72(3): 209-218 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
