Amer E. Mouawad

From MaRDI portal
Person:346506

Available identifiers

zbMath Open mouawad.amer-eMaRDI QIDQ346506

List of research outcomes





PublicationDate of PublicationType
On finding short reconfiguration sequences between independent sets2024-10-29Paper
Parameterized complexity of reconfiguration of atoms2024-10-24Paper
Minimum separator reconfiguration2024-10-08Paper
Combinatorial and algorithmic aspects of monadic stability2024-09-11Paper
On finding short reconfiguration sequences between independent sets2024-09-11Paper
Token sliding on graphs of girth five2024-01-25Paper
Solution discovery via reconfiguration for problems in P2023-11-22Paper
https://portal.mardi4nfdi.de/entity/Q60872162023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60896712023-11-13Paper
Minimum Separator Reconfiguration2023-07-15Paper
Galactic token sliding2023-06-12Paper
Token sliding on graphs of girth five2023-05-05Paper
On finding short reconfiguration sequences between independent sets2022-09-12Paper
On the Parameterized Complexity of [1,j]-Domination Problems2022-07-21Paper
Parameterized complexity of reconfiguration of atoms2022-07-13Paper
Combinatorial and Algorithmic Aspects of Monadic Stability2022-06-29Paper
https://portal.mardi4nfdi.de/entity/Q50757842022-05-11Paper
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems2022-04-22Paper
On the parameterized complexity of reconfiguration of connected dominating sets2022-03-25Paper
On girth and the parameterized complexity of token sliding and token jumping2021-09-02Paper
Bisection of bounded treewidth graphs by convolutions2021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q51362982020-11-25Paper
Lossy kernels for connected dominating set on sparse graphs2020-08-05Paper
Packing cycles faster than Erdős-Pósa2020-05-27Paper
On the parameterized complexity of \([1,j]\)-domination problems2019-12-27Paper
Simultaneous feedback vertex set: a parameterized perspective2019-12-16Paper
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets2019-10-01Paper
Lossy kernels for connected dominating set on sparse graphs2019-09-30Paper
Packing cycles faster than Erdős-Pósa2019-08-29Paper
The complexity of independent set reconfiguration on bipartite graphs2019-03-28Paper
Kernelization of cycle packing with relaxed disjointness constraints2018-07-18Paper
Reconfiguration on sparse graphs2018-05-08Paper
The complexity of independent set reconfiguration on bipartite graphs2018-03-15Paper
Simultaneous feedback vertex set: a parameterized perspective2018-01-24Paper
Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard2018-01-04Paper
Kernelization of cycle packing with relaxed disjointness constraints2017-12-19Paper
Shortest reconfiguration paths in the solution space of Boolean formulas2017-09-27Paper
On the parameterized complexity of reconfiguration problems2017-05-11Paper
The complexity of dominating set reconfiguration2017-03-16Paper
Reconfiguration of dominating sets2016-11-29Paper
The complexity of dominating set reconfiguration2015-10-30Paper
Reconfiguration on sparse graphs2015-10-30Paper
Shortest reconfiguration paths in the solution space of Boolean formulas2015-10-27Paper
The complexity of bounded length graph recoloring and CSP reconfiguration2015-09-15Paper
Reconfiguration over tree decompositions2015-09-15Paper
Vertex Cover Reconfiguration and Beyond2015-09-11Paper
Reconfiguration of dominating sets2014-09-26Paper
On the parameterized complexity of reconfiguration problems2013-12-10Paper
An exact algorithm for connected red-blue dominating set2011-08-23Paper
A hybrid graph representation for recursive backtracking algorithms2010-09-07Paper
An exact algorithm for connected red-blue dominating set2010-05-28Paper

Research outcomes over time

This page was built for person: Amer E. Mouawad