Amer E. Mouawad

Orcid: 0000-0003-2481-4968

Affiliations:
  • American University of Beirut, Lebanon


According to our database1, Amer E. Mouawad authored at least 48 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On finding short reconfiguration sequences between independent sets.
J. Comput. Syst. Sci., 2025

2024
Parameterized Complexity of Reconfiguration of Atoms.
Algorithmica, October, 2024

Token Sliding on Graphs of Girth Five.
Algorithmica, February, 2024

Minimum separator reconfiguration.
J. Comput. Syst. Sci., 2024

A survey on the parameterized complexity of reconfiguration problems.
Comput. Sci. Rev., 2024

Kernelization Complexity of Solution Discovery Problems.
CoRR, 2024

Parameterized Shortest Path Reconfiguration.
CoRR, 2024

Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Solution Discovery via Reconfiguration for Problems in P.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
A Framework to Maximize Group Fairness for Workers on Online Labor Platforms.
Data Sci. Eng., June, 2023

Galactic token sliding.
J. Comput. Syst. Sci., 2023

On Solution Discovery via Reconfiguration.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems.
CoRR, 2022

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.
Algorithmica, 2022

Combinatorial and Algorithmic Aspects of Monadic Stability.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Parallel Vertex Cover Algorithms on GPUs.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
Bisection of bounded treewidth graphs by convolutions.
J. Comput. Syst. Sci., 2021

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.
Algorithmica, 2021

2020
On the parameterized complexity of [1, <i>j</i>]-domination problems.
Theor. Comput. Sci., 2020

2019
The Complexity of Independent Set Reconfiguration on Bipartite Graphs.
ACM Trans. Algorithms, 2019

Packing Cycles Faster Than Erdos-Posa.
SIAM J. Discret. Math., 2019

Lossy Kernels for Connected Dominating Set on Sparse Graphs.
SIAM J. Discret. Math., 2019

2018
Simultaneous Feedback Vertex Set: A Parameterized Perspective.
ACM Trans. Comput. Theory, 2018

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
SIAM J. Discret. Math., 2018

Reconfiguration on sparse graphs.
J. Comput. Syst. Sci., 2018

Vertex Cover Reconfiguration and Beyond.
Algorithms, 2018

On the Parameterized Complexity of [1, j]-Domination Problems.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.
SIAM J. Discret. Math., 2017

Lossy Kernels for Connected Dominating Set on Sparse Graphs.
CoRR, 2017

On the Parameterized Complexity of Reconfiguration Problems.
Algorithmica, 2017

Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

On the Parameterized Complexity of Simultaneous Deletion Problems.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
The complexity of dominating set reconfiguration.
Theor. Comput. Sci., 2016

Reconfiguration of dominating sets.
J. Comb. Optim., 2016

2015
On scalable parallel recursive backtracking.
J. Parallel Distributed Comput., 2015

Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach.
Proceedings of the 2015 IEEE International Conference on Cluster Computing, 2015

2014
The Complexity of Bounded Length Graph Recoloring.
CoRR, 2014

A Hybrid Graph Representation for Exact Graph Algorithms.
CoRR, 2014

Reconfiguration over Tree Decompositions.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Vertex Cover Reconfiguration and Beyond.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking.
CoRR, 2013

2012
A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

2011
An exact algorithm for connected red-blue dominating set.
J. Discrete Algorithms, 2011

Parallel genetic algorithm for disease-gene association.
Proceedings of the Seventh International Conference on Natural Computation, 2011

2010
On hierarchical collaborative content distribution over communication networks.
Proceedings of the 17th International Conference on Telecommunications, 2010

Collaborative content distribution over wireless networks with minimized end-to-end distribution delays.
Proceedings of the 17th International Conference on Telecommunications, 2010

A Hybrid Graph Representation for Recursive Backtracking Algorithms.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010


  Loading...