Friday, December 20, 2024

[DMANET] Postdoctoral and PhD positions in Computational Social Choice and Game Theory in Prague

A one-year (extensible) post-doc position is available within the framework of the Czech Science Foundation project "New Models of Trust and Voting Robustness in Large Multiagent Systems", investigated by Martin Koutecký (Charles U) and Tomáš Kroupa (Czech Technical U). Applications are invited from candidates who have a strong background in algorithms, continuous or discrete optimization, game theory, and/or computational social choice, and who have completed their Ph.D. degree in theoretical computer science or mathematics within the last 4 years (or will complete their Ph.D. degree by Fall 2025).

The position is hosted by the Computer Science Institute (https://iuuk.mff.cuni.cz), a lively, excellent, and inspiring workplace located in the beautiful historical center of Prague. Prague's location in the heart of Europe makes it easy to travel to many attractive locations, be it for work or leisure.
Come join us!

*Starting date:* Fall 2025 (flexible)
The application should contain:
* Short letter of motivation,
* Professional CV (including a list of publications),
* Two letters of recommendation.
*Application deadline:* January 31, 2025.

Send the application and the recommendation letters to koutecky@iuuk.mff.cuni.cz.
The project's webpage is https://research.koutecky.name/projects.html
---
There is also a funded position for a PhD student with Tomáš Kroupa at the Czech Technical University; we are looking for candidates with a strong background in theoretical computer science or discrete mathematics who have completed their undergraduate studies or will complete them by Fall 2025. For more details see here: https://www.aic.fel.cvut.cz/careers/phd-postdoc-in-multiagent-systems-and-voting-theory

**********************************************************
*
* 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] new book: "Approximation Algorithms for Traveling Salesman Problems"

Dear colleagues,

We are happy to announce that our new book
"Approximation Algorithms for Traveling Salesman Problems"
has just appeared at Cambridge University Press.

See
https://www.cambridge.org/us/universitypress/subjects/mathematics/optimization-or-and-risk-analysis/approximation-algorithms-traveling-salesman-problems?format=HB
for a table of contents and more information.

Happy Holidays!
Vera Traub and Jens Vygen
**********************************************************
*
* 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/
*
**********************************************************

Thursday, December 19, 2024

[DMANET] Postdoc and research fellow positions in Helsinki, Finland

Hi all,

Several postdoc and research fellow positions are available in many areas of computer science, including
Algorithms and Foundations of Computing, at Aalto University and University of Helsinki, Finland.

Application deadline: February 2nd, 2025.

More information here:
https://www.hiit.fi/hiit-postdoctoral-and-research-fellow-positions/

Kind regards,
Jukka


**********************************************************
*
* 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] Second CfP: LSD & LAW for Costas 2025

CALL FOR PAPERS

London Stringology Days/London Algorithmic Workshop
LSD & LAW 2025 for Costas
King's College London, 05 February 2025
https://nms.kcl.ac.uk/informatics/events/LSD&LAW25/


The Algorithms and Data Analysis Research Group at King's College London invites researchers and students to the 29th meeting of LSD & LAW --- celebrating the life and work of Professor Costas Iliopoulos, who initiated the annual LSD & LAW meeting in 1993.

Researchers in string algorithms, automata theory, combinatorics on words, bioinformatics, graph and network algorithms, computational complexity and related fields are welcome. To submit an abstract of a presentation, please complete the registration form (see below) by 25 January 2025.

ACT SOON! There is time for only fourteen 15-minute presentations in the schedule. The event will be livestreamed for those unable to attend in person.

PUBLICATION: Full versions of selected presentations will be published in a special issue of Theoretical Computer Science, also dedicated to Costas.

VENUE: LSD & LAW 2025 will take place in Activity Room D in the Bush House South East Building, located in the Strand Campus of KCL(WC2R 2LS). The nearest station is Temple (Circle/District Line) or Holborn (Central/Piccadilly Line).

STRUCTURE: The workshop will feature four sessions of oral presentations by students and researchers, as well as two invited talks. A series of commemorative speeches and a chapel service will follow the afternoon sessions.

INVITED SPEAKERS: Maxime Crochemore, Jakub Radoszewski

REGISTRATION:
Registration is free; please use the following link:
https://forms.gle/ze9iUBvnyzQPWqB5A

DEADLINES:
Abstract Submission: deadline is 25 January 2025.
Registration: deadline is 03 February 2025.

Following LSD & LAW for Costas, the workshop SEQUENCES will be held 6-7 February at City, University of London. For more information, please visit:
https://sites.google.com/view/sequencesworkshop/home

Questions and further information: zara.lim@kcl.ac.uk

---------------------------------------------------------------

PRELIMINARY SCHEDULE:

9.00-9.30 Registration
9:30-9.35 Welcome by Tomasz Radzik
9:35-10:00 Invited Speaker: Maxime Crochemore
(Intro: Tomasz Radzik)
10:00-11:00 Session 1 (4 talks) Chair: Laurent Mouchard
11:00-11:15 Coffee Break
11:15-12:30 Session 2 (5 talks) Chair: Jan Holub
12:30-14:00 Lunch
14:00-14:30 Invited Speaker: Jakub Radoszewski
(Intro: Roberto Grossi)
14:30-15:15 Session 3 (3 talks) Chair: Zsuzsanna Liptak
15:15-15:30 Coffee Break
15:30-16:00 Session 4 (2 talks) Chair: Thierry Lecroq
16:00-16:25 Remembering Costas (short talks) Chair: Bill Smyth
16.45-17.25 Chapel Service
17:30- Coal Hole


COMMITTEE:
- Mai Alzamel
- Amihood Amir
- Maxime Crochemore
- Jacqueline Daykin (Co-chair)
- Roberto Grossi
- Jan Holub
- Zara Lim (Co-chair)
- Gad Landau
- Thierry Lecroq
- Grigorios Loukides
- Laurent Mouchard
- Kunsoo Park
- Jakub Radoszewski
- Tomasz Radzik
- Sohel Rahman
- Bill Smyth (Co-chair)
- Wing-Kin Sung
- Fatima Vayani
- Bruce Watson

**********************************************************
*
* 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] ISSAC 2025 -- Final Call for Papers

----------------------------------------------------------------------
THIRD CALL FOR PAPERS

ISSAC 2025
International Symposium on Symbolic and Algebraic Computation
July 28th to August 1st, 2025
Center for Research in Mathematics (CIMAT) in Guanajuato, Mexico.
https://www.issac-conference.org/2025/

----------------------------------------------------------------------
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2025 will be the 50th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communications, software demonstrations and vendor exhibits with a center-piece of contributed research papers.

ISSAC 2025 will be held from July 28th to August 1st, 2025, at the Center for Research in Mathematics (CIMAT) in Guanajuato, Mexico.


Important Dates
---------------

* Abstract submission deadline: January 23, 2025, 23:59 (anywhere on Earth)
* Paper submission deadline: January 30, 2025, 23:59 (anywhere on Earth)
* First notification of acceptance/rejection: April 16, 2025
* End of rebuttal phase: April 23, 2025
* Final notification after rebuttal phase: April 30, 2025
* Camera-ready copy due: May 21, 2025


Submission Instructions
-----------------------

ISSAC 2025 invites the submission of original research contributions to be considered for publication and presentation at the conference. Papers should not duplicate work published or submitted for consideration elsewhere.

Papers must be in English and should not exceed 8 pages in the ACM two-column style, found at:
http://www.acm.org/publications/proceedings-template
which can be downloaded from:
https://portalparts.acm.org/hippo/latex_templates/acmart-primary.zip

However, two additional pages may be used for bibliographical references, and/or for experimental results (tables, figures), experimental data (e.g. input or output systems for a solver) and computer program code (library code, scripts, worksheets, Makefiles, etc.). The portion of the paper before these two additional pages must be self-contained.

Extended abstracts are not allowed. At least one author of each accepted paper must register for the conference and present the paper.

Submission is via EasyChair, at the web site
https://easychair.org/my/conference?conf=issac2025


Topics
------

All areas of computer algebra and symbolic mathematical computation are of interest. These include, but are not limited to:

- Algorithmic aspects:

* Exact and symbolic linear, polynomial and differential algebra
* Symbolic-numeric, homotopy, perturbation and series methods
* Computational algebraic geometry, polynomial and semialgebraic optimization
* Computational group theory and number theory, quantifier elimination and logic
* Computer arithmetic
* Summation, recurrence equations, integration, solution of ODEs & PDEs
* Symbolic methods in other areas of pure and applied mathematics
* AI methods and symbolic computation
* Complexity of algebraic algorithms and algebraic complexity

- Software aspects:

* Design of symbolic computation packages and systems
* Language design and type systems for symbolic computation
* Data representation
* Considerations for modern hardware
* Algorithm implementation and performance tuning
* Mathematical user interfaces
* Use with systems such as digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation

- Application aspects:

* Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact.

- Satellite Workshops/Conferences:

* The organizing committee of ISSAC 2025 invites proposals for Satellite Events aimed at enriching the conference program, attracting a broader audience, and promoting new developments and original research results in all areas of symbolic mathematical computation.


Organizing Committee
--------------------

* General Chair: Carlos D'Andrea. Universitat de Barcelona, Spain
* Program Committee Chair: Sonia Pérez Díaz. University of Alcalá, Spain
* Local Arrangements Chair: Cristhian Garay López. Centro de Investigación en Matemáticas (CIMAT), Mexico
* Treasurer: Javier Carvajal-Rojas. Centro de Investigación en Matemáticas (CIMAT), Mexico
* Proceedings Editor: Santiago Laplagne. Universidad de Buenos Aires, Argentina
* Publicity Chair: Matías Bender. Inria - CMAP, École Polytechnique, France
* Tutorial Chair: Josephine Yu. Georgia Institute of Technology, USA
* Short Communications Chair: Xiaohong Jia. Chinese Academy of Sciences, China
* Software Presentations Chair: Thi Xuan Vu. University of Lille, France


Program Committee
-----------------

* Erika Ábrahám. RWTH Aachen University, Germany
* Jérémy Berthomieu. Sorbonne Université, CNRS, France
* Michela Ceria. Polytechnic University of Bari, Italy
* Maria Francis. Indian Institute of Technology Hyderabad, India
* Bruno Grenet. Université Grenoble-Alpes, France
* Kai Hormann. University of Italian Switzerland, Switzerland
* Gabriela Jeronimo. Universidad de Buenos Aires, Argentina
* Christoph Koutschan. Austrian Academy of Sciences, Austria
* Pierre Lairez. Inria, France
* Jesús de Loera. University of California, Davis, USA
* Katsusuke Nabeshima. Tokyo University of Science, Japan
* Gleb Pogudin. École Polytechnique, Institute Polytechnique de Paris, France
* Mauricio Velasco. Universidad Católica, Uruguay.
* Daniel S. Roche. United States Naval Academy in Annapolis, Maryland, USA
* Liyong Shen. School of Mathematical Sciences, University of the Chinese Academy of Sciences, China
* Carsten Schneider. Research Institute for Symbolic Computation. Johannes Kepler University, Austria
* Josué Tonelli-Cueto. Johns Hopkins University, USA
* Rafael H. Villarreal. Cinvestav - IPN, Mexico


Local Arrangements Committee
----------------------------

* Cristhian Garay López (Chair). Centro de Investigación en Matemáticas (CIMAT), Mexico
* Claudia Reynoso Alcántara. Universidad de Guanajuato, Mexico
* Luis Núñez Betancourt. Centro de Investigación en Matemáticas (CIMAT), Mexico


**********************************************************
*
* 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] [CFP] The 34th International Conference on Computer Communications and Networks (ICCCN 2025) , August 4 - 7, 2025, Tokyo, Japan

*** Please accept our apologies if you receive multiple copies of this CFP
***

****************************************************************************************

The 34th International Conference on Computer Communications and Networks
(ICCCN 2025)
August 4 - 7, 2025, Tokyo, Japan

http://www.icccn.org/icccn25/

****************************************************************************************

ICCCN 2025 is Technically Co-Sponsored by the IEEE and IEEE Communication
Society.

Paper Submission link: https://easychair.org/conferences/?conf=icccn2025
(for all Conference, Workshop, and Poster papers). The paper submission
site is open now.

IMPORTANT DATES: Paper submission due: February 13, 2025

ICCCN is one of the leading international conferences for presenting novel
ideas and fundamental advances in the fields of computer communications and
networks. ICCCN serves to foster communication among researchers and
practitioners with a common interest in improving computer communications
and networking through scientific and technological innovation.

Scope:

The primary focus of the ICCCN 2025 conference is on new and original
research results in the areas of design, implementation, and applications
of computer communications and networks. ICCCN 2025 covers the following
technical Tracks (the detailed Track scope and descriptions are posted at
http://www.icccn.org/icccn25/committeesandtracks/technical-tracks/index.html
):

Track 1: Infrastructure Networking Technologies
Track Chairs: Noriaki Kamiyama, Ritsumeikan University, Japan
Ke Xu, Tsinghua University, China
Paolo Bellavista, University of Bologna, Italy

Track 2: Network Architecture, Algorithm, Protocol, and Evaluation
Track Chairs: Go Hasegawa, Tohoku University, Japan
Subhramoy Mohanti, Interdigital, USA
Berk Canberk, Edinburgh Napier University, U.K.

Track 3: IoT and Cyber-Physical Systems
Track Chairs: Marco Di Felice, University of Bologna, Italy
Yingshu Li, Georgia State University, USA
Enrico Natalizio, Technology Innovation Institute, UAE

Track 4: Edge and Cloud Computing
Track Chairs: Rajkumar Buyya, University of Melbourne, Australia
Schahram Dustdar, TU Wien, Austria
Huaming Wu, Tianjin University, China

Track 5: Pervasive Communications, Networking and Sensing
Track Chairs: Hirozumi Yamaguchi, Osaka University, Japan
Sara Garcia Sanchez, IBM Research, USA
Jia Hu, University of Exeter, U.K.

Track 6: Social Networks, Extended Reality, and Metaverse
Track Chairs: Maria Gorlatova, Duke University, USA
Eirini Eleni Tsiropoulou, University of New Mexico, USA
Bin Cao, University of Posts and Telecommunications, China

Track 7: AI-Enabled Communications and Networks
Track Chairs: Hongjian Sun, University of Durham, U.K.
Tugba Erpek, Nexcepta, USA
Wei Bao, University of Sydney, Australia

Track 8: Security, Privacy, and Trust
Track Chairs: Rui Zhang, University of Delaware, USA
Abderrahim Benslimane, University of Avignon, France
Haojin Zhu, Shanghai Jiao Tong University, China

Track 9: Emerging Topics in Networking
Track Chairs: Ranga Rao Venkatesha Prasad, TU Delft, Netherlands
Richard Li, Southeast University, China
Rahman Doost-Mohammady, Rice University, USA

PAPER SUBMISSION:

MAIN CONFERENCE:

Submitted manuscripts must be formatted in standard IEEE camera-ready
format (double-column, 10-pt font) and must be submitted via EasyChair (
https://easychair.org/conferences/?conf=icccn2025) as PDF files (formatted
for 8.5×11-inch paper). The manuscripts should be no longer than 9 pages
including all figures/tables and references. Submitted papers should not be
previously published in or be under consideration for publication in
another conference or journal. Paper titles and/or author names cannot be
changed and/or added to the papers after the submission deadline or in the
camera-ready version if accepted. The Program Committee reserves the right
to not review papers that either exceed the length specification or have
been submitted or published elsewhere. Submissions must include a title,
abstract, keywords, author(s) and affiliation(s) with postal and e-mail
addresses. Note: ICCCN'25 will select the Best Paper and a runner-up paper
to recognize the research quality and excellence. The Program Committee
reserves the right to recommend some borderline conference papers to be
accepted as short papers in the conference (the short papers should be no
longer than 6 pages including all figures/tables and references).

REVIEW and PUBLICATION of MANUSCRIPTS:

Submitted papers will be reviewed by the TPC and judged on originality,
technical correctness, relevance, and quality of presentation. An accepted
paper must be presented at the conference venue by a registered author at
the full registration rate. Each full registration covers up to two
conference papers authored by the registered author. If the originally
registered author is unable to attend the conference due to extenuating
circumstance, he/she must explicitly ask for the transfer of registration
to one of the other authors of the paper. Please note that the registration
cannot be transferred to a nonauthor presenter under any circumstances.
Accepted and presented (onsite) papers will be published in the conference
proceedings and IEEE Xplore.

WORKSHOPS:

ICCCN 2025 workshops are exciting forums to present, discuss, and formulate
specialize topics and emerging hot research topics (new areas, new problems
or new methods). The workshops offer a perspective distinct from and
complementary to the research themes of the main conference. Workshop
papers should be no longer than 6 pages including all figures/tables and
references. The detailed info can be found in each workshop's Call for
Papers from (http://www.icccn.org/icccn25/workshop/list-of-workshops/). For
any questions or additional information, please contact the Workshop
General or Workshop Program Chairs.

POSTER PAPERS:

ICCCN 2025 provides an opportunity to present in-progress work in the
fields of computer communications and networks. Topics of interest are the
same as the research topics in the ICCCN 2025 main conference Call for
Papers. Early implementations, prototypes, work-in-progress
systems/applications as well as commercial products that are related to the
topics are welcome. Presenting a poster is an effective way to obtain early
and valuable feedback from a knowledgeable crowd at the conference. Posters
must be formatted in standard IEEE camera-ready format (double-column,
10-pt font). Each poster submission must be no longer than 2 pages
including all figures/tables and references.

IMPORTANT DATES: All times below are 11:59 pm (New York, USA);

Conference:
• Conference Paper submission due: February 13, 2025
• Poster Paper submission due: March 29, 2025
• Acceptance Notification: May 10, 2025
• Conference date: August 4 – 7, 2025

Workshop:
• Paper submission due: March 1, 2025
• Acceptance Notification: May 10, 2025
• Workshop date: August 6 - 7, 2025

All (conference/poster/workshops) Camera-Ready Papers Due: June 2, 2025
(Hard deadline)

Submission Link: https://easychair.org/conferences/?conf=icccn2025

---------------------------------------------------------
CONFERENCE ORGANIZING COMMITTEE

Executive Chair: Krishna Kant, Temple University, USA

General Chair: Akihiro Nakao, University of Tokyo, Japan

TPC Co-Chairs: Ruidong Li, Kanazawa University, Japan
Kaushik Chowdhury, University of Texs-Austin, USA

Workshops Co-General Chairs:
Kewei Sha, University of North Texas, USA
Zehui Xiong, Singapore Univ of Tech and Design

Poster Co-Chairs:
Neeraj Kumar, Thapar Institute of Engineering and Technology, India
Peng Li, Aizu University, Japan

Local Arrangement Chairs:
Kazuya Sakai, Tokyo Metropolitan University, Japan
Taku Yamazaki, Shibaura Institute of Technology, Japan

Publications Chair:
Ning Zhang, University of Windsor, Canada

Publicity Co-Chairs:
(America) Mostafa Fouda, Idaho State University, ID, USA
(Europe) Zhengxin Yu, Lancaster University, U.K.
(Japan) Makoto Misumi, Fukuoka University, Japan
(Asia) Qiao Xiang, Xiamen University, China
(Oceania) Wei Xiang, La Trobe University, Australia

Publicity Chair for Workshops:
Guan Gui, Nanjing University of Post and Telecomm., China

**********************************************************
*
* 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] MFCS 2025 - First Call for Papers

========================================================
MFCS 2025 - First Call for Papers
========================================================

The 50th conference on Mathematical Foundations of Computer Science
(MFCS) will take place in:

Warsaw, Poland August 25-29, 2025

MFCS is among the conferences with the longest history in the field —
the first conference in the series was held already in 1972.
Traditionally, the conference moved between the Czech Republic,
Poland, and Slovakia; while since 2013, the conference has traveled
around Europe. The conference will be preceded by the Young Research
Forum Workshop intended for a younger audience.

========================================================
Important dates and information
========================================================

Submissions: April 18, 2025
Rebuttal: June 3-6, 2025
Author notification: June 20, 2025
Camera-ready version: June 27, 2025
Early registration: TBA
Conference: August 25-29, 2025 (YRF Workshop on August 24)

Deadlines are firm; late submissions will not be considered. All dates are AoE.

Conference website: https://mfcs2025.mimuw.edu.pl/

Submissions: https://easychair.org/conferences/?conf=mfcs2025

========================================================
Submission guidelines
========================================================

1) Papers must present original research on the theory of computer
science. No prior publication and no simultaneous submission to other
publication outlets (either a conference or a journal) is allowed.
Authors are encouraged to also make full versions of their submissions
freely accessible in an on-line repository such as ArXiv.

2) Submissions take the form of an extended abstract of no more than
15 pages (LIPIcs document class), excluding references and a clearly
labelled appendix. The appendix may consist either of omitted proofs
or of a full version of the submission, and it will be read at the
discretion of program committee members. The extended abstract has to
present the merits of the paper and its main contributions clearly,
and describe the key concepts and technical ideas used to obtain the
results. Submissions must provide the proofs which can enable the main
mathematical claims of the paper to be verified.

3) Submissions authored or co-authored by members of the program
committee are allowed.

4) During the rebuttal phase, authors are encouraged (but not
required) to respond to the initial reviews. Further instructions will
be sent to the authors of the submitted papers in due time.

5) At least one author of each accepted paper is expected to register
for the conference, and all talks are in-person. In exceptional cases
(e.g. unexpected personal reasons) remote talks (pre-recorded or live)
might be allowed.

6) Papers authored only by students should be marked as such upon
submission in order to be eligible for the best student paper award.

========================================================
MFCS 2025 Invited Speakers
========================================================

Thomas Colcombet (Université Paris Cité)
Giuseppe Italiano (LUISS Guido Carli, Rome)
Rasmus Kyng (ETH Zurich)
Filip Murlak (University of Warsaw)
Anca Muscholl (Université de Bordeaux)

========================================================
MFCS 2025 Programme Committee
========================================================

Shaull Almagor (Technion)
Nathalie Bertrand (Inria Rennes)
Udi Boker (Reichman University)
Gerth Brodal (Aarhus University)
Michaël Cadilhac (DePaul University)
Panagiotis Charalampopoulos (Birkbeck, University of London)
Witold Charatonik (University of Wrocław)
Dmitry Chistikov (University of Warwick)
Anuj Dawar (University of Cambridge)
Joel Day (Loughborough University)
Moses Ganardi (Max Planck Institute for Software Systems)
Leszek Gąsieniec (University of Liverpool)
Paweł Gawrychowski (University of Wrocław) - chair
Stefan Göller (Universität Kassel)
Christoph Haase (University of Oxford)
Meike Hatzel (IBS, Daejeon)
Jarkko Kari (University of Turku)
Edon Kelmendi (Queen Mary, University of London)
Marie Kerjean (CNRS, Université Sorbonne Paris Nord)
Jakub Kozik (Jagiellonian University)
László Kozma (Freie Universität Berlin)
Karoliina Lehtinen (CNRS, LIS Marseille)
Nutan Limaye (University of Copenhagen)
Christof Löding (RWTH Aachen)
Filip Mazowiecki (University of Warsaw) - co-chair
Pierre Ohlmann (CNRS, LIS Marseille)
Jakub Opršal (University of Birmingham)
Guillermo Pérez (University of Antwerp)
Gabriele Puppis (University of Udine)
David Purser (University of Liverpool)
Karin Quaas (Universität Leipzig)
Chris Schwiegelshohn (Aarhus University)
Michał Skrzypczak (University of Warsaw) - co-chair
Tatiana Starikovskaya (ENS Paris)
Lidia Tendera (University of Opole)
Karol Węgrzycki (Max Planck Institute for Informatics)
Philip Wellnitz (National Institute of Informatics)
Markus Whiteland (Loughborough University)
Michał Wrona (Jagiellonian University)
Georg Zetzsche (Max Planck Institute for Software Systems)
Anna Zych (University of Warsaw)

**********************************************************
*
* 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/
*
**********************************************************

Wednesday, December 18, 2024

[DMANET] [CFP] ESSA Workshop at IEEE IPDPS 2025 - Submissions due January 26, 2025

**[Apologies if you receive multiple copies of this email]**

###############################################################

ESSA 2025 : 6th Workshop on Extreme-Scale Storage and Analysis
Held in conjunction with IEEE IPDPS 2025 - June 4th, 2025

https://sites.google.com/view/essa-2025/

###############################################################

==========
OVERVIEW:
==========

Advances in storage are becoming crucial as HPC and cloud systems handle ever-increasing data, a trend expected to accelerate. For decades, parallel file systems like Lustre and GPFS have seen few structural changes, with limited integration of I/O support technologies that leverage hierarchical storage layers, such as node-local burst buffers. Recently, however, there has been a surge in innovations in data storage, processing systems, and I/O support software for several key reasons:

- Technology: The growing availability of persistent solid-state storage and storage-class memory technologies, capable of replacing both memory and disk, is opening up new possibilities for the design of storage systems.

- Performance requirements: Disk-based parallel file systems are no longer sufficient to meet the performance demands of high-end systems. However, the optimal use of solid-state storage and storage-class memory to achieve the required performance remains unclear. As a result, new approaches for integrating these technologies into HPC systems are being actively developed and evaluated.

- Application evolution: Data analysis applications, such as graph analytics and machine learning, are becoming increasingly critical in both scientific and commercial computing. I/O often presents a major bottleneck for these applications, particularly in cloud and HPC environments, where rapid turnaround or the integration of intensive computation and analysis is required. As a result, data storage, I/O, and processing demands are evolving, driven by the emergence of complex workflows that integrate computation, analytics, and learning.

- Infrastructure evolution: In the future, HPC technology will extend beyond dedicated supercomputing centers. Concepts such as "Embedded HPC," "HPC in a Box," "HPC in the Loop," "HPC in the Cloud," "HPC as a Service," and "near-real-time simulation" will drive the need for new, small-scale HPC deployment environments. To enable a seamless computing continuum, a federation of systems and functions will be needed, with unified mechanisms for managing I/O, storage, and data processing across all participating systems.

- Virtualization and disaggregation: As virtualization and disaggregation become more widely adopted in cloud and HPC computing, the importance of virtualized storage is growing. Increased efforts will be required to understand its impact on performance.

Our goals for the ESSA Workshop are to bring together leading researchers and developers in data-related fields?such as storage, I/O, processing, and analytics?on extreme-scale infrastructures, including HPC systems, clouds, edge systems, and hybrid combinations of these. We aim to discuss advancements and potential solutions to the new challenges we encounter.

- Extreme-scale storage systems for high-end HPC infrastructures, clouds, or hybrid environments
- Extreme-scale parallel distributed, storage architectures
- Synergies between different storage models, including POSIX file systems, object storage, key-value stores, and row- and column-oriented databases
- Structures and interfaces for leveraging persistent solid-state storage and storage-class memory
- High-performance I/O libraries and services
- I/O performance in extreme-scale systems and applications (HPC, clouds, edge)
- Storage and data processing architectures for hybrid HPC/cloud/edge infrastructures supporting complex workflows that integrate simulation and analytics
- Integrating computation within the memory and storage hierarchy to facilitate in-situ & in-transit data processing
- I/O characterization and data processing techniques for application workloads in extreme-scale parallel and distributed machine learning and deep learning
- Tools and techniques for managing data movement among compute and data-intensive components
- Data reduction and compression methods
- Failure management and recovery strategies for extreme-scale storage systems
- Benchmarks and performance tools for extreme-scale I/O
- Language and library support for data-centric computing
- Storage virtualization and disaggregation
- Ephemeral storage media and consistency optimizations
- Storage architectures and systems for scalable stream-based processing
- Case studies of I/O services and data processing architectures across various application domains (e.g., scientific simulations, experimental facilities, large observatories, bioinformatics, etc.)

============
SUBMISSIONS:
============

The workshop will accept traditional research papers (8 pages) for in-depth topics and short papers (5 pages) for work in progress on hot topics. Papers should present original research and provide sufficient background material to make them accessible to the broader community.

Paper format: single-spaced double-column pages using 10-point size font on 8.5x11 inch pages (IEEE conference style), including figures, tables, and references. The submitted manuscripts should include author names and affiliations. The IEEE conference style templates for MS Word and LaTeX provided by IEEE eXpress Conference Publishing are available here: https://www.ieee.org/conferences/publishing/templates.html

Submission site:
https://ssl.linklings.net/conferences/ipdps/

================
IMPORTANT DATES:
================

- Paper submission deadline: January 26th, 2025
- Acceptance notification: February 21st, 2025
- Camera-ready deadline: March 6th, 2025
- Workshop date: June 4th, 2025

=================
WORKSHOP CHAIRS:
=================

Sarah Neuwirth, Johannes Gutenberg University Mainz, Germany - Chair - neuwirth@uni-mainz.de<mailto:neuwirth@uni-mainz.de>
Francois Tessier, Inria, France - Co-Chair - francois.tessier@inria.fr<mailto:francois.tessier@inria.fr>

================
PROGRAM CHAIRS:
================

Chen Wang, Lawrence Livermore National Laboratory, USA - Chair - wang116@llnl.gov<mailto:wang116@llnl.gov>
Lipeng Wan, Georgia State University, USA - Co-Chair - lwan@gsu.edu<mailto:lwan@gsu.edu>

======================
WEB & PUBLICITY CHAIR:
======================

Radita Liem, RWTH Aachen University, Germany - Chair - liem@itc.rwth-aachen.de<mailto:liem@itc.rwth-aachen.de>

====================
STEERING COMMITTEE:
====================

Gabriel Antoniu , Inria, Rennes, France
Franck Cappello, Argonne National Laboratory, USA
Toni Cortés, Barcelona Supercomputing Center, Spain
Kathryn Mohror, Lawrence Livermore National Laboratory, USA
Kento Sato, RIKEN, Japan
Marc Snir, University of Illinois at Urbana-Champaign, USA
Weikuan Yu, Florida State University, USA


--------------------------------------------------------------------------------
Prof. Dr. Sarah M. Neuwirth
Co-Director, NHR South-West HPC Center
Research Group Head, High Performance Computing and its Applications

Johannes Gutenberg University Mainz
Anselm-Franz-von-Bentzelweg 12
55099 Mainz | Germany

Office: ZDV, Room 01-339
Phone: +49 6131 39 23643
Email: neuwirth@uni-mainz.de<mailto:neuwirth@uni-mainz.de>
Website: https://www.hpca-group.de/
--------------------------------------------------------------------------------

**********************************************************
*
* 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] PhD positions in Operations Research @ Paderborn University

We have two open PhD positions in Operations Research at Paderborn
University. Successful applicants must have excellent skills in discrete
optimization and must teach in German. Further details can be found here:
https://wiwi.uni-paderborn.de/dep3/schryen/team-schryen/stellenausschreibung
en

We look forward to receiving your application.

--

Prof. Dr. Guido Schryen

Chair of Management Information Systems and Operations Research

Faculty of Business Administration and Economics

Paderborn University

Warburger Straße 100
33098 Paderborn
Germany

Web: <http://www.misor.org/> www.misor.org

Mail: misor@wiwi.upb.de

**********************************************************
*
* 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] Multiple Assistant Professor positions at Bocconi University in Milan

Bocconi University is recruiting tenure-track assistant professors in computer
science. Candidates must apply online by January 24th 2025, for the application
to be considered.

The university pays internationally competitive salary and provides relocation
assistance. The language of instructions of all computer science courses at
both undergraduate and graduate levels is English.


Description

Bocconi University is an amazingly vibrant academic community with leading
professors. It is located in central Milan, Italy, offering undergraduate,
graduate, PhD, MBA and Executive programs. A new Computing Sciences department
has been established three years ago and has already built a strong presence
in various branches on Computer Science, see the website of the department
https://cs.unibocconi.eu/
the webpage of the theory group
https://cs.unibocconi.eu/research/theory
and the webpage of the crypto group
https://rosenalon.github.io/cifra/

We are looking to hire tenure track Assistant Professors. All areas of research
in computing, mathematical and information sciences will be considered.
Priority will be given to candidates with expertise in computer vision and/or
high performance computing as well as to all candidates whose hiring would
increase the diversity of the faculty in the department, see the diversity
statement on the department website https://cs.unibocconi.eu/

The appointments will commence in Fall 2025 (but a later starting date is
negotiable).

Qualifications

Applicants should have a Ph.D. in Computer Science or closely related areas,
and should demonstrate the capacity for exceptional research achievement and
the ability to teach effectively in undergraduate, masters, MBA, and PhD
programs. Experienced candidates should have an established track record of
successful research and teaching.

Job information

The successful candidates will be expected to develop a strong publication
record, broadly contribute to the academic life of the department and be
effective teachers both at the undergraduate and graduate level. The contract
will last for 6 years and will become permanent after a successful tenure
process.

How to apply

Applications including a CV, Research Statement and copies of recent
publications (up to 5), plus 3 references must be submitted online at
https://jobmarket.unibocconi.eu/?id=711 .


Additional Information

For additional information concerning the Department of Computing Sciences
visit https://cs.unibocconi.eu/. Further details on the position may be
requested from faculty@unibocconi.it

Bocconi University is committed to increasing the diversity of its faculty.
Applications are particularly welcome from women and members of groups who are
under-represented in academic posts.


**********************************************************
*
* 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] Postdoc position in data structures at Université Libre de Bruxelles (ULB), Brussels, Belgium

Postdoc position in data structures at Université Libre de Bruxelles (ULB),
Brussels, Belgium

Research will be conducted within the Algorithms Group (http://algo.ulb.be/
).

The position would be to perform research on data structures with Prof.
John Iacono. Candidates are expected to have a history of publication in
data structures.

Flexible start date in 2025. Applications are welcome from candidates who
have a PhD or expect to finish in 2025.

Applications (cover letter and CV) should be sent to postdoc@johniacono.com.
Applications should be sent by February 1, 2025 to receive full
consideration.

**********************************************************
*
* 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, December 17, 2024

[DMANET] Postdoc Position in Algorithms (TU Munich)

Postdoctoral Position in Algorithms
TU Munich

A postdoctoral position in the area of efficient algorithms is
available in the research group of Prof. Susanne Albers, Department
of Computer Science, Technical University of Munich (TU Munich).

A research interest in approximation and online algorithms,
algorithmic game theory or algorithm engineering is very welcome.
More information about Susanne Albers and the research group can
be found at http://wwwalbers.in.tum.de/index.html.en

The position provides a competitive 12 month salary with standard
benefits. The appointment is for a period of one or two years,
depending on the scientific profile of the candidate. The expected
start date of the position is spring/summer 2025.

The successful candidate should have a PhD degree in computer
science or mathematics. Since the position includes teaching
responsibilities, proficiency in German is required.
The application material should include (1) a cover letter
describing the interest in the position, (2) a CV and list of
publications, (3) a short research summary, and (4) the name and
contact information of at least one reference. The material should
be sent electronically to <albers@in.tum.de>.

Applications will be reviewed starting January 18, 2025.

Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de

**********************************************************
*
* 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] WAW 2025 - CFP

WAW 2025 (20th Workshop on Modelling and Mining Networks) invites original research papers and abstracts on all aspects of algorithmic and mathematical research in the areas pertaining to the graph and hypergraph theory and applications. We especially encourage submission of papers that espouse the view of complex data as networks.

WAW 2025 will be held at the Vilnius University, Vilnius, Lithuania.

The deadline for submitting papers is February 1, 2025.

We are pleased to announce 3 invited speakers:
- Konstantin Avrachenkov, INRIA
- Marián Boguñá, Universitat de Barcelona
- Gesine Reinert, University of Oxford

More details can be found here:

https://math.torontomu.ca/waw2025/

Thank you,
Pawel Pralat
_______________________________________
http://math.torontomu.ca/~pralat/
Professor, Department of Mathematics, Toronto Metropolitan University


**********************************************************
*
* 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] Call for submissions: Computational Geometry Media Exposition CG:ME

Computational Geometry Media Exposition CG:ME 2025
https://socg25.github.io/media.html

================

Media, Visualizations, and Geometric Art are sought for the 34th International Computational Geometry Media Exposition (CG:ME), which will take place as part of Computational Geometry Week 2025 in Kanazawa, Japan, June 23-27, 2025. Submissions showcase creative approaches to illustrate research and/or support education in computational geometry.

CG:ME 2025 conference web page (https://socg25.github.io/media.html)
CG:ME 2025 EasyChair submission page (https://easychair.org/conferences/?conf=cgme2025)


## SUBMISSION

Submissions will be handled through [EasyChair](https://easychair.org/conferences/?conf=cgme2025). Submit a paper in PDF which details your multimedia contribution and, where applicable, the techniques used in your work.

The paper should include the following elements:
- An explanation of the connection your submission has to computational geometry, broadly interpreted.
- A link to a portfolio of your work, such as images, video, link to interactive apps, etc. For example, if your contribution is a video, we recommend posting it to YouTube (you can leave it unlisted so only those with the link can view it). You may also use an online file service such as Dropbox or Google Drive to share the portfolio files. In the final proceedings, your initial link will be replaced with an archival link at computational-geometry.org.
- A specification of how the work may be displayed. Note that in many cases the portfolio and the work are in fact identical, for example when the work is a video. In such cases, the (online) portfolio can be used to showcase the work in the CG:ME session.

Acceptance is based on both the portfolio and the accompanying paper. Accepted contributions will be published as Media Exposition papers in the LIPIcs proceedings of the Symposium on Computational Geometry.

Authors are encouraged to contact the PC chairs (cgme2025@easychair.org) early in the process to get feedback on their planned submissions.


## DATES

* February 25, 2025: Submission deadline
* March 21, 2025: Notification of acceptance
* March 31, 2025: Final version of abstract
* April 30, 2025: Final version of media portfolio
* June 23--27, 2025: CG Week 2025

All deadlines are at 11:59pm (23:59), AoE (Anywhere on Earth).


## TECHNICAL DETAILS

Portfolio submissions are limited to 100 MB. Authors are free to post higher quality versions on their own web sites or other platforms, and we will include links in the electronic proceedings to their version, in addition to the official version (<100 MB) archived on the Computational Geometry pages.

Videos should be 720p or better, using H.264, where the embedded audio stream should be AAC of at least 128kBit/s. Authors are encouraged to post the videos (public or unlisted) on a video sharing service.

Submissions must be formatted according to the same style file as regular SoCG submissions and not exceed 100 lines, excluding front matter and references. Unlike SoCG, CG:ME is not employing double-blind submissions this year. To ensure an accurate line counting, authors must use the LaTeX class file [socg-lipics-v2021](https://computational-geometry.org/documents/socg-lipics-v2021.cls), which is a wrapper around the standard LIPIcs class, see these [guidelines](https://computational-geometry.org/documents/linecount_2022_09_19.pdf).


## PROGRAM COMMITTEE

Aaron T. Becker (University of Houston, USA)
Brittany Fasy (Montana State University, USA)
Anirban Ghosh (University of North Florida, USA)
Philipp Kindermann (Trier University, Germany)
Fabian Klute (Universitat Politècnica de Catalunya, Spain)
Tamara Mchedlidze (Utrecht University, Netherlands)
Martin Nöllenburg (TU Wien, Austria) -- chair
Christian Scheffer (HS Bochum, Germany)
Willem Sonke (TU Eindhoven, Netherlands)
Jules Wulms (TU Eindhoven, Netherlands) -- co-chair


**********************************************************
*
* 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/
*
**********************************************************

Monday, December 16, 2024

[DMANET] Associate Professor positions in Computer Science at UNSW Sydney

The School of Computer Science and Engineering at the University of New South Wales (UNSW Sydney, Australia) is seeking candidates for multiple Associate Professor positions.

* Algorithms: https://external-careers.jobs.unsw.edu.au/cw/en/job/527790/associate-professor-algorithms
* Computer Graphics: https://external-careers.jobs.unsw.edu.au/cw/en/job/527791/associate-professor-computer-graphics
* Embedded Systems: https://external-careers.jobs.unsw.edu.au/cw/en/job/527792/associate-professor-embedded-systems
* Formal Methods: https://external-careers.jobs.unsw.edu.au/cw/en/job/527793/associate-professor-formal-methods
* Natural Language Processing: https://external-careers.jobs.unsw.edu.au/cw/en/job/527794/associate-professor-natural-language
* Robotics: https://external-careers.jobs.unsw.edu.au/cw/en/job/527795/associate-professor-robotics
* Theoretical Machine Learning: https://external-careers.jobs.unsw.edu.au/cw/en/job/527796/associate-professor-theoretical-machine-learning

Applications close on 27 January 2025 at 11:50 pm (Sydney time, which is a few hours ahead of most of the world).

--
Serge Gaspers<https://serggasp.github.io/>
Professor, School of Computer Science and Engineering
UNSW Sydney


**********************************************************
*
* 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] I would like to share with you "Scheduling electric vehicle regular charging tasks: A review of deterministic models"

Dear Colleagues:

Here is the link to our invited review in EJOR: "Scheduling electric
vehicle regular charging tasks: A review of deterministic models":

https://www.sciencedirect.com/science/article/pii/S0377221724009354

Good reading!
Best regards
Alexandre Dolgui

**********************************************************
*
* 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] Final Extension - IEEE ICHMS 2025 - Abu Dhabi, UAE - 26-28 May 2025

*The 5th IEEE International Conference on Human-Machine Systems*

26-28 May 2025, Abu Dhabi, UAE

https://ieee-ichms.org/2025/

Marriott Downtown Abu Dhabi

The theme of the 5th IEEE ICHMS is "AI and Large Language Models:
Transforming Human-Machine Interactions". The organization of ICHMS will
include Regular Sessions, Special Sessions, Poster Sessions, and Sessions
focused on PhD student research. Accepted papers will be submitted for
inclusion into IEEE Xplore. The list of topics are:

· Advancements in LLMs

· AI Integration in Human-Machine Systems

· AI in Robotics and Automation

· Future Trends and Emerging Technologies in Human- Machine
Interactions

· Augmented Cognition

· Authority/Control Transfer

· Brain-Inspired Autonomous Systems

· Brain-Machine Interfaces

· Decision-Support and Recommender Systems

· Ethical Aspects of Human-AI Symbiotic Systems

· Human- Computer Interaction

· Human-Autonomy Cooperation and Teaming

· Human Performance Modeling

· Human- Machine/Robot Interaction

· Intelligent Adaptive Systems

· Resilience Engineering in Human-AI Symbiotic Systems

· Team Performance and Training Systems

· Trust Modeling, Measurement, and Management

· Virtual and Mixed Reality Systems

· Wearable Sensors

· Web-based Interactive Systems

· Autonomous Technologies and Cyber- physical Systems

*Submission Categories:*

Submission to a Regular, Special, or a PhD Session should focus on topics
including, but not limited to:

· *Regular papers* (6 pages): should provide complete and
high-quality contributions to the field.

· *Short Papers* (4 pages): are expected to cover recent research
outcomes that are not yet mature enough for a regular paper but still
provide novel insights.

· *Posters *(1 page): should ideally show work in progress or
applications/demos that can be best presented through an interactive format
at the meeting.

*Submission Instructions:*

All paper submissions MUST be in PDF format. Complete manuscripts must be
electronically submitted via the ICHMS 2025 EDAS site
https://edas.info/N32982. Submitted manuscripts must appear in IEEE
two-column format, including figures, tables, and references. Please use
the IEEE templates available at Manuscript Templates for IEEE
Conference Proceedings to prepare your paper (
https://www.ieee.org/conferences/publishing/templates.html).

Authors of accepted papers will need to register online for the conference
before the early registration deadline (see below) in order for papers to
be published in the conference proceedings. Papers MUST be presented during
the conference, otherwise they will be removed from the IEEE Xplore Online
Proceedings.

*Deadlines for all Contributions:*

· Paper submission for all session types: *Dec. 15, 2024 Jan. 15 2025
(Firm and Final)*

· Paper acceptance notification: February 25, 2025

· Final camera-ready paper submission: April 15, 2025

· Deadline for early-bird registration: March 25, 2025


*Special Issue Opportunity *Selected papers accepted at ICHMS 2025 will
have the privileged opportunity to submit an extended version to a
dedicated Special Issue of the esteemed *IEEE Transactions on Human-Machine
Systems (THMS).*
Organizing Committee

*General Chair*

· Moayad Aloqaily, MBZUAI (UAE)

*General Co-Chair*

· Ji-Eun Kim, University of Washington (USA)

*Program Chairs*

· Raffaele Gravina, University of Calabria (Italy)

· Marina Gavrilova, University of Calgary (Canada)

· Manar Jammal, York 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/
*
**********************************************************

[DMANET] [SmartComp 2025] Call for Posters/Demos/WIP

****** SMARTCOMP 2025 - Call for Posters/Demos/WIP ******

SMARTCOMP 2025 is the 11th edition of the premier conference on Smart Computing. Smart computing is a multidisciplinary domain based on the synergistic influence of advances in sensor-based technologies, the Internet of Things, cyber-physical systems (CPS), edge computing, big data analytics, machine learning, cognitive computing, and artificial intelligence. Applications of smart computing can be found in different societal domains including, but not limited to, transportation, energy, environmental protection, smart and connected communities, healthcare, banking, industrial systems, entertainment, and social media. Algorithmic and system advancements in cloud computing, mobile/pervasive computing, cyber-physical systems, sensor networking, and social computing are taking smart computing to a new dimension and improving our ways of living.

The Posters and Work in Progress (WIP) session will provide a forum to discuss novel ideas, preliminary results, present innovative applications and tools, and bring about novel research questions, approaches, and directions.

The Demo session will focus on hands-on demonstrations of preliminary works on novel platforms, implementations, and case studies. We particularly welcome demos that present innovative designs or advancements in CPS, providing attendees with the opportunity to experience cutting-edge technology firsthand.

We encourage both academia and industry to contribute by sharing valuable insights into real-world applications and innovative solutions in Smart Computing.

Industry submissions are invited to reflect practical experiences, field trials, and emerging trends from an industrial perspective, demonstrating the impact and applicability of Smart Computing technologies.

Authors of papers that received favorable reviews but could not be accepted to the Main track may be offered the opportunity to publish their submitted work in the Posters/Demos/WIP track.

*********** Topics ******************

Areas of interest include (but are not limited to):

* Future Smart Computing Paradigms

* Models of Smart Environments

* Algorithms for Smart Computing

* AI and Machine Learning in Smart Computing

* Security, Privacy, and Trust Issues in Smart Computing

* Fairness and Socio-technical Issues of Smart Computing

* Cyber-physical System Platforms for Smart Environments

* Middleware Platforms for Smart Environments

* Mobile and Ubiquitous Platforms for Smart Environments

* Cloud, Edge and Fog Computing Platforms for Smart Systems

* Data Architectures and Analytics for Smart Computing

* Smart Computing for Smart and Connected Communities

* Smart Green Computing

* Social Computing and Smart Systems

* Wearable Computing and IoT for Smart Systems

* Architectures and Software for Smart Computing

* Novel Communication Paradigms (e.g., 5G/6G, VLC, DSA) in smart computing

* Quantum Computing in Smart Systems

* Interdisciplinary Approaches to Smart Computing

* Applications of Smart Computing include:

* Smart healthcare and digital epidemiology

* Smart agriculture

* Smart infrastructures

* Smart cities

* Smart energy, transportation, water distribution systems

* Smart factories

* Smart workspace


****** Submission Guidelines ******

Posters, Demos, and WIP papers should be no more than 3 pages in length, including figures,tables, and references.

All the submissions must be formatted according to the two-column IEEE proceedings template. IEEE provides corresponding formatting templates at IEEE proceedings template (ttps://www.ieee.org/conferences/publishing/templates.html). Make sure to use the conference mode of the template, i.e., LaTeX users must use the conference option of the IEEEtran document class. While the submission format is the same, the goals for Posters/WIP and Demos are different:

* Posters/WIP: We welcome papers up to 3 pages discussing early or ongoing research. Posters/WIP are intended to present ongoing research with a focus on novel methodologies, preliminary results, or innovative concepts that hold promise for future development, highlighting key ideas, or research directions in a concise format, fostering discussion and feedback on emerging work/applications.

* Demo: We welcome papers up to 3 pages focused on the specific component that will be demonstrated to the audience and how the attendees will be able to interact. They should also provide an overview of the background research leading up to the demo.

All submitted Posters/WIP, and Demos will be subject to peer reviews by SMARTCOMP Technical Program Committee members and other experts in the field. At least one author of each accepted paper must register and attend the conference to present the work.

Papers must be submitted electronically as a single PDF file on US Letter size paper (not A4), with all fonts embedded (the PDF-A standard complies with that), through EDAS. Select Posters/WIP or Demos Track at the following link: https://edas.info/newPaper.php?c=33045


****** Best Poster/Demo/WIP Award ******

In recognition of outstanding contributions to the field, SMARTCOMP 2025 will present the Best Posters/Demos/WIP Award to the submission that demonstrates exceptional quality, innovation, and potential impact in Smart Computing. This award will honor the work that best exemplifies forward-thinking approaches and technological advancements showcased during the Posters/Demos/WIP presentation.


****** Important Dates ******

* Paper submission: 23rd March 2025

* Acceptance notification: 6th April 2025

* Camera ready (tentative): 10th May 2025


****** Posters/Demos/WIP Co-Chairs ******

* Nasibeh Zohrabi (Penn State Brandywine, USA)

* Francesca Righetti (University of Pisa, Italy)
**********************************************************
*
* 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] Academic Position in Machine Learning, AI, or Data Science at Heidelberg University

The Department of Computer Science at Heidelberg University invites
applications for the position of Akademische*r Rat/Rätin (A13), starting
March 1, 2025.

We are seeking computer scientists aiming for an academic career in
Machine Learning, Artificial Intelligence, or Data Science with a strong
interest in teaching. Responsibilities include:

- Teaching core and advanced computer science courses (lectures,
seminars, and labs).
- Conducting research in ML, AI, or Data Science, preferably with
applications in industry, business, or public administration.
- Supporting the department in teaching administration and quality
development.

Requirements: A completed university degree, a Ph.D., excellent teaching
skills, and strong German and English proficiency. Postdoctoral academic
or relevant professional experience is advantageous.

Applications (motivation letter, CV, transcripts, publication list,
teaching record, and evaluations if available) should be sent as a
single PDF to Prof. Dr. Artur Andrzejak
(artur.andrzejak@uni-heidelberg.de) by January 7, 2025.

More information (in German) about the position can be found in
https://tinyurl.com/3733m2ch

Best regards
Christian Schulz
**********************************************************
*
* 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] PhD Fellowship position in Quantum-Inspired Evolutionary Algorithm for Multi-Objective Integrative Optimization

PhD Fellowship position in Quantum-Inspired Evolutionary Algorithm for Multi-Objective Integrative Optimization
We are looking for a highly motivated individual to join as a PhD Fellow at Oslo Metropolitan We seek a highly motivated individual to join as a PhD Fellow at our Artificial Intelligence Group, Oslo Metropolitan University, Norway. This fully funded position focuses on Quantum-Inspired Evolutionary Algorithms. This is a fantastic opportunity to join our dynamic Artificial Intelligence research group and work on cutting-edge AI and quantum computing research.
Application Deadline: 20 January 2025
For more details about the position, including the benefits, application process and requirements, and to apply, please visit:
https://www.oslomet.no/en/work/job-openings/phd-fellowship-position-in-quantum-inspired-evolutionary-algorithm-for-multi-objective-integrative-optimization

Area of Research
The primary objective of this project is to formulate and implement a multi-objective quantum-inspired EAs (QEA) tailored specifically for classical computers, focusing on addressing the prevalent challenges in the domain of multi-objective integrative optimization (MIO) problems. Real-world optimization problems, prevalent in industries, are often complex, involving different interrelated optimization problems with multiple interconnected and conflicting objectives. Most of these involved independent optimization problems are interrelated, and combining them into a global integrative optimization problem is therefore necessary. This proposal considers formulating an MIO problem by combining k optimization problems, resulting in k objective functions. As a result, instead of seeking a single solution, the approach provides a set of alternatives (Pareto-optimal front) that reflect the trade-off between the objectives resulting from the MIO, allowing decision-makers to choose based on their preferences. This practical approach is expected to enhance the decision-making process in industries significantly.

Recently, the emergence of quantum-inspired EAs (QEAs) has opened up new avenues for enhancing the effectiveness of EAs by striking a better balance between exploration and exploitation. Drawing inspiration from quantum mechanics, QEAs integrate concepts such as superposition, quantum parallelism, entanglement, interference, coherence, and measurement into the existing EA framework. Recent advancements have underscored the significant advantages of QEAs over classical EAs, demonstrating success in solving complex NP-hard problems that were previously deemed computationally intractable for classical computers. However, existing QEAs are typically designed for single optimization problems and exhibit optimal efficiency on specialized quantum hardware rather than classical computers. They also encounter challenges in maintaining coherence and leveraging entanglement for efficient exploration, necessitating further exploration of quantum operators and encoding schemes that can adapt to diverse problem structures and objective functions.

This project aims to bridge this gap by developing a novel multi-objective QEA that is specifically designed for classical computing environments. By utilizing quantum-inspired techniques, the objective is to provide industries with a practical and efficient solution for tackling real-world complex multi-objective optimization challenges in areas such as manufacturing and logistics.

Contact: If you would like more information about the position, feel free to contact the Principal Supervisor: Kazi Shah Nawaz Ripon, email: kazi.ripon[at]oslomet.no


----------------------------
Kazi Shah Nawaz Ripon
Associate Professor
Department of Computer Science
OsloMet - Oslo Metropolitan University
Oslo, Norway


**********************************************************
*
* 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] DCFS 2025 - Second Call for Papers

============================================================================

DCFS 2025 - Call for Papers

26th International Conference on Descriptional Complexity of Formal Systems

July 22-24, 2025, Loughborough, UK

https://www.lboro.ac.uk/departments/compsci/events/dcfs-2025/

============================================================================

DCFS 2025 will be held in Loughborough, UK, on July 22-24, 2025.
The conference is organized by the Department of Computer Science, Loughborough
University, and by the IFIP Working Group 1.02 "Descriptional Complexity".

The conference will be co-located with NCMA 2025 (July 21-22, 2025).


PRINCIPAL TOPICS

Submissions concerning the descriptional complexity of formal systems and
structures (and its applications) are invited for DCFS 2025. Original papers
are sought in all aspects of descriptional complexity. Topics include, but are
not limited to:

- Automata, grammars, languages and other formal systems; various modes of
operations and complexity measures.
- Succinctness of description of objects, state-explosion-like phenomena.
- Circuit complexity of Boolean functions and related measures.
- Size complexity of formal systems.
- Structural complexity of formal systems.
- Trade-offs between computational models and mode of operation.
- Applications of formal systems-- for instance in software and hardware
testing, in dialogue systems, in systems modeling or in modeling natural
languages-- and their complexity constraints.
- Co-operating formal systems.
- Size or structural complexity of formal systems for modeling natural
languages.
- Complexity aspects related to the combinatorics of words.
- Descriptional complexity in resource-bounded or structure-bounded
environments.
- Structural complexity as related to descriptional complexity.
- Frontiers between decidability and undecidability.
- Universality and reversibility.
- Nature-motivated (bio-inspired) architectures and unconventional models of
computing.
- Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.


INVITED SPEAKERS

- Giuseppa Castiglione (Palermo, Italy)
- Ian McQuillan (Saskatoon (SK), Canada)
- Irek Ulidowski (Leicester, UK)


PROGRAM COMMITTEE

- Henning Bordihn (Potsdam, Germany)
- Pascal Caron (Rouen, France)
- Szilárd Zsolt Fazekas (Akita, Japan)
- Dora Giammarresi (Rome, Italy)
- Yo-Sub Han (Seoul, Korea)
- Galina Jirásková (Košice, Slovakia)
- Stavros Konstantinidis (Halifax (NS), Canada)
- Martin Kutrib (Giessen, Germany)
- Sylvain Lombardy (Bordeaux, France)
- Andreas Malcher (Giessen, Germany, co-chair)
- Dana Pardubská (Bratislava, Slovakia)
- Luca Prigioniero (Loughborough, United Kingdom, co-chair)
- Rogério Reis (Porto, Portugal)
- Kai Salomaa (Kingston (ON), Canada)
- Marinella Sciortino (Palermo, Italy)
- Shinnosuke Seki (Tokyo, Japan)
- Taylor Smith (Antigonish (NS), Canada)
- Nicholas Tran (Santa Clara (CA), USA)
- György Vaszil (Debrecen, Hungary)
- Hsu-Chun Yen (Taipei, Taiwan)


IMPORTANT DATES

- Paper submission deadline: March 16, 2025
- Author notification: April 27, 2025
- Camera-ready deadline: May 11, 2025
- Conference: July 22-24, 2025


PAPER SUBMISSION

Submissions to DCFS must not exceed 12 pages (in Springer-Verlag's
Lecture Notes style and including bibliography). If the authors believe
that more details are essential to substantiate the main claims, they
may include a clearly marked appendix that will be read at the
discretion of the program committee. Simultaneous submissions of papers
to any other conference with published proceedings or submitting
previously published papers is not allowed. Only electronic submissions
in the PDF format are accepted. Papers should be submitted electronically
through the EasyChair system at this link:
https://easychair.org/conferences/?conf=dcfs2025
The proceedings will be published by Springer-Verlag in the series Lecture
Notes in Computer Science.


CONTACT

e-mail: DCFS2025@lboro.ac.uk <mailto:DCFS2025@lboro.ac.uk>
website: https://www.lboro.ac.uk/departments/compsci/events/dcfs-2025/


**********************************************************
*
* 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] [JAIR Special Track - 1st CFP] Integration of Logical Constraints in Deep Learning

(apologies for cross-posting)

======================================================================
Special Track on Integration of Logical Constraints in Deep Learning
----------------------------------------------------------------------
Journal of Artificial Intelligence Research (JAIR)
Deadline: May 31, 2025
Info: https://www.jair.org/index.php/jair/SpecialTrack-LogicDL
======================================================================
Track Editors:
----------------------------------------------------------------------
Alessandro Abate, University of Oxford, U.K.
Eleonora Giunchiglia, Imperial College London, U.K.
Bettina Könighofer, Graz University of Technology, Austria
Luca Pasa, University of Padova, Italy
Matteo Zavatteri, University of Padova, Italy
======================================================================

Overview:

Over the last few years, the integration of logical constraints in Deep
Learning models has gained significant attention from research communities
for its potential to enhance the interpretability, robustness, safety, and
generalization capabilities of these models. This integration opens the
possibility of incorporating prior knowledge, handling incomplete data, and
combining symbolic and subsymbolic reasoning. Moreover, the use of logical
constraints improves generalization, formal verification, and ethical
decision-making. The versatility of logical constraint integration spans
diverse domains, presenting both research challenges and opportunities. In
recent times, there has been a growing trend in incorporating logical
constraints into deep learning models, especially in safety-critical
applications. Looking ahead, challenges in this field extend to the
development of Machine Learning models that not only incorporate logical
constraints but also provide robust assurances. This involves ensuring that
AI systems adhere to specific (temporal) logical or ethical constraints,
offering a level of guarantees in their behavior.

Thus, this special track seeks submissions on the integration of logical
constraints into deep learning approaches. We are particularly interested
in the following broad content areas.

- Formal verification of neural networks is an active area of research that
has been proposing methods, tools, specification languages (e.g., VNNLIB),
and annual competitions (e.g., VNN-COMP) devoted to verify that a neural
network satisfies a certain property typically given in (a fragment) of
first order logic.

- Synthesis aims at synthesizing neural networks that are compliant with
some given constraint. Approaches to achieve this aim range from modifying
the loss function in the training phase (i.e., soft constraint injection)
to exploit counterexample guided inductive synthesis (CEGIS).

- Monitoring: Logical constraints can be used to mitigate and/or neutralize
constraint violations of machine learning systems when formal verification
and synthesis are not possible. Shielding techniques intervene by changing
the output of the network when a constraint is being violated. Runtime
monitoring can be used to anticipate failures of AI systems without
modifying them.

- Explainability: Automated learning of formulae and logical constraints
from past executions of the system provides natural explanations for neural
network predictions and poses another avenue for future research. Formulae
and constraints offer a high degree of explainability since they carry a
precise syntax and semantics, and thus they can be "read" by humans more
easily than other explainability methods.

This special track aims to explore and showcase recent advancements in the
integration of logical constraints within deep learning models, spanning
the spectrum of verification, synthesis, monitoring and explainability, by
considering exact and approximate solutions, online and offline approaches.
The focus will also extend to encompass innovative approaches that address
the challenges associated with handling logical constraints in neural
networks.

Submissions:

This special track seeks contributions that delve into various aspects of
logic constraint integration in deep learning, including, but not limited
to:

- Learning with logical constraints
- Enhancing neural network expressiveness for logical constraints
- Formal verification (certification) of neural networks
- Automated synthesis of certified neural networks, or of AI systems with
neural nets
- Decision making: Strategy/policy synthesis for AI systems with neural
networks
- Runtime monitoring of AI systems
- Learning of (temporal) logic formulae for explainable and interpretable AI
- Scalability challenges in neural networks with logical constraints
- Real-world applications of neural networks with logical constraints
- Enhancing model explainability via logical constraints
- Design of neural networks under temporal logical requirements

Pertinent review papers of exceptional quality may also 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/
*
**********************************************************

[DMANET] SoCS 2025: 1st Call for Papers

*1st Call for Papers*

*SoCS 2025 <https://socs25.search-conference.org/>*

*The 18th International Symposium on Combinatorial Search*

https://socs25.search-conference.org/


August 12-15, 2025

University of Glasgow, Scotland, United Kingdom

co-located with CP and SAT

Paper submission deadline: March 19, 2025


You are cordially invited to submit your new research findings to the
18th Symposium of Combinatorial Search (SoCS 2025), jointly organized
with SAT 2025 and CP 2025 in Glasgow, UK, from August 12 to August 15,
2024. The joint conference already starts on August 10th, with the first
two days devoted to CP and SAT workshops and doctoral consortiums
only.*The* *SoCS Doctoral Consortium* will be organized during the SoCS
conference days as usual.

Heuristic search and other forms of combinatorial search and
optimization are very active areas of research in artificial
intelligence, robotics, planning, constraint programming,
meta-reasoning, navigation, bioinformatics, and other areas of computer
science and operations research. The International Symposium on
Combinatorial Search is meant to bring researchers in such areas
together to exchange their ideas and cross-fertilize the field. We
especially invite submissions presenting real-world applications of
heuristic search.

With CP 2025 and SAT 2025 co-located this year, we particularly welcome
papers that explore the intersections between our research topics and
the problems studied by these communities.

All accepted papers will be included in the proceedings published by
AAAI Press <https://aaai.org/aaai-publications/> as usual
<https://ojs.aaai.org/index.php/SOCS/issue/archive>. *
*

*Important Dates*

*

Paper abstract submission deadline: *March 12, 2025*  (11:59 PM UTC-12)

*

Paper submission deadline: *March 19, 2025* (11:59 PM UTC-12)

*

Author response period: May 2 - May 5, 2025

*

Notification: May 16, 2025


*Types of Submissions*

*

Technical papers:Original long (up to 8 pages plus up to one page of
references) and short (up to 4 pages plus up to one page of
references) papers.

*

Position papers:Original long  (up to 8 pages plus up to one page of
references)  and short (up to 4 pages plus up to one page of
references) position papers.

*

Extended abstracts: Extended abstracts (up to 2 pages including
references) of original work, work-in-progress, or work that has
recently appeared in or is under review at other venues.

See more details at https://socs25.search-conference.org/call-for-papers


*Best Paper Awards*

Technical papers will be considered for the best paper award. If the
main authors, both in terms of work and writing, are students at the
time of submission, the paper will be considered for a best student
paper award.

*Conference Chairs*

*

Maxim Likhachev, Carnegie Mellon University, USA (maxim@cs.cmu.edu )

*

Hana Rudová, Masaryk University, Czech Republic (hanka@fi.muni.cz )

*

Enrico Scala, University of Brescia, Italy (enrico.scala@unibs.it )

*
*

*Doctoral Consortium Chairs*

*

Lukáš Chrpa, Czech Technical University, Czech Republic
(chrpaluk@cvut.cz )

*

Francesco Percassi, University of Huddersfield, United Kingdom
(f.percassi@hud.ac.uk )


*Local Arrangements Chair*

*

Ciaran Mccreesh, University of Glasgow, United Kingdom
(ciaran.mccreesh@glasgow.ac.uk )

**********************************************************
*
* 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] PhD and Postdoctoral positions in Theoretical Computer Science at the University of Copenhagen

The Department of Computer Science at the University of Copenhagen (DIKU) invites applications for PhD and Postdoctoral positions in theoretical computer science.

DIKU hosts a world-leading research environment (currently ranked 1st in the EU in algorithms and complexity theory by CSrankings.org), with a strong presence at top-tier conferences like STOC, FOCS, SODA, CCC, SoCG and NeurIPS. We are home to the Basic Algorithms Research Copenhagen (BARC) centre (https://barc.ku.dk/), joint with the IT University of Copenhagen, and have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Øresund Bridge, as well as with our many visitors.

The Phd positions tentatively commence 1 September 2025 (but the starting date is negotiable).

The postdoctoral positions have a flexible starting date between April and September 2025, and the intended duration is 1-2 years (subject to negotiation).

More information regarding the positions and how to apply can be found at the webpages linked below.

PhD: https://employment.ku.dk/phd/?show=163037

Postdoc: https://jobportal.ku.dk/videnskabelige-stillinger/?show=163121

The application deadline for both positions is *January 10, 2025*.

Contact: Srikanth Srinivasan (srsr@di.ku.dk)


**********************************************************
*
* 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/
*
**********************************************************