7 citations · 20 across the 11 of their papers we have counts for
3 papers · 1 filter
Representative families for matroid intersections, with applications to location, packing, and covering problems
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location p…
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein +2
Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For -vertex and $…
Temporal Graph Classes: A View Through Temporal Separators
Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2
We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the…