Christos Karatzas

Refinement-Derived Algebraic Computation of Graph Automorphism Groups

We compute the automorphism group of a graph exactly, with a verified generatingset. Inside each class of an invariant colouring, individualisation and refinement yielda permutation group TC that contains the restriction of every automorphism; a normalseries of these groups turns...

Refinement-Derived Algebraic Computation of Graph Automorphism Groups

We compute the automorphism group of a graph exactly, with a verified generatingset. Inside each class of an invariant colouring, individualisation and refinement yielda permutation group TC that contains the restriction of every automorphism; a normalseries of these groups turns...

Orbit Computation by Satisfiability: Structural Invariants and their Boundaries

We compute vertex orbits exactly by reducing the problem to pairwise satisfiability queries,with a checked witness in the satisfiable direction and encoding-based certification in the un-satisfiable one. Each query is constructed so that its models are exactly the automorphismsma...

Transforming viticulture through genomic innovation and integrated pest management for sustainable grape production

Abstract Climate change and intensifying disease pressure push viticulture beyond incremental adaptation, especially where grape production depends on repeated pesticide applications. Reducing chemical inputs requires an integrated strategy combining broader genetic diversity, co...