The maximum common edge subgraph problem: A polyhedral investigation L Bahiense, G Manić, B Piva, CC De Souza Discrete Applied Mathematics 160 (18), 2523-2541, 2012 | 53 | 2012 |

Packing triangles in low degree graphs and indifference graphs G Manić, Y Wakabayashi Discrete Mathematics 308 (8), 1455-1471, 2008 | 27 | 2008 |

Approximation algorithms and hardness results for the clique packing problem F Chataigner, G Manić, Y Wakabayashi, R Yuster Discrete Applied Mathematics 157 (7), 1396-1406, 2009 | 21 | 2009 |

A branch&cut algorithm for the maximum common edge subgraph problem G Manić, L Bahiense, C de Souza Electronic Notes in Discrete Mathematics 35, 47-52, 2009 | 9 | 2009 |

Approximation algorithms and hardness results for the clique packing problem F Chataigner, G Manić, Y Wakabayashi, R Yuster Electronic Notes in Discrete Mathematics 29, 397-401, 2007 | 5 | 2007 |

On bichromatic triangle game G Manić, DM Martin, M Stojaković Discrete Applied Mathematics 164, 400-405, 2014 | 3 | 2014 |

Algoritmos Para Fluxo Máximo em Redes BCS Sanches, G Manic Centro de Matemática, Computação e Cognição, Universidade Federal do ABC …, 2008 | 1 | 2008 |

On the Facial Structure of the Common Edge Subgraph polytope. G Manic, L Bahiense, CC de Souza CTW, 62-65, 2008 | | 2008 |

Programação Matemática Turma A1 noturno G Manic | | |

Processamento da Informação-TEORIA-2019.3 G Manic | | |