**33rd International Symposium on String Processing and Information Retrieval** **October 13-15, 2026, Hamilton, Canada** We warmly invite researchers, practitioners, and students to participate in the 33rd International Symposium on String Processing and Information Retrieval (SPIRE 2026), to be held at McMaster University in Hamilton, Canada, from October 13 to 15, 2026. Hamilton is located in Southern Ontario and offers convenient access to Toronto and Niagara Falls, providing attendees with opportunities to explore one of Canada's most vibrant regions. SPIRE is an international forum for the exchange of ideas and research results in string processing, information retrieval, data structures and algorithms, computational biology, text compression, pattern matching, and related areas. Since its inception in 1993, SPIRE has established itself as a premier venue for bringing together researchers from academia and industry to discuss advances in theory, methodology, and applications. **Keynote Speakers** SPIRE 2026 is pleased to feature keynote talks by: [-] Meng He, Dalhousie University, Canada: Succinct Data Structures for Distance Queries in Interval Graphs [-] Lila Kari, University of Waterloo, Canada: Short DNA Patterns Reveal Environmental Imprints in Extremophile Genomes [-] Tomasz Kociumaka, Max Planck Institute for Informatics, Germany: The Many Faces of Locally Consistent Parsing **Accepted Papers** The list of accepted papers can be found at: https://sites.google.com/view/spire-2026/accepted-papers?authuser=0 In addition to the accepted papers, SPIRE 2026 features a Best Paper Award, sponsored by Springer. **Workshop** SPIRE 2026 will be followed by the: 21st Workshop on Compression, Text, and Algorithms (WCTA 2026) October 16, 2026 WCTA 2026 is pleased to feature an invited talk by: [-] Ian Munro, Professor Emeritus, University of Waterloo, Canada Venue: McMaster University Hamilton, Ontario, Canada **Registration** The early registration fee (until September 7, 2026) is CAD $515 (student), CAD $645 (faculty/author/other). The late registration fee (from September 8, 2026 to October 3, 2026) is CAD $645 (student), CAD $800 (faculty/other). Other details, including travel, accommodation, and the conference program, are available on the conference website: https://sites.google.com/view/spire-2026/home?authuser=0 We look forward to welcoming you to Hamilton for SPIRE 2026. SPIRE 2026 Organizing Committee McMaster University, Canada ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************
Tuesday, September 1, 2026
[DMANET] ISMP 2027: Submission Platform Now Open
26th International Symposium on Mathematical Programming (ISMP 2027) Amsterdam, The Netherlands July 25-30, 2027 https://ismp2027.mathopt.nl/ The submission platform for the 26th International Symposium on Mathematical Programming (ISMP 2027) is now open! ISMP 2027 will be held at the RAI Convention Centre in Amsterdam, The Netherlands, from July 25-30, 2027. Held on behalf of the Mathematical Optimization Society, ISMP is a triennial conference bringing together scientists from around the world to present and discuss their latest advances and developments in mathematical programming. Plenary Speakers Daniel Bienstock, Columbia University Jim Luedtke, University of Wisconsin-Madison Thomas Rothvoss, University of Washington Katya Scheinberg, Georgia Tech Defeng Sun, The Hong Kong Polytechnic University Semi-Plenary Speakers David Applegate, Google NYC Nicolas Boumal, EPFL Rene Henrion, Weierstrass Institute Berlin Patrick Jaillet, MIT Rahul Mazumder, MIT Gonzalo Munoz, Universidad de Chile Vera Traub, ETH Zurich Madeleine Udell, Stanford University Laszlo Vegh, University of Bonn With a broad range of streams covering different areas of mathematical optimization, ISMP 2027 offers opportunities to present and exchange ideas across the field. We invite you to submit your work to ISMP 2027! The submission platform and submission guidelines are accessible via: https://ismp2027.mathopt.nl/registration/submission Important Dates January 15, 2027: Submission deadline contributed talks & Early bird registration opens March 15, 2027: Early bird registration deadline July 25, 2027: Conference starts Further information about ISMP 2027, including the full list of streams, can be found at: https://ismp2027.mathopt.nl/ We look forward to receiving your contributions and welcoming researchers and practitioners from around the world to Amsterdam for ISMP 2027. The ISMP 2027 Organizing Committee ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************
[DMANET] Liverpool Discrete Mathematics Colloquium – 8–9 September 2026
Dear all, The 3rd Liverpool Discrete Mathematics Colloquium (LDMC) will take place on 8–9 September 2026 at the University of Liverpool, UK. This year's colloquium focuses on the mathematically rigorous analysis of black-box AI and optimisation algorithms, with each day devoted to a different topic. Participants are very welcome to attend either day individually, or both days. Tuesday 8 September – Logical Aspects of Graph Neural Networks The first day will focus on the logical and mathematical foundations of Graph Neural Networks. Tutorial: Michael Benedikt (Oxford) and Tony Tan (Liverpool) - Logical Aspects of Graph Neural Networks Invited speakers: Carsten Lutz (Leipzig) Emily Jin (Oxford) Jonni Virtema (Glasgow) Wednesday 9 September – Stochastic Gradient Descent The second day will focus on the mathematical analysis of Stochastic Gradient Descent. Tutorial: Steffen Dereich (Münster) - Convergence of Stochastic Gradient Descent Invited speakers: Benjamin Dupuis (ENS Paris) Alex Mijatovic (Warwick) Sarah Sachs (Bristol) Each day will feature a two-hour tutorial, invited talks, and plenty of time for discussion and networking. The event is free of charge and open to all. Registration is required, and you may register for one day or for both days. Please register by 3rd of September so that we can make arrangements for coffee breaks and dinner. Further details and registration are available on the LDMC website: https://j-sylvester.github.io/LDMC26 The event is supported by: Heilbronn Institute for Mathematical Research/UKRI Applied Probability Trust University of Liverpool Many thanks, John Sylvester, Linglong Yuan & Viktor Zamaraev ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************
[DMANET] Postdoctoral position in measurable combinatorics – LoGloS project (Prague, Czechia)
Dear all, I would like to advertise a 3-year postdoctoral position in measurable combinatorics at Charles University in Prague, Czechia, starting in January 2027 (or later by agreement). The position is funded through the project LoGloS – Local and Global Structure in Measurable Combinatorics funded by the Czech Ministry of Education and Sports under the ERC CZ programme (1 September 2026 – 31 August 2031). The project lies at the interface of descriptive set theory, combinatorics, probability, dynamics, and theoretical computer science. Its aim is to develop a unified framework for studying structural, combinatorial, and algorithmic aspects of local problems on graphs, groups, and Euclidean spaces, in both discrete and continuous settings. Topics of particular interest include: countable Borel equivalence relations and combinatorics of Borel graphs, local algorithms, random processes, and measurable dynamics, distributed and randomized algorithms, continuous and discrete tilings, connections between descriptive combinatorics, probability, dynamics, and theoretical computer science. The position is open to candidates interested in any of these directions, broadly interpreted. Researchers with related backgrounds who would like to move into these areas are also very welcome to apply. Position details: 3-year fixed-term postdoctoral position Salary: 75,000 CZK/month Starting date: January 2027, or by agreement Generous travel budget Location: Charles University, Prague, Czechia More information about the project and the position can be found here: https://grebikj.github.io/LoGloS.html Interested candidates are encouraged to contact me at grebikj@gmail.com, attaching a CV and a short research statement describing their interests and potential fit with the project. Applications received by the beginning of October 2026 will receive full consideration, and I expect to make a decision in late October. Please feel free to forward this announcement to anyone who might be interested. Best regards, Jan Grebík Charles University Prague, Czechia ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************
Posts
