{"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":"2021-03-09T07:42:19","modified_gmt":"2021-03-09T07:42:19","slug":"call-for-papers","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2021\/call-for-papers\/","title":{"rendered":"Call for Papers"},"content":{"rendered":"<p>[et_pb_section fb_built=&#8221;1&#8243; _builder_version=&#8221;4.3.3&#8243; top_divider_style=&#8221;wave2&#8243; top_divider_color=&#8221;#e09900&#8243;][et_pb_row _builder_version=&#8221;4.3.3&#8243;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.3.3&#8243;][et_pb_text _builder_version=&#8221;4.3.3&#8243;]<\/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.3.3&#8243;][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=&#8221;4.3.3&#8243; custom_margin=&#8221;-15px|auto||auto||&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.3.3&#8243;][et_pb_button button_url=&#8221;http:\/\/easyconferences.eu\/ciac2021\/wp-content\/uploads\/2020\/10\/CIAC2021_CfP_20102020.pdf&#8221; button_text=&#8221;Download the CFP as a PDF&#8221; button_alignment=&#8221;center&#8221; _builder_version=&#8221;4.3.3&#8243; custom_margin=&#8221;||2px|||&#8221;][\/et_pb_button][et_pb_text _builder_version=&#8221;4.3.3&#8243; hover_enabled=&#8221;0&#8243;]<\/p>\n<p style=\"text-align: center;\">Updated: 9 Mar, 2021<\/p>\n<p>[\/et_pb_text][et_pb_text _builder_version=&#8221;4.3.3&#8243; hover_enabled=&#8221;0&#8243;]<\/p>\n<h3 style=\"text-align: justify;\"><strong>Aims and Scope<\/strong><\/h3>\n<p style=\"text-align: justify;\">The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.<\/p>\n<h3 style=\"text-align: justify;\"><strong>Topics<\/strong><\/h3>\n<p style=\"text-align: justify;\">Papers presenting original research in the areas of algorithms and complexity are sought, including (but not limited to):<\/p>\n<ul style=\"text-align: justify;\">\n<li>sequential, parallel and distributed algorithms and data structures<\/li>\n<li>approximation and randomized algorithms<\/li>\n<li>graph algorithms and graph drawing<\/li>\n<li>on-line and streaming algorithms<\/li>\n<li>analysis of algorithms and computational complexity<\/li>\n<li>algorithm engineering<\/li>\n<li>web algorithms<\/li>\n<li>exact and parameterized computation<\/li>\n<li>algorithmic game theory<\/li>\n<li>computational biology<\/li>\n<li>foundations of communication networks<\/li>\n<li>computational geometry<\/li>\n<li>discrete optimization<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3 style=\"text-align: justify;\"><strong>Invited Speakers<\/strong><\/h3>\n<ul style=\"text-align: justify;\">\n<li>Henning Fernau, Trier University, Germany<\/li>\n<li>Katharina Huber, University of East Anglia, UK<\/li>\n<li>Seffi Naor, Technion Haifa, Israel<\/li>\n<\/ul>\n<h3 style=\"text-align: justify;\"><strong>Proceedings <\/strong><\/h3>\n<p style=\"text-align: justify;\">The conference proceedings will be published by Springer-Verlag in the ARCoSS\/LNCS series and will be available for distribution at the conference. Accepted papers will be allocated 12 pages total in the LNCS format in the proceedings. More information about the LNCS format can be found on the author instructions page of Springer-Verlag.<\/p>\n<h3 style=\"text-align: justify;\"><strong>Special Issue<\/strong><\/h3>\n<p style=\"text-align: justify;\">The authors of selected papers will be invited to submit an extended version of their paper for possible publication on a special issue of Theoretical Computer Science devoted to CIAC 2021.<\/p>\n<h3 style=\"text-align: justify;\"><strong>Best Paper Award<\/strong><\/h3>\n<p style=\"text-align: justify;\">There will be a CIAC 2021 Best Paper Award, accompanied by a prize of\u00a0<strong>EUR 1,000<\/strong>\u00a0offered by\u00a0<strong>Springer<\/strong>.<\/p>\n<h3 style=\"text-align: justify;\"><strong>Important dates<\/strong><\/h3>\n<ul style=\"text-align: justify;\">\n<li>Deadline for submission: <span style=\"text-decoration: line-through;\">October 31<\/span> <span style=\"color: #ff6600;\">November 05<\/span>, 2020, 23:59 Ao\u0395 <span style=\"color: #ff6600;\">Extended<\/span><\/li>\n<li>Deadline for uploading new versions of already submitted papers: <span style=\"text-decoration: line-through;\">November 6<\/span> <span style=\"color: #ff6600;\">November 10<\/span>, 2020, AoE <span style=\"color: #ff6600;\">Extended<\/span><\/li>\n<li>Notification of acceptance: December 22, 2020<\/li>\n<li>Final manuscript, camera ready: January 31, 2021<\/li>\n<\/ul>\n<h3 style=\"text-align: justify;\"><strong>Submission<\/strong><\/h3>\n<p style=\"text-align: justify;\">Authors are invited to submit an extended abstract of at most 12 pages by October 31, 23:59 AoE.<\/p>\n<p style=\"text-align: justify;\">Uploading updated versions of already submitted papers will be allowed until November 6, 23:59 AoE<\/p>\n<p style=\"text-align: justify;\">Submissions are handled by EasyChair at the following web <span><a href=\"https:\/\/easychair.org\/conferences\/?conf=ciac2021\">https:\/\/easychair.org\/conferences\/?conf=ciac2021<\/a><\/span><\/p>\n<p style=\"text-align: justify;\">All submissions will be rigorously peer-reviewed and evaluated on the basis of the quality of their contribution, originality, soundness, and significance.<\/p>\n<p style=\"text-align: justify;\">Simultaneous submission of papers to any other conference with proceedings published or made publicly available, or submitting papers previously accepted for journal publication is not allowed.<\/p>\n<p style=\"text-align: justify;\"><strong>Submission Format:<\/strong> An extended abstract submitted to CIAC 2021 should start with the title of the paper, each author&#8217;s name, affiliation and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results, including motivation and a clear comparison with related work. The extended abstract should not exceed 12 pages total in the LNCS format. <span style=\"color: #800000;\">Note: References\/Bibliography will not be counted as part of the 12 pages; figures and tables will be counted.<\/span>\u00a0 If the authors believe that more details are essential to substantiate the claims of the paper, they may include a clearly marked appendix (with no space limit) that will be read at the discretion of the Program Committee. It is strongly recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately.<\/p>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=&#8221;1_2,1_2&#8243; _builder_version=&#8221;4.3.3&#8243;][et_pb_column type=&#8221;1_2&#8243; _builder_version=&#8221;4.3.3&#8243;][et_pb_text _builder_version=&#8221;4.3.3&#8243;]<\/p>\n<h3><strong>Program Committee<\/strong><\/h3>\n<p>Cristina Bazgan, Univ. Paris Dauphine, France<br \/><strong>Tiziana Calamoneri (Chair)<\/strong>, Sapienza Univ. of Rome, Italy<br \/>Jianer Chen, Texas A&amp;M Univ. College Station, USA<br \/>Thomas Erlebach, Univ. of Leicester, UK<br \/>Guillaume Fertin, Nantes Univ., France<br \/>Ji\u0159\u00ed Fiala, Charles Univ., Czech Republic<br \/>Peter Damaschke, Chalmers Univ., Sweden<br \/>Paola Flocchini, Univ. of Ottawa, Canada<br \/>Dimitris Fotakis, NTU Athens, Greece<br \/>Paolo Franciosa, Sapienza Univ. of Rome, Italy<br \/>Leszek Antoni G\u0105sieniec, Univ. of Liverpool, UK<br \/>Mordecai Golin, Hong Kong Univ. Kowloon, Hong Kong<br \/>Jan Kratochv\u00edl, Charles Univ., Czech Republic<br \/>Vadim Lozin, Univ. of Worwick, UK<br \/>Bodo Manthey, Twente Univ. Enschede, The Netherlands<br \/>Marios Mavronicolas, Univ. of Cyprus Nicosia, Cyprus<br \/>C\u00e9cile Murat, Dauphine Univ. Paris, France<br \/>Gaia Nicosia, Roma Tre Univ., Italy<br \/>Hirotaka Ono, Nagoya Univ., Japan<br \/>Maurizio Patrignani, Roma Tre Univ., Italy<br \/>Tomasz Radzik, King\u2019s College London, UK<br \/>Laura Sanit\u00e0 Univ. of Waterloo, Canada<br \/>Charles Semple, Canterbury Univ. Christchurch, New Zealand<br \/>Blerina Sinaimeri, Univ. Lyon I \u2013 INRIA, France<br \/>Csaba D. T\u00f3th, California State Univ. Northridge, USA<br \/>Luca Trevisan, Bocconi Univ. Milan, Italy<br \/>Ryuhei Uehara, JAIST, Japan<\/p>\n<p>[\/et_pb_text][\/et_pb_column][et_pb_column type=&#8221;1_2&#8243; _builder_version=&#8221;4.3.3&#8243;][et_pb_text _builder_version=&#8221;4.3.3&#8243;]<\/p>\n<h3><strong>Organizing Committee<\/strong><\/h3>\n<p>Federico Cor\u00f2 (Publicity), Sapienza Univ. of Rome, Italy<br \/>Anna Philippou (Co-chair), Univ. of Cyprus, Cyprus<br \/>Chryssis Georgiou (Co-chair), Univ. of Cyprus, Cyprus<\/p>\n<h3><strong>Steering Committee<\/strong><\/h3>\n<p>Giorgio Ausiello, Sapienza Univ. of Rome, Italy<br \/>Pinar Heggernes, Univ. of Bergen, Norway<br \/>Vangelis Paschos, Univ. Paris-Dauphine, France<br \/>Rossella Petreschi, Sapienza Univ. of Rome, Italy<br \/>Peter Widmayer, ETH Zurich, Switzerland<\/p>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Call for PapersUpdated: 9 Mar, 2021 Aims and Scope The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. Topics Papers presenting original research in the areas of algorithms and [&hellip;]<\/p>\n","protected":false},"author":1,"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":""},"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages\/20"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/comments?post=20"}],"version-history":[{"count":11,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages\/20\/revisions"}],"predecessor-version":[{"id":494,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages\/20\/revisions\/494"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/media?parent=20"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}