DEACONU Adrian

Conferențiar dr.
Departamentul Matematică și informatică
Facultatea Matematică și informatică

Contact:

Str. Iuliu Maniu nr. 50 Brașov, Romania
Corp P, sala PP2
Tel./Fax: +40 268 412776
E-mail: a.deaconu@unitbv.ro

Descarcă CV

Interese de cercetare:

  • algoritmi
  • algoritmi euristici
  • grafuri
  • optimizare
  • probleme inverse
  • grafică pe calculator
  • procesare digitală de imagini

Publicații (selecție)

  • A.M. Deaconu, J. Tayyebi, Inverse Maximum Capacity Path Problems under Sum-type and Max-type Distances and their Practical Application to Transportation Networks, IEEE Access, 2020
  • A.M. Deaconu, D.T. Cotfas, P.A. Cotfas, Calculation of Seven Photovoltaic Cells Parameters Using Parallelized Successive Discretization Algorithm, International Journal of Photoenergy, 2020
  • A.M. Deaconu, L. Ciupala, Inverse Minimum Cut Problem with Lower and Upper Bounds, Mathematics, 8(9), 1494, 2020
  • D.T. Cotfas, A.M. Deaconu, P.A. Cotfas, Application of Successive Discretization Algorithm for Determining Photovoltaic Cells Parameters, Energy Conversion and Management, vol. 196, 545-556, 2019
  • J. Tayyebi, A. Deaconu, Inverse Generalized Maximum Flow Problems, Mathematics, vol. 7(10), 2019
  • A. Deaconu, E. Ciurea, Inverse feasibility problems of the inverse maximum flow problems, Sadhana-Academy Proceedings in Engineering Sciences, vol. 38(2), 199-209, 2013
  • A. Deaconu, E. Ciurea, The inverse maximum flow problem under 𝐿𝑘 norms, Carpathian Journal of Mathematics, 59-66, 2012
  • C. Marinescu, A. Deaconu, E. Ciurea, D. Marinescu, From Microgrids to Smart Grids: Modeling and Simulating Using Graphs. Part I active, OPTIM 12th  Conference on IEEEE, 2010
  • C. Marinescu, A. Deaconu, E. Ciurea, D. Marinescu, From Microgrids to Smart Grids: Modeling and Simulating Using Graphs. Part II, OPTIM 12th Conference on IEEEE, 2010
  • A. Deaconu, The inverse maximum flow problem considering l∞ norm,  RAIRO-Operations Research, vol. 42(3), 401-414, 2008
  • E. Ciurea, A. Deaconu, Inverse minimum flow problem, Journal of Applied Mathematics and Computing (JAMC), vol. 23 (1-2), 193-203, 2007
  • A. Deaconu, Alternative algorithms for finding the conex components for a graph, International Journal of Computers Communications & Control (IJCCC), vol. 1, 175-180, 2006