1 citations · 2 across the 4 of their papers we have counts for
5 papers
The Pareto cover problem
Bento Natura, Meike Neuwohner, Stefan Weltge
We introduce the problem of finding a set of points in such that the expected cost of the cheapest point in that dominates a random point from is mi…
The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
Meike Neuwohner
We consider the Maximum Weight Independent Set Problem (MWIS) in -claw free graphs, i.e. the task of computing an independent set of maximum weight in a given -claw free grap…
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
Meike Neuwohner
In this paper, we consider the task of computing an independent set of maximum weight in a given -claw free graph equipped with a positive weight function $w:V\rightar…
Reducing Moser's Square Packing Problem to a Bounded Number of Squares
Meike Neuwohner
The problem widely known as Moser's Square Packing Problem asks for the smallest area such that for any set of squares of total area , there exists a rectangle of ar…
A Fast Optimal Double Row Legalization Algorithm
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
In Placement Legalization, it is often assumed that (almost) all standard cells possess the same height and can therefore be aligned in cell rows, which can then be treated indepen…