dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marco Budinich Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich: On Computational Complexity of Clifford Algebra CoRR abs/0904.0417: (2009)
2006
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich, Paolo Budinich: A Spinorial Formulation of the Maximum Clique Problem of a Graph CoRR abs/math-ph/0603068: (2006)
2003
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich: Exact Bounds on the Order of the Maximum Clique of a Graph. Discrete Applied Mathematics 127(3): 535-543 (2003)
2002
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLImmanuel M. Bomze, Marco Budinich, Marcello Pelillo, Claudio Rossi: Annealed replication: a new heuristic for the maximum clique problem. Discrete Applied Mathematics 121(1-3): 27-49 (2002)
1999
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich, Renato Frison: Adaptive Calibration of Imaging Array Detectors. Neural Computation 11(6): 1281-1296 (1999)
1996
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich: A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Computation 8(2): 416-424 (1996)
1995
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Budinich: Sorting with self-organizing maps. Neural Computation 7(6): 1188-1190 (1995)

Coauthor Index

1Immanuel M. Bomze [4]
2Paolo Budinich [6]
3Renato Frison [3]
4Marcello Pelillo [4]
5Claudio Rossi [4]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page