58 citations · 151 across the 35 of their papers we have counts for
4 papers · 1 filter
Structural Parameterizations of the Mixed Chinese Postman Problem
Gregory Gutin, Mark Jones, Magnus Wahlstrom
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph ( may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each ed…
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
Gregory Gutin, Stefan Kratsch, Magnus Wahlström
The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by…
Calculation of Discrepancy Measures and Applications
Carola Doerr, Michael Gnewuch, Magnus Wahlström
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of point sets. After providing an introduction which puts the calculation of discrepa…
Parameterized Directed -Chinese Postman Problem and Arc-Disjoint Cycles Problem on Euler Digraphs
Gregory Gutin, Mark Jones, Bin Sheng +1
In the Directed -Chinese Postman Problem (-DCPP), we are given a connected weighted digraph and asked to find non-empty closed directed walks covering all arcs of …