Search Results - "Asratian, A A"

A generalized class–teacher model for some timetabling problems by Asratian, A.S., de Werra, D.

“…We consider a theoretical model which extends the basic “class–teacher model” of timetabling and which corresponds to some situations which occur frequently in…”
Get full text

Peripheral and central kynurenine pathway abnormalities in major depression by Paul, Elisabeth R., Schwieler, Lilly, Erhardt, Sophie, Boda, Sandra, Trepci, Ada, Kämpe, Robin, Asratian, Anna, Holm, Lovisa, Yngve, Adam, Dantzer, Robert, Heilig, Markus, Hamilton, J. Paul, Samuelsson, Martin

“…•Picolinic acid levels are decreased in the cerebrospinal fluid of individuals with major depression.•Reduced hippocampal and amygdalar volumes in major…”
Get full text

Treatment of patients with a cerebral arterial aneurysm and stenosis of the internal carotid artery by Khripun, A I, Asratian, S A, Priamikov, A D, Mironkov, A B, Suriakhin, V S, Gulina, L D

“…The purpose of this study was to analyse the world literature dedicated to the problem concerning treatment of a combination of internal carotid artery…”
Get more information

Tendency and analysis of the epidemic situation in parenteral virus hepatitis B and C in the Russian Federation and a number of its regions by Asratian, A A, Isaeva, O V, Mikhaĭlov, M I

“…As revealed in the present survey, during the last 3 years, against a background of decreased number of registered cases of acute hepatitis B (HB) and acute…”
Get more information

New class of 0-1 integer programs with tight approximation via linear relaxations by Asratian, A. S., Kuzjurin, N. N.

“…We consider the problem of estimating optima of integer programs {max cx | Ax < or = b, 0 < or = x < or = 1, x - integral} where b > 0, c > or = 0 are rational…”
Get full text

Two sensitivity theorems in fuzzy integer programming by Asratian, A.S., Kuzjurin, N.N.

“…We consider the problem of estimating optima of covering integer linear programs with 0-1 variables under the following conditions: we do not know exact values…”
Get full text

Experience in diagnosis and treatment of combined lesions of the extra- and intracranial portions of the internal carotid artery by Khripun, A I, Salikov, A V, Priamikov, A D, Mironkov, A B, Mikhaĭlenko, V P, Asratian, S A, Kemezh, Iu V, Abashin, M V

“…The treatment policy concerning patients with lesions of the extra- and intracranial portions of carotid arteries is currently uncertain. The authors share…”
Get more information

Venous thromboembolic complications in patients with intracranial hemorrhage and tumors of the central nervous system by Khripun, A I, Alimov, A N, Priamikov, A D, Mironkov, A B, Asratian, S A, Gorshkov, K M, Latonov, V V, Abashin, M V

“…It was analyzed the results of diagnosis and prevention of venous thromboembolic complications in 248 patients with intracranial hemorrhages of different…”
Get more information

Some results on an edge coloring problem of Folkman and Fulkerson by Asratian, A.S.

“…In 1968, Folkman and Fulkerson posed the following problem: Let G be a graph and let ( n 1,…, n t ) be a sequence of positive integers. Does there exist a…”
Get full text

Haemodynamic and clinical efficacy of electric muscular stimulation of the venous outflow in prevention of postoperative venous thromboembolic complications by Lobastov, K V, Barmotin, N A, Barinov, V E, Obolenskiĭ, V N, Asratian, S A, Laberko, L A, Boiarintsev, V V

“…The present clinical and experimental study was carried out in order to evaluate efficacy of electrical stimulation of the crural muscles with the purpose of…”
Get more information

Every 3-connected, locally connected, claw-free graph is Hamilton-connected by Asratian, A. S.

“…A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of order p ≥…”
Get full text

On the number of nearly perfect matchings in almost regular uniform hypergraphs by Asratian, A.S., Kuzjurin, N.N.

“…Strengthening the result of Rődl and Frankl (Europ. J. Combin 6 (1985) 317–326), Pippenger proved the theorem stating the existence of a nearly perfect…”
Get full text

Short Solution of Kotzig's Problem for Bipartite Graphs by Asratian, A.S.

“…In 1975, A. Kotzig posed the following problem: LetGbe at-regular graph which has a proper edget-coloring,t⩾4. Is it possible to obtain, from one proper…”
Get full text

A note on transformations of edge colorings of bipartite graphs by Asratian, A.S.

“…The author and A. Mirumian proved the following theorem: Let G be a bipartite graph with maximum degree Δ and let t , n be integers, t ⩾ n ⩾ Δ . Then it is…”
Get full text

On the number of partial Steiner systems by Asratian, A. S., Kuzjurin, N. N.

“…We give a simple proof of the result of Grable on the asymptotics of the number of partial Steiner systems S(t,k,m). © 2000 John Wiley & Sons, Inc. J Combin…”
Get full text

Dislocation syndrome induced by massive cerebellar infarction and indications for urgent operation by Asratian, S A, Nikitin, A S

Get more information

Some panconnected and pancyclic properties of graphs with a local ore-type condition by Asratian, A. S., Sarkisian, G. V.

“…Asratian and Khachatrian proved that a connected graph G of order at least 3 is hamiltonian if d(u) + d(v) ≥ |N(u) ∪ N(v) ∪ N(w)| for any path uwv with uv ∉…”
Get full text

A generalized class-teacher model for timetabling problems by Asratian, A S, de Werra, D

“…This article considers a theoretical model which extends the basic class-teacher model of timetabling and which corresponds to some situations which occur…”
Get full text

Immunoenzyme test-systems for diagnostics of cytomegalovirus infection by Mardanly, S G, Asratian, A A

“…Cytomegalovirus infection (CMVI) is becoming the serious medical-social problem both in clinical-epidemiological aspects and in connection with demographic…”
Get more information

A characterization of panconnected graphs satisfying a local ore-type condition by Asratian, A. S., Häggkvist, R., Sarkisian, G. V.

“…It is well known that a graph G of order p ≥ 3 is Hamilton‐connected if d(u) + d(v) ≥ p + 1 for each pair of nonadjacent vertices u and v. In this paper we…”
Get full text