2 citations · 3 across the 4 of their papers we have counts for
5 papers
A Natural Quadratic Approach to the Generalized Graph Layering Problem
Sven Mallach
We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associ…
Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints
Sven Mallach
In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linea…
Compact Linearization for Binary Quadratic Problems subject to Linear Equations
Sven Mallach
In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generali…
Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints
Sven Mallach
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as…
Compact Layered Drawings of General Directed Graphs
Adalat Jabrayilov, Sven Mallach, Petra Mutzel +2
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a la…