Monday, August 15, 2022

[DMANET] Postdoc position in parameterized algorithms / kernelization at TU Eindhoven (deadline September 15th)

The Algorithms group of TU Eindhoven is offering a 1-year postdoc position in parameterized algorithms and kernelization, funded by the ERC Starting grant 'ReduceSearch'. For more information about the positions and how to apply, please visit:

https://jobs.tue.nl/en/vacancy/postdoc-position-quotreduce-search-projectquot-948352.html

For your convenience I have copied the text from this website below.

TU Eindhoven is offering a 1-year postdoc position for a talented and motivated researcher with a strong interest in algorithms and complexity. The research is supported by ERC Starting grant "Rigorous Search Space Reduction" and is aimed at advancing the theory of algorithmic preprocessing. The project investigates questions such as: why does preprocessing lead to such large speedups for some NP-hard problems? How does a preprocessing algorithm reduce the search space of the follow-up algorithm? Which aspects of a problem input make it amenable to preprocessing? How can new preprocessing algorithms be developed that deliver speedups of several orders of magnitude? These questions are tackled using the framework of parameterized complexity and kernelization, and are asked for a diverse set of NP-hard problems concerning graphs, logic, and constraint satisfaction.

The position is supervised by dr. Bart M. P. Jansen (https://www.win.tue.nl/~bjansen/ )

Job requirements
The postdoctoral candidate is required to have a strong background in algorithms or computational complexity. Experience within the domain of parameterized complexity, kernelization, or constraint satisfaction problems is a plus. Candidates are expected to be fluent in English, both oral and in writing, and to have obtained a PhD degree.

The postdoctoral candidate will be expected to conduct independent research on topics relevant to the above agenda, to publish this research at conferences and journals, and to cooperate with the PhD candidates and principal investigator of the ReduceSearch project. The position does not have any required teaching duties. If the postdoctoral candidate wishes to further their development by assisting with the daily supervision of master- or PhD students, there will be opportunities to do so.

The starting date is negotiable, but must be no later than January 1st 2023. The position is offered for a period of one year, which may be extended.

Conditions of employment
A meaningful job in a dynamic and ambitious university with the possibility to present your work at international conferences.
A full-time employment for 1 year.
You will have free access to high-quality training programs on general skills, didactics and topics related to research and valorization.
A gross monthly salary and benefits in accordance with the Collective Labor Agreement for Dutch Universities.
Additionally, an annual holiday allowance of 8% of the yearly salary, plus a year-end allowance of 8.3% of the annual salary.
The position comes with ample travel budget to engage in research activities abroad.
A broad package of fringe benefits (including an excellent technical infrastructure, moving expenses, and savings schemes).
Should you come from abroad and comply with certain conditions, you can make use of the so-called '30% facility', which permits you not to pay tax on 30% of your salary.
Family-friendly initiatives are in place, such as an international spouse program, and excellent on-campus children day care and sports facilities.
Information and application
If you are interested in the postdoc position and would like to apply, please send us your application by using the 'apply for this job' button at the top of this page. Your application must contain the following documents:

A motivation letter describing your background and reasons for applying for this position.
A 1-page research statement describing research interests and goals.
A detailed CV including a publications list and overview of presentations at scientific meetings.
Names and contact information of two academic references.
You can upload only 5 documents up to 2 MB each.
Please send us your application before September 15th 2022; you can only apply using the "Apply now button" on the website of the Technical University of Eindhoven.
Screening of applicants will start as soon as applications are received and will continue until the position has been filled.

About the research environment
TU Eindhoven features a rich environment for algorithmic research. The cluster Algorithms, Geometry, and Applications, including full professors Mark de Berg and Bettina Speckmann investigates (parameterized, approximation, and classic) algorithms for problems in computational geometry and graph theory. The Combinatorial Optimization group (prof. Frits Spieksma) focuses on problems in scheduling and optimization. In addition, TU Eindhoven is one of the four cornerstones of the NETWORKS project which investigates algorithmic and stochastic problems on complex networks. All combined, this research environment offers the postdoctoral researcher interesting possibilities for collaboration.

About TU Eindhoven
TU Eindhoven (TU/e) is a mid-size technical university located in the heart of the high-tech industry in the Netherlands, named the Brainport region. Eindhoven is the fifth largest city in the Netherlands, and including suburbs it has about 420,000 inhabitants. TU/e is a highly ranked university both in research and education. Our training and research programs are highly regarded and we foster close relationships with companies, organizations and research institutes in the Brainport region and beyond. TU/e is a social and inspiring university with a fine culture. You'll quickly feel at home, surrounded by people who share your scientific ambitions. The TU/e currently has nine departments, with over 11,000 students in total.

More information
Further information with respect to the positions can be obtained from dr. Bart M. P. Jansen via email b.m.p.jansen[at]tue.nl
Further information concerning employment conditions can be found here or obtained from HR Services for Mathematics and Computer Science viaemail HRServices.MCS[at]tue.nl.


**********************************************************
*
* 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] Data Driven Decisions Group: Open Doctoral Student Positions (University of Würzburg)

The Data Driven Decisions (D3) Group at the University of Würzburg is dedicated to the development and application of new methods that exploit large amounts of empirical data to arrive at better decisions in various fields of management, e.g., in Retail, Supply Chain and Operations Management, Healthcare, Smart Cities, Energy and Mobility.

The group is currently expanding and seeking motivated and highly skilled individuals to become part of our ambitious team. We offer up to

5 Doctoral Student Positions

starting September 2022 or later. The remuneration will be according to TV-L E13 (if prerequisites are met).

Our research builds on methods in Data Science and Machine Learning (Deep Learning, Reinforcement Learning), Operations Research (Optimization), and Statistics. It is innovative and challenging from a theoretical viewpoint and, at the same time, very relevant to practice - we work with leading industry partners on several exciting projects.

The D3 group currently consists of 15 researchers and is composed of the chairs for

§ Information Systems and Business Analytics (Prof. Dr. Flath),

§ Information Systems Engineering (Prof. Dr. Thiesse),

§ Logistics and Quantitative Methods (Prof. Dr. Pibernik), and

§ Process and IT Integration for AI in Organizations (Prof. Dr. Gust).

Additionally, the group is affiliated with the newly created cross-faculty Center for Artificial Intelligence and Data Science (CAIDAS) and has a strong international focus.

Our job offering is not focused on specific academic disciplines. Currently, our team members have very diverse skill sets and backgrounds, such as Computer Science, Management, Mathematics, and Engineering. Candidates should be eager to solve analytical tasks and should ideally have at least intermediate programming skills (e.g., in Python or R).

You will actively participate in the research of our group, including projects with partners from academia and industry. Most importantly, you will contribute to publications in scientific journals and thereby work on your doctoral dissertation (ideally, within a three-year period). We also expect you to support some of our teaching activities.

The D3 Group offers a highly flexible working environment within an ambitious team with entrepreneurial spirit. We encourage doctoral students to visit leading international research institutions during their dissertation. The group is based in the city of Würzburg with its lovely culture and countryside.

Interested candidates should apply to d3@uni-wuerzburg.de, including all usual documents (cover letter, CV, certificates of recent grades etc.). Questions can be directed to the same email address or to the professors heading the D3 group. Please also consult the websites of the chairs for additional information on our research.

The University of Würzburg is an equal opportunity employer. As such, we explicitly encourage applications from qualified women. Handicapped applicants will be given preferential consideration when equally qualified.


**********************************************************
*
* 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 Papers for WABCT 2022

Call for Papers for WABCT 2022
ICS 2022 Workshop on Algorithms, Bioinformatics, and Computation Theory

The 2022 Workshop on Algorithms, Bioinformatics, and Computation Theory in
conjunction with 2022 International Computer Symposium (ICS 2022) will be
held at National Taipei University of Business, Taoyuan, Taiwan, on
December 15-17, 2022. ICS is one of the most prestigious international ICT
symposiums held in Taiwan. Founded in 1973, it is intended to provide a
forum for researchers, educators, and professionals to exchange their
discoveries and practices, and to explore future trends and applications in
computer technologies. The biennial symposium offers a great opportunity to
share research experiences and to discuss potential new trends in the ICT
industry. ICS 2022 will provide workshops, panels and keynotes to
facilitate discourse on and deepen the understanding of the challenges in
computer and communication technologies.

All the papers will be published to the symposium in Springer-Verlag CCIS
series (https://www.springer.com/series/7899), Communications in Computer
and Information Science (pending approval). CCIS is abstracted/indexed in
DBLP, Google Scholar, EI-Compendex, Mathematical Reviews, SCImago, Scopus.
Papers of high quality will be invited to special issues of an
international journal related to the topics of WABCT 2022.

The topics of the Workshop on Algorithms, Bioinformatics, and Computation
Theory to be covered include (but are not limited to) the following:
- Algorithms and Data Structures
- Algorithmic Game Theory
- Approximation Algorithms and Online Algorithms
- Automata, Languages, Logic, and Computability
- Complexity Theory
- Computational Learning Theory and Knowledge Discovery
- Cryptography, Reliability and Security, and Database Theory
- Computational Biology and Bioinformatics
- Computational Algebra, Geometry, and Number Theory
- Graph Drawing and Information Visualization
- Graph Theory, Communication Networks, and Optimization
- Parallel and Distributed Computing
- Fault Tolerant Computing and Fault Diagnosis
- Deep learning algorithms and applications

---------------------
Important Dates
---------------------
Full paper submission: September 15, 2022 (AoE)
Paper notification: October 22, 2022
Camera-ready paper due date: October 31, 2022
Conference date: December 15-17, 2022

--------------------------------
Submission Instructions
--------------------------------
Authors are invited to submit an extended abstract of original research on
Algorithms, Bioinformatics, and Computation Theory. Submissions must
contain a scholarly exposition of the ideas, techniques, and a full
description of the results achieved. A clear indication of the motivation
and comparison with prior related work should be presented. Simultaneous
submission to a journal or another conference with refereed proceedings is
not allowed.

Before submission, authors should carefully read over the submission
guidelines, located at https://ics2022.ntub.edu.tw. All papers must be
submitted in an electronic format according to the conference paper
submission guidelines at the website. Submission page:
https://easychair.org/conferences/?con=ics2022.

------------
Awards
------------
Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper. The
program committee may decline to make these awards or may split them.

---------------------------
Workshop co-Chairs
---------------------------
Jou-Ming Chang, National Taipei University of Business, Taiwan
Sun-Yuan Hsieh, National Cheng Kung University, Taiwan
Ling-Ju Hung, National Taipei University of Business, Taiwan
Chia-Wei Lee, National Tatung University, Taiwan

------------------------------------------
Workshop Program Committee:
-------------------------------------------
Matthias Bentert, TU Berlin, Germany
Hans-Joachim Boeckenhauer, ETH Zurich, Switzerland
Hsin-Hung Chou, National Chi Nan University, Taiwan
Thomas Erlebach, Durham University, UK
Jianxi Fan, Soochow University, China
Florent Foucaud, LIMOS - Université Clermont Auvergne, France
Wing-Kai Hon, National Tsing Hua University, Taiwan
Sanpawat Kantabutra, Chiang Mai University, Thailand
Hung-Yu Kao, National Cheng Kung University, Taiwan
Ralf Klasing, CNRS and University of Bordeaux, France
Christian Komusiewicz, Philipps-Universität Marburg, Germany
Van Bang Le, University of Rostock, Germany
Chung-Shou Liao, National Tsing Hua University, Taiwan
Cheng-Kuan Lin, National Yang Ming Chiao Tung University, Taiwan
Tobias Mömke, University of Augsburg, Germany
Kung-Jui Pai, Ming Chi University of Technology, Taiwan
Peter Rossmanith, RWTH Aachen University, Germany
Dajin Wang, Montclair State University, USA
Hung-Lung Wang, National Taiwan Normal University, Taiwan
Weili Wu, University of Texas at Dallas USA
Jules Wulms, TU Wien, Austria
Dong Xiang, Tsinghua University, China
Tomoyuki Yamakami, University of Fukui, Japan
Shuming Zhou, Fujian Normal University, China

------------
Contact
------------
All questions about WABCT 2022 should be emailed to ics2022@ntub.edu.tw

**********************************************************
*
* 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: Computational Logic Autumn Summit, 19-30 September 2022, Tbilisi, Georgia

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

Computational Logic Autumn Summit (CLAS 2022)

19-30 September 2022, Tbilisi, Georgia

http://viam.science.tsu.ge/clas2022/

CLAS 2022 is supported by KGS
==============================================


The Computational Logic Autumn Summit brings together eight conferences and
three schools. Taking into account the coronavirus pandemic and the war in
Ukraine, the conference will be organized as a hybrid event.


# Conferences


- International Colloquium on Theoretical Aspects of Computing (ICTAC)

- Conference on Intelligent Computer Mathematics (CICM)

- International Symposium on Principles and Practice of Declarative
Programming (PPDP)

- International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR)

- International Conference on Mathematics of Program Construction (MPC)

- International Conference on Runtime Verification (RV)

- International Conference on Verification and Evaluation of Computer and
Communication Systems (VECoS)

- International Conference on Practical and Theoretical Aspects of Logic,
Cyber Security and Cryptography (LCSC)


# Schools


- Summer School of the International Colloquium on Theoretical Aspects of
Computing

- International School on Rewriting

- International Tbilisi Summer School in Logic and Language


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

Venue of CLAS

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


The CLAS venue is the historical main building of the Ivane Javakhishvili
Tbilisi State University (TSU). The main building of TSU is located in the
city center, from where many hotels, cafeterias, pubs, restaurants, parks,
other attractions (zoo, theaters, cinemas, opera, etc.) are within walking
distance.


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

Social Events

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

Although Georgia is a small country covering only 69700km2, it contains a
huge variety of places of interest, ranging from ski resorts and beaches to
cultural landmarks that tell the history of more than 3000 years. You will
experience Georgia's unique culture during your visit, especially during
the excursions throughout the country.


# Excursions


CLAS participants will have options to select one from the following tours:

- Wine tour in Kartli

- Wine tour in Kakheti

https://viam.science.tsu.ge/clas2022/socialEvents

# Banquets

During the banquets, the visitors will be able to experience the world's
famous Georgian Cuisine and most importantly, Georgian wine, which has a
history of 8000 years. The restaurants will offer a vast variety of
Georgian meals and wine. Some information about Georgian cuisine and wine
can be found at the following links:

https://en.wikipedia.org/wiki/Georgian_cuisine

https://en.wikipedia.org/wiki/Georgian_wine

**********************************************************
*
* 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, August 14, 2022

[DMANET] NTHU (Hybrid) Summer School on Operations Research and Algorithms, Sep. 1-2, 2022

=====================================================================
2022 NTHU (Hybrid) Summer School on Operations Research and Algorithms

1st (Thu) to 2nd (Fri) September, 2022, National Tsing Hua University,
Taiwan

http://www.ie.nthu.edu.tw/s/summerschool
=====================================================================


SCOPE
---------------------------------------------------
The summer school aims at introducing mathematical modelling in operations
research and algorithms, as well as various practical applications from
combinatorial optimization, machine learning, game theory, dynamic
programming and so on. It would also like to provide a discussion forum for
international participants, especially graduate students and young scholars.

Like last year, we invite six speakers to give research/tutorial talks to
share the latest development and their recent research results. The
lectures also include preliminary theoretical materials and possible
real-world applications. The talks will be scheduled on September 1st to
2nd (Thursday to Friday), and given in a hybrid way: on-site at National
Tsing Hua University in Hsinchu, Taiwan, and online via Microsoft Teams.
Every local participant is particularly welcome to attend the on-site
venue. We hope you will enjoy the two-day event.


SPEAKERS
---------------------------------------------------
- Kazuo Iwama (National Tsing Hua University & Kyoto University)
- Yu-Ching Lee (National Tsing Hua University)
- Feng-Jang Hwang (National Sun Yat-sen University)
- Chung-Shou Liao (National Tsing Hua University)
- Hao-Hsiang Wu (National Yang Ming Chiao Tung University)
- Hung-Ping Tung (National Yang Ming Chiao Tung University)


REGISTRATION
---------------------------------------------------
In order to maintain the high quality of the forum, please fill out the
form below by Aug. 26 (Fri).
https://forms.gle/vUdTGcBLNkkpjBUF6

Once your registration is confirmed, you will receive a link later for
entering the online forum if you plan to attend online. For any questions,
please email the organizer:
summerschool@ie.nthu.edu.tw


INFORMATION
---------------------------------------------------
Registration Deadline: August 26(Fri), 2022 (AoE)
Online Event Dates: 1st (Thu) to 2nd (Fri) September, 2022
Place: It will be held in a Hybrid way.
Online: Microsoft Teams
On-site venue: Room 106/107, Engineering Building 1, National Tsing Hua
University, Hsinchu
Local Organizer: Chung-Shou Liao (National Tsing Hua 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/
*
**********************************************************

Saturday, August 13, 2022

[DMANET] Helsinki ICT network: Doctoral student positions in computer science (deadline 28 Aug 2022)

The Helsinki Doctoral Education Network in Information and
Communications Technology (HICT <https://hict.fi/>) is a joint
initiative by Aalto University
<https://www.aalto.fi/en/department-of-computer-science/>and the
University of Helsinki
<https://www.helsinki.fi/en/faculty-science/faculty/computer-science>,
the two leading universities within this area in Finland. The network
involves at present over 80 professors and over 200 doctoral students,
and the participating units graduate altogether more than 40 new doctors
each year.

The participating units of HICT are currently seeking to hire doctoral
candidates to *fully-funded positions**in 22 research projects*. We
offer an exciting opportunity to join world-class research groups, with
multiple projects across our five research area specific tracks:

* Algorithms and machine learning
* Life science informatics
* Networks, networked systems and services
* Software and service engineering and systems
* User centered and creative technologies

If you wish to be considered as a new doctoral student in HICT you can
apply to one or a number of doctoral student positions. 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.

*For more information, please see the list of positions and detailed
information on the application process at: * https://hict.fi/admissions/
<https://hict.fi/admissions/>

*The online application form closes August 28, 2022 at 11:59 pm Finnish
local time (EEST = UTC +3).*

The quality of research and education in both HICT universities is
world-class. You will receive high-quality training, personal
supervision, and guidance, which will provide an excellent start to an
academic career. The Helsinki Metropolitan area is a comfortable place
where services are close by and public transport works excellently. In
terms of the living environment
<https://www.myhelsinki.fi/en/work-and-study/27-reasons-to-live-in-helsinki>,
Helsinki has consistently ranked as a vibrant and safe city, and it is
surrounded by beautiful nature. Helsinki currently holds fifth place on
the Valuer top-50 startup cities
<https://valuer.ai/blog/top-50-best-startup-cities/> list. Finland is
among the best countries in the world with respect to many quality of
life indicators
<http://www.stat.fi/tup/tilastokirjasto/itsenaisyyspaiva-2019_en.html>,
ranking at the top in education and subjective wellbeing. Furthermore,
Finland is the world's happiest country in 2022
<https://finland.fi/life-society/happinessreport2022/> – for the fifth
time in a row.

**********************************************************
*
* 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] IST-BRIDGE (Marie Skłodowska-Curie fellow) postdoc positions at IST Austria

IST Austria has opened applications for its 2-year fully-funded IST-BRIDGE
postdoctoral fellowships (which also come with the 'Marie Skłodowska-Curie
fellow' title).

Fellows will affiliate with one or more of the research groups at IST.
Particularly relevant to discrete maths are:

Vladimir Kolmogorov's group on Discrete Optimization;
Matthew Kwan's group on Combinatorics and Probability;
Uli Wagner's group on Discrete and Computational Geometry and Topology.

deadline: 05/11/22
details: https://ist.ac.at/en/education/postdocs/ist-bridge/

**********************************************************
*
* 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 Combinatorial Optimization and Discrete Mathematics at RWTH Aachen

Postdoc position in Combinatorial Optimization and Discrete Mathematics

at RWTH Aachen, Germany


A postdoc/senior researcher position is available in the group of

Britta Peis at RWTH Aachen University (www.oms.rwth-aachen.de)
The group's research focus is on combinatorial optimization, algorithmic game theory,

and discrete mathematics, in particular network optimization, submodular functions, flows, scheduling, approximation algorithms, linear and integer programming.

The ideal candidate holds (or is expected to hold soon) an excellent PhD degree in mathematics,
theoretical computer science, or a related area, and should have a strong
publication record in the areas combinatorial optimization, discrete mathematics, or algorithm
theory. A background in some of the other above-mentioned topics, as well as interest in problems motivated by applications in politics, logistic, and markets, is desirable.

In addition, the successful candidate is highly self-motivated, passionate about her/his work, and has a good ability to work both independently as well as in a team. Good communication skills
and solid English skills, both oral and in writing, are expected.
Teaching experience is an advantage.

The position is a full-time position for 3 years, with the possibility
of extension, paid according to the Federal German Payment scale TV-L
13. The actual salary depends on academic experience, family situation,
tax classification, etc.

The successful applicant is expected to conduct independent research on
topics relevant to the above-mentioned areas, to cooperate with the
group as well as external collaborators and to attract and supervise
graduate students. The position comes with teaching duties.

Applications will be reviewed starting from September 20, 2022, until the
position is filled. The starting date is negotiable; the position is
available immediately.

Please send your application as a single pdf to
britta.peis@oms.rwth-aachen.de. The application should include
- a motivation letter describing your background and reasons for
applying for this position
- a detailed CV with a list of publications
- a 1-page research statement describing research interests and goals
- name and email address of two academic references

Questions regarding the position should be directed to Prof. Britta Peis (britta.peis@oms.rwth-aachen.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/
*
**********************************************************

Friday, August 12, 2022

[DMANET] 2nd CFP: 14th World Congress on Nature and Biologically Inspired Computing (NaBIC 2022) - Online - Springer Publication

** Second Call for Papers - please circulate this CFP to your colleagues
and networks **

-- 14th World Congress on Nature and Biologically Inspired Computing
(NaBIC 2022) --

http://www.mirlabs.net/nabic22
http://www.mirlabs.org/nabic22

On the World Wide Web

December 14-16,2022

Proceedings of NaBIC'22 will be published with Springer Verlag in their
Lecture Notes in Networks and Systems (LNNS) series.
(https://www.springer.com/series/15179) (Approval Pending)

Proceedings of NaBIC'21:
https://link.springer.com/book/10.1007/978-3-030-96302-6
Indexed by: SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH, SCImago, DBLP, EI
Compendex, Japanese Science and Technology Agency (JST), SpringerLink

History of NaBIC series: http://www.mirlabs.net/nabic22/previous.php

**Important Dates**
---------------------
Paper submission due: September 30, 2022
Notification of paper acceptance: October 31, 2022
Registration and Final manuscript due: November 15, 2022
Conference: December 14-16, 2022

**About NaBIC'22**
------------------

After the success of the previous 13 events, we welcome
your participation and contribution to the 14th World Congress
on Nature and Biologically Inspired Computing (NaBIC 2022)
to be held online during December 14-16, 2022. NaBIC 2022 is
organized to provide a forum for researchers, engineers, and
students from all over the world, to discuss state-of-the-art
machine intelligence, and address various issues on building up
human-friendly machines by learning from nature. The conference
theme is "Nurturing Intelligent Computing Towards Advancement
of Machine Intelligence".

**Topics (not limited to)**
---------------------------
Industrial Applications of Nature and Biologically Inspired Computing
Computing
Information Retrieval
Robotics
Fault Diagnosis
Bioinformatics
Web Intelligence
Speech Processing
Business Information Systems
Knowledge Management
Evolvable Hardware
Image and Signal Processing
Pattern Recognition
Traffic and Transportation System
Decision Analysis
Data Mining
Computer Vision
Information and Communication Technology
Control System

Innovative approaches
Artificial Neural Networks
Biodegradability Prediction
Cellular Automata
Evolutionary Algorithms
Swarm Intelligence
Emergent Systems
Artificial Life
Lindenmayer Systems
Digital Organisms
Artificial Immune Systems
Membrane Computing
Simulated Annealing
Communication Networks and Protocols
Computing with Words
Common Sense Computing
Cognitive Modeling and Architecture
Connectionism
Metaheuristics
Hybrid Approaches
Quantum Computing
Nano Computing

**Submission Guidelines**
-------------------------
Submission of paper should be made through the submission page
from the conference web page. Please refer to the conference website
for guidelines to prepare your manuscript.

Paper format templates:
https://www.springer.com/de/authors-editors/book-authors-editors/manuscript-preparation/5636#c3324


NaBIC'22 Submission Link:
https://easychair.org/conferences/?conf=nabic2022

**Plenary Talks**
----------------------------------------
You are welcome to attend 11 Keynote Talks offered by world-renowned
professors and industry leaders. The detailed information is available
on conference website.

Speaker 1: Catarina Silva, University of Coimbra, Portugal
Title: Interpretability and Explainability in Intelligent Systems

Speaker 2: Chuan-Kang Ting, National Tsing Hua University, Taiwan
Title: TBA

Speaker 3: Joanna Kolodziej, Cracow University of Technology, Poland
Title: TBA

Speaker 4: Kaisa Miettinen, Multiobjective Optimization Group, Faculty
of Information Technology, University of Jyvaskyla, Finland
Title: Some Perspectives to Interactive Evolutionary Multiobjective
Optimization Methods.

Speaker 5: Kaspar Riesen, Institute of Computer Science, University of
Bern, Switzerland
University of Applied Sciences and Arts, Switzerland
Title: Four Decades of Structural Pattern Recognition - An Overview of
the Three Major Epochs

Speaker 6: Katherine MALAN, Department of Decision Sciences, University
of South Africa
Title: Landscape analysis of optimisation and machine learning search
spaces.

Speaker 7: Maki Sakamoto, The University of Electro-Communications,
Tokyo, Japan
Title: Computer Vision for Expressing Texture Using Sound-Symbolic Words


Speaker 8: Mário Antunes, Polytechnic Institute of Leiria, Portugal
Title: Cybersecurity: the road ahead

Speaker 9: Patricia MELIN, Tijuana Institute of Technology, Tijuana,
Mexico
Title: Hybrid Intelligent Systems based on Neural Networks, Fuzzy Logic
and Bioinspired Optimization Algorithms and their application to Pattern
Recognition.

Speaker 10: René NATOWICZ, ESIEE-Paris - Université Gustave Eiffel,
France
Title: Machine Learning in Graphs: Where Are We So Far?

Speaker 11: Yifei Pu, College of Computer Science, Sichuan University,
China
Title : Analog Circuit Implementation of Fractional-Order Memristor:
Arbitrary-Order Lattice Scaling Fracmemristor.

** NaBIC 2022 Organization**
---------------------------
General Chairs
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Patrick Siarry, Université Paris-Est Créteil, France
Thomas Hanne, University of Applied Sciences and Arts Northwestern
Switzerland, Switzerland

Program Chairs
Isabel Jesus, Institute of Engineering of Porto, Portugal
Nazar Zaki, United Arab Emirate University, UAE

Publication Chairs
Niketa Gandhi, Machine Intelligence Research Labs, USA
Kun Ma, University of Jinan, China

Special Session Chair
Gabriella Casalino, University of Bari, Italy

Publicity Chairs
Pooja Manghirmalani Mishra, Machine Intelligence Research Labs, India
Anu Bajaj, Machine Intelligence Research Labs, USA

If you would like to propose a special session, please email Dr.
Gabriella Casalino <gabriella.casalino@uniba.it>

**Technical Contact**
---------------------
Dr. Ajith Abraham
Email: ajith.abraham@ieee.org

Thanks & Regards
Anu Bajaj
Publicity Chair-MIR Labs Annual Conferences-2021, 2022
**********************************************************
*
* 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] Hausdorff Center for Mathematics: Hausdorff Chairs

The Cluster of Excellence Hausdorff Center for Mathematics at the
University of Bonn combines researches in Theoretical and Applied
Mathematics, and Mathematical Economics. In this framework, the
university looks forward to fill a Hausdorff Chair, which is a full
professorship with tenure. The position will be devoted to Applied
Mathematics. There are no further specifications concerning the
scientific direction.
https://www.hcm.uni-bonn.de/opportunities/hausdorff-chairs/announcement/

Daniela Schmidt (she/her)

Administrative Assistant
Hausdorff Center for Mathematics
Endenicher Allee 62, Villa Maria, Room 0.005
53115 Bonn
Tel: +49-228-73-4881, Fax: +49-228-73-62251
E-Mail: daniela.schmidt@hcm.uni-bonn.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] Mathematical Institute Bonn University: Full Professorship (W3) in Pure Mathematics

The Mathematical Institute of the Faculty of Science at the University
of Bonn invites applications for a tenured Full Professorship (W3) in
Pure Mathematics to be filled as soon as possible.
https://www.hcm.uni-bonn.de/opportunities/professorship-w3-in-pure-mathematics-mfd/


Daniela Schmidt (she/her)

Administrative Assistant
Hausdorff Center for Mathematics
Endenicher Allee 62, Villa Maria, Room 0.005
53115 Bonn
Tel: +49-228-73-4881, Fax: +49-228-73-62251
E-Mail: daniela.schmidt@hcm.uni-bonn.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] Hausdorff Center for Mathematics: W2 Professorships "Bonn Junior Fellows"

The Hausdorff Center for Mathematics (HCM) at the University of Bonn is
looking forward to filling up to three W2-Professorships ("Bonn Junior
Fellows")
These are temporary positions for a period of five years. To some of
these positions, a tenure-track option is associated, and, in
exceptional cases, a position may be tenured immediately.
https://www.hcm.uni-bonn.de/opportunities/bonn-junior-fellows/announcement/

Daniela Schmidt (she/her)

Administrative Assistant
Hausdorff Center for Mathematics
Endenicher Allee 62, Villa Maria, Room 0.005
53115 Bonn
Tel: +49-228-73-4881, Fax: +49-228-73-62251
E-Mail: daniela.schmidt@hcm.uni-bonn.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] Hausdorff Center for Mathematics: Postdoc Positions

The cluster of excellence Hausdorff Center for Mathematics (HCM) at the
University of Bonn brings together researchers in mathematics and its
applications, including in particular quantitative economics. In this
framework the center is looking forward to filling up several
Postdoctoral Positions
https://www.hcm.uni-bonn.de/opportunities/hausdorff-postdocs/official-announcement-postdoctoral-positions/

Daniela Schmidt (she/her)

Administrative Assistant
Hausdorff Center for Mathematics
Endenicher Allee 62, Villa Maria, Room 0.005
53115 Bonn
Tel: +49-228-73-4881, Fax: +49-228-73-62251
E-Mail: daniela.schmidt@hcm.uni-bonn.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/
*
**********************************************************

Thursday, August 11, 2022

[DMANET] ICDCIT 2022 - Call for Papers

======================================
ICDCIT 2022: CALL FOR PAPERS
======================================

The 19th International Conference on Distributed Computing and Intelligent
Technology
18th - 22nd January, 2023, Odisha, India

https://icdcit.ac.in/19th-icdcit-2023/

======================================
DATES (all times are AoE)
======================================

All deadlines are at 23:59 AoE in the year 2022.

Abstract submission: August 26, 2022 (extended)
Full paper submission: August 26, 2022 (extended)
Notification: October 9, 2022
Final version: October 19, 2022

======================================
SCOPE
======================================

ICDCIT-2023 solicits original research papers contributing to the
foundations and applications of Distributed Computing and Intelligent
Technology in the following broad areas:

Distributed Computing

-Blockchain & Its Applications
-Cloud Computing
-Computational Social Science
-Distributed and Cloud Storage
-Distributed and Concurrent Data Structures
-Distributed Auctions and Mechanism Design
-Distributed Graph Algorithms
-Distributed Machine Learning Algorithms
-Distributed Operating Systems, Middleware, Databases
-Distributed Social Choice Models
-Edge Computing
-Game-Theoretic Approaches to Distributed Computing
-High-Performance, Cluster, Cloud and Grid Computing and IoT Systems
-Internet Applications
-Memory Management
-Multi-Agent Systems
-Multiprocessor and Multi-Core Architectures and Algorithms
-Non-volatile memory
-Parallel network computations
-Peer-to-peer systems, overlay networks
-Replication and consistency
-Security in Distributed computing, Cryptographic Protocols
-Sensor, mesh, and ad hoc networks
-System-on-chip and Network-on-chip architectures
-Task Management
-Web Services
-Wireless networks , mobile computing, autonomous agents

Intelligent Technologies

-Affective Computing
-AI and Formal Verification
-AI planning
-Authenticity, Honesty & Deception
-Automated Vehicles
-Business Analytics
-Computational Intelligence
-Constraint Satisfaction Problems
-Cyber Physical Systems
-Deep Learning
-Engineering Intelligent Systems
-Ethics and AI
-Explainability in AI
-Federated Learning
-Health Care Systems
-Intelligent Manufacturing
-Intelligent Transport Systems
-Knowledge management
-Knowledge Representation
-Machine learning
-Machine Vision
-Metalearning
-Natural Language Processing
-Neuro-symbolic computing
-Profiling and social networking
-Recommendation Systems
-Reinforcement Learning
-Robots
-Security Systems
-Sentiment Analysis
-Social Memory & Cognition
-Society of Apps
-Speech Technologies
-Topic Detection
-Trustworthy computing

======================================
PAPER SUBMISSION INSTRUCTIONS
======================================

Authors are invited to electronically submit their papers using LNCS format
written in English, of up to 16 pages, presenting unpublished research
results (not submitted elsewhere) or innovative practical applications
including development of state of the art tools relevant to the conference
theme. All submissions are to be done electronically, and submitted papers
will be peer reviewed for possible inclusion in the conference proceedings
expected to be published by Springer-Verlag as a volume of Lecture Notes in
Computer Science.

Note: During the paper submission (on the easychair link given below), you
will be required to choose one of the two tracks: Distributed Computing or
Intelligent Technology. Please choose the track based on the topics
mentioned above.

Format for paper preparation:

https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines

At least one of the authors of each accepted paper must register for the
conference and present the paper in person at the conference.

Papers are to be submitted through the Easychair:
https://easychair.org/conferences/?conf=icdcit2023

======================================
ANONYMITY OF SUBMISSIONS
======================================

A submission should not reveal the identity of the authors in any way. No
names, addresses and affiliations should appear in the paper. Any
references to their own related work should be in the third person (e.g.,
not "We build on our previous work …" but rather "We build on the work of
…"). The purpose of this process 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.

The conference's double blind review process should avoid bias, yet nothing
should be done in the name of anonymity that weakens the submission or
makes the job of reviewing the paper more difficult. In particular,
important references should not be omitted or anonymized. Authors with
further questions on double-blind reviewing are encouraged to contact the
PC chairs by email.

You are free to disseminate your work through ArXiv and other online
repositories and give presentations on your work as usual.

======================================
BEST PAPER AWARD
======================================

-For Best Paper Award, INR 50,000 (for both distributed computing and
intelligent technology tracks) prize money will be awarded.
-For Best Student Paper Award, INR 25,000 (for both distributed computing
and intelligent technology tracks) prize money will be awarded.
-Tezos India is a leading blockchain adoption entity based in India. Their
goal is to reach, educate and train millions of developers about Blockchain
and assist individuals and entities to use the Tezos blockchain. This is an
excellent opportunity to publish and win the award in ICDCIT 2023!!

Note: The conference organizers can decide to split the awards between two
papers or not decide to award it to anyone as they seem fit.

======================================
ORGANIZATION
======================================

Chief Patron:
-Achyuta Samanta, KIIT, India

Patron:
-Sasmita Rani Samanta. KIIT, India

Advisory Committee:
-Diganta Goswami, IIT Guwahati
-Raj Bhatnagar, Univ. of Cincinnati, USA
-Rajkumar Buyya, University of Melbourne
-Sandeep Kulkarni, Michigan State University, USA

General Chairs:
-Sathya Peri, IIT Hyderabad, India
-Sandeep Kulkarni, Michigan State University, USA

Program Chairs:
-Anisur Rahaman Molla, ISI Kolkota, India
-Gokarna Sharma, Kent State University, USA
-Pradeep Kumar, IIM Lucknow

Conference Management Chair:
-Samaresh Mishra, KIIT, India

Organizing Chair:
-Krishna Chakravarty, KIIT, India

Finance Chairs:
-Jagannath Singh, KIIT, India
-Amiya Kumar Dash, KIIT, India

Publicity Chairs:
-Roshni Pradhan, KIIT, India
-Saurabh Bilgaiyan, KIIT, India

Registration Chairs:
-Abhaya Kumar Sahoo, KIIT, India
-Pratyusa Mukherjee, KIIT, India

Session Management Chairs:
-Manjusha Pandey, KIIT, India
-Bhaswati Sahoo, KIIT, India

Publications Chairs:
-Santwana Sagnika, KIIT, India
-Satarupa Mohanty, KIIT, India

Student Symposium Chairs:
-Hrudaya Kumar Tripathy, KIIT, India
-Minakhi Rout, KIIT, India
-Sushruta Mishra, KIIT, India

Industry Symposium Chairs:
-Subhasis Dash, KIIT, India
-Manas Ranjan Lenka, KIIT, India

Project Innovation Contest Chairs / Innovation Chairs:
-Bindu Agarwalla, KIIT, India
-Kunal Anand, KIIT, India

Workshop Chairs:
-Chittaranjan Pradhan, KIIT, India
-Rajat Kumar Behera, KIIT, India

Ph.D Symposium Chairs:
-Satya Ranjan Dash, KIIT, India
-Himansu Das, KIIT, India

----
Regards,
William K. Moses Jr.

**********************************************************
*
* 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 position in Graph Algorithms for Bioinformatics (University of Helsinki)

Dear colleagues,

I'm looking to recruit one PhD student (full-time employment, ~3.5 - 4 years) for a Bioinformatics project at the University of Helsinki, involving graph algorithms (focusing on network flows and flow decompositions) for long-read RNA-seq assembly problems and possibly pan-genomics problems.

Ideally, the candidate has a strong algorithmic and/or programming background, but also (strong) knowledge of Bioinformatics and an interest to apply graph algorithms in developing practical Bioinformatics tools. However, there is flexibility in adapting the project to the interests and expertise of the student. The student is expected to take an active role in leading the project, working with the team members and international collaborators, and doing possible research visits abroad.

The person will join my Graph Algorithms team, which is part of the wider Algorithmic Bioinformatics group at the University of Helsinki. The team consists of 3 PhD Students, 2 Postdocs, and we are currently funded also by an ERC Starting Grant.

For some key pointers related to this position, see:
- Dias et al. "Fast, Flexible, and Exact Minimum Flow Decompositions via ILP" https://link.springer.com/chapter/10.1007/978-3-031-04749-7_14 (RECOMB 2022)
- Khan et al. "Safety and Completeness in Flow Decompositions for RNA Assembly" https://arxiv.org/abs/2201.10372 (RECOMB 2022)
- Prjibelski et al. "IsoQuant: a tool for accurate novel isoform discovery with long reads" https://www.researchsquare.com/article/rs-1571850/v1
- Cáceres et al. "Width Helps and Hinders Splitting Flows" https://arxiv.org/abs/2207.02136 (ESA 2022)

The application deadline is August 28, and applications are done via our doctoral school https://hict.fi/admissions/ (mentioning the project "Graph Algorithms for Long-Read Sequencing Data"). After the deadline, the position will remain open until a suitable candidate is found. Applications after the deadline are possible by e-mail to alexandru.tomescu@helsinki.fi . If you are interested in applying shortly after the deadline, please send as soon as possible a notification to my e-mail address including at least your CV.

Required documents:
1. Letter of motivation (max. one page)
2. A curriculum vitae and list of publications
3. A study transcript
4. A copy of the M.Sc. degree certificate
5. Contact details of two possible referees

We are based at the Department of Computer Science, University of Helsinki, Finland, in a city that often ranks among the best places to live in the world. Despite being a capital, Helsinki is a very easy city to live in, with lots of green areas, an efficient public transport system and a housing market rather accessible. Helsinki offers easy access to national parks or islands within the metropolitan area: nature lovers, this is the place to be!

Candidates from a minority background in our field are warmly encouraged to apply!

For any inquiry, please do not hesitate to contact me.

Best regards,
Alexandru Tomescu
Associate Professor and Academy of Finland Research Fellow

alexandru.tomescu@helsinki.fi
https://www.cs.helsinki.fi/u/tomescu/
https://www2.helsinki.fi/en/researchgroups/algorithmic-bioinformatics/teams/graph-algorithms
https://www2.helsinki.fi/en/researchgroups/algorithmic-bioinformatics/teams
**********************************************************
*
* 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] Lecturer / Senior Lecturer / Reader in Algorithms and Complexity, University of Glasgow

Lecturer / Senior Lecturer / Reader in Algorithms and Complexity
University of Glasgow, School of Computing Science

Vacancy Ref: 093810
Salary: Grade, level 7/8/9, £37,474 - £42,155 / £46,047 - £53,353 / £54,949 - £61,823 per annum

The School of Computing Science is seeking to appoint a Lecturer / Senior Lecturer / Reader in Algorithms and Complexity. In this post, you will carry out research and scholarship in Algorithms and Complexity, deliver an excellent student experience through teaching and assessment, and contribute to management and administration. At Grade 8 and 9, you will demonstrate leadership and contribute to academic and strategic management.

This post is full time and is offered on an open-ended basis. The post is equivalent to US tenure track Assistant or Associate Professor.

Relocation assistance will be provided where appropriate.

For informal enquiries, please contact Professor David Manlove at David.Manlove@glasgow.ac.uk.

Visit our website for further information on The University of Glasgow, School of Computing Science at https://www.gla.ac.uk/schools/computing.
Apply online at: https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=093810.

Closing Date: 30 September 2022.

**********************************************************
*
* 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, August 10, 2022

[DMANET] Registration open: Sixteenth International Tbilisi Summer School in Logic and Language

=========================================================
Sixteenth International Tbilisi Summer School in Logic and Language (TbiLL
2022)

September 19-23, 2022, Tbilisi, Georgia
https://www.logic.at/tbilisi22/

Part of the Computational Logic Autumn Summit (CLAS 2022)
https://viam.science.tsu.ge/clas2022
=========================================================


This summer school is part of the Computational Logic Autumn Summit
(CLAS2022) co-organized by the Kurt Gödel Society in Tbilisi, Georgia. It
will take place September 19-23 2022. This Summer School is in addition to
the eminence of the invited scientists devoted to peace within the sciences.


The intended audience of the winter school includes bachelor, master and
PhD students as well as young researchers from the fields of computer
science and mathematics. The following lectures agreed to deliver classes
at the school:


-Bahareh Afshari (The Netherlands/Iran): Reasoning about Computation
-Matthias Baaz (Austria): Epsilon Calculus
-Lev Beklemishev (Russia): Foundations of Mathematics
-Nachum Dershowitz (Israel): The Church=Turing Theses
-Michel Parigot (France): Natural Deduction
-Jan von Plato (Finnland): Recent Discoveries in Gödel´s Shorthand Notebooks

==================
REGISTRATION
==================

For the registration visit the Easychair system:
https://easychair.org/conferences/?conf=clas2022

The registration fee is 200/250 Euro for students (early till July 31/late
till August 31) and 350/400 for non-students (early till July 31/late till
August 31), which will include access to school materials, coffee breaks,
and social events (excursion and banquet). The registration fee for an
accompanying person is 150 Euro and includes only social events.

==================
ORGANIZERS
==================
Matthias Baaz
Anela Lolic


Contact: baaz@logic.at

**********************************************************
*
* 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 position in Algorithms and Complexity Theory at TU Kaiserslautern

PHD POSITION IN ALGORITHMS AND COMPLEXITY THEORY AT TU KAISERSLAUTERN

The newly established Algorithms and Complexity Theory group headed by
Prof. Marvin Künnemann at TU Kaiserslautern invites applications for PhD
positions. The starting date is as soon as possible.

The group's research focuses on recent methods in fine-grained
complexity theory & algorithm design, giving exciting opportunities to
explore the complexity landscape of polynomial-time problems. This
includes both conditional lower bounds as well as algorithm design &
engineering informed by such lower bounds.

Topics include: fine-grained complexity theory, algorithm engineering,
graph algorithms, computational geometry, string algorithms, database
theory, multivariate and parameterized algorithms as well as algorithms
for large data sets.

Successful applicants will explore algorithmic barriers for
polynomial-time problems and/or engineer fast algorithms. Background in
competitive programming is appreciated, but not mandatory.

TU Kaiserslautern offers a strong research environment, an international
atmosphere and comfortable working & living conditions. There will be
possibilities for collaborations with other researchers, including
groups at Max Planck Institute for Software Systems and Max Planck
Institute for Informatics as well as institutions abroad.

The salary is according to TV-L E13 scale.

TU Kaiserslautern strongly encourages qualified female academics to
apply. It is a family-friendly university, which offers a high level of
support to applicants with children. Disabled applicants will be given
preference when equally qualified (please enclose evidence). TU
Kaiserslautern values the diversity of its members and enables equal
opportunities for all.

In case of questions, please feel free to contact Marvin Künnemann
(kuennemann@cs.uni-kl.de).

To apply, please send an e-mail to kuennemann@cs.uni-kl.de including a
CV, transcript of records, a thesis draft (if available) and a research
statement detailing your interests. Candidates will be considered until
the position is filled.

**********************************************************
*
* 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] 3 year Postdoc, Theory of Co-evolutionary Algorithms (University of Birmingham)

Dear colleagues,

Applications are invited for a 3-year Research Fellowship (postdoc) in
the theory of co-evolutionary computation at the University of
Birmingham. 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. When complete, the
project team will consist of two postdocs and two PhD students in
addition to the PI. The fellowship is funded by 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 research track record in theory
of evolutionary computation, algorithmic game theory, and/or randomised
algorithms.

For further details, please see

https://www.jobs.ac.uk/job/CSG036/research-fellow-in-theory-of-co-evolutionary-computation

The closing date is Aug 28th 2022.

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

[DMANET] SDS 2022 CFP: The Ninth International Conference on Software Defined Systems , Paris, France. December 12-15, 2022

[Apologies if you got multiple copies of this invitation]

The Ninth International Conference on Software Defined Systems (SDS-2022)

https://emergingtechnet.org/SDS2022/index.php

Paris, France. December 12-15, 2022

Pending-Technically Co-Sponsored by IEEE France Section

*SDS 2022 CFP:*

Next generation cloud systems will require a paradigm shift in how they are
constructed and managed. Conventional control and management platforms are
facing considerable challenges regarding flexibility, dependability and
security that next generation systems will require. The cloud computing
paradigm has gone part of the way towards alleviating some of the problems
associated with resource allocation, utilization and managements (e.g., via
elasticity). However, many of the elements of a well-designed cloud
environment remain "stiff" and hard to modify and adapt in an integrated
fashion. This includes underlying networking topologies, many aspects of
the user control over IaaS, PaaS or SaaS layers when such is needed,
construction of XaaS services, provenance and meta-data collection, and so
on. In many situations the problem may be because service abstraction is
inadequate. Software Defined Systems (SDS) are systems that have added
software components which help abstract actual IT equipment and other
layers. One classical example, of course, are hypervisors. Such separation
provides a great opportunity for system administrators to more easily
construct and managing their systems through flexible software layers.

Software Defined Systems include Software Defined Networking (SDN),
Software Defined Storage, Software Defined Servers (Virtualization),
Software Defined Datacenters (SDD), Software Defined Security (SDSec), and
ultimately Software Defined Clouds (SDCloud) to name a few possibilities.
Individual solutions and seamless integration of these abstractions remains
in many respects a challenge. After the high success of the previous
editions (SDS'2014, SDS'2015, SDS'2016, SDS'2017, SDS'2018, SDS' 2019, SDS'
2020 and SDS' 2021), The Ninth International conference on Software Defined
Systems (SDS'2022) will continue to be a forum for scientists,
researchers, students, and practitioners to present their latest research
results, ideas, and developments in the area of software defined systems –
both components and their integration - and by implication advancement of
next generation clouds.

SDS 2022 aims to investigate the opportunities and in all aspects of
Software Defined Systems. In addition, it seeks for novel contributions
that help mitigating SDS challenges. That is, the objective of SDS 2022 is
to provide a forum for scientists, engineers, and researchers to discuss
and exchange new ideas, novel results and experience on all aspects of
Software Defined Systems. SDS is Technically Co-Sponsored by IEEE Spain
Section. Researchers are encouraged to submit original research
contributions in all major areas, which include, but not limited to:

* Software Defined Systems support for Cloud Computing .
* Software Defined Networking (SDN).
* SDN concepts, architecture, and APIs.
* Network Virtualization
* SDN and OpenFlow protocol
* Software Defined Radio
* Cognitive Radio Networks .
* Access Control models in SDN.
* Software Defined Storage.
* Storage Automation and Abstraction.
* Policy-driven storage provisioning.
* Software Defined Servers and Virtualization.
* Software Defined Datacenters.
* Software Defined Security o Security policies automation.
* Self-management systems.
* Autonomic Computing techniques.
* Real-time load prediction model to optimize the user satisfaction.
* Software Defined Systems Scalability.
* Software Defined Systems optimization.
* Software tools and frameworks to support SDS .
* Software Defined Systems challenges and opportunities
* Software Defined Systems surveys .
* Social engineering, insider threats system for SDS.
* Incident Handling and Penetration Testing with SDS.
* Software Defined Systems support if IoT.
* Security protocols in SDS.
* Security and privacy of mobile SDS based cloud computing
* Service-oriented architectures, service portability andP2P
* Network virtualization and cloud-based radio access networks

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also, submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the SDS Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers up to 8 pages and must follow the IEEE paper format. Please include
up to 7 keywords, complete postal and e-mail address, and fax and phone
numbers of the corresponding author. Authors of accepted papers are
expected to present their work at the conference. Submitted papers that are
deemed of good quality but that could not be accepted as regular papers
will be accepted as short papers. Length of short papers can be between 4
to 6 pages.

*Important Dates*

Submission Date: 1 September, 2022

Notification to Authors: 20 October, 2022

Camera Ready Submission: 15 November, 2022

*Contact:*

Please send any inquiry on SDS 2022 to the Emerging Tech. Network Team at:
emergingtechnetwork@gmail.com

**********************************************************
*
* 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] Day(s) on Computational Game Theory: Registration open

Dear colleagues,

we invite you to the

   12th Day(s) on Computational Game Theory,

to be held on

   September 29-30, 2022, at the University of Bremen.

It is a two-day scientific meeting and the follow up to the 11th Day on
Computational Game Theory which was held at the University of Twente in
Enschede.

The workshop will bring together researchers in Mathematics, Computer
Science, Operations Research and Economics, who are interested in
algorithmic or computational aspects of game theory, social choice and
related areas. It provides an opportunity to foster collaboration,
present research and exchange ideas in an informal and relaxed atmosphere.

Invited speakers are

   Martin Hoefer, Goethe University Frankfurt, Germany,

   Michael McGettrick, National University of Ireland, Galway, Ireland, and

   Tami Tamir, Reichman University, Herzliya, Israel.

REGISTRATION:
---------------------

You can register for the workshop by sending an email to
cgtday@uni-bremen.de. The email should contain your name, your
affiliation and the title of your talk (unless you prefer not to give a
talk).
There is a registration fee of 50€. Payment details will be provided via
email after your registration request. We appreciate your registration
until September 01.

There will be room for contributed talks and we strongly encourage PhD
students and young researchers to present their recent results or
ongoing research.

FURTHER INFORMATION:
----------------------------------

The workshop website is available at

http://www.math.uni-bremen.de/zetem/cms/detail.php?id=24316

We hope to see you in Bremen
Daniel Schmand (University of Bremen)

**********************************************************
*
* 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, August 9, 2022

[DMANET] Postdoc in Brno, Czech Republic (Transportation planning and scheduling)

*Postdoc positions at FI MU 2022*

The Faculty of Informatics of Masaryk University (FI MU) in Brno, Czech
Republic, invites applications for one or two *Post-doctoral positions in all
areas of Computer Science*. Brno (see https://brnoregion.com/) is an attractive
city for students and young researchers, and often branded as the "Silicon
Valley of the Czech Republic" thanks to its innovative ecosystem of universities
and start-up as well as scale-up businesses. The Faculty has a strong interest
in attracting applications from abroad.

See the callhttps://www.muni.cz/en/about-us/careers/vacancies/71161
<https://www.muni.cz/en/about-us/careers/vacancies/71161>

This includes, in particular, the area of*
*

*    Transportation planning and scheduling*

where the work on complex vehicle routing and scheduling problems in cooperation
with industry is expected. More details about corresponding research topics can
be found athttps://www.fi.muni.cz/research/networks/scheduling.html.en

Please contact Hana Rudova <hanka@fi.muni.cz> <mailto:hanka@fi.muni.cz> if you
are interested in these particular topics. You should also send:

* An academic CV including a list of publications (only published or
accepted), preferably also attach links to your ORCiD, Google Scholar
profile, and your DBLP record
* Motivation letter
* Your three best recent publications from above mentioned areas (references
as well as PDF files), where all publications must be published or accepted.
Please, do not send publications under review
* PDF of your PhD thesis if it is written in English

Note that deadline for application is ****September 4, 2022. However, you should
contact Hana Rudova as early as possible to evaluate potential candidates for
these areas in advance.


**Offer**

The postdoctoral positions are awarded for one year with an extension to the
second year after a review. Gross salary is 61,000 CZK per month which sums to
about *30,000 EUR per year.* Additional funds of approximately 4,000 EUR per
year will be available for travel and material expenses. Preferred start date of
the contract is January 2023, but other options can be negotiated without hassle.

********
**Requirements**

Candidates must have a *Ph.D. degree not older than 4 years* at the time of
application, from a university outside of the Czech and Slovak Republics. In
case that the Ph.D. defense is not yet finished, the candidate must also provide
an official letter certifying that his/her Ph.D. thesis has already been
submitted for defense and outlining the expected schedule of the Ph.D. defense.
Candidates with a Ph.D. degree from a Czech or Slovak university may also be
considered if they prove at least two years of post-doctoral research experience
abroad.

**Evaluation**

All candidates are expected to be fluent in English, while prior knowledge of
Czech is not required. Candidates will be evaluated on the ground of their
strong international research record, and preference will be given to those
whose research areas match the research directions of the Faculty of
Informatics; see http://www.fi.muni.cz/research/.

***Contact***

****Hana Rudova, Ph.D.
Associate Professor
Faculty of Informatics, Masaryk University
Botanicka 68a, 602 00 Brno, Czech Republic
hanka@fi.muni.cz
http://www.fi.muni.cz/~hanka
**********************************************************
*
* 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, August 8, 2022

[DMANET] Assistant professor position on Algorithms and Data Analysis, KTH, Sweden

KTH Royal Institute of Technology has a vacancy for one assistant professor position (tenure track) with specialization in algorithms and data analysis.

The position is funded by the Wallenberg AI, Autonomous Systems and Software Program (WASP) is Sweden's largest individual research program ever, a major national initiative for strategically motivated basic research, education and faculty recruitment.

Applications must be made online through the KTH job portal. Full position details, including how to apply online can be found at:

https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:493264/type:job/where:4/

The deadline for online applications is September 15, 2022.

Job reference number: VL-2022-0039

**********************************************************
*
* 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, Computational and Data Science, KIT

6 Doctoral Researchers (f/m/d) in Computational and Data Science (KIT
Graduate School Computational and Data Science)

Deadline for applications: Monday, Aug 29, 2022.

KIT Graduate School Computational and Data Science (KCDS) is a new graduate
school at the Karlsruhe Institute of Technology (KIT) starting in winter
semester 2022/23 that offers an interdisciplinary training program for
doctoral researchers in the field of model-driven and data-driven
computational science.

We are looking for master degree holders who are interested in
interdisciplinary research projects that revolve around computational
methods such as
- mathematical models
- simulation methods and
- data science techniques,
all the while building bridges between mathematical sciences and an applied
SEE discipline (sciences, economics and engineering).

More info on the doctoral projects and the application procedure on the KCDS
website:
https://www.kcds.kit.edu/72.php

Application form:
https://jobs.pse.kit.edu/en/jobs/81895/6-doctoral-researchers-fmd-in-computa
tional-and-data-science-kit-graduate-school-computational-and-data-science

--
Karlsruhe Institute of Technology (KIT)
- KIT Center MathSEE -

Angela Hühnerfuß
KIT Graduate School Computational and Data Science

Coordination Office

Kaiserstr. 12
D-76131 Karlsruhe
Tel.: +49 721-608 47748

angela.huehnerfuss@kit.edu

KIT – The Research University in the Helmholtz Association
www.kit.edu

**********************************************************
*
* 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] Let's SCIP it! A workshop to celebrate 20 years of Solving Constraint Integer Programs

Let's SCIP it! A workshop to celebrate 20 years of Solving Constraint
Integer Programs

on November 4, 2022, at Zuse Institute Berlin


Since its inception 20 years ago, SCIP (https://scipopt.org) has become
one of the most versatile solvers and frameworks for research in mixed
integer optimization. The first recorded commit message documenting the
start of SCIP's development dates back to October 23, 2002. High time to
come together and discuss past, present and future developments!

The spotlight will be on SCIP, but the workshop welcomes a broad
audience interested in computational optimization and its theoretical
underpinnings.

We are excited to host two invited presentations by

- Merve Bodur, University of Toronto, on "Methodological Advances in
Two-stage Stochastic Programming"

- Domenico Salvagnin, Università di Padova on "A fix-propagate-repair
heuristic for Mixed Integer Programming"

and many talks on computational mixed integer optimization.

Find more information on programme and registration at the workshop webpage

https://scipopt.org/20years

We hope to see many of you in Berlin!


The organizing committee, on behalf of the entire SCIP team:

Ambros Gleixner, Zuse Institute and HTW Berlin
Marc Pfetsch, TU Darmstadt
Sebastian Pokutta, Zuse Institute Berlin and TU Berlin
Franziska Schlösser, Zuse Institute Berlin
**********************************************************
*
* 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] ATMOS 2022 - Call for Participation / Registration open

CALL FOR PARTICIPATION -- REGISTRATION OPEN
-------------------------------------------

ATMOS 2022

22nd Symposium on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems (ATMOS)

https://algo2022.eu/atmos/

The 22nd edition of the Symposium on Algorithmic Approaches for
Transportation Modelling, Optimization, and Systems (ATMOS) will be held
on September 8--9, 2022, at the Hasso Plattner Institute in Potsdam,
Germany. As usual, ATMOS is part of ALGO, the major annual European
event for researchers, students and practitioners in algorithms.

The conference will be in-person and will feature a keynote talk.


REGISTRATION
------------

https://algo2022.eu/registration/

Early registration deadline: August 14, 2022


KEYNOTE TALK
------------

Speaker: Christian Sommer, Apple Inc.

Title: On Map Matching GPS Traces

Abstract: With the widespread availability of receivers for the Global
Positioning System (GPS) in modern cars and smartphones came the rise of
large databases of GPS traces. These are valuable sources for various
applications like map construction, map refinement and correction,
traffic estimation, travel time estimation, dynamic routing, and many more.

As a first step, GPS traces often get mapped to a road network via a
non-trivial process called map matching. Given a GPS trace as a sequence
of (latitude, longitude) pairs, possibly equipped with time stamps and
auxiliary information, a map matching algorithm is expected to return a
sequence of road segments (edges in the road network) that the input
trace likely traversed.

In this talk we review problems and approaches around map matching GPS
traces at scale.


ACCEPTED PAPERS
---------------

* Irene Heinrich, Philine Schiewe and Constantin Seebach: Algorithms and
Hardness for Non-Pool-Based Line Planning
* Ralf Borndörfer, Fabian Danecker and Martin Weiser: A
Discrete-Continuous Algorithm for Globally Optimal Free Flight
Trajectory Optimization
* Torsten Klug, Thomas Schlechte and Markus Reuther: Does Laziness Pay
Off? – A Lazy-Constraint Approach to Timetabling
* Julian Patzner, Ralf Rückert and Matthias Müller-Hannemann:
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in
Public Transport
* Hector Gatt, Jean-Marie Freche, Fabien Lehuédé and Arnaud Laurent: A
bilevel model for the frequency setting problem
* Enrico Bortoletto, Niels Lindner and Berenike Masing: Tropical
Neighbourhood Search: A New Heuristic for Periodic Timetabling
* Marco Blanco, Ralf Borndoerfer and Pedro Maristany de Las Casas: An A*
Algorithm for Flight Planning based on Idealized Vertical Profiles
* Vera Grafe, Alexander Schiewe and Anita Schöbel: Delay Management with
Integrated Decisions on the Vehicle Circulations
* Spyros Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas
Paraskevopoulos and Christos Zaroliagis: REX: A Realistic Time-dependent
Model for Multimodal Public Transport
* Zuguang Gao, John R. Birge, Richard L.-Y. Chen and Maurice Cheung:
Greedy Algorithms for the Freight Consolidation Problem
* Moritz Potthoff and Jonas Sauer: Efficient Algorithms for Fully
Multimodal Journey Planning
* Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita
Schöbel and Reena Urban: The Edge Investment Problem: Upgrading Transit
Line Segments with Multiple Investing Parties
* Kosuke Kawazoe, Takuto Yamauchi and Kenji Tei: A formulation of MIP
train rescheduling at terminals in bidirectional double-track lines with
a moving block and ATO
* Lukas Graf, Tobias Harks and Prashant Palkar: Dynamic Traffic
Assignment for Electric Vehicles

The detailed schedule will appear soon on the conference webpage
(https://algo2022.eu/atmos).


PROCEEDINGS
-----------

The proceedings of ATMOS 2022 will be published online and as
open-access in the Dagstuhl Open Access Series in Informatics
(https://www.dagstuhl.de/en/publications/oasics).


PC MEMBERS
----------

* Bastian Amberg, FU Berlin, Germany
* Moritz Baum, Apple Inc., USA
* Nikola Bešinović, TU Delft, Netherlands
* Valentina Cacchiani, University of Bologna, Italy
* Serafine Cicerone, University of L'Aquila, Italy
* David Coudert, INRIA and Université Cốté d'Azur, France
* Gianlorenzo D'Angelo, Gran Sasso Science Institute, Italy
* Yann Disser, TU Darmstadt, Germany
* Stefan Funke, University of Stuttgart, Germany
* Christian Liebchen, TH Wildau, Germany
* Matúš Mihalák, Maastricht University, Netherlands
* Joseph S. B. Mitchell, Stony Brook University, USA
* Matthias Müller-Hannemann, MLU Halle-Wittenberg, Germany
* Philine Schiewe, TU Kaiserslautern, Germany
* Pieter Vansteenwegen, KU Leuven, Belgium
* Christos Zaroliagis, CTI and University of Patras, Greece


Best regards,
Mattia D'Emidio and Niels Lindner
PC chairs of ATMOS 2022

--
Dr. Niels Lindner
Head of MobilityLab
Department Network Optimization
Zuse Institute Berlin
Takustr. 7, 14195 Berlin, Germany
www.zib.de/lindner
lindner@zib.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/
*
**********************************************************