3 papers
cs.DS2021
Finding All Leftmost Separators of Size
Mahdi Belbasi, Martin Fürer
We define a notion called leftmost separator of size at most . A leftmost separator of size is a minimal separator that separates two given sets of vertices and …
cs.DS2019
A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation
Mahdi Belbasi, Martin Fürer
An NP-hard graph problem may be intractable for general graphs but it could be efficiently solvable using dynamic programming for graphs with bounded width (or depth or some other…
cs.DS2017
Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set
Mahdi Belbasi, Martin Fürer
An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application…