Marco Kuhlmann

activity

20082024

most citedBalanced Product of Calibrated Experts for Long-Tailed Recognition

5 citations · 12 across the 10 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

cs.CC2015

Maximum Pagenumber-k Subgraph is NP-Complete

Peter Jonsson, Marco Kuhlmann

Given a graph $G$ with a total order defined on its vertices, the Maximum Pagenumber- $k$ Subgraph Problem asks for a maximum subgraph $G^{'}$ of $G$ such that $G^{'}$ can be embedded int…

cs.DS2015★ 4 cited

Tabulation of Noncrossing Acyclic Digraphs

Marco Kuhlmann

I present an algorithm that, given a number $n \geq 1$ , computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation…