M. Rosenfeld

activity

20152023

most citedRobust Secure UAV Communications with the Aid of Reconfigurable Intelligent Surfaces

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

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Bounding the number of $(σ, ρ)$ -dominating sets in trees, forests and graphs of bounded pathwidth

Matthieu Rosenfeld

The notion of $(σ, ρ)$ -dominating set generalizes many notions including dominating set, induced matching, perfect codes or independent sets. Bounds on the maximal number of such (m…

cs.DM2019

How far away must forced letters be so that squares are still avoidable?

Matthieu Rosenfeld

We describe a new non-constructive technique to show that squares are avoidable by an infinite word even if we force some letters from the alphabet to appear at certain occurrences…

Bounding the number of (σ,ρ)-dominating sets in trees, forests and graphs of bounded pathwidth

How far away must forced letters be so that squares are still avoidable?

Bounding the number of $(σ, ρ)$ -dominating sets in trees, forests and graphs of bounded pathwidth