Numerical block diagonalization of matrix*-algebras with application to semidefinite programming E de Klerk, C Dobre, DV Ṗasechnik Mathematical programming 129 (1), 91-111, 2011 | 37 | 2011 |

A comparison of lower bounds for the symmetric circulant traveling salesman problem E De Klerk, C Dobre Discrete Applied Mathematics 159 (16), 1815-1826, 2011 | 34 | 2011 |

Exploiting symmetry in copositive programs via semidefinite hierarchies C Dobre, J Vera Mathematical Programming 151 (2), 659-680, 2015 | 14 | 2015 |

On semidefinite programming relaxations of maximum -section E de Klerk, D Pasechnik, R Sotirov, C Dobre Mathematical programming 136 (2), 253-278, 2012 | 12 | 2012 |

A copositive formulation for the stability number of infinite graphs C Dobre, M Dür, L Frerick, F Vallentin Mathematical Programming 160 (1), 65-83, 2016 | 7 | 2016 |

Semidefinite programming approaches for structured combinatorial optimization problems C Dobre CentER, Center for Economic Research, 2011 | 6 | 2011 |

Convex cost flow. Adaptation of network simplex algorithm C Dobre Proceedings of ICCC, 2006 | 2 | 2006 |

Network Simplex Algorithm. Parallel solution for finding the leaving arc C Dobre Bulletin of Transilvania University of Brasov, 2005 | 1 | 2005 |

Mathematical properties of the regular *-representation of matrix -algebras with applications to semidefinite programming C Dobre Numerical Algebra, Control & Optimization 3 (2), 367, 2013 | | 2013 |

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). S Cafieri, U Faigle, L Liberti Discret. Appl. Math. 159 (16), 1659, 2011 | | 2011 |

An improved semidefinite programming relaxation for max k-equipartitions. ED Klerk, C Dobre, DV Pasechnik, R Sotirov An improved semidefinite programming relaxation for max k-equipartitions …, 2011 | | 2011 |

Numerical block diagonalization of matrix-algebras with E Klerk, C Dobre, DV Pasechnik | | 2011 |

Inverse Generalized Maximum Flow Algorithms MS IOLU, A DEACONU, C DOBRE | | |

O PRAVILU NAPUŠTAJUĆE GRANE U MREŽNOM SIMPLEKS ALGORITMU ON LEAVING ARC RULE FOR NETWORK SIMPLEX ALGORITHM C Dobre | | |

Convex Time Temporally Repeated Flows E Ciurea, C Dobre | | |

ON OPTIMALITY TEST FOR THE MINIMUM COST FLOW PROBLEM WITH CONVEX COST FUNCTION C Dobre | | |