[DMANET] SOSA 2027: Second call for papers

=== SOSA27: Second call for Papers === Symposium on Simplicity in Algorithms (SOSA) is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems. Papers in all areas of algorithms research are sought. An ideal submission will advance our understanding of an algorithmic problem by, for example, introducing a simpler algorithm, presenting a simpler analysis of an existing algorithm, or offering insights that generally simplify our understanding of important algorithms or computational problems. We are especially interested in papers that make material more accessible to a wider audience, such as undergraduates, or for more specialized topics, general algorithms researchers. Submissions should contain novel ideas or attractive insights, but they are not required to prove novel theorems. That is, the results themselves can be known, but their presentation must be new. === Program Committee Co-Chairs === Gerth Stølting Brodal, Aarhus University, Denmark Michał Pilipczuk, University of Warsaw, Poland === Program Committee === Divesh Aggarwal, National University of Singapore, Singapore Georg Anegg, ETH Zurich, Switzerland Per Austrin, KTH Royal Institute of Technology, Sweden Ruben Becker, Ca’ Foscari University of Venice, Italy Sujoy Bhore, IIT Bombay, India and LSE, London, UK Édouard Bonnet, ENS Lyon, France Yixin Cao, Hong Kong Polytechnic University Karthik C. S., Rutgers University, US Radu Curticapean, University of Regensburg, Germany Yann Disser, TU Darmstadt, Germany Mordecai J. Golin, University of Massachusetts Amherst, US Ivor van der Hoog, IT University of Copenhagen, Denmark Ce Jin, UC Berkeley, US Linda Kleist, University of Hamburg, Germany Tuukka Korhonen, University of Copenhagen, Denmark Martin Koutecký, Charles University, Czech Republic Jason Li, Carnegie Mellon University, US Debmalya Panigrahi, Duke University, US Solon Pissis, The Cyprus Institute, Cyprus Kevin Pratt, Columbia University, US Lars Rohwedder, University of Southern Denmark, Odense, Denmark Rahul Santhanam, University of Oxford, UK Srinivasa Rao Satti, Norwegian University of Science and Technology, Norway Roohani Sharma, IBS, Daejeon, South Korea Nodari Sitchnava, University of Hawaii at Manoa, US Marek Sokołowski, MPI Saarbrucken, Germany Shay Solomon, Tel Aviv University, Israel Chaitanya Swamy, University of Waterloo, Canada Laura Vargas Koch, RWTH Aachen University, Germany László Végh, University of Bonn, Germany David Wajc, Technion, Israel Sebastian Wild, University of Marburg, Germany Karol Węgrzycki, MPI Saarbrucken, Germany Kewen Wu, Institute for Advanced Study and Caltech, US Jie Xue, NYU Shanghai, China === Submissions and Deadlines === Submission deadline: August 6, 2026, 11:59 p.m. Anywhere on Earth Submission site: https://sosa27.hotcrp.com/ Notification: early October 2026 Publication of proceedings: early 2027 Submission Instructions: Authors must submit their papers electronically, in PDF format. Submissions should begin with a title page containing the paper title, author information, and an abstract summarizing the contributions of the paper. There is no page limit. The paper should begin with a clear description of the algorithmic problem to be solved, a survey of prior work on the problem, including a candid assessment of prior work in terms of simplicity and elegance, and a discussion of the contributions of the paper. The body of the paper should be written for a general theoretical computer science audience and substantiate the main claims of the paper with full proofs. The submission should be typeset using 11-point font, in a single-column format with ample spacing throughout and ample margins all around. The submissions ought to be visually easy to read. PC Member Submissions: Submissions authored or co-authored by PC members (other than the PC chairs) are allowed. === Mihai Pătrașcu Best Paper Award === The SOSA Best Paper award is now known as the Mihai Pătrașcu Best Paper Award, named in honor of the algorithms researcher Mihai Pătrașcu, who passed before his time in 2012. Mihai was renowned for his brilliance and ability to solve long standing algorithmic problems. His work was distinguished by its insightfulness and simplicity of design. The program committee may give the Mihai Pătrașcu Best Paper Award to one or more papers. All submissions will be considered. ********************************************************** * * 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/ * **********************************************************