Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (WG, 2013)

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (CoRR, 2013)

The Maximum Cut Problem in Co-bipartite Chain Graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (CoRR, 2015)

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (CoRR, 2015)

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Appl. Math., 2016)

Graphs of edge-intersecting and non-splitting paths. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2016)

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Math. Theor. Comput. Sci., 2017)

Weighted upper domination number. - Arman Boyaci; Jérôme Monnot (Electron. Notes Discret. Math., 2017)

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (Inf. Process. Lett., 2017)

Semi-Supervised Psychometric Scoring of Document Collections. - Burak Suyunu; Gonul Ayci; Mine Ögretir; Ali Taylan Cemgil; Suzan Uskudarli; Hamza Zeytinoglu; Bülent Özel; Arman Boyaci (ICDM Workshops, 2018)

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Math. Theor. Comput. Sci., 2018)

The maximum cardinality cut problem in co-bipartite chain graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (J. Comb. Optim., 2018)

On the maximum cardinality cut problem in proper interval graphs and related graph classes. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (Theor. Comput. Sci., 2022)