research
∙
11/06/2018
Weighted Upper Edge Cover: Complexity and Approximability
Optimization problems consist of either maximizing or minimizing an obje...
share
research
∙
10/25/2018
Maximum Independent Sets in Subcubic Graphs: New Results
The maximum independent set problem is known to be NP-hard in the class ...
research
∙
10/10/2018
Extension of vertex cover and independent set in some classes of graphs and generalizations
We consider extension variants of the classical graph problems Vertex Co...
research
∙
10/10/2018
On the Complexity of Solution Extension of Optimization Problems
The question if a given partial solution to a problem can be extended re...
research
∙
03/18/2018
Computing and Testing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an...
research
∙
11/15/2011