302 citations · 303 across the 4 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Nils Kriege, Florian Kurpicz, Petra Mutzel
The complexity of the maximum common connected subgraph problem in partial -trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplan…
cs.CG2017
New Integer Linear Programming Models for the Vertex Coloring Problem
Adalat Jabrayilov, Petra Mutzel
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different fro…
cs.DS2017
Orthogonal Compaction Using Additional Bends
Michael Jünger, Petra Mutzel, Christiane Spisla
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We…