The field of graph theory and complexity is experiencing significant developments, with a focus on resolving long-standing conjectures and establishing new hardness results. Researchers are exploring various variants of classic problems, such as eternal domination and disjoint paths, and investigating their complexity in different graph classes. Notably, studies have shown that certain problems remain hard even in restricted settings, such as acyclic digraphs or sparse graphs. Innovative techniques and approaches are being introduced to tackle these challenges. Some papers are particularly noteworthy, including one that strengthens existing hardness results for the directed disjoint paths problem with congestion, and another that establishes W[2]-hardness for dominating set reconfiguration on sparse graphs. These findings contribute to a deeper understanding of the fundamental limits of computational problems and inform the development of efficient algorithms.