Adrian Marius Deaconu

According to our database, Adrian Marius Deaconu authored at least 12 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Widest Path in Networks with Gains/Losses.

Javad Tayyebi, Mihai-Lucian Rîtan, Adrian Marius Deaconu

Axioms, February, 2024

Generalized Maximum Capacity Path Problem with Loss Factors.

Javad Tayyebi, Mihai-Lucian Rîtan, Adrian Marius Deaconu

Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023

Shortest path interdiction problem with convex piecewise-linear costs.

Javad Tayyebi, Adrian Marius Deaconu, Hamid Bigdeli, Malihe Niksirat

Comput. Appl. Math., October, 2023

Maximum capacity path problem with loss factors.

Adrian Marius Deaconu, Javad Tayyebi, Mihai-Lucian Rîtan

CoRR, 2023

Finding minimum loss path in big networks.

Adrian Marius Deaconu, Delia Spridon, Laura Ciupala

Proceedings of the 22nd International Symposium on Parallel and Distributed Computing, 2023

Fast CUDA Geomagnetic Map Builder.

Delia Spridon, Adrian Marius Deaconu, Laura Ciupala

Proceedings of the Computational Science and Its Applications - ICCSA 2023, 2023

2021

Data Delivery in a Disaster or Quarantined Area Divided into Triangles Using DTN-Based Algorithms for Unmanned Aerial Vehicles.

Razvan Udroiu, Adrian Marius Deaconu, Corina-Stefania Nanau

Sensors, 2021

Algorithms for Delivery of Data by Drones in an Isolated Area Divided into Squares.

Adrian Marius Deaconu, Razvan Udroiu, Corina-Stefania Nanau

Sensors, 2021

2020

Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks.

Adrian Marius Deaconu, Javad Tayyebi

IEEE Access, 2020

2008

The inverse maximum flow problem considering <i>l</i> _∞ norm.

Adrian Marius Deaconu

RAIRO Oper. Res., 2008

2006

A Cardinality Inverse Maximum Flow Problem.

Adrian Marius Deaconu

Sci. Ann. Cuza Univ., 2006

2004

Iterative Algorithm for Construction of a Tree from its Pre-order and Post-order Traversals in Linear Time and Space.

Adrian Marius Deaconu

Sci. Ann. Cuza Univ., 2004