<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div dir="ltr" class=""><div class="gmail_quote"><br class=""><br class=""><div dir="ltr" class=""><p align="center" style="margin:0cm 0cm 12pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:center" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">CALL FOR PAPERS</span></b><span style="font-family:Arial,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></p><p align="center" style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:center" class=""><span style="margin:0px" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class=""><span class="">QuantOpt</span></span></b></span><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">@GECCO-2023</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p align="center" style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:center" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">2<sup class="">nd</sup> Workshop on </span></b><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Quantum Optimization</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p align="center" style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:center" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">Genetic and Evolutionary Computation Conference (GECCO'23)</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p align="center" style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:center" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">Lisbon, Portugal, July 15-19, 2023</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p align="center" style="margin:0cm 0cm 12pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:center" class=""><b class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class="">Paper Submission Deadline: April 14, 2023</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class="">Scope</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Quantum computers are rapidly becoming more powerful and increasingly applicable to solve problems in the real world. They have the potential to solve extremely hard computational problems, which are currently intractable by conventional computers. Quantum optimization is an emerging field that focuses on using quantum computing technologies to solve hard optimization problems.</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">There are two main types of quantum computers: quantum annealers and gate-based quantum computers. Quantum annealers are specially tailored to solve combinatorial optimization problems. They find (near) optimal solutions via quantum annealing, which is similar to traditional simulated annealing, and use quantum tunnelling phenomena to provide a faster mechanism for moving between states and faster processing. On the other hand, gate-based quantum computers are universal and can perform general purpose calculations. These computers can be used to solve combinatorial optimization problems using the quantum approximate optimization algorithm and quantum search algorithms. </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Quantum computing has also given rise to quantum-inspired computers and algorithms. Quantum-inspired computers use dedicated hardware technology to emulate/simulate quantum computers. Quantum-inspired optimization algorithms use classical computers to simulate some physical phenomena such as superposition and entanglement to perform quantum computations, in an attempt to retain some of its benefit in conventional hardware when searching for solutions.</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">To solve optimization problems on a quantum computer, we need to reformulate them in a format suitable for the quantum hardware, in terms of qubits, biases and couplings between qubits. In mathematical terms, this requirement translates to reformulating the optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. This is closely related to the renowned Ising model. It constitutes a universal class, since all combinatorial optimization problems can be formulated as QUBOs. In practice, some classes of optimization problems can be naturally mapped to a QUBO, whereas others are much more challenging to map.</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><div style="margin: 0cm 0cm 8pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; text-align: justify;" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class=""> </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span><br class="webkit-block-placeholder"></div><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class="">Content</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">The aim of the workshop is to provide a forum for both scientific presentations and discussion of issues related to quantum optimization. As the algorithms that quantum computers use for optimization can be regarded as general types of randomized search heuristics, there are potentially great research benefits and synergy to bringing together the communities of quantum computing and randomized search heuristics. </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">The workshop aims to be as inclusive as possible and welcomes contributions from all areas broadly related to quantum optimization – by researchers from both academia and industry.</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><div style="margin: 0cm 0cm 8pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif;" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span><br class="webkit-block-placeholder"></div><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Particular topics of interest include, but are not limited to: </span><span style="font-family:"Calibri Light",sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Formulation of optimization problems as QUBOs (including handling of non-binary representations and constraints)</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Fitness landscape analysis of QUBOs</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Novel search algorithms to solve QUBOs</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Experimental comparisons on QUBO benchmarks </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Theoretical analysis of search algorithms for QUBOs </span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Speed-up experiments on traditional hardware vs quantum(-inspired) hardware</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Decomposition of optimization problems for quantum hardware</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Application of the quantum approximate optimization algorithm</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Application of Grover's algorithm to solve optimization problems</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Novel quantum-inspired optimization algorithms</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Optimization/discovery of quantum circuits</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Quantum optimization for machine learning problems</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Optical Annealing</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Dealing with noise in quantum computing</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="font-size:10pt;font-family:Symbol;margin:0px" class="">·</span><span style="font-size:7pt;margin:0px" class=""> </span><span style="font-family:"Calibri Light",sans-serif;margin:0px" class="">Quantum Gates’ optimization, Quantum Coherent Control</span><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="margin:0px;color:rgb(34,34,34)" class="">All accepted papers of this workshop will be included in the Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'23) Companion Volume. </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class=""> </span></b></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class="">Key Dates<br class=""></span></b><span style="margin:0px;color:rgb(34,34,34)" class="">Submission Opening: February 13, 2023<br class=""><b class="">Paper Submission Deadline: April 14, 2023</b><br class="">Notification of Acceptance: May 3, 2023<br class="">Camera-Ready Copy Due: May 10, 2023<br class="">Author Registration: May 10, 2023<br class="">Conference Presentation: 15 July 2023 to 19 July 2023 </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class=""> </span></b></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class="">Instructions for Authors</span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif" class=""><span style="margin:0px;color:rgb(34,34,34)" class="">We invite submissions of two types of paper: </span></p><div style="margin: 0cm 0cm 0.0001pt 18pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Regular papers (limit 8 pages) </span></div><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;line-height:11.75pt" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Short papers (limit 4 pages) </span></p><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:justify" class=""><span style="margin:0px;color:rgb(34,34,34)" class="">Papers should present original work that meets the high-quality standards of GECCO. Each paper will be rigorously evaluated in a review process. Accepted papers appear in the ACM digital library as part of the Companion Proceedings of GECCO. Each paper accepted needs to have at least one author registered by the author registration deadline. Papers must be submitted via the online submission system </span><a href="https://ssl.linklings.net/conferences/gecco/" rel="noopener noreferrer" style="margin:0px" target="_blank" class=""><span style="margin:0px" class="">https://ssl.linklings.net/conferences/gecco/</span></a><span style="margin:0px;color:rgb(34,34,34)" class="">. Please refer to </span><a href="https://gecco-2022.sigevo.org/Paper-Submission-Instructions" rel="noopener noreferrer" style="margin:0px" target="_blank" class=""><span style="margin:0px" class="">https://gecco-2022.sigevo.org/Paper-Submission-Instructions</span></a><span style="margin:0px;color:rgb(34,34,34)" class=""> for more detailed instructions. </span></p><div style="margin: 0cm 0cm 8pt; color: rgb(0, 0, 0); font-size: 12pt; line-height: 11.75pt; font-family: "Times New Roman", serif; text-align: justify;" class=""><span style="margin:0px;color:rgb(34,34,34)" class=""> </span><br class="webkit-block-placeholder"></div><p style="margin:0cm 0cm 8pt;color:rgb(0,0,0);font-size:12pt;line-height:11.75pt;font-family:"Times New Roman",serif;text-align:justify" class=""><b class=""><span style="font-family:Arial,sans-serif;margin:0px" class="">Workshop Chairs </span></b><span style="margin:0px;color:rgb(34,34,34)" class=""> </span></p><div style="margin: 0cm 0cm 0.0001pt 18pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Alberto Moraglio, University of Exeter, UK, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px" class=""><a href="mailto:a.moraglio@exeter.ac.uk" target="_blank" class="">a.moraglio@exeter.ac.uk</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></div><div style="margin: 0cm 0cm 0.0001pt 18pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Mayowa Ayodele, Fujitsu Laboratories of Europe, UK, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px" class=""><a href="mailto:mayowa.ayodele@fujitsu.com" target="_blank" class="">mayowa.ayodele@fujitsu.com</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></div><div style="margin: 0cm 0cm 0.0001pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; text-indent: 18pt; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Francisco Chicano, University of Malaga, Spain, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px" class=""><a href="mailto:chicano@lcc.uma.es" target="_blank" class="">chicano@lcc.uma.es</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></div><div style="margin: 0cm 0cm 0.0001pt 18pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Oleksandr Kyriienko, University of Exeter, UK, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px" class=""><a href="mailto:o.kyriienko@exeter.ac.uk" target="_blank" class="">o.kyriienko@exeter.ac.uk</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></div><div style="margin: 0cm 0cm 0.0001pt 18pt; color: rgb(0, 0, 0); font-size: 12pt; font-family: "Times New Roman", serif; line-height: 11.75pt;" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Ofer Shir, Tel-Hai College and Migal Institute, Israel, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(17,85,204)" class=""><a href="mailto:ofersh@telhai.ac.il" target="_blank" class="">ofersh@telhai.ac.il</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></div><p style="margin:0cm 0cm 8pt 18pt;color:rgb(0,0,0);font-size:12pt;font-family:"Times New Roman",serif;line-height:11.75pt" class=""><span style="font-size:11pt;font-family:Symbol;margin:0px;color:rgb(34,34,34)" class="">·</span><span style="font-size:7pt;margin:0px;color:rgb(34,34,34)" class=""> </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class="">Lee Spector, Amherst College, USA, </span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px" class=""><a href="mailto:lspector@amherst.edu" target="_blank" class="">lspector@amherst.edu</a></span><span style="font-size:11pt;font-family:Calibri,sans-serif;margin:0px;color:rgb(34,34,34)" class=""> </span></p><div style="margin: 0cm 0cm 8pt; color: rgb(0, 0, 0); font-size: 12pt; line-height: 11.75pt; font-family: "Times New Roman", serif;" class=""><span style="margin:0px;color:rgb(34,34,34)" class=""> </span> </div></div></div></div><div class=""><br class="Apple-interchange-newline">
</div>
<br class=""></body></html>