7 citations · 17 across the 16 of their papers we have counts for
8 papers · 1 filter
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be…
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
Tınaz Ekim, Mordechai Shalom, Oylum Şeker
It is known that any chordal graph on vertices can be represented as the intersection of subtrees in a tree on nodes. This fact is recently used in [2] to generate rand…
Hierarchical b-Matching
Yuval Emek, Shay Kutten, Mordechai Shalom +1
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a -matching every vertex ha…
Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints
Yuval Emek, Shay Kutten, Mordechai Shalom +1
A widely studied problem in communication networks is that of finding the maximum number of communication requests that can be scheduled concurrently, subject to node and/or link c…
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste, Didem Gözüpek, Christophe Paul +3
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirect…
Edge Coloring with Minimum Reload/Changeover Costs
Didem Gözüpek, Mordechai Shalom
In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are traversed. The value of the traversal cost depends only…
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Didem Gözüpek, Sibel Özkan, Christophe Paul +2
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Chan…
The Maximum Cut Problem in Co-bipartite Chain Graphs
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
A \emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known t…