5 citations · 15 across the 12 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Kernelization for Graph Packing Problems via Rainbow Matching
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos +1
We introduce a new kernelization tool, called rainbow matching technique}, that is appropriate for the design of polynomial kernels for packing problems and their hitting counterpa…
cs.DS2022
Approximating optimization problems in graphs with locational uncertainty
Marin Bougeret, Jérémy Omer, Michael Poss
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the ve…