Dragan Marusic

Prof. Dragan Marusic


Research Focus & Metrics

Academic Career Length

46Years (1981-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 April 2010 in BMC Public Health
Verified
Journal Article
Open access
PDF file
DWDanuta Wasserman
Danuta Wasserman
VCVladimir Carli
Vladimir Carli
CWCamilla Wasserman
Camilla Wasserman
Alan ApterAlan Apter
Alan Apter
JBJudit Balazs
Judit Balazs
CHChristina W Hoven
Christina W Hoven
There have been only a few reports illustrating the moderate effectiveness of suicide-preventive interventions in reducing suicidal behavior, and, in most of those studies, the target populations were primarily adults, whereas few focused on adolescents. Essentially, there have been no randomized controlled studies comparing the efficacy, cost-effectiveness and cultural adaptability of suicide-prevention strategies in schools. There is also a lack of information on whether suicide-preventive interventions can, in addition to preventing suicide, reduce risk behaviors and promote healthier ones as well as improve young people's mental health.

1 July 2004 in Journal of Algebraic Combinatorics
Verified
Journal Article
Open access
PDF file
AMAleksander Malnič
Aleksander Malnič
DMDragan Marusic
Dragan Marusic
PPPrimož Potočnik
Primož Potočnik
Let ${\mathcal{C}}$ G (X) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G ≤ Aut X of automorphisms lifts. There is a natural lattice structure on ${\mathcal{C}}$ G (X), where ℘1 ≤ ℘2 whenever ℘2 factors through ℘1. The sublattice ${\mathcal{C}}$ G (℘) of coverings which are below a given covering ℘ : X~ → X naturally corresponds to a lattice ${\mathcal{N}}$ G (℘) of certain subgroups of the group of covering transformations. In order to study this correspondence, some general theorems regarding morphisms and decomposition of regular covering projections are proved. All theorems are stated and proved combinatorially in terms of voltage assignments, in order to facilitate computation in concrete applications. For a given prime p, let ${\mathcal{C}}$ G p (X) ≤ ${\mathcal{C}}$ G (X) denote the sublattice of all regular covering projections with an elementary abelian p-group of covering transformations. There is an algorithm which explicitly constructs ${\mathcal{C}}$ G p (X) in the sense that, for each member of ${\mathcal{C}}$ G p (X), a concrete voltage assignment on X which determines this covering up to equivalence, is generated. The algorithm uses the well known algebraic tools for finding invariant subspaces of a given linear representation of a group. To illustrate the method two nontrival examples are included.

1 January 1983 in Discrete Mathematics
Verified
Journal Article
Closed access
DMDragan Marusic
Dragan Marusic

1 May 2006 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
MCMarston Conder
Marston Conder
AMAleksander Malnič
Aleksander Malnič
DMDragan Marusic
Dragan Marusic
PPPrimž Potočnik
Primž Potočnik

1 May 1998 in Journal of Combinatorial Theory, Series B
Verified
Journal Article
Closed access
PDF file
DMDragan Marusic
Dragan Marusic

1 January 1981 in Discrete Mathematics
Verified
Journal Article
Closed access
DMDragan Marusic
Dragan Marusic