Amer Mouawad

Amer Mouawad

Computer Scientist / Mathematician

Contact Me

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

My research interests (i.e. things I know I enjoy working on) are graph theory, parameterized complexity, kernelization, reconfiguration, high performance computing, and in the confluence of several of those fields.

Journal Articles (still journalizing those conference proceedings)

Shortest reconfiguration paths in the solution space of Boolean formulas.

SIAM Journal on Discrete Mathematics (aka SIDMA) (short version in the proceedings of ICALP 2015).
Joint work with Naomi Nishimura, Vinayak Pathak, and Venkatesh Raman.

On the parameterized complexity of reconfiguration problems.

Algorithmica (short version in the proceedings of IPEC 2013).
Joint work with Naomi Nishimura, Venkatesh Raman, Narges Simjour, and Akira Suzuki.

On scalable parallel recursive backtracking.

Journal of Parallel and Distributed Computing.
Joint work with Faisal N. Abu-Khzam, Khuzaima Daudjee, and Naomi Nishimura.

Reconfiguration of dominating sets.

Journal of Combinatorial Optimization (short version in the proceedings of COCOON 2014).
Joint work with Naomi Nishimura and Akira Suzuki.

The complexity of dominating set reconfiguration.

Theoretical Computer Science (short version in the proceedings of WADS 2015).
Joint work with Arash Hadadan, Takehiro Ito, Naomi Nishimura, Hirotaka Ono, and Akira Suzuki.

An exact algorithm for connected red-blue dominating set.

Journal of Discrete Algorithms (short version in the proceedings of CIAC 2010).
Joint work with Faisal N. Abu-Khzam and Mathieu Liedloff.

Conference Proceedings

Packing Cycles Faster Than Erdos-Pósa.

Proc. of the Int. Colloquium on Automata, Languages, and Programming (ICALP 2017).
Joint work with Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi.

Critical node cut parameterized by treewidth and solution size is W[1]-hard.

Proc. of the Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017).
Joint work with Akanksha Agrawal and Daniel Lokshtanov.

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.

Proc. of the Int. Colloquium on Automata, Languages, and Programming (ICALP 2016).
Joint work with Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, and Saket Saurabh.

Simultaneous Feedback Vertex Set: A Parameterized Perspective.

Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS 2016).
Joint work with Akanksha Agrawal, Daniel Lokshtanov, and Saket Saurabh.

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.

Reconfiguration over tree decompositions.

Proc. of the 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 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 Int. Symposium on Algorithms and Computation (ISAAC 2014).
Joint work with Naomi Nishimura and Venkatesh Raman.

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

Proc. of the 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 Int. Frontiers of Algorithmics Workshop (FAW 2010).
Joint work with Faisal N. Abu-Khzam, Michael A. Langston and Clinton P. Nolan.

Submitted / In Progress

Reconfiguration via graph searching.

Joint work with Daniel Lokshtanov.

Lossy kernels for connected dominating set on sparse graphs

Joint work Eduard Eiben, Mithilesh Kumar, and Fahad Panolan.

On the parameterized complexity of simultaneous deletion problems.

Joint work with Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, and M. S. Ramanujan.