2 citations · 4 across the 9 of their papers we have counts for
9 papers
Engineering Hypergraph -Matching Algorithms
Ernestine Großmann, Felix Joos, Henrik Reinstädtler +1
Recently, researchers have extended the concept of matchings to the more general problem of finding -matchings in hypergraphs broadening the scope of potential applications and…
Engineering Weighted Connectivity Augmentation Algorithms
Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos +2
Increasing the connectivity of a graph is a pivotal challenge in robust network design. The weighted connectivity augmentation problem is a common version of the problem that takes…
Ramsey theory constructions from hypergraph matchings
Felix Joos, Dhruv Mubayi
We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,…
Long cycles through prescribed vertices have the Erdős-Pósa property
Henning Bruhn, Felix Joos, Oliver Schaudt
We prove that for every graph, any vertex subset , and given integers : there are disjoint cycles of length at least that each contain at least one vertex fro…
Induced Matchings in Graphs of Maximum Degree 4
Felix Joos
For a graph , let be the induced matching number of . We prove the sharp bound for every graph of maximum degree at most and with…
Induced Matchings in Graphs of Bounded Maximum Degree
Felix Joos
For a graph , let be the induced matching number of . We prove that for every graph…