Arman Boyaci

Publication Activity (10 Years)

Years Active: 2013-2022
Publications (10 Years): 10

Top Topics

Graph Representations

Minimum Spanning Trees

Top Venues

Discret. Math. Theor. Comput. Sci.

Theor. Comput. Sci.

Publications

Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the maximum cardinality cut problem in proper interval graphs and related graph classes. Theor. Comput. Sci. 898 (2022)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes. CoRR (2020)
Burak Suyunu, Gonul Ayci, Mine Ögretir, Ali Taylan Cemgil, Suzan Uskudarli, Hamza Zeytinoglu, Bülent Özel, Arman Boyaci
Semi-Supervised Psychometric Scoring of Document Collections. ICDM Workshops (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35 (1) (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. Inf. Process. Lett. 121 (2017)
Arman Boyaci, Jérôme Monnot
Weighted upper domination number. Electron. Notes Discret. Math. 62 (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629 (2016)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215 (2016)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cut Problem in Co-bipartite Chain Graphs. CoRR (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. ICTCS (2014)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. CoRR (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. CoRR (2013)