Marco Aurelio Stefanes

According to our database1, Marco Aurelio Stefanes authored at least 12 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs.
Theor. Comput. Sci., 2020

Searching and inferring colorful topological motifs in vertex-colored graphs.
J. Comb. Optim., 2020

On motifs in colored graphs.
CoRR, 2020

2019
Heuristics for the Specific Substring Problem with Hamming Distance.
Proceedings of the 19th IEEE International Conference on Bioinformatics and Bioengineering, 2019

2018
A Hybrid Parallel Implementation for the Maximum Flow Problem.
Proceedings of the 26th Euromicro International Conference on Parallel, 2018

Inferring Gene Regulatory Networks Using Hybrid Parallel Computing.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017
Multiple Sequence Alignment using Hybrid Parallel Computing.
Proceedings of the 17th IEEE International Conference on Bioinformatics and Bioengineering, 2017

2015
SIMBio: Searching and inferring colorful motifs in biological networks.
Proceedings of the 15th IEEE International Conference on Bioinformatics and Bioengineering, 2015

2013
Some results on topological colored motifs in metabolic networks.
Proceedings of the 13th IEEE International Conference on BioInformatics and BioEngineering, 2013

2009
Algorithms for Maximum Independent Set in Convex Bipartite Graphs.
Algorithmica, 2009

2008
Repetition-free longest common subsequence.
Electron. Notes Discret. Math., 2008

2003
BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs.
Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 2003


  Loading...