Yuri Frota - Citegraph

Author Info

Name	Affiliation	Papers
YURI FROTA	Univ Fed Fluminense, Inst Comp, BR-24210240 Niteroi, RJ, Brazil	31
Collaborators	Citations	PageRank
50	105	13.98
Referers	Referees	References
163	668	321

Search Limit

100668

Publications (31 rows)

Collaborators (50 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Integer programming formulations and efficient local search for relaxed correlation clustering	0	0.34	2021
A new approach for the rainbow spanning forest problem	0	0.34	2020
On the exact solution of vehicle routing problems with backhauls.	0	0.34	2020
A note on the rainbow cycle cover problem.	0	0.34	2019
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph.	0	0.34	2019
A study on exponential-size neighborhoods for the bin packing problem with conflicts.	1	0.34	2018
An exact and heuristic approach for the d-minimum branch vertices problem.	0	0.34	2018
An Interference-Aware Virtual Machine Placement Strategy for High Performance Computing Applications in Clouds	0	0.34	2018
A GPU-Based Metaheuristic for Workflow Scheduling on Clouds.	0	0.34	2018
Green Vehicle Routing and Scheduling Problem with Split Delivery.	0	0.34	2018
A hybrid evolutionary algorithm for task scheduling and data assignment of data-intensive scientific workflows on clouds.	4	0.46	2017
Generating Context Acquisition Code using Awareness API.	0	0.34	2017
Evaluating balancing on social networks through the efficient solution of correlation clustering problems.	1	0.36	2017
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems.	0	0.34	2017
Brazilian Congress structural balance analysis.	3	0.41	2016
A Dynamic Cloud Dimensioning Approach for Parallel Scientific Workflows: a Case Study in the Comparative Genomics Domain.	1	0.40	2016
An ILS algorithm to evaluate structural balance in signed social networks	6	0.47	2015
Detecting and Handling Flash-Crowd Events on Cloud Environments.	0	0.34	2015
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.	8	0.54	2014
The maximum balanced subgraph of a signed graph: Applications and solution approaches.	11	0.55	2014
Integer programming approaches for minimum stabbing problems.	0	0.34	2014
Optimization of a Cloud Resource Management Problem from a Consumer Perspective.	5	0.40	2013
Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance.	3	0.39	2013
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph.	3	0.40	2013
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem.	0	0.34	2013
A distributed transportation simplex applied to a Content Distribution Network problem.	0	0.34	2012
New branch-and-bound algorithms for k-cardinality tree problems.	2	0.38	2011
A branch-and-cut algorithm for partition coloring	15	0.89	2010
An Exact Method for the Minimum Caterpillar Spanning Problem	3	0.44	2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives	6	0.58	2009
Cliques, holes and the vertex coloring polytope	33	1.92	2004