Alexandre S. Freire Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma: An integer linear programming approach for bilinear integer programming. Oper. Res. Lett. 40(2): 74-77 (2012)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi, C. E. Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot: Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177
2011
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. E. Ferreira, Alexandre S. Freire, G. A. Puglia: A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics 37: 147-152 (2011)
2010
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vicente Acuña, C. E. Ferreira, Alexandre S. Freire, Eduardo Moreno: The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electronic Notes in Discrete Mathematics 36: 159-166 (2010)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexandre S. Freire, R. M. Cesar Jr., C. E. Ferreira: A Column Generation Approach for the Graph Matching Problem. ICPR 2010: 1088-1091

Coauthor Index

1Vicente Acuña
[c2] [j1]
2R. M. Cesar Jr.
[c1]
3Pierluigi Crescenzi (Pilu Crescenzi)
[c2]
4C. E. Ferreira
[c2] [j2] [j1] [c1]
5Vincent Lacroix
[c2]
6Paulo Vieira Milreu
[c2]
7Eduardo Moreno
[j3] [c2] [j1]
8G. A. Puglia
[j2]
9Marie-France Sagot
[c2]
10Juan Pablo Vielma
[j3]
Last update Tue May 21 15:29:29 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page