| A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs A Boyacı, T Ekim, M Shalom Information Processing Letters 121, 29-33, 2017 | 14 | 2017 |
| The maximum cardinality cut problem in co-bipartite chain graphs A Boyacı, T Ekim, M Shalom Journal of Combinatorial Optimization 35, 250-265, 2018 | 11 | 2018 |
| Weighted upper domination number A Boyacı, J Monnot Electronic Notes in Discrete Mathematics 62, 171-176, 2017 | 8 | 2017 |
| Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I A Boyacı, T Ekim, M Shalom, S Zaks Discrete Applied Mathematics 215, 47-60, 2016 | 7 | 2016 |
| Graphs of edge-intersecting non-splitting paths in a tree: Towards hole representations A Boyacı, T Ekim, M Shalom, S Zaks International Workshop on Graph-Theoretic Concepts in Computer Science, 115-126, 2013 | 4 | 2013 |
| Graphs of edge-intersecting and non-splitting one bend paths in a grid A Boyacı, T Ekim, M Shalom, S Zaks Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017 | 3 | 2017 |
| Graphs of edge-intersecting and non-splitting paths A Boyacı, T Ekim, M Shalom, S Zaks Theoretical Computer Science 629, 40-50, 2016 | 2 | 2016 |
| On the maximum cardinality cut problem in proper interval graphs and related graph classes A Boyacı, T Ekim, M Shalom Theoretical Computer Science 898, 20-29, 2022 | 1 | 2022 |
| The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs A Boyacı, T Ekim, M Shalom arXiv preprint arXiv:1512.06893, 2015 | | 2015 |
| The Maximum Cut Problem in Co-bipartite Chain Graphs A Boyacı, T Ekim, M Shalom arXiv preprint arXiv:1504.03666, 2015 | | 2015 |
Mordechai ShalomTel Hai Academic CollegeEmail verificata su telhai.ac.il
