{"id":20,"date":"2020-02-24T13:31:08","date_gmt":"2020-02-24T13:31:08","guid":{"rendered":"http:\/\/easyconferences.eu\/ciac2021\/?page_id=20"},"modified":"2024-11-11T15:32:37","modified_gmt":"2024-11-11T15:32:37","slug":"call-for-papers","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2025\/call-for-papers\/","title":{"rendered":"Call for Papers"},"content":{"rendered":"<p>[et_pb_section fb_built=&#8221;1&#8243; _builder_version=&#8221;4.18.0&#8243; top_divider_style=&#8221;wave2&#8243; top_divider_color=&#8221;#5390c1&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_row _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_text _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;]<\/p>\n<h1 style=\"text-align: center;\">Call for Papers<\/h1>\n<p>[\/et_pb_text][et_pb_divider color=&#8221;#e09900&#8243; _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=&#8221;4.18.0&#8243; _module_preset=&#8221;default&#8221; custom_padding=&#8221;4px|||||&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.18.0&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_text _builder_version=&#8221;4.27.3&#8243; _module_preset=&#8221;default&#8221; hover_enabled=&#8221;0&#8243; global_colors_info=&#8221;{}&#8221; sticky_enabled=&#8221;0&#8243;]<\/p>\n<p><span style=\"font-weight: 400;\">The 14th International Symposium on Algorithms and Complexity (CIAC 2025) is scheduled to take place from June 10 to June 12, 2025, at LUISS University, Rome, Italy.<\/span><\/p>\n<h3><b>Important Dates<\/b><\/h3>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Deadline for submissions: <span style=\"text-decoration: line-through;\">November 15, 2024<\/span> (AoE) &#8211; <strong><em>extended November 22, 2024<\/em><\/strong><\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Author notification: January 31, 2025<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Camera-ready due: February 14, 2025<\/span><\/li>\n<\/ul>\n<p><b>Submission site:<\/b><a href=\"https:\/\/easychair.org\/conferences\/?conf=ciac2025\" target=\"_blank\" rel=\"noopener\"> <span style=\"font-weight: 400;\">https:\/\/easychair.org\/conferences\/?conf=ciac2025<\/span><\/a><\/p>\n<h3><b>Topics<\/b><\/h3>\n<p><span style=\"font-weight: 400;\">Authors are invited to submit papers presenting original and unpublished research on algorithms and complexity. Typical areas include:<\/span><\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithm design and analysis<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">sequential, parallel, and distributed algorithms<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">data structures<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">computational and structural complexity<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">lower bounds and limitations of algorithms<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">randomized and approximation algorithms<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">parameterized algorithms and parameterized complexity classes<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">smoothed analysis of algorithms<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions)<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">on-line computation and competitive analysis<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">streaming algorithms<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">quantum algorithms and complexity<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithms in algebra, geometry, number theory and combinatorics<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">computational geometry<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithmic game theory and mechanism design<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithmic economics (including auctions and contests)<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">computational learning theory<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">computational biology and bioinformatics<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithmic issues in communication networks<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithms for discrete optimization (including convex optimization)<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">algorithm engineering<\/span><\/li>\n<\/ul>\n<h3><b>Paper Submission and Proceedings<\/b><\/h3>\n<p><span style=\"font-weight: 400;\">Authors are invited to submit an extended abstract or full paper with at most 15 pages, excluding the title page and the references. The title page consists of the title of the paper and the abstract. The first section of the paper should start on the next page.<\/span><\/p>\n<p>The usage of the LNCS style file is mandatory. LNCS templates are available here: <a href=\"https:\/\/www.springer.com\/gp\/computer-science\/lncs\/conference-proceedings-guidelines\" data-auth=\"NotApplicable\" data-linkindex=\"1\">https:\/\/www.springer.com\/gp\/computer-science\/lncs\/conference-proceedings-guidelines<\/a>. No changes to font size, page geometry, etc. are permitted. Submissions should be anonymized according to the double-blind review policy<span style=\"font-weight: 400;\">. Late submissions and submissions not in the correct format will not be considered.\u00a0<\/span><\/p>\n<p><span style=\"font-weight: 400;\">Submissions will be through EasyChair (<\/span><a href=\"https:\/\/easychair.org\/conferences\/?conf=ciac2025\" target=\"_blank\" rel=\"noopener\"><span style=\"font-weight: 400;\">https:\/\/easychair.org\/conferences\/?conf=ciac2025<\/span><\/a><span style=\"font-weight: 400;\">)<\/span><\/p>\n<p><span style=\"font-weight: 400;\">The paper should contain a succinct statement of the issues and their motivation, a summary of the results, a brief explanation of their significance, and a comparison to related work, accessible to non-specialists. Proofs omitted due to space constraints must be put into an appendix, to be read by the PC members at their discretion.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">Simultaneous submission to other conferences with published proceedings or to journals is not allowed.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">At least one author of each accepted paper will have to register for the conference. For authors who cannot present their paper in person for a significant reason, the possibility of remote presentation may be offered.<\/span><\/p>\n<h3><b>Double-Blind Reviewing<\/b><\/h3>\n<p><span style=\"font-weight: 400;\">CIAC 2025 will implement a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way; in particular, authors\u2019 names, affiliations, and email addresses should not appear at the beginning or in the body of the submission.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would (e.g., making early drafts available on their webpage, or through pre-print dissemination websites such as arXiv).<\/span><\/p>\n<p><span style=\"font-weight: 400;\">When submitting a paper, please indicate Conflict of Interest (CoI) with PC members.<\/span><\/p>\n<h3><b>PC Submissions<\/b><\/h3>\n<p><span style=\"font-weight: 400;\">Submissions authored or co-authored by (non-chair) members of the program committee are allowed.<\/span><\/p>\n<h3><b>Proceedings<\/b><\/h3>\n<p>Accepted papers will be published in the proceedings of the symposium. As in previous editions,\u00a0 the proceedings will be published as a volume in Springer LNCS.<\/p>\n<h3><b>Best Paper Award<\/b><\/h3>\n<p>Two selected papers will receive the Best Paper Award, sponsored by Springer.<b><\/b><\/p>\n<h3><b>Contact Information<\/b><\/h3>\n<p><span style=\"font-weight: 400;\">All questions about submissions should be emailed to Loukas Georgiadis at <\/span><a href=\"mailto:loukas@uoi.gr\"><span style=\"font-weight: 400;\">loukas@uoi.gr<\/span><\/a><\/p>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Call for PapersThe 14th International Symposium on Algorithms and Complexity (CIAC 2025) is scheduled to take place from June 10 to June 12, 2025, at LUISS University, Rome, Italy. Important Dates Deadline for submissions: November 15, 2024 (AoE) &#8211; extended November 22, 2024 Author notification: January 31, 2025 Camera-ready due: February 14, 2025 Submission site: [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-20","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/20"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/comments?post=20"}],"version-history":[{"count":27,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/20\/revisions"}],"predecessor-version":[{"id":243809,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/20\/revisions\/243809"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/media?parent=20"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}