Rodica Boliac

According to our database, Rodica Boliac authored at least 10 papers between 1995 and 2007.

Collaborative distances:

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

2007

NP-hard graph problems and boundary classes of graphs.

Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin

Theor. Comput. Sci., 2007

2004

On computing the dissociation number and the induced matching number of bipartite graphs.

Rodica Boliac, Kathie Cameron, Vadim V. Lozin

Ars Comb., 2004

2003

Independent domination in finitely defined classes of graphs.

Rodica Boliac, Vadim V. Lozin

Theor. Comput. Sci., 2003

An augmenting graph approach to the stable set problem in P₅-free graphs.

Rodica Boliac, Vadim V. Lozin

Discret. Appl. Math., 2003

2002

On the Clique-Width of Graphs in Hereditary Classes.

Rodica Boliac, Vadim V. Lozin

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

An attractive class of bipartite graphs.

Rodica Boliac, Vadim V. Lozin

Discuss. Math. Graph Theory, 2001

2000

Optimal Paths in Network Games with P Players.

Rodica Boliac, Dmitrii Lozovanu, D. Solomon

Discret. Appl. Math., 2000

1997

Algorithms for finding optimal paths in network games with p players.

Rodica Boliac, Dmitrii Lozovanu

Comput. Sci. J. Moldova, 1997

An algorithm and a program for finding the minimax path tree in weighted digraphs.

Rodica Boliac

Comput. Sci. J. Moldova, 1997

1995

On graphs containing a given graph as median.

A. Poshtaru, Rodica Boliac

Comput. Sci. J. Moldova, 1995