Michael Gentner
YOU?
Author Swipe
View article: Active Visuo-Tactile Point Cloud Registration for Accurate Pose Estimation of Objects in an Unknown Workspace
Active Visuo-Tactile Point Cloud Registration for Accurate Pose Estimation of Objects in an Unknown Workspace Open
This paper proposes a novel active visuo-tactile based methodology wherein the accurate estimation of the time-invariant SE(3) pose of objects is considered for autonomous robotic manipulators. The robot equipped with tactile sensors on th…
View article: Promoting EFL Speaking Practice through Digital Reading
Promoting EFL Speaking Practice through Digital Reading Open
This purposive homogeneous study explores the relationship between reading and speaking in the EFL context and attempts to integrate the two language skills in a manner that encourages learners to practice and develop their receptive and p…
View article: Equating k maximum degrees in graphs without short cycles
Equating k maximum degrees in graphs without short cycles Open
For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k. Caro and Yuster [Discrete Mathematics 310 (2010) 742…
View article: Smallest domination number and largest independence number of graphs and forests with given degree sequence
Smallest domination number and largest independence number of graphs and forests with given degree sequence Open
For a sequence d of nonnegative integers, let and be the sets of all graphs and forests with degree sequence d , respectively. Let , , , and where is the domination number and is the independence number of a graph G . Adapting results of H…
View article: Equating $k$ Maximum Degrees in Graphs without Short Cycles
Equating $k$ Maximum Degrees in Graphs without Short Cycles Open
For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete Mathemati…
View article: Domination and forcing
Domination and forcing Open
This thesis comprises the results of five research papers on domination and zero forcing. In "Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence" (Gentner, Henning, Rautenbach, 2016) and "Small…
View article: Large Values of the Clustering Coefficient
Large Values of the Clustering Coefficient Open
A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is the clustering coefficient of a graph $G$. It is defined as …
View article: Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees
Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees Open
Let $G$ be a graph, and let $ρ\in (0,1)$. For a set $D$ of vertices of $G$, let the set $H_ρ(D)$ arise by starting with the set $D$, and iteratively adding further vertices $u$ to the current set if they have at least $\lceil ρd_G(u)\rceil…