Thursday, November 23, 2023

[DMANET] PhD studentship, University of Birmingham (theory of co-evolution)

Dear colleagues,

Applications are invited for a PhD studentship on Theory of Evolutionary
Computation in the School of Computer Science at the University of
Birmingham (UK).

Co-evolutionary algorithms are heuristic optimisation techniques,
mimicking biological principles of natural selection, e.g. for
minimax/robust optimisation and learning game playing strategies. Such
algorithms have been successfully applied to various industrial
optimisation domains. However, the theoretical understanding of these
methods has been limited.

The successful candidate will contribute, together with other project
team members and international academic and industrial partners, towards
developing the theoretical foundation necessary for the design of
efficient and reliable co-evolutionary algorithms. The PhD position is
associated with the UKRI Turing AI Acceleration Fellowship project
"Rigorous Time-Complexity Analysis of co-Evolutionary Algorithms",
providing generous travel allowance, computing facilities etc.

The ideal candidate will have a strong background in either mathematics
or computer science. The studentship covers UK "home student" rates.

To apply, please see

https://www.birmingham.ac.uk/schools/computer-science/postgraduate-research/applying-for-phd-in-computer-science.aspx

The official closing date is December 1st 2023, however please feel free
to contact me after this time.

Best wishes,
Professor Per Kristian Lehre
School of Computer Science
University of Birmingham, UK
http://www.cs.bham.ac.uk/~lehrepk
@pklehre on Twitter

**********************************************************
*
* 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, November 22, 2023

[DMANET] PhD position at WU Vienna, Austria

Applications are invited for a PhD position at the Research Institute for Supply Chain Management at WU (Vienna University of Economics and Business). The position is available from February 1, 2024, for 30h/week. The appointment is for 3 years.
You will actively collaborate on an exciting third-party funded research project. The project addresses optimization problems on strategical, tactical, and operational levels for deploying sustainable distribution modes such as cargo bikes, robots or walking couriers in a multi-echelon setting. The project is a collaboration with EM Normandie (France).

What to expect
-Active collaboration in an exciting research project in an international research environment
-Teamwork: You will be working to advance research in your field together with an international team of researchers
-Building up a network: You can create your own professional network for the future
-The possibility of attending international scientific workshops and conferences.

What you have to offer
-Academic degree: You have a diploma/master's degree in business computing, mathematics, computer science or a related field that qualifies you for enrollment in a doctoral program at WU.
-Strong knowledge of Operations Research (E.g. thesis written in Operations Research or a strongly related topic)
-Excellent Programming language skills (e.g. in C, C++, Python …)
-Interest in sustainable transportation
-Proficiency in English

What we offer you
-Inspiring campus life with over 2,400 employees in research, teaching, and administration and approximately 21,500 students
-A modern campus with spectacular architecture in the heart of Vienna
-Excellent accessibility by public transportation
-Meaningful work in an open-minded, inclusive, and family-friendly environment
-Flexible working hours
-A wide range of benefits, from an in-house medical officer to athletic activities and a meal allowance to a variety of employee discounts

The minimum monthly gross salary amounts to €2,464.80 (14 times per year). This salary may be adjusted based on job-related prior work experience. In addition, we offer a wide range of attractive social benefits.
For further information about this position, please contact Vera Hemmelmayr: vera.hemmelmayr@wu.ac.at
Applications can be submitted by December 13, 2023
www.wu.ac.at/jobs (ID 1960)
We are looking forward to hearing from you!
**********************************************************
*
* 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 Call for Papers: 40th SoCG in Athens, Greece

Final CALL FOR PAPERS: 40TH SOCG

The 40th International Symposium on Computational Geometry (SoCG 2024) is planned to be held in Athens, Greece, June 11–14 2024, as part of the Computational Geometry (CG) Week. We invite high quality submissions that describe original research on computational problems in a geometric and/or topological setting. Topics of interest include, but are not limited to:
• Design, analysis, and implementation of geometric algorithms and data structures;
• Computational complexity of geometric problems;
• Implementation and experimental evaluation of geometric algorithms and heuristics, including mathematical, numerical, and algebraic aspects;
• Discrete and combinatorial geometry;
• Computational topology, topological data analysis, and topological combinatorics;
• Applications of computational geometry or topology in any field.


IMPORTANT DATES

• 24 November 2023: Abstracts due (23:59 AoE (anywhere on Earth))
• 01 December 2023: Papers due (23:59 AoE (anywhere on Earth))
• 05 February 2024: Notification of acceptance/rejection
• mid March 2024: Final versions of accepted papers due
• 11–14 June 2024: Symposium

SoCG 2024 conference web page: http://socg24.athenarc.gr/socg.html

SoCG 2024 HotCRP submission webpage: https://socg24.hotcrp.com/


CODE OF CONDUCT

SoCG is dedicated to providing an environment that is free from harassment, bullying, discrimination, and retaliation for all participants. All attendees, speakers, sponsors, and volunteers at our conference are required to agree with the CG Week code of conduct.

A person found in violation of these standards can be barred from attendance. This includes violations and sanctions that were established by other academic or professional institutions as the outcome of a formal enquiry.

If an author has a conflict of such nature with a potential reviewer, and the author has sufficient grounds to believe that the review would be negatively biased, then the author is asked to declare this conflict in HotCRP. You are also welcome to contact a SoCG SafeTOC advocate who will treat any supporting information confidentially. For a list of SoCG advocates with contact information, please refer to CG Week Code of Conduct.


SUBMISSION GUIDELINES

— Paper types —
When writing or evaluating a SoCG paper, it is important to keep in mind that there are different types of contributions, each with its own strengths. To ensure that a submission is evaluated on its own merits, authors will need to identify the main strengths of their submission, as captured by four possible paper types. PC members and external reviewers will be asked to take into account these paper types together with their associated evaluation criteria when they evaluate a paper. There are no quotas for the paper types and submissions can be labeled with more than one paper type at the time of submission.
• Mathematical Foundations: A typical paper will contain theorems and proofs describing new results in discrete or combinatorial geometry, discrete differential geometry or topology, or in topological combinatorics. The paper will primarily be evaluated on its technical depth, the importance of the results, the elegance of the solution, the connection of the problem studied to computational geometry and topology, and the potential future impact on algorithm development.
• Algorithmic Complexity: A typical paper will contain algorithms, data structures, theorems, proofs, or lower bound constructions describing new results on computational geometry problems. The paper will primarily be evaluated on the (mathematical or computational) relevance and importance of the problem studied, its technical depth, the elegance of the solution, and the potential future impact of the results or the proposed new methods and techniques.
• Experiments and Implementation: A typical paper will make a clear contribution to the implementation and evaluation of geometric algorithms, such as exact, approximate, or algebraic computation, algorithms engineering, or the experimental evaluation of competing algorithmic approaches. The paper will primarily be evaluated on the completeness and the expected impact of the proposed implementation, the soundness of the experiments, the quality and quantity of testing, and on the general amount of knowledge gained.
• Applications: A typical paper will describe the modeling and algorithmic choices made when developing or adapting computational geometry techniques for an application area. The paper will be primarily evaluated on the soundness of the modeling decisions, the ingenuity of the solution, the effectiveness of the proposed method, and the expected impact in the application area. One might also consider the lesson learned regarding the applicability or suitability of computational geometry tools to the specific area.

— Double Blind and PC submissions —
This year's SoCG will employ a lightweight double-blind reviewing process, and will allow PC members (other than the PC chairs) to submit to the conference as well. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). Particular care needs to be taken if there is any accompanying software or data, which needs to be linked anonymously (for example, via a DropBox folder or Anonymous GitHub (https://anonymous.4open.science/), perhaps with a subset of synthetic data if the real data is not anonymized). Upon registering a submission, the authors will declare conflicts of interest with PC members, as well as listing email address or domain level conflicts (i.e. "Jeff M. Phillips (University of Utah)", "All (Freie Universität Berlin)") of other professional or personal conflicts. The purpose of lightweight double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. We encourage authors with further questions on double-blind reviewing to contact the PC chairs, or to see the more detailed discussion in the proposal (https://computational-geometry.org/documents/Double_blind_proposal.pdf) that preceded the vote to move to double blind.

— Format —
Submissions must be formatted in accordance with the LIPIcs proceedings guidelines (https://www.dagstuhl.de/en/publications/lipics). Authors must use the LaTeX class file socg-lipics-v2021.cls(https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; use the one updated in 2022) (version 0.9), with the option "anonymous"; note that the cls file is a wrapper around the standard LIPIcs class. The LIPIcs style and instructions are available here (https://submission.dagstuhl.de/series/details/5#author); the class file is available here (https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; note these were updated in 2022), and instructions on how to use it are available here (https://computational-geometry.org/guidelines/linecount_2022_09_19.pdf). Submissions must not exceed 500 lines, excluding front matter (title), references, and a clearly marked appendix (further described below), but including all other lines (in abstract, algorithms, tables, captions, etc.). The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors not to exceed 500 lines even if some lines are not counted automatically.

— Contents of the submission —
Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, as well as a short abstract. This should be followed by the main body of the paper that begins with a precise statement of the problem considered, a succinct summary of the results obtained (emphasizing the significance, novelty, and potential impact of the research), and a clear comparison with related work. The remainder of the extended abstract should provide sufficient details to allow the program committee to evaluate the validity, quality, and relevance of the contribution. Clarity of presentation is very important; the entire extended abstract should be written carefully, taking into consideration that it will be read and evaluated by both experts and non-experts, often under tight time constraints.

— Appendix and additional data —
All details needed to verify the results must be provided. Supporting materials, including proofs of theoretical claims and experimental details, that do not fit in the 500-line limit should be given in an appendix. If more appropriate, the full version may be given as the appendix. In both cases, however, the authors should include in the main part specific pointers to the relevant locations in the appendix. The appendix will be read by the program committee members and subreviewers at their discretion and will not be published as part of the proceedings. Thus, the paper without the appendix should be able to stand on its own. Experimental and implementation results (independent of paper type) must be reproducible and verifiable. Authors of all types of papers are encouraged to put accompanying software and relevant data, if there are any, in a repository accessible to the reviewers. Authors are asked to indicate which of the supporting materials will remain publicly available if their papers are accepted.

— Previous or simultaneous submission —
Results previously published or accepted for publication in the proceedings of another conference cannot be submitted. Simultaneous submissions of the results to another conference with published proceedings are not allowed. Exempted are workshops and conferences without formal proceedings, but possibly with handouts containing short abstracts. In particular, submissions of papers that have appeared or will be submitted to EuroCG are allowed, since EuroCG does not publish formal proceedings, while submissions of papers that have appeared in CCCG are not allowed. Results that have already been accepted (with or without revision) for publication in a journal at the time of their submission to the symposium are not allowed.

— Strict guidelines —
Submissions deviating from the above guidelines risk being rejected without further consideration.

— Guidelines for reviewers —
The guidelines are available here (https://computational-geometry.org/guidelines/socg-reviewing.pdf).


ACCEPTED PAPERS

— Presentation, awards, and special issues —
An author of each accepted paper will be expected to attend the symposium and present the paper (approximately 20 minutes). The format of both attendance and presentation will be clarified closer to the event. Awards will be given for the best paper and for the best student presentation. Authors of a selection of papers from the symposium will be invited to submit extended versions of their papers to special issues of Discrete & Computational Geometry and Journal of Computational Geometry. As in the previous years, the authors of the best paper will be invited to submit an extended version of their paper to the Journal of the ACM.

— Format —
Final proceedings versions of accepted papers must respect the same formatting constraints as the submissions (LIPIcs proceedings format https://submission.dagstuhl.de/series/details/5#author with socg-lipics-v2021 https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; 500-line limit, excluding front matter and references), but must not comprise any appendix. If any supporting material (including complete proofs of theoretical claims and experimental details) does not fit in the specified limit, then the full version of the paper containing this information must be referenced in the conference version and made available at a public repository, such as arXiv, by the time the final version is submitted. Where applicable, we encourage the authors to make accompanying software and/or data publicly accessible, with proper references in the paper.


PROGRAM COMMITTEE

• Peyman Afshani, Aarhus University, Denmark
• Hee-Kap Ahn, Pohang University of Science and Technology, South Korea
• Boris Aronov, New York University, USA
• Sayan Bandyapadhyay, Portland State University, USA
• Gill Barequet, Technion - Israel Inst. of Technology, Israel
• Karl Bringmann, Universität des Saarlandes, Germany
• Maike Buchin, Ruhr-Universität Bochum, Germany
• Tamal Dey, Purdue University, USA
• Omrit Filtser, Open University of Israel, Israel
• Sariel Har-Peled, University of Illinois, Urbana-Champaign, USA
• Meng He, Dalhousie University, Canada
• Michael Hoffmann, Eidgenössische Technische Hochschule Zürich, Switzerland
• Chaya Keller, Ariel University, Israel
• Clement Maria, INRIA, France
• David Mount, University of Maryland, USA
• Wolfgang Mulzer, Freie Universität Berlin, Germany (co-chair)
• Steve Oudot, INRIA, France
• Dömötör Pálvölgyi, Eötvös Loránd University, Hungary
• Evanthia Papadopoulou, Università della Svizzera italiana, Switzerland
• Salman Parsa, DePaul University, USA
• Zuzana Patáková, Univerzita Karlova, Czech Republic
• Jeff M. Philips, University of Utah, USA (co-chair)
• Benjamin Raichel, University of Texas at Dallas, USA
• Lena Schlipf, University of Tübingen, Germany
• Melanie Schmidt, Heinrich Heine University Düsseldorf, Germany
• Micha Sharir, Tel Aviv University, Israel
• Rodrigo Silveira, Universitat Politècnica de Catalunya, Spain
• Andrew Suk, University of California, San Diego, USA
• Subhash Suri, University of California, Santa Barbara, USA
• Martin Tancer, Univerzita Karlova, Czech Republic
• Yufei Tao, The Chinese University of Hong Kong, China
• Csaba D. Tóth, California State University Northridge, USA
• Birgit Vogtenhuber, Technische Universität Graz, Austria

**********************************************************
*
* 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] M1 or M2 Internship on Scheduling at Ecole Polytechnique

Dear all,

The computer science laboratory of Ecole Polytechnique (LIX) offers in
collaboration with the company Konatus (co-located on the campus of IP
Paris) an M1 or M2 *internship on a resource-constrained scheduling
problem.* The internship has an *empirical focus with a theoretical
foundation.* Hence, interest in both areas is very welcome.

The scheduling problem at hand is concerned with the automated
management of development processes in companies. In such processes,
different projects are split into smaller parts (such as work elements
or tasks), which need to be assigned to different teams. Each team has
various skills and capacities, and each task has a priority, a start and
an end date, a cost, and other factors. The aim is to assign the
different parts of each project to the teams such that all constraints
are satisfied and that the overall time spent on the projects is minimized.

Due to various constraints as well as the diverse nature of projects and
set-up of teams, this problem is challenging. To this end, heuristic
solvers are employed, which provide a great compromise between finding
good solutions and reducing the run time of the solver. At the moment,
Konatus uses an evolutionary algorithm as such a heuristic solver. This
algorithm acts as the baseline for the internship. *The goal of the
internship is to come up with an improved heuristic solver for the
scheduling problem.* This new algorithm can be tested on different data
sets provided by Konatus (both artificial and from the real world).

The internship is going to be financed by Konatus, and Max Stellmacher
(max.stellmacher@konatus.io) from Konatus acts as domain experts during
the internship. From LIX, Martin Krejca
(martin.krejca@polytechnique.edu) acts as the scientific advisor of this
project. Initially, the student should study the theoretical aspects of
this problem and determine to what end it can be decomposed or optimal
sub-problems can be solved. Based on such insights, the next step is to
implement a solver that computes good schedules, which ideally
outperform the baseline (in terms of solution quality and run time).

This internship has the potential to be continued as a CIFRE thesis.

If you are interested or have further questions, please contact Martin
(martin.krejca@polytechnique.edu).

Best regards,

Martin

**********************************************************
*
* 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 posters and short contributed talks on "Deep Reinforcement Learning: Bridging Theory and Practice" at ISAIM-2024 (Ft. Lauderdale. Florida, Jan. 8-10, 2024)

Call for posters and short contributed talks

Workshop Theme: "Deep Reinforcement Learning: Bridging Theory and Practice"
Organizers: Abhishek Gupta and Zhaoran Wang
Dates & Venue: January 8–10, 2024, at the International Symposium on
Artificial Intelligence and Mathematics (ISAIM 2024), Ft. Lauderdale, FL
https://isaim2024.cs.ou.edu/index.html

Submission: https://forms.gle/MJuSJHJpuJ3mFevf6

Overview: Deep Reinforcement Learning (DRL) stands at the forefront of AI
research, shaping the future of diverse fields from robotics to finance.
However, the journey from theoretical foundations to practical applications
in DRL is laden with challenges. Our workshop, a special session of ISAIM
2024, aims to address these challenges by fostering a deeper understanding
and appreciation of the latest advancements in DRL.

Key Features:
* Expert Speakers: Gain insights from renowned figures in academia and
industry on cutting-edge DRL research and trends.
* Hands-on Labs: Experience the implementation of advanced DRL
algorithms through practical sessions.
* Discussion Panels: Engage in enriching discussions moderated by
leading DRL professionals.
* Poster Sessions: An opportunity to network and collaborate with peers.
* Key Challenges Addressed: Sample efficiency, exploration vs.
exploitation, transfer learning, stability and convergence, and
real-world application barriers.

Objective: Our goal is to illuminate the connection between the theoretical
and practical aspects of DRL, addressing inherent challenges in the field.
Participants will gain comprehensive knowledge, backed by hands-on experiences
and expert-led discussions.

Target Audience: This workshop is ideal for researchers, AI practitioners,
graduate students, and industry professionals keen on exploring the forefront
of Deep Reinforcement Learning.

Call for Posters: We invite submissions for poster presentations that align
with the theme of the workshop. This is an excellent opportunity to
showcase your research, share novel ideas, and interact with experts in the
field. There is also a possibility for short contributed talks.

Submission Guidelines:
* Poster topics should be relevant to DRL and its challenges.
* Abstracts should be concise, clearly outlining objectives,
methodology, and findings.
* Include author(s) name, affiliation, and contact information.

Submission Deadline: Jan. 5, 2024

Contact Information: zhaoranwang@gmail.com

Join us in exploring the intricate world of DRL and contribute to bridging
the gap between theory and practice. We look forward to your insightful
contributions and lively discussions!
**********************************************************
*
* 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, November 21, 2023

[DMANET] PhD position in probabilistic combinatorics, University of Auckland, New Zealand

One PhD Position (3 years) in Probabilistic Combinatorics is available at
the School of Computer Science, University of Auckland, New Zealand.

A successful candidate will pursue their PhD degree under the supervision of
Dr. Rajko Nenadov. The position is funded by the Marsden Fast-Start project
"Emergence of large structures in random graphs and games". The preferred
starting date is 1 May 2024. Later or earlier starting date can be
negotiated.

Qualifications:
- Interest in combinatorics and discrete mathematics, algorithms,
probability
- Strong track record of mathematical/computer science studies
- Master's degree in mathematics or theoretical computer science

Application documents:
- Cover letter describing your qualification and your research experience
and interests
- Transcript (or a list) of courses for your Masters and Bachelor programs
including grades
- Master thesis if available
- CV

Please merge all your application documents into a single pdf-file and
send it by e-mail to rajko.nenadov@auckland.ac.nz.
Please also arrange one letter of recommendation to be sent to the same
address.

**********************************************************
*
* 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 student position in "Algorithm Engineering for Process Mapping"

***DEADLINE APPROACHING****

You love algorithms, their analysis and efficient implementation? You
are about to or know somebody who graduates with an excellent Master's
degree and is looking for a PhD position? Then please read on:

The algorithm engineering group at Heidelberg University is inviting
applications for a full-time position of a PhD Student
starting on January 1st, 2024 (the exact date is negotiable).
The initial contract length is two years, but an extension is highly
expected.

Working Area:

A successful candidate will work under the supervision of Prof. PD. Dr.
Christian Schulz on the topics of algorithm engineering, parallel and
distributed algorithms in particular for process mapping and other
partitioning problems. Further responsibilities as part of the position
include the supervision of bachelor and master students and possibly TA
duties.

Requirements:

- Very good university degree (Master or equivalent) in computer science
or a related field
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis or relevant courses); knowledge
in combinatorial algorithms and linear algebra is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement

Heidelberg University offers excellent conditions for undergraduate,
graduate, and PhD students. As part of the university we pursue a
non-discriminatory employment policy and value equal opportunities, as
well as diversity (https://www.uni-heidelberg.de/diversity/). The
universities lay special emphasis on increasing the number of women in
senior and in academic positions. Given equal qualifications, preference
will be given to female applicants.

Please forward this email to anyone who may be interested or send your
application documents (cover letter, CV, copies of certificates, and the
contact information of two references if available) to the address
below. We will try to fill the position as soon as possible. Please send
you application via email no later than December 1, 2023 to:

Algorithm Engineering Group
Heidelberg University
Prof. PD. Dr. Christian Schulz
Germany
email: christian.schulz@informatik.uni-heidelberg.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] Second Announcement: CG Challenge 2024

Dear colleagues,

The Fifth Computational Geometry Challenge will be part of CG Week
in Athens, Greece, June 10-14, 2024.

There is still plenty of time to participate - or introduce it to your students!
(Contest closes January 27 - see times below.)

As in previous years, the objective will be to compute good solutions
to instances of a difficult geometric optimization problem.
The specific problem chosen for the 2023 Challenge is
Maximum Polygon Packing, as follows.

Description:
Given a convex region, P, in the plane, and a collection
of polygons, Q_1,…, Q_n, each with a respective value of c_i.

The task is to find a subset S of {1,…,n} and a feasible
packing of all Q_i (without rotation!) with i in S into P.

Objective:
Maximize the total value \sum_{i\in S} c_i of the packed objects.

Motivation:
Optimal packing problems have an extensive history in Computational Geometry.
They are also relevant in many practical contexts.

Even the one-dimensional version of the problem (the Knapsack Problem)
is NP-hard; furthermore, some geometric variants have been shown to be
∃R-complete [1], which most likely implies that they are not in the class NP.

Details of the competition (such as benchmark instances, data formats,
specific constraints on feasible packings, such as integer coordinates,
as well as rules for submission and evaluation) will be announced in the
coming weeks. Appropriate steps will be undertaken (e.g., by restricting
the classes of feasible subsets) to ensure straightforward, automated
verification of solutions, but also rule out simple use of commercial solvers.

The contributors with the most outstanding solutions will be recognized
at CG Week 2024 and invited to present their results, both at the event
and in the proceedings.

We are looking forward to your contributions and welcome questions
and comments!

Instances:
A large number and variety of input polygonal regions P are
provided for the competition.

Credit:
This problem was suggested by Mikkel Abrahamsen, Copenhagen.

References
[1] M. Abrahamsen, T. Miltzow and N. Seiferth,
"Framework for ER-Completeness of Two-Dimensional Packing Problems,"
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020,
pp. 1014-1021, doi: 10.1109/FOCS46700.2020.00098.

Challenge Team:
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

Advisory Board:
Bill Cook, Andreas Fabri, Dan Halperin, Michael Kerber,
Philipp Kindermann, Joe Mitchell, Kevin Verbeek

Timeline:
A first batch of test instances was released in late September 2022;
the actual benchmark instances for the Challenge were released
in October. The contest will close in late January 2023.

• First test instances: September 30, 2022
• Contest instances: October 28, 2022
• Contest Closes: January 27, 2023


**********************************************************
*
* 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 Participation: PACE Challenge 2024

We are happy to announce the ninth iteration of PACE, the
Parameterized Algorithms and Computational Experiments Challenge. The
goals of PACE as well as official reports for past challenges can be
found on our website: https://pacechallenge.org/.

The challenge this year is an important problem in Graph Drawing:
One-Sided Crossing Minimization (OCM). This problem involves arranging the
nodes of a bipartite graph on two layers (typically horizontal), with
one of the layers fixed, aiming to minimize the number of edge crossings.
OCM is one of the basic building block used for drawing hierarchical
graphs.
It is NP-hard, even for trees, but admits good heuristics, can be
constant-factor approximated and solved in FPT time.


** Tracks
------------------------------------------------------------
This year, we will have three tracks:

**Exact:**
Your task is to find an optimal solution for each OCM
instance within 30 minutes. Here, the instances will admit a solution
with "few" crossings. You will be ranked by the number of solved
instances.

**Heuristic:**
Your task is to find the best solution for each OCM instance
within 5 minutes. You will be ranked by the quality of the solution.

**Parameterized:**
Your task is to find an optimal solution for each OCM
instance within 30 minutes. Here, the instances have small cutwidth,
but may require many crossings. A certificate for the cutwidth is
provided. You will be ranked by the number of solved instances.


** Timeline
------------------------------------------------------------
- Already present on the webpage: Tiny test instances, input and
  output format descriptions, a verifier program, and more detailed
  ranking information.
- November 2023: A visualizer will be provided.
- December 2023: Announcement of the ranking methods and additional
information about the submission process.
    A repository for an autotester (like a JUnit test) and public test
instances will be provided
- January 2024: Public instances and details about the benchmark set get
published.
- March 2024: Submission opens with public leaderboard.
- May 2024: The public leaderboard gets frozen.
- June 2024: Submission Deadline.
- June 1st, 2024 (AoE): Submission deadline for solver.
- June 15th, 2024 (AoE): Submission deadline for solver description.
- July 2024: Announcement of the Results.
- IPEC 2024: Award ceremony.


** Zulip
------------------------------------------------------------
Join us on Zulip for discussions and updates:
https://pacechallenge.zulipchat.com/join/prysn4f3rn7grsxgmbx6vkfg/


** Program Committee
------------------------------------------------------------
- Philipp Kindermann (chair) (Universität Trier)
- Fabian Klute (UPC Barcelona)
- Soeren Terziadis (TU Eindhoven)


** Steering Committee
------------------------------------------------------------
- Max Bannach (European Space Agency)
- Sebastian Berndt (Universität zu Lübeck)
- Holger Dell (Goethe University Frankfurt and IT University of Copenhagen)
- Bart M. P. Jansen (chair) (Eindhoven University of Technology)
- Łukasz Kowalik (University of Warsaw)
- André Nichterlein (Technical University of Berlin)
- Christian Schulz (Universität Heidelberg)
- Manuel Sorge (Technische Universität Wien)


--
*************************************************************************
Jun.-Prof. Dr. Philipp Kindermann Office: + 49 651 201 4564
University of Trier Sekr.: + 49 651 201 3768
Fachbereich IV - Informatikwissenschaften Mail: kindermann@uni-trier.de
Department of Algorithms Room: H427
54286 Trier, Germany
*************************************************************************

**********************************************************
*
* 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] Permanent Research Positions at Inria center of University of Lille

Dear all,

Please find below an announcement for a permanent research position
opportunity at the BONUS research group, Inria research Institute,
Lille, France.

BONUS research group research activities: https://www.inria.fr/en/bonus

*
*

*Description *

The INRIA research institute invites applications for multiple permanent
research positions (junior and senior) to start in the 2024-2025
academic year. Optimization and High-performance computing are among the
targeted topics. This is a major focus of the BONUS research group,
which is part of the INRIA center of the University of Lille (North of
France). Qualified applicants in computer science are invited to apply
to join the BONUS research group as a permanent researcher.

*Qualifications*

The BONUS team addresses big optimization problems (high-dimensional in
decision variables and/or objectives, and/or with computationally
expensive black-box functions) using Machine Learning-assisted
optimization and High-performance (parallel) optimization.

Candidates should hold a *Ph.D. or equivalent degree*in computer science
or a related discipline. BONUS is interested in applicants having a
strong background in at least one of these research lines: *Machine
Learning-assisted optimization, parallel optimization, computational
intelligence*. Candidates with *only HPC-related profile*, highly
motivated to adapt their activities to the BONUS research program, are
also invited to apply.

*Application Instructions / Contact *

Applicants are asked to contact Prof. Bilel Derbel for further details
:bilel.derbel@inria.fr | bilel.derbel@univ-lille.fr

**********************************************************
*
* 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] Postdocs in the theory of distributed & parallel computing

Postdocs in the theory of distributed & parallel computing
https://research.cs.aalto.fi/da/jobs/

The research group of Jukka Suomela at Aalto University (Helsinki, Finland) is among the leading research groups in the areas of theory of distributed and parallel computing. Our work frequently appears in the top conferences of the field, and we have received a number of awards, e.g. the best paper award at FOCS 2019.

Our research group is now looking for postdoctoral researchers to work on the foundations of distributed and parallel computing, in the project "Limits of Causal Computation" funded by the Research Council of Finland. The candidates are expected to have a doctoral degree and relevant publications in leading conferences or journals. A good command of English is necessary. In addition to research work, postdocs participate in the supervision of students and teaching. The salary for the position is between 3942.55 and 4118.93 EUR per month depending on experience and qualifications. These are fixed-term contracts typically for 1–2 years.

The starting dates of the contracts are negotiable, and we can offer flexible terms of employment. In addition to the salary, the contracts include occupational health benefits. Finland has a comprehensive social security system and is particularly suitable for families. Diversity is part of who we are, and we actively work to ensure our community's diversity and inclusiveness in the future as well; this is why we warmly encourage qualified candidates from all backgrounds to join our community.

To apply for the positions, please send an email to jukka.suomela@aalto.fi by December 20, 2023. Your application should be a single PDF file that contains a cover letter, your CV and list of publications, a brief research statement, and the relevant transcripts of studies and certificates of the degrees. Please also ask two or three senior academics to send their recommendation letters to the same email address, by the same deadline. While all applicants who have submitted an application by the deadline will be appropriately considered, Aalto University reserves the right to consider also other candidates for the announced positions.

For more information, please contact:

Jukka Suomela
Associate Professor
Department of Computer Science
Aalto University
jukka.suomela@aalto.fi

**********************************************************
*
* 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 positions in Algorithms and Complexity at IRIF, Paris, France

The Algorithms and Complexity group of IRIF (CNRS and Universite Paris Cite), Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, distributed algorithms, biological algorithms, communication complexity, cryptography (including post-quantum cryptography), computational game theory, quantum computing, quantum algorithms (in particular machine learning and optimization), quantum communication, computational applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (French National Center for Scientific Research) and Universite Paris Cite. For more information about IRIF, please see http:https://www.irif.fr , and for more information about the Algorithms and Complexity group please see https://www.irif.fr/en/equipes/algocomp/index . Further information may be obtained from any of the permanent members of the group.

The starting date of the position(s) will usually be in September-October 2023 but may be negotiated.

The position(s) will be financed either by the group's own resources, or via joint applications of the candidate and the group to external funding sources. Applications should consist of a CV including list of publications, a summary of research, and names and emails of at least three references and should be emailed to algocomp-apply@irif.fr . For further information about the application process please visit https://www.irif.fr/en/postes/postdoc . Applications should be received by December 15, 2023.


**********************************************************
*
* 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 positions at Heidelberg University available: Combinatorics, Geometry, Geometric Group Theory and others

There are one or more open postdoc positions available in the Research
Station Geometry and Dynamics at Heidelberg University. Candidates
should have excellent research potential with research interests in
geometry, topology, dynamics, geometric group theory, optimization in
non-linear spaces, or combinatorics.

For more information can be found here:
https://www.mathjobs.org/jobs?joblist-3110-23893

Review of applications starts 1 December 2023.

Do not hesitate to write to Felix Joos (joos@uni-heidelberg.de) with any
informal inquiries.
**********************************************************
*
* 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, November 20, 2023

[DMANET] 8th AIROYoung Workshop – Announcement and 1st Call for Contributions

Dear all,


We are happy to announce that registration for our 8th AIROYoung Workshop is now OPEN!

Hurry up to secure a spot and a grant for you!

--------------------------------------------------------------------------------------------------------
Call for Registration and Contributions to the
8th AIROYoung Workshop

"Emerging technologies for decision support systems

and innovative optimization paradigms"

University of Calabria
February, 14-16th, 2024

unical.it/ayw2024<https://www.unical.it/ayw2024/>

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


With this call, we invite all AIROYoung members, Ph.D. students, and early-stage Researchers (Ph.D. degree <= 5 years) in Operations Research and related topics, or anyone with a strong interest in Operations Research with less than 35 years old, to submit an abstract or a short paper as contributions to be presented during the workshop.

ABSTRACT SUBMISSIONS – Deadline: December 23rd, 2023

Abstracts should be sent by filling in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.

Submitted abstracts are limited to one-page length (including references) in PDF format, using the available Word Template<https://drive.google.com/file/d/1LeyHM9BEQ8l2nyBMccz4T0datZwzn3nI/view>. Please name your file as follows: SURNAME_NAME_8AYW.

The acceptance of the contribution will be notified to the author by email by January 8th, 2024.

Please, note that each author can give at most one talk during the event.

SHORT PAPER SUBMISSIONS – Deadline: January 26th, 2024

Submitted short papers are limited to 8-10 pages, including front matter and references.

Short papers will undergo a review process by anonymous referees.

Accepted papers will be included in a special volume of the AIRO Springer Series, indexed in main scientific databases.

Short papers must be prepared in LaTeX or Word using the Springer template<https://www.springer.com/gp/authors-editors/conference-proceedings/conference-proceedings-guidelines> and submitted via Springer's Online Conference Service OCS<https://equinocs.springernature.com/service/7TH_AIROYOUNG2023>.

Authors submitting a short paper, are also requested to send the abstract of their contribution, as indicated in the instructions for submitting abstracts and filling in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.

Abstracts accepted for presentation will be notified by email by January 8th, 2024, while acceptance of short papers will be subject to the reviewers' feedback and will be notified successively.

REGISTRATION AND GRANTS

Participants submitting a short paper or an abstract, as well as simple attendees, are required to fill in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.

AIROYoung mission is to involve everyone in its events, independently from their funds. For this reason, our events are free for everyone and we work hard to secure some money to help with accommodation as well. Thanks to the financial support of AIRO and our sponsors, we can offer 10 grants to cover the cost of accommodation for the entire event.

Grants will be awarded on a first-come, first-served basis to participants who have expressed, in the registration process, their willingness to apply for the grant, and who are (or are willing to become) AIROYoung members. If you have been selected as one of the first 10 applicants to receive a grant, you will be notified by email.

To confirm the grant, proof of AIROYoung membership and travel booking must be emailed to airoyw2024@gmail.com<mailto:airoyw2024@gmail.com> by January 15th, 2024.

To become an AIROYoung member, please contact airo.young.researchers@gmail.com<mailto:airo.young.researchers@gmail.com>.

The accommodation will be provided in a double room at Socrates, with check-in on February 14th and check-out on February 17th. More info here: Venue-Socrates area<https://www.unical.it/ayw2024/venue/>.

PLENARY SPEAKERS

- Prof. Daniele Vigo, University of Bologna, Italy

- Prof. Claudio Sterle, University of Naples Federico II, Italy

- Prof. Manlio Gaudioso, University of Calabria, Italy

THE ORGANIZING COMMITTEE

Cristian Belfiore

Alessia Ciacco

Annarita De Maio

Stefania Ferrisi

Martina Luzzi

Giusy Macrina

Chiara Maragò

Veronica Mosca

Francesco Saccomanno

Edoardo Scalzo

Sara Stoia


www.airoyoung.org<http://www.airoyoung.org/>

unical.it/ayw2024<https://www.unical.it/ayw2024/>

Facebook: AIROYoungResearchersChapter<https://www.facebook.com/AIROYoungResearchersChapter/?ref=br_rs>

Instagram: airoyoung<https://www.instagram.com/airoyoung/>

Twitter: AIROyoung<https://twitter.com/AIROyoung>

**********************************************************
*
* 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 Nominations: ACM/SIGAI Autonomous Agents Research Award

[Apologies for Multiple Postings]

Nominations are solicited for the 2024 ACM SIGAI Autonomous Agents Research
Award. This award is made for excellence in research in the area of
autonomous agents. It is intended to recognize researchers in autonomous
agents whose current work is an important influence on the field. The award
is an official ACM award, funded by an endowment created by ACM SIGAI from
the proceeds of previous Autonomous Agents conferences. The recipient of
the award will receive a monetary prize and a certificate, and will be
invited to present a plenary talk at the AAMAS 2024 conference.

How to Nominate

Anyone can make a nomination. Nominations should be made by filling out the
below google form, and should consist of a short (< 1 page) statement that
emphasizes not only the research contributions that the individual has made
that merit the award but also how the individual's current work is an
important influence on the field.

NOTE: a candidate can only be considered for the award if they are
explicitly nominated. If you believe that someone deserves the award, then
NOMINATE THEM — don't assume that somebody else will!

For any questions please contact Manuela Veloso (Award Chair, mmv@cs.cmu.edu)
or Nicholas Mattei (SIGAI Vice Chair, nsmattei@gmail.com).

Nomination Link: https://forms.gle/Fg4StTpk85sNKmdt5

Important Dates

- 15 December 2023 — Deadline for nominations
- 30 January 2024 — Announcement of winner
- 6 – 10 May 2024 — AAMAS-2024 conference in Auckland, New Zealand

--Nick

--
*Nicholas Mattei*
Assistant Professor, Tulane University
nsmattei@tulane.edu | www.nickmattei.net
Stanley Thomas Hall | 305B
+1 504 865 5782
Department of Computer Science
Tulane University
6823 St Charles Ave
New Orleans, LA 70118

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

Sunday, November 19, 2023

[DMANET] PODC 2024: Second Call for Workshops and Tutorials

*** Apologies for multiple postings. ***

================================================
PODC 2024: SECOND CALL FOR WORKSHOPS AND TUTORIALS
================================================
The 43th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed
Computing (PODC 2024) invites proposals for full-day and half-day workshops
and tutorials. PODC 2024 will be held in Nantes, France, June 17-21, 2024.
The days reserved for the workshops/tutorials are Monday, June 17, and
Friday, June 21.
Website: https://www.podc.org
Mastodon: https://mathstodon.xyz/@podc_disc
X: https://twitter.com/podc_disc
================================================
DATES
================================================
The deadline for sending workshop/tutorial proposals is February 22, 2024,
at 23:59 AoE. However, we encourage sending proposals as early as possible.
Notification will be provided shortly after the proposal has been sent; in
particular, we will admit proposals already substantially before the
deadline to facilitate planning.
================================================
INSTRUCTIONS
================================================
The proposals should be sent by e-mail to the Workshop Chair, Sebastian
Brandt <brandt@cispa.de>
A proposal should include:

- Title of the workshop or tutorial
- A description of the subject matter and why it would be of interest to
the PODC community
- Name(s) and contact information of the organizer(s)
- Proposed format (e.g., invited speakers only, or peer-reviewed papers
with proceedings, etc.)
- Length: half-day or full-day
- Date preference: June 17 or June 21
- Estimated number of speakers and attendees
- Link to previous editions of the same workshop (if applicable)

If you have any questions, please don't hesitate to contact Sebastian.
================================================
SCOPE
================================================
With regards to potential topics, we are looking for proposals related to
the current scope of PODC and new emerging research fields complementing or
extending it, including but not restricted to:

- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, architectures, services, protocols,
applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, synchronization protocols, concurrent
programming
- fault-tolerance, reliability, availability, self-organization,
self-stabilization
- codes and reliable communication
- internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning-based distributed algorithms
- distributed operating systems, middleware platforms, databases
- game-theoretic approaches to distributed computing
- distributed mechanisms design
- peer-to-peer systems, overlay networks, distributed data management
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents and robots
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- distributed cryptocurrencies and blockchain protocols
- quantum and optics-based distributed algorithms
- nanonetworks
- biological distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems

**********************************************************
*
* 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] SIROCCO 2024 - SECOND CALL FOR PAPERS

Apologies for duplicate messages.
*******************************************************************
SIROCCO 2024 CALL FOR PAPERS
31st International Colloquium On Structural Information and Communication
Complexity
Vietri sul Mare, Salerno, Italy, May 27--29, 2024
http://sirocco2024.di.unisa.it
*******************************************************************

SIROCCO is devoted to the study of the interplay between structural
knowledge, communication, and computing in decentralized systems of
multiple communicating entities. Special emphasis is given to innovative
approaches leading to a better understanding of the relationship between
computing and communication.

SIROCCO has a tradition of interesting and productive scientific meetings
in a relaxed and pleasant atmosphere, attracting leading researchers in a
variety of fields in which communication and knowledge play a significant
role. Previous SIROCCO proceedings can be found here<
https://link.springer.com/conference/sirocco>.

Original papers are solicited from all areas of study of local structural
knowledge and global communication and computational complexities. Among
the typical areas are
distributed computing
communication networks
game theory
parallel computing
social networks
mobile computing (including autonomous robots)
peer to peer systems
communication complexity
decentralized graph algorithms
blockchain protocols
alternative models of decentralized computation
Keeping with the tradition of SIROCCO, new areas are always welcome.

IMPORTANT DATES:
Submission deadline: December 11th, 2023 (AoE)
Notification: January 28th, 2024
Camera-ready deadline: TBA

VENUE
SIROCCO 2024 will take place in the enchanting setting of Vietri on the
Amalfi Coast, a UNESCO World Heritage site, offering a unique experience
that blends academic excellence with the beauty of the surroundings:
breathtaking landscapes, dramatic cliffs, and rich cultural heritage.
SIROCCO 2024 is pleased to work towards a special arrangement with the
Lloyd's Baia Hotel for participants who wish to extend their stay in the
area.

SUBMISSION INSTRUCTIONS:
A submission must report on original research and contain results that have
not appeared previously in a regular conference paper and have not been
concurrently submitted to a journal or a conference with published
proceedings.

All submissions must start with a title page consisting of the paper's
title, author names, and a short abstract. Excluding the title page and the
references, submissions should be no longer than 14 pages. Further details
can be added in a clearly marked appendix that will be read at the
discretion of the reviewers.

The papers must be submitted in PDF format using EasyChair<
https://easychair.org/conferences/?conf=sirocco2024>. Submissions must be
written in English and formatted in a sin­gle column on US letter-size or
A4 size paper, use at least 11-point font, and have at least 2.5 cm
margins. Submissions deviating from these guidelines as well as papers outside
the scope of the conference may be rejected without consideration of their
merits.

PROCEEDINGS:
The proceedings of SIROCCO 2024 will be published by Springer in the
Lecture Notes in Computer Science (LNCS) series.

SPECIAL ISSUE:
Selected papers from SIROCCO 2024 will be invited to a special issue of the
Theoretical Computer Science journal.

BEST PAPER AWARDS:
All regular papers are eligible for the best paper award. Moreover, all
regular papers that have at least one student author, and these student
authors have done most of the work, are also eligible for the best student
paper award. If a submission is eligible for the best student paper award,
please state that in the title page. The program committee may decline to
make the awards or may split them among multiple papers.

PROGRAM COMMITTEE:
Alexandre Nolin, CISPA Helmholtz Center for Information Security
Ami Paz, LISN - CNRS & Paris-Saclay University
Amos Korman, CNRS - FILOFOCS and University of Haifa
Darya Melnyk, TU Berlin
Debasish Pattanayak, Carleton University
Fabien Dufoulon, Lancaster University
Frederik Mallmann-Trenn, King's College London
Irina Kostitsyna, KBR at NASA Ames Research Center
Jared Saia, University of New Mexico
Jennifer Welch, Texas A&M
Joel Rybicki, Humboldt University of Berlin
Karine Altisen, Université Grenoble Alpes
Michal Dory, University of Haifa
Mikaël Rabie, Université Paris Cité
Mor Perry, Tel-Aviv Academic College
Orr Fischer, Weizmann Institute of Science
Peter Davies, University of Durham
Peter Robinson, Augusta University
Prudence Wong, University of Liverpool
Seth Gilbert, National University of Singapore
Shantanu Das, Aix-Marseille University
Volker Turau, Hamburg University of Technology
Will Rosenbaum, Amherst College
William K. Moses Jr., Durham University
Yannic Maus, TU Graz
Yukiko Yamauchi, Kyushu University
Yuval Emek, Technion - Israel Institute of Technology (chair)

LOCAL ARRANGEMENTS CHAIR:
Gianluca De Marco, University of Salerno

KEYNOTE SPEAKERS:
TBA

STEERING COMMITTEE:
Keren Censor-Hillel, Technion - Israel Institute of Technology (chair)
Merav Parter, Weizmann Institute of Science
Paola Flocchini, University of Ottawa
Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico
Stefan Schmid, TU Berlin
Tomasz Jurdziński, University of Wroclaw

**********************************************************
*
* 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] 4th workshop on Human-Centered Computational Sensing (HCCS’24) - EXTENDED DEADLINE Dec. 1st 2023

Dear Colleagues,

We are pleased to invite you to participate in the Fourth Workshop on
Human-Centered Computational Sensing (HCCS'24)
<https://sites.google.com/view/hccs24/home>, which will be co-located with
the 22nd IEEE International Conference on Pervasive Computing and
Communications (PerCom'24) <http://percom.org/>in Biarritz, France, from
March 11-15, 2024.

The fourth edition of the Human-Centered Computational Sensing (HCCS'24)
Workshop at PerCom 2024 aims to advance and promote research about how
unobtrusive observations of human beings' cognitive, behavioral,
physiological, and contextual data are increasingly enabling new computing
experiences. The workshop will additionally stimulate dialog about the
implications of computational sensing for society. Traditionally, sensors
have been understood narrowly as physiological measurements often captured
with wearable devices. This workshop adopts a broader, human-focused view,
envisioning sensing as time-evolving measurable data directly linked to
individuals and, by extension, to their communities. With this
understanding, sensing involves human reactions and interactions observed
in spoken, written, or signed language, eye gaze, facial and bodily
expressions, social networks, geospatial patterns, and other such
human-generated data. Advances in multimodal human data acquisition and
fusion have the potential to significantly impact all areas of human life -
productivity, health and well-being, training and education, human-computer
interaction, accessibility, safety, and security, as well as gaming,
sports, and entertainment.

Relevant topics include but are not limited to::

- Novel methodologies for collecting and processing multimodal human
sensing data, including remote/online data collection
- Co-sensing of multiple individuals, groups, or communities
- Detection and analysis of human social interactions, behaviour and
habits
- Localization and proximity-detection systems
- User acceptance, quality of experience, and social impact studies
- Accessibility of human sensing technologies
- New interventions acting on human-centered computational sensing
- Fusion of multifaceted, heterogeneous, and/or incommensurable human
sensing data
- Artificial intelligence and machine learning algorithms for
responsible behavioral analysis with human sensing data
- Interactive machine learning guided by humans, with sensing
technologies
- Edge and fog computing architectures for human sensing
- Applications of human-centered computational sensing
- Innovative Human-Computer Interactions based on sensing
- Innovative visualizations and representations of human sensing data
- Evaluation metrics and methodologies
- Experimental analysis with human sensing data from real-world
applications
- Human-centered sensing for healthcare, industry, and social good
- Educational insights from teaching human sensing technologies
- Experiences and lessons learned from research projects focused on
human-centered computational sensing
- Privacy and ethical considerations for human-centered computational
sensing
- Design of human computation sensing promoting diversity.


*Organizers will consider the possibility of inviting authors of selected
papers accepted to HCCS'24 to submit an extended work to a Special Issue of
an international journal.*

---Submission and Registration:
Authors are invited to submit technical or theoretical papers for
presentation at the workshop, describing original, previously unpublished
work, which is not currently under review by another workshop, conference,
or journal. Papers should present novel perspectives within the general
scope of the workshop.
Accepted workshop papers will be included and indexed in the IEEE digital
libraries (Xplore).
Papers may be no more than 6 pages in length. Authors can purchase one
additional page for the camera-ready version. Papers in excess of the page
limits will not be considered for review or publication. All papers must be
typeset in double-column IEEE format using 10pt fonts on US letter paper,
with all fonts embedded. The IEEE LaTeX and Microsoft Word templates, as
well as related information, can be found at the IEEE website.

Submission must be made via EDAS using https://edas.info/N31320.

It is a requirement that all the authors listed in the submitted paper are
also listed in EDAS. The author section of EDAS will be locked after the
workshop submission deadline to ensure that conflict-of-interest can be
properly enforced during the review process. If the list of authors differs
between the paper and EDAS, the paper may not be reviewed.
Each accepted workshop paper requires a full PerCom registration (no
registration is available for workshops only). Papers that are not
presented at the workshop will not be published in the proceedings.


---Important Dates:

- Paper submission deadline: December 1st, 2023 23:59 EST timezone
- Paper notification: January 8th, 2024
- Camera Ready Deadline: February 2nd, 2024
- Registration: same as main conference PerCom 24 papers (no
workshop-only registration)
- HCCS Workshop at PerCom 2024: To be announced (11 or 15 March 2024)

For more information, including the workshop's scope, submission
guidelines, and topics of
interest, please visit the workshop website
<https://sites.google.com/view/hccs24/home> or find the attached Call for
Papers (CFP).

We look forward to your contributions and participation in HCCS'24. If you
have any questions, please do not hesitate to contact us.

Best regards,
Rochester Institute of Technology
Rochester, NY 14623
Email: rt7331@rit.edu
Tel: +1 718-208-0664


Content-Type: text/plain; charset="UTF-8"; name="cfp.txt"
Content-Disposition: attachment; filename="cfp.txt"
Content-Transfer-Encoding: base64
Content-ID: <f_lp58eyud0>
X-Attachment-Id: f_lp58eyud0

77u/KiBDYWxsIGZvciBQYXBlcnMgKg0KDQoNCkZvdXJ0aCBXb3Jrc2hvcCBvbiBIdW1hbi1DZW50
ZXJlZCBDb21wdXRhdGlvbmFsIFNlbnNpbmcgKEhDQ1PigJkyNCkgY28tbG9jYXRlZCB3aXRoIHRo
ZSAyMm5kIElFRUUgSW50ZXJuYXRpb25hbCBDb25mZXJlbmNlIG9uIFBlcnZhc2l2ZSBDb21wdXRp
bmcgYW5kIENvbW11bmljYXRpb25zIChQZXJDb20gMjAyNCksIE1hcmNoIDExLTE1LCAyMDIyIC0g
QmlhcnJpdHosIEZyYW5jZS4NCg0KDQpodHRwczovL3NpdGVzLmdvb2dsZS5jb20vdmlldy9oY2Nz
MjQvaG9tZQ0KDQoNClRoZSBmb3VydGggZWRpdGlvbiBvZiB0aGUgSHVtYW4tQ2VudGVyZWQgQ29t
cHV0YXRpb25hbCBTZW5zaW5nIChIQ0NT4oCZMjQpIFdvcmtzaG9wIGF0IFBlckNvbSAyMDI0IGFp
bXMgdG8gYWR2YW5jZSBhbmQgcHJvbW90ZSByZXNlYXJjaCBhYm91dCBob3cgdW5vYnRydXNpdmUg
b2JzZXJ2YXRpb25zIG9mIGh1bWFuIGJlaW5nc+KAmSBjb2duaXRpdmUsIGJlaGF2aW9yYWwsIHBo
eXNpb2xvZ2ljYWwsIGFuZCBjb250ZXh0dWFsIGRhdGEgaXMgaW5jcmVhc2luZ2x5IGVuYWJsaW5n
IG5ldyBjb21wdXRpbmcgZXhwZXJpZW5jZXMuIFRoZSB3b3Jrc2hvcCB3aWxsIGFkZGl0aW9uYWxs
eSBzdGltdWxhdGUgZGlhbG9nIGFib3V0IHRoZSBpbXBsaWNhdGlvbnMgb2YgY29tcHV0YXRpb25h
bCBzZW5zaW5nIGZvciBzb2NpZXR5LiBUcmFkaXRpb25hbGx5LCBzZW5zb3JzIGhhdmUgYmVlbiB1
bmRlcnN0b29kIG5hcnJvd2x5IGFzIHBoeXNpb2xvZ2ljYWwgbWVhc3VyZW1lbnRzIG9mdGVuIGNh
cHR1cmVkIHdpdGggd2VhcmFibGUgZGV2aWNlcy4gVGhpcyB3b3Jrc2hvcCBhZG9wdHMgYSBicm9h
ZGVyLCBodW1hbi1mb2N1c2VkIHZpZXcsIGVudmlzaW9uaW5nIHNlbnNpbmcgYXMgdGltZS1ldm9s
dmluZyBtZWFzdXJhYmxlIGRhdGEgZGlyZWN0bHkgbGlua2VkIHRvIGluZGl2aWR1YWxzIGFuZCwg
YnkgZXh0ZW5zaW9uLCB0byB0aGVpciBjb21tdW5pdGllcy4gV2l0aCB0aGlzIHVuZGVyc3RhbmRp
bmcsIHNlbnNpbmcgaW52b2x2ZXMgaHVtYW4gcmVhY3Rpb25zIGFuZCBpbnRlcmFjdGlvbnMgb2Jz
ZXJ2ZWQgaW4gc3Bva2VuLCB3cml0dGVuLCBvciBzaWduZWQgbGFuZ3VhZ2UsIGV5ZSBnYXplLCBm
YWNpYWwgYW5kIGJvZGlseSBleHByZXNzaW9ucywgc29jaWFsIG5ldHdvcmtzLCBnZW9zcGF0aWFs
IHBhdHRlcm5zLCBhbmQgb3RoZXIgc3VjaCBodW1hbi1nZW5lcmF0ZWQgZGF0YS4gQWR2YW5jZXMg
aW4gbXVsdGltb2RhbCBodW1hbiBkYXRhIGFjcXVpc2l0aW9uIGFuZCBmdXNpb24gaGF2ZSB0aGUg
cG90ZW50aWFsIHRvIHNpZ25pZmljYW50bHkgaW1wYWN0IGFsbCBhcmVhcyBvZiBodW1hbiBsaWZl
IC0gcHJvZHVjdGl2aXR5LCBoZWFsdGggYW5kIHdlbGwtYmVpbmcsIHRyYWluaW5nIGFuZCBlZHVj
YXRpb24sIGh1bWFuLWNvbXB1dGVyIGludGVyYWN0aW9uLCBhY2Nlc3NpYmlsaXR5LCBzYWZldHkg
YW5kIHNlY3VyaXR5LCBhcyB3ZWxsIGFzIGdhbWluZywgc3BvcnRzLCBhbmQgZW50ZXJ0YWlubWVu
dC4NCg0KDQoqIFJlbGV2YW50IHRvcGljcyBpbmNsdWRlIGJ1dCBhcmUgbm90IGxpbWl0ZWQgdG86
DQoNCg0KICAtIE5vdmVsIG1ldGhvZG9sb2dpZXMgZm9yIGNvbGxlY3RpbmcgYW5kIHByb2Nlc3Np
bmcgbXVsdGltb2RhbCBodW1hbiBzZW5zaW5nIGRhdGEsIGluY2x1ZGluZyByZW1vdGUvb25saW5l
IGRhdGEgY29sbGVjdGlvbg0KICAtIENvLXNlbnNpbmcgb2YgbXVsdGlwbGUgaW5kaXZpZHVhbHMs
IGdyb3Vwcywgb3IgY29tbXVuaXRpZXMNCiAgLSBEZXRlY3Rpb24gYW5kIGFuYWx5c2lzIG9mIGh1
bWFuIHNvY2lhbCBpbnRlcmFjdGlvbnMsIGJlaGF2aW91ciBhbmQgaGFiaXRzDQogIC0gTG9jYWxp
emF0aW9uIGFuZCBwcm94aW1pdHktZGV0ZWN0aW9uIHN5c3RlbXMgDQogIC0gVXNlciBhY2NlcHRh
bmNlLCBxdWFsaXR5IG9mIGV4cGVyaWVuY2UsIGFuZCBzb2NpYWwgaW1wYWN0IHN0dWRpZXMNCiAg
LSBBY2Nlc3NpYmlsaXR5IG9mIGh1bWFuIHNlbnNpbmcgdGVjaG5vbG9naWVzDQogIC0gTmV3IGlu
dGVydmVudGlvbnMgYWN0aW5nIG9uIGh1bWFuLWNlbnRlcmVkIGNvbXB1dGF0aW9uYWwgc2Vuc2lu
Zw0KICAtIEZ1c2lvbiBvZiBtdWx0aWZhY2V0ZWQsIGhldGVyb2dlbmVvdXMsIGFuZC9vciBpbmNv
bW1lbnN1cmFibGUgaHVtYW4gc2Vuc2luZyBkYXRhDQogIC0gQXJ0aWZpY2lhbCBpbnRlbGxpZ2Vu
Y2UgYW5kIG1hY2hpbmUgbGVhcm5pbmcgYWxnb3JpdGhtcyBmb3IgcmVzcG9uc2libGUgYmVoYXZp
b3JhbCBhbmFseXNpcyB3aXRoIGh1bWFuIHNlbnNpbmcgZGF0YQ0KICAtIEludGVyYWN0aXZlIG1h
Y2hpbmUgbGVhcm5pbmcgZ3VpZGVkIGJ5IGh1bWFucywgd2l0aCBzZW5zaW5nIHRlY2hub2xvZ2ll
cw0KICAtIEVkZ2UgYW5kIGZvZyBjb21wdXRpbmcgYXJjaGl0ZWN0dXJlcyBmb3IgaHVtYW4gc2Vu
c2luZyANCiAgLSBBcHBsaWNhdGlvbnMgb2YgaHVtYW4tY2VudGVyZWQgY29tcHV0YXRpb25hbCBz
ZW5zaW5nDQogIC0gSW5ub3ZhdGl2ZSBIdW1hbi1Db21wdXRlciBJbnRlcmFjdGlvbnMgYmFzZWQg
b24gc2Vuc2luZw0KICAtIElubm92YXRpdmUgdmlzdWFsaXphdGlvbnMgYW5kIHJlcHJlc2VudGF0
aW9ucyBvZiBodW1hbiBzZW5zaW5nIGRhdGENCiAgLSBFdmFsdWF0aW9uIG1ldHJpY3MgYW5kIG1l
dGhvZG9sb2dpZXMNCiAgLSBFeHBlcmltZW50YWwgYW5hbHlzaXMgd2l0aCBodW1hbiBzZW5zaW5n
IGRhdGEgZnJvbSByZWFsLXdvcmxkIGFwcGxpY2F0aW9ucw0KICAtIEh1bWFuLWNlbnRlcmVkIHNl
bnNpbmcgZm9yIGhlYWx0aGNhcmUsIGluZHVzdHJ5LCBhbmQgc29jaWFsIGdvb2QNCiAgLSBFZHVj
YXRpb25hbCBpbnNpZ2h0cyBmcm9tIHRlYWNoaW5nIGh1bWFuIHNlbnNpbmcgdGVjaG5vbG9naWVz
DQogIC0gRXhwZXJpZW5jZXMgYW5kIGxlc3NvbnMgbGVhcm5lZCBmcm9tIHJlc2VhcmNoIHByb2pl
Y3RzIGZvY3VzZWQgb24gaHVtYW4tY2VudGVyZWQgY29tcHV0YXRpb25hbCBzZW5zaW5nDQogIC0g
UHJpdmFjeSBhbmQgZXRoaWNhbCBjb25zaWRlcmF0aW9ucyBmb3IgaHVtYW4tY2VudGVyZWQgY29t
cHV0YXRpb25hbCBzZW5zaW5nDQogIC0gRGVzaWduIG9mIGh1bWFuIGNvbXB1dGF0aW9uIHNlbnNp
bmcgcHJvbW90aW5nIGRpdmVyc2l0eS4NCg0KDQpPcmdhbml6ZXJzIHdpbGwgY29uc2lkZXIgdGhl
IHBvc3NpYmlsaXR5IG9mIGludml0aW5nIGF1dGhvcnMgb2Ygc2VsZWN0ZWQgcGFwZXJzIGFjY2Vw
dGVkIHRvIEhDQ1PigJkyNCB0byBzdWJtaXQgYW4gZXh0ZW5kZWQgd29yayB0byBhIFNwZWNpYWwg
SXNzdWUgb2YgYW4gaW50ZXJuYXRpb25hbCBqb3VybmFsLg0KDQoNCiogU3VibWlzc2lvbiBhbmQg
UmVnaXN0cmF0aW9uOg0KDQoNCkF1dGhvcnMgYXJlIGludml0ZWQgdG8gc3VibWl0IHRlY2huaWNh
bCBvciB0aGVvcmV0aWNhbCBwYXBlcnMgZm9yIHByZXNlbnRhdGlvbiBhdCB0aGUgd29ya3Nob3As
IGRlc2NyaWJpbmcgb3JpZ2luYWwsIHByZXZpb3VzbHkgdW5wdWJsaXNoZWQgd29yaywgd2hpY2gg
aXMgbm90IGN1cnJlbnRseSB1bmRlciByZXZpZXcgYnkgYW5vdGhlciB3b3Jrc2hvcCwgY29uZmVy
ZW5jZSwgb3Igam91cm5hbC4gUGFwZXJzIHNob3VsZCBwcmVzZW50IG5vdmVsIHBlcnNwZWN0aXZl
cyB3aXRoaW4gdGhlIGdlbmVyYWwgc2NvcGUgb2YgdGhlIHdvcmtzaG9wLg0KQWNjZXB0ZWQgd29y
a3Nob3AgcGFwZXJzIHdpbGwgYmUgaW5jbHVkZWQgYW5kIGluZGV4ZWQgaW4gdGhlIElFRUUgZGln
aXRhbCBsaWJyYXJpZXMgKFhwbG9yZSkuDQpQYXBlcnMgbWF5IGJlIG5vIG1vcmUgdGhhbiA2IHBh
Z2VzIGluIGxlbmd0aC4gQXV0aG9ycyBjYW4gcHVyY2hhc2Ugb25lIGFkZGl0aW9uYWwgcGFnZSBm
b3IgdGhlIGNhbWVyYS1yZWFkeSB2ZXJzaW9uLiBQYXBlcnMgaW4gZXhjZXNzIG9mIHRoZSBwYWdl
IGxpbWl0cyB3aWxsIG5vdCBiZSBjb25zaWRlcmVkIGZvciByZXZpZXcgb3IgcHVibGljYXRpb24u
IEFsbCBwYXBlcnMgbXVzdCBiZSB0eXBlc2V0IGluIGRvdWJsZS1jb2x1bW4gSUVFRSBmb3JtYXQg
dXNpbmcgMTBwdCBmb250cyBvbiBVUyBsZXR0ZXIgcGFwZXIsIHdpdGggYWxsIGZvbnRzIGVtYmVk
ZGVkLiBUaGUgSUVFRSBMYVRlWCBhbmQgTWljcm9zb2Z0IFdvcmQgdGVtcGxhdGVzLCBhcyB3ZWxs
IGFzIHJlbGF0ZWQgaW5mb3JtYXRpb24sIGNhbiBiZSBmb3VuZCBhdCB0aGUgSUVFRSB3ZWJzaXRl
Lg0KDQoNClN1Ym1pc3Npb24gbXVzdCBiZSBtYWRlIHZpYSBFREFTIHVzaW5nIGh0dHBzOi8vZWRh
cy5pbmZvL04zMTMyMC4NCg0KDQpJdCBpcyBhIHJlcXVpcmVtZW50IHRoYXQgYWxsIHRoZSBhdXRo
b3JzIGxpc3RlZCBpbiB0aGUgc3VibWl0dGVkIHBhcGVyIGFyZSBhbHNvIGxpc3RlZCBpbiBFREFT
LiBUaGUgYXV0aG9yIHNlY3Rpb24gb2YgRURBUyB3aWxsIGJlIGxvY2tlZCBhZnRlciB0aGUgd29y
a3Nob3Agc3VibWlzc2lvbiBkZWFkbGluZSB0byBlbnN1cmUgdGhhdCBjb25mbGljdC1vZi1pbnRl
cmVzdCBjYW4gYmUgcHJvcGVybHkgZW5mb3JjZWQgZHVyaW5nIHRoZSByZXZpZXcgcHJvY2Vzcy4g
SWYgdGhlIGxpc3Qgb2YgYXV0aG9ycyBkaWZmZXJzIGJldHdlZW4gdGhlIHBhcGVyIGFuZCBFREFT
LCB0aGUgcGFwZXIgbWF5IG5vdCBiZSByZXZpZXdlZC4NCkVhY2ggYWNjZXB0ZWQgd29ya3Nob3Ag
cGFwZXIgcmVxdWlyZXMgYSBmdWxsIFBlckNvbSByZWdpc3RyYXRpb24gKG5vIHJlZ2lzdHJhdGlv
biBpcyBhdmFpbGFibGUgZm9yIHdvcmtzaG9wcyBvbmx5KS4gUGFwZXJzIHRoYXQgYXJlIG5vdCBw
cmVzZW50ZWQgYXQgdGhlIHdvcmtzaG9wIHdpbGwgbm90IGJlIHB1Ymxpc2hlZCBpbiB0aGUgcHJv
Y2VlZGluZ3MuDQoNCg0KKiBJbXBvcnRhbnQgRGF0ZXM6DQoNCg0KICAgLSBQYXBlciBzdWJtaXNz
aW9uIGRlYWRsaW5lOiBEZWNlbWJlciAxc3QsIDIwMjMgMjM6NTkgRVNUIHRpbWV6b25lDQogICAt
IFBhcGVyIG5vdGlmaWNhdGlvbjogSmFudWFyeSA4dGgsIDIwMjQNCiAgIC0gQ2FtZXJhIFJlYWR5
IERlYWRsaW5lOiBGZWJydWFyeSAybmQsIDIwMjQNCiAgIC0gUmVnaXN0cmF0aW9uOiBzYW1lIGFz
IG1haW4gY29uZmVyZW5jZSBQZXJDb20gMjQgcGFwZXJzIChubyB3b3Jrc2hvcC1vbmx5IHJlZ2lz
dHJhdGlvbikNCiAgIC0gSENDUyBXb3Jrc2hvcCBhdCBQZXJDb20gMjAyNDogVG8gYmUgYW5ub3Vu
Y2VkICgxMSBvciAxNSBNYXJjaCAyMDI0KQ0KDQoNCg0KDQoNCg0KKiBPcmdhbml6ZXJzOg0KDQoN
CldvcmtzaG9wIGNvLWNoYWlycw0KICAgLSBGcmFuY2EgRGVsbWFzdHJvIChJSVQtQ05SKQ0KICAg
LSBNaWNoZWxlIEdpcm9sYW1pIChJU1RJLUNOUikNCiAgIC0gRmFicmljZSBUaGVvbGV5cmUgKENO
UlMpDQoNCg0KUHVibGljaXR5IGNvLWNoYWlycw0KICAgLSBSYWplc2ggVGl0dW5nIChSb2NoZXN0
ZXIgSW5zdGl0dXRlIG9mIFRlY2hub2xvZ3kpDQogICAtIFZpZXQgRHVuZyBOZ3V5ZW4gKFJvY2hl
c3RlciBJbnN0aXR1dGUgb2YgVGVjaG5vbG9neSkNCiAgIC0gTWF0dGlhIEcuIENhbXBhbmEgKElJ
VC1DTlIpDQoNCg0KU3RlZXJpbmcgQ29tbWl0dGVlDQogICAtIENlY2lsaWEgTy4gQWxtIChSb2No
ZXN0ZXIgSW5zdGl0dXRlIG9mIFRlY2hub2xvZ3kpDQogICAtIFJleW5vbGQgQmFpbGV5IChSb2No
ZXN0ZXIgSW5zdGl0dXRlIG9mIFRlY2hub2xvZ3kp
**********************************************************
*
* 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/
*
**********************************************************

Saturday, November 18, 2023

[DMANET] Master/PhD scholarships in Berlin

The Berlin Mathematical School (www.berlin-math.de) advertises
scholarships for Master and PhD studies in Mathematics, including Discrete
Mathematics. The starting date of the Master scholarship is October 2024.

The Berlin Mathematical School (BMS) is the joint graduate school of the
mathematics departments of the three research universities in Berlin, the
Freie Universität (FU), the Humboldt-Universität (HU), and the Technische
Universität (TU). It offers a comprehensive, coordinated study program in
English, an active, international research environment, as well as
mentoring programs, language courses, soft-skills seminars, funding for
summer schools and conferences, a buddy program and funding for students
with children. The BMS is committed to equality and diversity.

For information on how to apply, go to: http://www.math-berlin.de/application

The deadline is December 1.

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

Dear Colleagues and Friends,

We are very happy to announce that ODS2024, the International Conference on Optimization and Decision Science organized by AIRO, the Italian Association for Operations Research, will be held in Badesi, Sardinia, Italy, on September 8-12, 2024: http://www.airoconference.it/ods2024/

The conference venue is the Resort & SPA Le Dune, which is located in the north coast of Sardinia between sand dunes and old juniper trees: http://www.airoconference.it/ods2024/venue

The conference theme is " "Operations Research: closing the gap between research and practice", but it is open in the whole field of Operations Research.

Two types of contribution are considered:

1- Short paper (8--10 pages), prepared in LaTeX or Word using the Springer template and submitted via Springer's Online Conference Service OCS. The deadline is February 24, 2024. Accepted papers will be included in a special volume of the AIRO Springer Series, indexed in main scientific databases.
2- Abstract (max 2000 characters), prepared using the ODS2023 Word template available on the website and submitted via a form. The deadline is February 24, 2024. Session proposals are also welcome and have to be sent through the form available on the website. The deadline is January 31, 2024. A list of possible contributions (3 to 5) is also required.


For any further information please contact ods2024@airoconference.it <mailto:ods2023@airoconference.it>.
We look forward to seeing you in Sardinia at ODS2024!!
The Organizing Committee:
Francesco Contu, Massimo Di Francesco (Chair), Enrico Gorgone, Benedetto Manca, Roberto Wolfler Calvo, Simone Zanda


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