The field of Boolean circuits and graph computation models is witnessing significant developments, with a focus on improving the efficiency and scalability of algorithms. Researchers are exploring new approaches to solve complex problems, such as the range avoidance problem in Boolean circuits, using techniques like hypergraph theory and reconfigurable circuits. Additionally, there is a growing interest in developing tools and frameworks for simplifying Boolean circuits and optimizing graph queries. Recent studies have also investigated the representation of solution sets in factorised databases and knowledge compilation, leading to new bounds and dichotomies for join queries. Noteworthy papers in this area include: Range Avoidance in Boolean Circuits via Turan-type Bounds, which proposes a new approach to solving the range avoidance problem via hypergraphs. Simplifier: A New Tool for Boolean Circuit Simplification, which presents a new open-source tool for simplifying Boolean circuits. Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy, which studies the representation of the result of join queries in a useful yet succinct data structure.