Amer Mouawad

Amer Mouawad

Computer Scientist

Contact Me

Currently a postdoc at the University of Bergen working with Daniel Lokshtanov on the BeHard project, a four year research project on kernelization funded by the Bergen Research Foundation and the University of Bergen.

My research interests are mainly in graph theory, parameterized complexity/algorithms, kernelization, exact algorithms, combinatorial reconfiguration, computational geometry, high performance computing, and in the confluence of several of those fields.

Conference Proceedings

Reconfiguration on sparse graphs.

Proc. of Algorithms and Data Structures Symposium (WADS 2015).
Joint work with Daniel Lokshtanov, Fahad Panolan, M.S. Ramanujan, and Saket Saurabh.

The complexity of dominating set reconfiguration.

Proc. of Algorithms and Data Structures Symposium (WADS 2015).
Joint work with Arash Hadadan, Takehiro Ito, Naomi Nishimura, Hirotaka Ono, and Akira Suzuki.

Shortest reconfiguration paths in the solution space of Boolean formulas.

Proc. of the 42nd Int. Colloquium on Automata, Languages, and Programming (ICALP 2015).
Joint work with Naomi Nishimura, Vinayak Pathak, and Venkatesh Raman.

Reconfiguration over tree decompositions.

Proc. of the 9th Int. Symposium on Parameterized and Exact Computation (IPEC 2014).
Joint work with Naomi Nishimura, Venkatesh Raman, and Marcin Wrochna.

The complexity of bounded length graph Recoloring and CSP reconfiguration.

Proc. of the 9th Int. Symposium on Parameterized and Exact Computation (IPEC 2014).
Joint work with Paul Bonsma, Naomi Nishimura, and Venkatesh Raman.

Vertex cover reconfiguration and beyond.

Proc. of the 25th International Symposium on Algorithms and Computation (ISAAC 2014).
Joint work with Naomi Nishimura and Venkatesh Raman.

Reconfiguration of dominating sets.

Proc. of the 20th Int. Computing and Combinatorics Conference (COCOON 2014).
Joint work with Naomi Nishimura and Akira Suzuki.

On the parameterized complexity of reconfiguration problems.

Proc. of the 8th Int. Symposium on Parameterized and Exact Computation (IPEC 2013).
Joint work with Naomi Nishimura, Venkatesh Raman, Narges Simjour, and Akira Suzuki.

A decentralized load balancing approach for Parallel search-tree optimization.

Proc. of the 13th Int. Conference on Parallel and Distributed Computing (PDCAT 2012).
Joint work with Faisal N. Abu-Khzam.

A hybrid graph representation for recursive backtracking algorithms.

Proc. of the 4th Int. Frontiers of Algorithmics Workshop (FAW 2010).
Joint work with Faisal N. Abu-Khzam, Michael A. Langston and Clinton P. Nolan.

Journal Articles

An exact algorithm for connected red-blue dominating set.

Journal of Discrete Algorithms (JDA 2011).
Joint work with Faisal N. Abu-Khzam and Mathieu Liedloff.