A Hybrid Graph Representation for Recursive Backtracking Algorithms. - Faisal N. Abu-Khzam; Michael A. Langston; Amer E. Mouawad; Clinton P. Nolan (FAW, 2010)

Collaborative content distribution over wireless networks with minimized end-to-end distribution delays. - Amer E. Mouawad; Sanaa Sharafeddine (ICT, 2010)

On hierarchical collaborative content distribution over communication networks. - Amer E. Mouawad; Sanaa Sharafeddine (ICT, 2010)

Parallel genetic algorithm for disease-gene association. - Amer E. Mouawad; Nashat Mansour (ICNC, 2011)

An exact algorithm for connected red-blue dominating set. - Faisal N. Abu-Khzam; Amer E. Mouawad; Mathieu Liedloff (J. Discrete Algorithms, 2011)

A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization. - Faisal N. Abu-Khzam; Amer E. Mouawad (PDCAT, 2012)

An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (CoRR, 2013)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (ISAAC, 2014)

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. - Paul S. Bonsma; Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (IPEC, 2014)

Reconfiguration over Tree Decompositions. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Marcin Wrochna (IPEC, 2014)

A Hybrid Graph Representation for Exact Graph Algorithms. - Faisal N. Abu-Khzam; Karim A. Jahed; Amer E. Mouawad (CoRR, 2014)

The Complexity of Bounded Length Graph Recoloring. - Paul S. Bonsma; Amer E. Mouawad (CoRR, 2014)

Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach. - Faisal N. Abu-Khzam; Amer E. Mouawad; Karim A. Jahed (CLUSTER, 2015)

On scalable parallel recursive backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (J. Parallel Distributed Comput., 2015)

Reconfiguration of dominating sets. - Akira Suzuki 001; Amer E. Mouawad; Naomi Nishimura (J. Comb. Optim., 2016)

The complexity of dominating set reconfiguration. - Arash Haddadan; Takehiro Ito; Amer E. Mouawad; Naomi Nishimura; Hirotaka Ono 001; Akira Suzuki 001; Youcef Tebbal (Theor. Comput. Sci., 2016)

On the Parameterized Complexity of Simultaneous Deletion Problems. - Akanksha Agrawal 001; R. Krithika 001; Daniel Lokshtanov; Amer E. Mouawad; M. S. Ramanujan 001 (FSTTCS, 2017)

Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad (WG, 2017)

On the Parameterized Complexity of Reconfiguration Problems. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Narges Simjour; Akira Suzuki 001 (Algorithmica, 2017)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan (CoRR, 2017)

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. - Amer E. Mouawad; Naomi Nishimura; Vinayak Pathak; Venkatesh Raman 001 (SIAM J. Discret. Math., 2017)

On the Parameterized Complexity of [1, j]-Domination Problems. - Mohsen Alambardar Meybodi; Fedor V. Fomin; Amer E. Mouawad; Fahad Panolan (FSTTCS, 2018)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Sebastian Siebertz (Algorithms, 2018)

Reconfiguration on sparse graphs. - Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (J. Comput. Syst. Sci., 2018)

Kernelization of Cycle Packing with Relaxed Disjointness Constraints. - Akanksha Agrawal 001; Daniel Lokshtanov; Diptapriyo Majumdar; Amer E. Mouawad; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Simultaneous Feedback Vertex Set: A Parameterized Perspective. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001 (ACM Trans. Comput. Theory, 2018)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz (SIAM J. Discret. Math., 2019)

Packing Cycles Faster Than Erdos-Posa. - Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2019)

The Complexity of Independent Set Reconfiguration on Bipartite Graphs. - Daniel Lokshtanov; Amer E. Mouawad (ACM Trans. Algorithms, 2019)

On the parameterized complexity of [1, j]-domination problems. - Mohsen Alambardar Meybodi; Fedor V. Fomin; Amer E. Mouawad; Fahad Panolan (Theor. Comput. Sci., 2020)

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. - Valentin Bartier; Nicolas Bousquet 001; Clément Dallard; Kyle Lomer; Amer E. Mouawad (Algorithmica, 2021)

Bisection of bounded treewidth graphs by convolutions. - Eduard Eiben; Daniel Lokshtanov; Amer E. Mouawad (J. Comput. Syst. Sci., 2021)

Parallel Vertex Cover Algorithms on GPUs. - Peter Yamout; Karim Barada; Adnan Jaljuli; Amer E. Mouawad; Izzat El Hajj (IPDPS, 2022)

Combinatorial and Algorithmic Aspects of Monadic Stability. - Jan Dreier; Nikolas Mählmann; Amer E. Mouawad; Sebastian Siebertz; Alexandre Vigny (ISAAC, 2022)

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. - Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz (Algorithmica, 2022)

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (CoRR, 2022)

On Solution Discovery via Reconfiguration. - Michael R. Fellows; Mario Grobler; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Frances A. Rosamond; Daniel Schmand; Sebastian Siebertz (ECAI, 2023)

Galactic token sliding. - Valentin Bartier; Nicolas Bousquet 001; Amer E. Mouawad (J. Comput. Syst. Sci., 2023)

A Framework to Maximize Group Fairness for Workers on Online Labor Platforms. - Anis El Rabaa; Shady Elbassuoni; Jihad Hanna; Amer E. Mouawad; Ayham Olleik; Sihem Amer-Yahia (Data Sci. Eng., 2023)

Solution Discovery via Reconfiguration for Problems in P. - Mario Grobler; Stephanie Maaz; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Daniel Schmand; Sebastian Siebertz (ICALP, 2024)

Kernelization Complexity of Solution Discovery Problems. - Mario Grobler; Stephanie Maaz; Amer E. Mouawad; Naomi Nishimura; Vijayaragunathan Ramamoorthi; Sebastian Siebertz (ISAAC, 2024)

Parameterized Shortest Path Reconfiguration. - Nicolas Bousquet 001; Kshitij Gajjar; Abhiruk Lahiri; Amer E. Mouawad (IPEC, 2024)

A survey on the parameterized complexity of reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (Comput. Sci. Rev., 2024)

Minimum separator reconfiguration. - Guilherme C. M. Gomes; Clément Legrand-Duchesne; Reem Mahmoud; Amer E. Mouawad; Yoshio Okamoto; Vinícius Fernandes dos Santos; Tom C. van der Zanden (J. Comput. Syst. Sci., 2024)

Token Sliding on Graphs of Girth Five. - Valentin Bartier; Nicolas Bousquet 001; Jihad Hanna; Amer E. Mouawad; Sebastian Siebertz (Algorithmica, 2024)

Parameterized Complexity of Reconfiguration of Atoms. - Alexandre Cooper; Stephanie Maaz; Amer E. Mouawad; Naomi Nishimura (Algorithmica, 2024)

On finding short reconfiguration sequences between independent sets. - Akanksha Agrawal 001; Soumita Hait; Amer E. Mouawad (J. Comput. Syst. Sci., 2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration. - Nicolas Bousquet 001; Quentin Deschamps; Arnaud Mary; Amer E. Mouawad; Théo Pierron (CoRR, 2025)

Data reduction for directed feedback vertex set on graphs without long induced cycles. - Jona Dirks; Enna Gerhard; Mario Grobler; Amer E. Mouawad; Sebastian Siebertz (Acta Informatica, 2025)