Letícia Rodrigues Bueno

Orcid: 0000-0003-3995-3004

According to our database1, Letícia Rodrigues Bueno authored at least 9 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Data Structures for Direct Spanning Tree Representations in Mutation-Based Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2020

2018
On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett., 2018

2016
A note on the middle levels problem.
Discret. Appl. Math., 2016

2015
Hamiltonian cycles in unitary prefix transposition rearrangement graphs.
Discret. Appl. Math., 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On Hamiltonian Cycles in Kneser Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2011
On hamiltonian cycles in the prism over the odd graphs.
J. Graph Theory, 2011

Hamiltonian Cycles in Kneser Graphs for n=2k+2.
Electron. Notes Discret. Math., 2011


  Loading...