Eleonor Ciurea

According to our database, Eleonor Ciurea authored at least 13 papers between 1997 and 2022.

Collaborative distances:

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

2022

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

2019

Minimum Flows in Directed Planar Dynamic Networks.

Eleonor Ciurea, Camelia Schiopu

Proceedings of the 6th International Conference on Control, 2019

2018

Minimum parametric flow in time-dependent dynamic networks.

Mircea Parpalea, Nicoleta Avesalon, Eleonor Ciurea

RAIRO Theor. Informatics Appl., 2018

Maximum Flows in Planar Dynamic Networks with Lower Bounds.

Camelia Schiopu, Eleonor Ciurea

Fundam. Informaticae, 2018

Minimum flows in directed s-t planar networks with arcs and nodes capacities.

Eleonor Ciurea, Oana Georgescu, Camelia Schiopu

Proceedings of the 5th International Conference on Control, 2018

2017

Two Flow Problems in Dynamic Networks.

Camelia Schiopu, Eleonor Ciurea

Int. J. Comput. Commun. Control, 2017

The Maximum Parametric Flow in Discrete-time Dynamic Networks.

Nicoleta Avesalon, Eleonor Ciurea, Mircea Parpalea

Fundam. Informaticae, 2017

2016

The Maximum Flows in Planar Dynamic Networks.

Camelia Schiopu, Eleonor Ciurea

Int. J. Comput. Commun. Control, 2016

2015

Minimum parametric flow over time.

Mircea Parpalea, Nicoleta Avesalon, Eleonor Ciurea

CoRR, 2015

2001

Algorithms for minimum flows.

Eleonor Ciurea, Laura Ciupal

Comput. Sci. J. Moldova, 2001

1998

The Reciprocal Theorems Concerning the Chromatic Polynomial.

Tatiana Tabirca, Sabin Tabirca, Eleonor Ciurea

Sci. Ann. Cuza Univ., 1998

The In-Out Rebalancing Flow Method for Maximum Flow Computation.

Sabin Tabirca, Eleonor Ciurea, Tatiana Tabirca

Sci. Ann. Cuza Univ., 1998

1997

Two problems concerning dynamic flows in node and arc capacitated networks.

Eleonor Ciurea

Comput. Sci. J. Moldova, 1997