Vladimir Andrunachievici Institute of Mathematics and Computer Science

RO EN

CSJM v.13, n.2 (38), 2005

Discrete Mathematics

Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games Lozovanu Dmitrii	07.09.2005	pp.115-130
Note about the upper chromatic number of mixed hypertrees Kenneth Roblee, Vitaly Voloshin	25.07.2005	pp.131-135
Nash equilibria sets in mixed extended 2x3 games Valeriu Ungureanu, Ana Botnari	23.06.2005	pp.136-150
Involving d-Convex Simple and Quasi-simple Planar Graphs in R³ Nadejda Sur, Sergiu Cataranciuc	03.10.2005	pp.151-167
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks Fonoberova Maria, Lozovanu Dmitrii	24.06.2005	pp.168-176
Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l₁ and l_∞ metrics Vladimir A. Emelichev, Olga V. Karelkina, Kirill G. Kuzmin	24.06.2005	pp.177-192

Software
Approaches to Software Based Fault Tolerance -- A Review Goutam Kumar Saha	12.07.2005	pp.193-231
Interfaces to symbolic computation systems: reconsidering experience of Bergman Cojocaru Svetlana, Malahov Ludmila, Colesnicov Alexandru	03.10.2005	pp.232-244