activity
20232026
most citedEnsuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems

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

collaborators

5 papers

math.OC2026

A multi-objective perspective on block-structured integer programs with one soft coupling constraint

Mark Lyngesen, Kathrin Klamroth, Britta Efkes +1

This paper presents a multi-objective perspective on block-structured integer programs featuring a single soft coupling constraint. By interpreting the coupling constraint as a sec…

cs.CG2024

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem

François Clément, Carola Doerr, Kathrin Klamroth +1

Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Followin…

cs.DM20241 cited

Ensuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given an undirected graph , a quasi-clique is a subgraph of whose density is at least . Two optimization problems can be defined for quasi-cliques: the Ma…

cs.DM2024

Solving the Multiobjective Quasi-Clique Problem

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given a simple undirected graph , a quasi-clique is a subgraph of whose density is at least . Finding a maximum quasi-clique has been addressed from two d…

cs.CG2023

Constructing Optimal Star Discrepancy Sets

François Clément, Carola Doerr, Kathrin Klamroth +1

The star discrepancy is a very well-studied measure used to quantify the uniformity of a point set distribution. Constructing optimal point sets for this measure is se…