default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmer E. Mouawad
Person information
- affiliation: American University of Beirut, Lebanon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j23]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On finding short reconfiguration sequences between independent sets. J. Comput. Syst. Sci. 147: 103578 (2025)- 2024
- [j22]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. Algorithmica 86(2): 638-655 (2024) - [j21]Nicolas Bousquet, Amer E. Mouawad
, Naomi Nishimura, Sebastian Siebertz:
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53: 100663 (2024) - [j20]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:
Minimum separator reconfiguration. J. Comput. Syst. Sci. 146: 103574 (2024) - [c36]Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz:
Solution Discovery via Reconfiguration for Problems in P. ICALP 2024: 76:1-76:20 - [c35]Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz:
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles. SOFSEM 2024: 183-197 - [i28]Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. CoRR abs/2406.12717 (2024) - 2023
- [j19]Anis El Rabaa, Shady Elbassuoni, Jihad Hanna, Amer E. Mouawad, Ayham Olleik, Sihem Amer-Yahia:
A Framework to Maximize Group Fairness for Workers on Online Labor Platforms. Data Sci. Eng. 8(2): 146-176 (2023) - [j18]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic token sliding. J. Comput. Syst. Sci. 136: 220-248 (2023) - [c34]Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz:
On Solution Discovery via Reconfiguration. ECAI 2023: 700-707 - [c33]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:
Minimum Separator Reconfiguration. IPEC 2023: 9:1-9:12 - [i27]Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz:
On Solution Discovery via Reconfiguration. CoRR abs/2304.14295 (2023) - [i26]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:
Minimum Separator Reconfiguration. CoRR abs/2307.07782 (2023) - [i25]Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz:
Data reduction for directed feedback vertex set on graphs without long induced cycles. CoRR abs/2308.15900 (2023) - [i24]Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz:
Solution discovery via reconfiguration for problems in P. CoRR abs/2311.13478 (2023) - 2022
- [j17]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84(2): 482-509 (2022) - [c32]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. ESA 2022: 15:1-15:14 - [c31]Peter Yamout, Karim Barada, Adnan Jaljuli, Amer E. Mouawad, Izzat El Hajj:
Parallel Vertex Cover Algorithms on GPUs. IPDPS 2022: 201-211 - [c30]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC 2022: 11:1-11:17 - [c29]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On Finding Short Reconfiguration Sequences Between Independent Sets. ISAAC 2022: 39:1-39:14 - [c28]Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. WALCOM 2022: 263-274 - [c27]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. WG 2022: 56-69 - [i23]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. CoRR abs/2204.05549 (2022) - [i22]Peter Yamout, Karim Barada, Adnan Jaljuli, Amer E. Mouawad, Izzat El Hajj:
Parallel Vertex Cover Algorithms on GPUs. CoRR abs/2204.10402 (2022) - [i21]Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz:
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. CoRR abs/2204.10526 (2022) - [i20]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token sliding on graphs of girth five. CoRR abs/2205.01009 (2022) - [i19]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR abs/2206.14509 (2022) - [i18]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On finding short reconfiguration sequences between independent sets. CoRR abs/2209.05145 (2022) - 2021
- [j16]Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad:
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. Algorithmica 83(9): 2914-2951 (2021) - [j15]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. 119: 125-132 (2021) - [i17]Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized complexity of reconfiguration of atoms. CoRR abs/2107.12267 (2021) - 2020
- [j14]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020) - [c26]Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad:
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ISAAC 2020: 44:1-44:17 - [c25]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC 2020: 24:1-24:15 - [i16]Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad:
On girth and the parameterized complexity of token sliding and token jumping. CoRR abs/2007.01673 (2020)
2010 – 2019
- 2019
- [j13]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. 33(3): 1194-1215 (2019) - [j12]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33(3): 1743-1771 (2019) - [j11]Daniel Lokshtanov, Amer E. Mouawad:
The Complexity of Independent Set Reconfiguration on Bipartite Graphs. ACM Trans. Algorithms 15(1): 7:1-7:19 (2019) - [c24]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of Bounded Treewidth Graphs by Convolutions. ESA 2019: 42:1-42:11 - [i15]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR abs/1910.00581 (2019) - 2018
- [j10]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz:
Vertex Cover Reconfiguration and Beyond. Algorithms 11(2): 20 (2018) - [j9]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j8]Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32(3): 1619-1643 (2018) - [j7]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory 10(4): 18:1-18:25 (2018) - [c23]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS 2018: 34:1-34:14 - [c22]Daniel Lokshtanov, Amer E. Mouawad:
The complexity of independent set reconfiguration on bipartite graphs. SODA 2018: 185-195 - [c21]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS 2018: 29:1-29:15 - 2017
- [j6]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. Algorithmica 78(1): 274-297 (2017) - [j5]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. SIAM J. Discret. Math. 31(3): 2185-2200 (2017) - [c20]Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - [c19]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. ICALP 2017: 71:1-71:15 - [c18]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad:
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. WG 2017: 32-44 - [i14]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR abs/1706.09339 (2017) - [i13]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdős-Pósa. CoRR abs/1707.01037 (2017) - [i12]Daniel Lokshtanov, Amer E. Mouawad:
The complexity of independent set reconfiguration on bipartite graphs. CoRR abs/1707.02638 (2017) - 2016
- [j4]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of dominating sets. J. Comb. Optim. 32(4): 1182-1195 (2016) - [j3]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651: 37-49 (2016) - [c17]Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - [c16]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS 2016: 7:1-7:15 - 2015
- [j2]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
On scalable parallel recursive backtracking. J. Parallel Distributed Comput. 84: 65-75 (2015) - [c15]Faisal N. Abu-Khzam, Amer E. Mouawad, Karim A. Jahed:
Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach. CLUSTER 2015: 518 - [c14]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) 2015: 985-996 - [c13]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [c12]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on Sparse Graphs. WADS 2015: 506-517 - [i11]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. CoRR abs/1502.04803 (2015) - [i10]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015) - [i9]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR abs/1510.01557 (2015) - 2014
- [c11]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of Dominating Sets. COCOON 2014: 405-416 - [c10]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. ISAAC 2014: 452-463 - [c9]Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC 2014: 110-121 - [c8]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over Tree Decompositions. IPEC 2014: 246-257 - [i8]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of Dominating Sets. CoRR abs/1401.5714 (2014) - [i7]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. CoRR abs/1402.4926 (2014) - [i6]Paul S. Bonsma, Amer E. Mouawad:
The Complexity of Bounded Length Graph Recoloring. CoRR abs/1404.0337 (2014) - [i5]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR abs/1404.3801 (2014) - [i4]Faisal N. Abu-Khzam, Karim A. Jahed, Amer E. Mouawad:
A Hybrid Graph Representation for Exact Graph Algorithms. CoRR abs/1404.6399 (2014) - [i3]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over tree decompositions. CoRR abs/1405.2447 (2014) - 2013
- [c7]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. IPEC 2013: 281-294 - [i2]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. CoRR abs/1308.2409 (2013) - [i1]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. CoRR abs/1312.7626 (2013) - 2012
- [c6]Faisal N. Abu-Khzam, Amer E. Mouawad:
A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization. PDCAT 2012: 173-178 - 2011
- [j1]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3): 252-262 (2011) - [c5]Amer E. Mouawad, Nashat Mansour:
Parallel genetic algorithm for disease-gene association. ICNC 2011: 2215-2219 - 2010
- [c4]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An Exact Algorithm for Connected Red-Blue Dominating Set. CIAC 2010: 25-36 - [c3]Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan:
A Hybrid Graph Representation for Recursive Backtracking Algorithms. FAW 2010: 136-147 - [c2]Amer E. Mouawad, Sanaa Sharafeddine:
Collaborative content distribution over wireless networks with minimized end-to-end distribution delays. ICT 2010: 589-593 - [c1]Amer E. Mouawad, Sanaa Sharafeddine:
On hierarchical collaborative content distribution over communication networks. ICT 2010: 628-633
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
