Two problems concerning dynamic flows in node and arc capacitated networks. - Eleonor Ciurea (Comput. Sci. J. Moldova, 1997)

The In-Out Rebalancing Flow Method for Maximum Flow Computation. - Sabin Tabirca; Eleonor Ciurea; Tatiana Tabirca (Sci. Ann. Cuza Univ., 1998)

The Reciprocal Theorems Concerning the Chromatic Polynomial. - Tatiana Tabirca; Sabin Tabirca; Eleonor Ciurea (Sci. Ann. Cuza Univ., 1998)

Algorithms for minimum flows. - Eleonor Ciurea; Laura Ciupal (Comput. Sci. J. Moldova, 2001)

Minimum parametric flow over time. - Mircea Parpalea; Nicoleta Avesalon; Eleonor Ciurea (CoRR, 2015)

The Maximum Flows in Planar Dynamic Networks. - Camelia Schiopu; Eleonor Ciurea (Int. J. Comput. Commun. Control, 2016)

The Maximum Parametric Flow in Discrete-time Dynamic Networks. - Nicoleta Avesalon; Eleonor Ciurea; Mircea Parpalea (Fundam. Informaticae, 2017)

Two Flow Problems in Dynamic Networks. - Camelia Schiopu; Eleonor Ciurea (Int. J. Comput. Commun. Control, 2017)

Minimum flows in directed s-t planar networks with arcs and nodes capacities. - Eleonor Ciurea; Oana Georgescu; Camelia Schiopu (CoDIT, 2018)

Maximum Flows in Planar Dynamic Networks with Lower Bounds. - Camelia Schiopu; Eleonor Ciurea (Fundam. Informaticae, 2018)

Minimum parametric flow in time-dependent dynamic networks. - Mircea Parpalea; Nicoleta Avesalon; Eleonor Ciurea (RAIRO Theor. Informatics Appl., 2018)

Minimum Flows in Directed Planar Dynamic Networks. - Eleonor Ciurea; Camelia Schiopu (CoDIT, 2019)

Minimum Flows in Directed 1-n Planar Static and Dynamic Networks with Arcs and Nodes Capacities. - Eleonor Ciurea; Oana Georgescu; Camelia Schiopu (J. Circuits Syst. Comput., 2022)