Դավիթ Մուրադյան

David Muradian, “On Layout Problems for Kneser Graphs”, In Computer Science and Information Technologies Conference, pages 341–342, Yerevan, Armenia., 2009. 

David Muradian et al, “Yield Optimization through Statistical Analysis of Recipe Changes”, 18th Annual IEEE/SEMI Conference, ASMC 2007, Stresa, Italy.

David Muradian, “The Bandwidth Minimization Problem for Cyclic Caterpillars with Hair Length 1 is NP-complete”, Theoretical Computer Science, Volume 307, N. 3 (2003), “Selected Papers in Honour of Lawrence Harper”. In English. 

D.O. Muradian, “A Polynomial Algorithm for finding the Bandwidth of Interval Graphs”, Academy of Science of Armenia, Papers 82, 2, 64-66 (1986). In Russian.

D.O. Muradian, “Some estimates for the Length of an Arbitrary Graph”, Mathematical Issues of Cybernetics, Computing Equipment, 14, 79-86, 126 (1985). In Russian.

D.O. Muradian, “Minimax Numbering of Multipaths”, 7th All-Union Conference “Theoretical Cybernetics”, 1985, Irkutsk, Russia.

D.O. Muradian, “Minimal Numberings of a Two-dimensional Cylinder”, Academy of Science of Armenia, Papers 75, 3, 114-119 (1982). In Russian.

D.O. Muradian, T.E. Piliposyan, “Minimal Numberings of Vertices of a Rectangular Lattice”, Academy of Science of Armenia, Papers 70, 1, 21-27 (1980). In Russian.

D.O. Muradian, T.E. Piliposyan, “The Problem of Finding the Length and Width of the Complete P-partite Graph”, Scientific Notes, Yerevan State University. 2, 18-26 (1980). In Russian. 

D.O. Muradian et al, “To the Task Inter-Zone Assignment Problem in the RAM at its Static Distribution”, Radio-electronics Issues, Issue 15, 112-115 (1980). In Russian.