Loana Tito Nogueira

According to our database, Loana Tito Nogueira authored at least 22 papers between 2001 and 2024.

Collaborative distances:

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

2024

Induced Tree Covering and the Generalized Yutsis Property.

Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2022

A general framework for path convexities.

João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza

J. Comb. Optim., 2022

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

Clique cycle transversals in distance-hereditary graphs.

Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti

Electron. Notes Discret. Math., 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

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

Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees.

Pedro Nucci, Loana Tito Nogueira, Carlile Lavor

Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

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

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

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

2007

A note on the size of minimal covers.

Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira

Inf. Process. Lett., 2007

2005

List matrix partitions of chordal graphs.

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

Theor. Comput. Sci., 2005

Characterizing (k, l)-partitionable Cographs.

Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira

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

On the hardness of the minimum height decision tree problem.

Eduardo Sany Laber, Loana Tito Nogueira

Discret. Appl. Math., 2004

Partitioning chordal graphs into independent sets and cliques.

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

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

2001

Fast Searching in Trees.

Eduardo Sany Laber, Loana Tito Nogueira

Electron. Notes Discret. Math., 2001

On generalized split graphs.

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

Electron. Notes Discret. Math., 2001