A. Rosenmann

activity

19932026

most citedBounded Determinization of Timed Automata with Silent Transitions

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

collaborators

Showing 2021Show all

2 papers · 1 filter

math.GR2021

Dependence over subgroups of free groups

Amnon Rosenmann, Enric Ventura Capell

Given a finitely generated subgroup $H$ of a free group $F$ , we present an algorithm which computes $g_{1}, \dots, g_{m} \in F$ , such that the set of elements $g \in F$ , for which there e…

math.OC2021

Computing the sequence of $k$ -cardinality assignments

Amnon Rosenmann

The $k$ -cardinality assignment problem asks for finding a maximal (minimal) weight of a matching of cardinality $k$ in a weighted bipartite graph $K_{n, n}$ , $k \leq n$ . The algorit…

Dependence over subgroups of free groups

Computing the sequence of k-cardinality assignments

Computing the sequence of $k$ -cardinality assignments