default search action
Loana Tito Nogueira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j18]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
:
A general framework for path convexities. J. Comb. Optim. 43(5): 994-1009 (2022) - 2016
- [j17]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira
Clique cycle-transversals in distance-hereditary graphs. Discret. Appl. Math. 210: 38-44 (2016) - 2013
- [j16]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) - [j15]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira
Clique cycle transversals in distance-hereditary graphs. Electron. Notes Discret. Math. 44: 15-21 (2013) - [j14]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira
Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. 469: 15-23 (2013) - [j13]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. 487: 103-105 (2013) - 2012
- [j12]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira
Partitioning extended P4-laden graphs into cliques and stable sets. Inf. Process. Lett. 112(21): 829-834 (2012) - 2011
- [j11]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques. Discret. Appl. Math. 159(4): 165-173 (2011) - [j10]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) - 2009
- [j9]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35: 189-195 (2009) - 2007
- [j8]Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira
A note on the size of minimal covers. Inf. Process. Lett. 102(2-3): 124-126 (2007) - 2005
- [j7]Pavol Hell, Sulamita Klein, Loana Tito Nogueira
Packing r-Cliques in Weighted Chordal Graphs. Ann. Oper. Res. 138(1): 179-187 (2005) - [j6]Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira
Characterizing (k, l)-partitionable Cographs. Electron. Notes Discret. Math. 22: 277-280 (2005) - [j5]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira
List matrix partitions of chordal graphs. Theor. Comput. Sci. 349(1): 52-66 (2005) - 2004
- [j4]Pavol Hell, Sulamita Klein, Loana Tito Nogueira
Partitioning chordal graphs into independent sets and cliques. Discret. Appl. Math. 141(1-3): 185-194 (2004) - [j3]Eduardo Sany Laber, Loana Tito Nogueira
On the hardness of the minimum height decision tree problem. Discret. Appl. Math. 144(1-2): 209-212 (2004) - 2001
- [j2]Eduardo Sany Laber, Loana Tito Nogueira:
Fast Searching in Trees. Electron. Notes Discret. Math. 7: 90-93 (2001) - [j1]Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. Electron. Notes Discret. Math. 7: 98-101 (2001)
Conference and Workshop Papers
- 2024
- [c5]Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza
Induced Tree Covering and the Generalized Yutsis Property. LATIN (2) 2024: 147-161 - 2019
- [c4]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
A General Framework for Path Convexities. AAIM 2019: 272-283 - 2013
- [c3]Fernanda Couto
On (k, ℓ)-Graph Sandwich Problems. FAW-AAIM 2013: 187-197 - 2010
- [c2]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 - 2004
- [c1]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108
Parts in Books or Collections
- 2013
- [p1]Pedro Nucci, Loana Tito Nogueira
Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees. Distance Geometry 2013: 161-176
Editorship
- 2008
- [e1]Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Lecture Notes in Computer Science 4957, Springer 2008, ISBN 978-3-540-78772-3 [contents]
Informal and Other Publications
- 2017
- [i3]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A general framework for path convexities. CoRR abs/1702.06112 (2017) - 2013
- [i2]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 - [i1]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle-transversals in distance-hereditary graphs. CoRR abs/1302.1402 (2013)
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-04-25 05:57 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: