Jayme L. Szwarcfiter

most citedEfficient and Perfect domination on circular-arc graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2015

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number

Claudson F. Bornstein, Jose W. C. Pinto, Dieter Rautenbach +1

A graph $G$ has $p$ -intersection number at most $d$ if it is possible to assign to every vertex $u$ of $G$ , a subset $S (u)$ of some ground set $U$ with $∣ U ∣ = d$ in such a way that d…

cs.DS2015

Parameterized mixed cluster editing via modular decomposition

Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter

In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigate…

cs.DM2015★ 1 cited

Efficient and Perfect domination on circular-arc graphs

Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter

Given a graph $G = (V, E)$ , a \emph{perfect dominating set} is a subset of vertices $V^{'} \subseteq V (G)$ such that each vertex $v \in V (G) ∖ V^{'}$ is dominated by exactly one ve…

Forbidden Induced Subgraphs for Bounded p-Intersection Number

Parameterized mixed cluster editing via modular decomposition

Efficient and Perfect domination on circular-arc graphs

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number