activity
19992024
most citedOn the number of outer connected dominating sets of graphs

9 citations · 21 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2024★ 1 cited

ADEP: A Novel Approach Based on Discriminator-Enhanced Encoder-Decoder Architecture for Accurate Prediction of Adverse Effects in Polypharmacy

Katayoun Kobraei, Mehrdad Baradaran, Seyed Mohsen Sadeghi +2

Motivation: Unanticipated drug-drug interactions (DDIs) pose significant risks in polypharmacy, emphasizing the need for predictive methods. Recent advancements in computational te…

cs.DS2012★ 1 cited

TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets

Hadi Poormohammadi, Changiz Eslahchi, Ruzbeh Tusserkani

The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripN…

math.CO2011★ 9 cited

On the number of outer connected dominating sets of graphs

Saeid Alikhani, Mohammad H. Akhbari, C. Eslahchi +1

Let be a simple graph. A set is called an outer-connected dominating set (or ocd-set) of , if is a dominating set of and either or $…

cs.CE2011★ 2 cited

TripNet: A Method for Constructing Phylogenetic Networks from Triplets

Ruzbeh Tusserkani, Changiz Eslahchi, Hadi Poormohammadi +1

We present TripNet, a method for constructing phylogenetic networks from triplets. We will present the motivations behind our approach and its theoretical and empirical justificati…

math.CO1999★ 8 cited

Some concepts in list coloring

Ch. Eslahchi, M. Ghebleh, H. Hajiabolhassan

In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list colori…