Candido Ferreira Xavier de Mendonça Neto
According to our database1, Candido Ferreira Xavier de Mendonça Neto authored at least 16 papers between 1995 and 2017.
Legend:Book In proceedings Article PhD thesis Other
Solving a Large Real-world Bus Driver Scheduling Problem with a Multi-assignment based Heuristic Algorithm.
J. UCS, 2017
Combining Heuristic and Utility Function for Fair Train Crew Rostering.
Proceedings of the ICEIS 2015, 2015
A heuristic algorithm based on multi-assignment procedures for nurse scheduling.
Annals OR, 2014
Skewness, splitting number and vertex deletion of some toroidal meshes.
Ars Comb., 2009
On maximum planar induced subgraphs.
Discret. Appl. Math., 2006
The non planar vertex deletion of Cn x Cm.
Ars Comb., 2005
The splitting number and skewness of Cn x Cm.
Ars Comb., 2002
On the complexity of the approximation of nonplanarity parameters for cubic graphs.
Electron. Notes Discret. Math., 2001
SPLITTING NUMBER is NP-complete.
Discret. Appl. Math., 2001
Visualization of Three-Dimensional Maps.
Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000
A Multi-agent Approach using A-Teams for Graph Drawing.
Proceedings of the ISCA 9th International Conference on Intelligent Systems, 2000
Heuristics and pedigrees for drawing directed graphs.
J. Braz. Comp. Soc., 1999
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
The Splitting Number of the 4-Cube.
Proceedings of the LATIN '98: Theoretical Informatics, 1998
Automatic Visualization of Two-Dimensional Cellular Complexes.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996
Vertex Splitting and Tension-Free Layout
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995