Friday, December 30, 2022

[DMANET] Deadline extended: Special Issue on Graph Searching:Theory and Applications

Dear colleagues,

This is to announce that the deadline for submissions to the Special
Issue of Theoretical Computer Science has been extended to February 15,
2023.

With best regards,

Dimitrios, Nicolas, Pierre and Spyros

On 2022-09-04 21:29, Spyros Angelopoulos wrote:
> Call For Papers--Theoretical Computer Science.
> Special Issue on "Graph Searching: Theory and Applications".
>
> We invite submissions to a special issue of the journal "Theoretical
> Computer Science" (TCS)
> on the topic "Theory and Applications of Graph Searching". The scope of
> the issue is inspired by,
> but not limited to papers presented in the 10th International Workshop
> on Graph Searching:
> Theory and Algorithms (GRASTA 2022), which took place in Porquerolles,
> France, May 16-20 2002.
>
> Graph searching involves a team of mobile agents (called searchers or
> pursuers or cops) that aims
> at capturing a set of escaping agents (called evaders or fugitives or
> robbers) that hide in a
> network which may be modeled by a graph. Many variants of graph
> searching have been studied
> in the literature, such as pursuit-evasion games or cops and robber
> games. These variants are either
> application driven, i.e., motivated by settings of practical interest,
> or are inspired by
> foundational issues at the intersection of Computer Science, Discrete
> Mathematics, and Artificial
> Intelligence. As a result, graph searching has attracted significant
> interest from different areas of
> Mathematics, Computer Science and Operations Research.
>
> With this Special Issue, we aim to further foster research in the area
> of Graph Searching by
> presenting recent results and directions for future research. The
> purpose of the Special Issue is to
> highlight recent research, predominantly from the theoretical point of
> view. Topics of interest
> include (but are not limited to) the following:
>
> Cops and Robbers Games
> Conquest and Expansion Games
> Search, Patrolling and Surveillance Games
> Graph Parameters Related to Graph Searching
> Graph Searching and Logic
> Graph Searching and Theory of Robotic Search
> Database Theory and Robber and Marshals Games
> Probabilistic Techniques in Graph Searching
> Monotonicity and Connectivity in Graph Searching
> New Variants and Performance Measures of Graph Searching
> Graph Searching and Distributed Computing
> Graph Searching and Network Security
> Searching in Unbounded Domains
>
>
> Submission format and guidelines
> All submissions must contain original work and be written in English.
> The manuscript and any
> supplementary material should be submitted using the Elsevier Editorial
> System (EES) at https://www.editorialmanager.com/TCS. The authors must
> select "VSI: GRASTA_2022" when they reach the
> "Article Type" step in the submission process. All submitted papers
> will be refereed according to
> the rigorous standards of TCS. The editorial team will make all effort
> to ensure the timely
> completion of the refereeing process. Requests for additional
> information should be addressed to
> the guest editors.
>
>
> Important dates
>
> Submission deadline: February 15, 2023
> Final decision notification (tentative): December 30, 2023
> Publication of special issue (tentative): March 30, 2024
>
>
> Guest Editors:
>
> Spyros Angelopoulos
> Pierre Fraigniaud
> Nicolas Nisse
> Dimitrios Thilikos
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, December 29, 2022

[DMANET] BEATCS Algorithmics Column: Approximate counting using Taylor's theorem

The Algorithmics Column in the latest Bulletin of the EATCS (number 138, available a
http://bulletin.eatcs.org/index.php/beatcs/issue/view/40) features the following article:

Viresh Patel and Guus Regts: Approximate counting using Taylor's theorem: a survey

Other recent contributions featured in the Algorithmics Column were:

William Gasarch: Hilbert's Tenth Problem for Fixed d and n
(in Bulletin No 133)

Kathie Cameron and Kristina Vuskovic: Hadwiger's Conjecture for some hereditary classes of graphs: a survey
(in Bulletin No 131)

Yann Strozecki: Enumeration Complexity
(in Bulletin No 129)

Katarína Cechlárová, Ágnes Cseh, David Manlove: Selected open problems in Matching Under Preferences
(in Bulletin No 128)

The bulletins are all freely available here: https://eatcs.org/index.php/on-line-issues

If you have ideas for a potential contribution to the Algorithmics Column, please
feel free to contact me (thomas.erlebach@durham.ac.uk) with suggestions or
proposals.

Best regards,

Thomas Erlebach


**********************************************************
*
* 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] ISC High Performance 2023 CALL FOR BoFS

ISC High Performance 2023 CALL FOR BoFS

Deadline for submission is January 25th, 2023
============================================================================================
The ISC High Performance 2023 Conference call for BoFs is now open!
(https://www.isc-hpc.com/submissions-bof-sessions-2023.html)

Like-minded ISC attendees come together in our informal
Birds-of-a-Feather (BoF) sessions during ISC High Performance (May 21 -
25, 2023 in Hamburg) to discuss current HPC topics, network, and share
their thoughts and ideas. Each BoF will be a 60 minutes session focusing
on a different topic and is led by one or more experts in the relevant
subject.
BoFs are different in nature from panels, technical paper sessions,
tutorials, vendor talks, and other, more lecture-oriented parts of the
ISC program. They provide a venue for a dynamic conversation with peers,
experts, leaders, and anybody from the HPC community interested in a
common subject.
Proposals should demonstrate a clear concept for the interactive nature
of their BoF.
Submitted BoF proposals will be reviewed by the ISC 2023 BoFs Committee,
which is headed by Marta Garcia Gasulla, Barcelona Supercomputing
Center, Spain as Chair.

More information: https://www.isc-hpc.com/submissions-bof-sessions-2023.html

IMPORTANT DATES
- Submission Deadline: January 25, 2023, 11:59pm AoE
- Notification of Acceptance: February 28, 2023
- BoF Sessions: May 22 – May 24, 2023

CHAIR
BoFs Chair: Marta Garcia Gasulla, Barcelona Supercomputing Center, Spain
BoFs Deputy Chair: Brian Wylie, Forschungszentrum Juelich GmbH

AREAS OF INTEREST
BoF sessions are intended to cover all areas of interest as listed in
the call for paper:
https://www.isc-hpc.com/submissions-research-papers-2023.html

- Architectures, Networks, & Storage
- HPC Algorithms & Applications.
- Programming Environments & Systems Software
- Machine Learning, AI, & Quantum Computing
- Performance Modeling, Evaluation, & Analysis

SUBMISSION & REVIEW PROCESS
see: https://www.isc-hpc.com/submissions-bof-sessions-2023.html

TERMS & CONDITIONS
ISC 2023 is planned as an in-person conference from May 21 to May 25,
2023, in Hamburg, Germany. By submitting a BoF proposal, the submitter
agrees to host the BoF session at ISC 2023 on-site in Hamburg.
BoF presenters need to be registered ISC 2023 participants. They will
require at least an Exhibition Pass. The ISC organizers will provide
meeting room facilities and basic technical equipment for the BoF sessions.
Travel, accommodation, registration fees and other such costs will not
be covered by the ISC organizers.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, December 28, 2022

[DMANET] ICDT 2024 : Call for papers (first submission)

CALL FOR PAPERS

27th INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2024)
Paestum, Italy 25th-28th March 2024
For more info check https://dastlab.github.io/edbticdt2024/

*About ICDT*

ICDT is a series of international scientific conferences on research of
data management theory
(https://databasetheory.org/icdt-pages). Since 2009, it is annually
and jointly held with EDBT (Extending DB Technology). The 27th edition
of ICDT, in 2024, will take place in Paestum, Italy.

Topics of Interest

We welcome research papers on *every* topic related to the principles
and theory of data management, provided that there is a clear connection
to foundational aspects. This includes, for example, articles on
"classical" data management topics such as:

The design and study of data models and query languages
The development and analysis of algorithms for data management
The theoretical investigation of various aspects underlying data
management systems (indexes, concurrency, distributed computation,
privacy and security, ...)
but also includes papers exploring existing or identifying new
connections between data management and other areas, such as the areas of:

knowledge representation, semantic web
information retrieval and data mining
machine learning/AI
distributed computing
theoretical computer science.
In all of the above, a clear emphasis on foundational aspects is
expected. You may want to check https://dblp.org/db/conf/icdt/index.html
to get an overview of previous editions of ICDT. The Program Committee
reserves the right to desk reject a submission when it is regarded to be
out of scope.


*Important dates*

ICDT will have two submission cycles for 2024, with deadlines as follows:

ICDT Submission Cycle 1
=======================
Abstract deadline: March 20, 2023
Full Submission due: March 27, 2023
Notification: June 5, 2023

ICDT Submission Cycle 2
=======================
Abstract deadline: September 13, 2023
Full Submission due : September 20, 2023
Notification: November 29, 2023


* Program Committee *

Program Committee Chair:
Graham Cormode (University of Warwick)

Program Committee Members:

Mahmoud Abo Khamis (Relational.AI)
Antoine Amarilli (Telecom Paris)
Yael Amsterdamer (Bar Ilan University)
Pablo Barceló (PUC Chile)
Vladimir Braverman (Rice University)
Marco Calautti (Università degli Studi di Milano)
Hubie Chen (King's College London)
Cristina Feier (University of Warsaw)
Diego Figueira (Université de Bordeaux)
Dominik Freydenberger (Loughborough University)
Martin Grohe (RWTH Aachen University)
Daniel Kifer (Penn State University)
Benny Kimelfeld (Technion)
Paraschos Koutris (University of Wisconsin-Madison)
Stefan Mengel (CNRS)
Frank Neven (Hasselt University)
Matthias Niewerth (Bayreuth University)
Jeff M. Phillips (University of Utah)
Reinhard Pichler (TU Wien)
Cristian Riveros (PUC Chile)
Francesco Scarcello (Università della Calabria)
Markus Schmid (Humboldt-Universität)
Yufei Tao (CUHK)
Jef Wijsen (University of Mons)


*Submission Instructions*

All submissions will be electronic via EasyChair
at https://easychair.org/conferences/?conf=icdt2024

Papers must be written in English and provide sufficient detail to allow
the program committee to assess their merits. The results must be
unpublished and not submitted for publication elsewhere, including the
proceedings of other symposia or workshops.

Papers must be submitted as PDF documents, using the LIPIcs style
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors).
Papers must be at most 15 pages, excluding references. Additional
details may be included in a clearly marked appendix, which, however,
will be read at the discretion of the program committee (online
appendices are not allowed). Papers not conforming to these requirements
may be rejected without further consideration.

The proceedings will appear in the Leibniz International Proceedings in
Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees
that the proceedings will be available online and free of charge, while
the authors retain the rights over their work.

At least one author of each accepted paper is expected to register at
the conference and to present the paper.

**ANONYMOUS SUBMISSION**

For 2024, ICDT will adopt anonymous submission, in line with other
leading conferences in the database community such as SIGMOD and PODS.
The intent of anonymous submission is to ensure that the identity of the
authors is not presented to the reviewers during the review process.
Specifically, submitted papers should not list authors or affiliations,
and should not include acknowlegments to funding sources, or other
colleagues or collaborators. References to the authors' own prior work
should not be distinguished from other references. Where this is not
possible (for instance, when referring to a specific system to which the
authors have privileged access), anonymized citations are permissible.
For more background on the motivation for anonymous submissions, and the
mechanisms to achieve it, please consult [Snodgrass, 2007]
https://www2.cs.arizona.edu/~rts/pubs/TODS07.pdf

Simultaneously, we encouage authors to make their submissions available
to the community via pre-print services such as ArXiv and through talks.
We do require that work is not labeled as "under submission at ICDT"
or indicates that it is under review, but otherwise place no
restrictions on sharing results. This does not conflict with the
anonymous submission requirement.


*Awards*

An award will be given to the Best Paper. Also, an award will be given
to the Best Newcomer Paper written by newcomers to the field of database
theory. The latter award will preferentially be given to a paper written
only by students; in that case the award will be called Best
Student-Paper Award. The program committee reserves the following
rights: not to give any award; to split an award among several papers;
and to define the notion of a newcomer. Papers authored or co-authored
by program committee members are not eligible for any award.
**********************************************************
*
* 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] Open PhD student and Pos-Doc positions in AI/ML at Linköping University, Sweden

Dear all,
the Reasoning and Learning Lab at Linköping University, Sweden has
several open positions:

PhD students with a focus on dynamic multi-drone route planning (both
algorithmic and RL-based methods are interesting, as well as machine
learning to scale up exact algorithms to real-world sized problems).
This project is in collaboration with Ericsson Research in Brazil.
https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=20742&rmlang=UK
<https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=20742&rmlang=UK>

Postdocs with a focus on novel learning/reasoning methods to model and
improve chemical processes for paper and pulp industry, great
opportunity to develop new ML methods in collaboration with domain
experts with direct application in a major industry sector.
https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=20741&rmlang=UK
<https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=20741&rmlang=UK>

Outstanding applicants with other research interests are always welcome
to apply.

Deadline for submission: January 16, 2023

Feel free to share these opportunities with your networks!

Best regards,
Fredrik
**********************************************************
*
* 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 Paper - NCTCS Special Issue in Theoretical Computer Science

Call for Papers - Special Issue "China National Conference of Theoretical Computer Science" in Theoretical Computer Science

https://www.sciencedirect.com/journal/theoretical-computer-science/about/call-for-papers#china-national-conference-of-theoretical-computer-science


Important Dates

Submission Deadline: 31 January 2023
Expected Publication Date: 30 June 2023
-------------------------------------------------------------------

Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. Journal Theoretical Computer Science welcomes all papers introducing or studying mathematical, logic and formal concepts and methods, provided that their motivation is clearly drawn from the field of computing.

For this Special Issue, some papers are selected and invited from the 2022 China National Conference of Theoretical Computer Science (NCTCS 2022), while there will be also an open call for papers.

Topics of interest include, but are not limited to:

Algorithms and data structures
Algorithmic game theory
Approximation algorithms and online algorithms
Automata, languages, logic, and computability
Bioinformatics
Combinatorial optimization
Complexity theory
Computational algebra and computational geometry
Computational learning theory
Cryptography and algorithmic coding theory
Experimental algorithmic methodologies
Graph algorithms and theory
Large graph algorithms and social network analysis
Optimization algorithms in economic and operations research
Parallel and distributed computing and multicore algorithms
Parameterized algorithms
Quantum computing

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


Manuscript submission information:

Manuscript Preparation
Papers must contain original contributions and are not currently under review by a conference or a journal.
In addition, the manuscripts should be prepared in accordance with the journal standards.

Manuscript Submission
Manuscripts should be submitted online at: https://www.editorialmanager.com/tcs/default2.aspx
Authors must select article type "VSI:NCTCS2022" in Editorial Manager of the submission to be considered for this special issue.All manuscripts will be subjected to the peer review process.


If you have any questions, please email to the Guest Editor Dr. Xiaoming Sun at sunxiaoming@ict.ac.cn.

Best Wishes,

Jialin Zhang, zhangjialin@ict.ac.cn
Institute of Computing Technology, Chinese Academy of Sciences
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, December 27, 2022

[DMANET] CFP ICECCME 2023

Please accept our apologies if you have received multiple copies*


*3rd International Conference on Electrical, Computer, Communications and
Mechatronics Engineering (ICECCME 2023) *
*www.iceccme.com* <http://www.iceccme.com/>


*19-20 July 2023 *
*Tenerife, Canary Islands, SPAIN*

*If you don't want to receive these emails in the future, please *
*unsubscribe*
<http://www.ecer.org/mail/mail/unsubscribe?p=leticia.lemus@upc.edu>.

Dear colleague,

*The 3rd International Conference on Electrical, Computer, Communications
and Mechatronics Engineering (ICECCME 2023)* will take place in *Tenerife,
Canary Islands, SPAIN* on *19-20 July, 2023*. The conference will provide
an excellent international forum for dissemination of original research
results, new ideas and practical development experiences which concentrate
on both theory and practices of the academics, researchers, engineers and
also industry professionals.
*The first two editions were performed successfully in 2021 and 2022, in
Mauritius and in the Maldives, respectively. You can organize a special
session. If you can find 5 registered participants at least, you will not
pay the registration fee.*

*All accepted and presented papers will be submitted to IEEE Xplore for
publication. IEEE record number: **57830
<https://conferences.ieee.org/conferences_events/conferences/conferencedetails/57830>*

*The acceptance of the papers submitted to ICECCME'23 will be based on
quality, relevance and originality. The conference will be in hybrid mode.
There will be both physical, online and poster sessions.*

*Please visit the conference web page for more details:
**http://www.iceccme.com
<http://www.iceccme.com/>*

*Topics of interest for submission include, but are not limited to:*

*• Electrical Energy Generation, Transmission and Distribution • Renewable
Energy Systems • Solar Technology • Electrical Machines • Electrcial
Vehicles • Batteries • Power Electronics • Computer Vision • Artificial
Intelligence • Computer Networks • Cloud Computing • Big Data • Blookchain
and Informatics • Signal Modelling for Audio-Visual Communication • Machine
Learning • Telecommunication Systems • Data Mining • Digital Communication
Systems • Fiber-optic Communication • Mechatronics Engineering • Advanced
Manufacturing • Intelligent Control • Micro Mechatronics • Mathematical
Modelling • Mechatronics in Energy Systems • Fault Detection and Diagnosis
in Mechatronics Systems • IoT and sensor networks • Robotics and automation
• Engineering applications supporting the SDGs • Wireless Sensor Networks
• Unmanned Vehicles • High Voltage Engineering *
*Please feel free to circulate this message among your friends. We would
like to send our greetings and looking forward to seeing you in Tenerife,
Canary Islands, SPAIN.*

Paper Submission Due: *5 March 2023*
Acceptance Notification: *25 April 2023*
Early Bird Registration: *30 April 2023*
Camera Ready Submission: *15 May 2023*
Conference Dates: *19-20 July 2023*


*Best regards, Conference Organizing Team E-mail: **info@iceccme.com*
<info@iceccme.com>
* Phone(Whatsapp): +90 532 6425237*

**********************************************************
*
* 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] Stellenausschreibung Wiss. Mitarbeiter E13-TVL (m/w/d), BTU Cottbus-Senftenberg

Die Brandenburgische Technische Universität (BTU) Cottbus-Senftenberg ist eine Campusuniversität mit drei Standorten: Zentralcampus Cottbus, Campus Cottbus-Sachsendorf und Campus Senftenberg. An der BTU sind rund 7.000 Studenten eingeschrieben, welche von 180 Professoren und 629 akademischen Mitarbeitern unterwiesen werden. In der Fakultät 1 (Mathematik, Informatik, Physik, Elektro- und Informationstechnik) ist an der Professur für Ingenieurmathematik und Numerik der Optimierung zum nächstmöglichen Zeitpunkt eine Stelle für einen wissenschaftliche Mitarbeiter (m/w/d; Entgeltgruppe 13 TV-L) in Vollzeit (100%-Stelle) zu besetzen, befristet für die Dauer des Projekts (Jan. 2023 bis Dez. 2025). Die Beschäftigungsdauer richtet sich nach den Vorschriften des Wissenschaftszeitvertragsgesetzes.

Aufgabengebiet:
Zu den Aufgaben gehört die Mitarbeit in einem Verbund-Forschungsprojekt in der angewandten Mathematik, insbesondere mit Methoden der Discrete-Event Simulation.

Qualifikationserfordernisse:
- Hochschulabschluss (Diplom, Master) in der Fachrichtung Mathematik, Physik oder Informatik,
- Kenntnisse im Bereich der Discrete-Event-Simulation und Softwarepakete wie AnyLogic,
- Programmierkenntnisse (z.B. Python, Java, C/C++),
- gute Deutsch- und Englischkenntnisse,
- Interesse an einer Tätigkeit im Bereich der angewandten mathematischen Optimierung/Simulation,
- Fähigkeit zur Zusammenarbeit mit interdisziplinären Teams.

Wir bieten ein freundliches, offenes Arbeitsumfeld und eine exzellente Ausstattung in einem jungen Team. Die Möglichkeit zur wissenschaftlichen Qualifikation (Promotion bzw. Habilitation) ist gegeben. Nähere Informationen über die Universität finden Sie unter der Internetadresse http://www.b-tu.de

Weitere Auskünfte erteilt Ihnen Armin Fügenschuh (EMail: fuegenschuh@b-tu.de).

Bewerbungen mit den üblichen Unterlagen (Anschreiben, Lebenslauf, Zeugniskopien) senden Sie bitte elektronisch an Armin Fügenschuh per Email.

Prof. Dr. Armin Fügenschuh
Fachgebiet Ingenieurmathematik und Numerik der Optimierung
Fakultät 1 - MINT
Brandenburgische Technische Universität Cottbus - Senftenberg


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD and postdoc positions in the Algorithms & Complexity Section and the MIAO group in Copenhagen/Lund

Since it seems some of the announcements for the positions below might have disappeared along the way, here is a summary about the PhD and postdoc openings in the Algorithms & Complexity Section and the Mathematical Insights into Algorithms for Optimization (MIAO) group in Copenhagen and Lund:

- Postdoc positions in theoretical computer science in Copenhagen with deadline January 10: http://www.jakobnordstrom.se/openings/Postdoc-UCPH-230110.html
- PhD positions in theoretical computer science and/or combinatorial optimization in Copenhagen with deadline January 10: http://www.jakobnordstrom.se/openings/PhD-UCPH-230110.html
- PhD positions in theoretical computer science and/or combinatorial optimization in Lund with deadline January 12: http://www.jakobnordstrom.se/openings/PhD-Lund-230112.html
- Postdoc positions in combinatorial optimization in Copenhagen with deadline January 15: http://www.jakobnordstrom.se/openings/Postdoc-UCPH-230115.html

See the respective webpages for the full announcements with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jn@di.ku.dk.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, December 26, 2022

[DMANET] Postdoctoral Position in Market Design, Universidad de Chile

A postdoctoral position is available at the Universidad de Chile (Santiago), funded through the grant "Information and Computation in Market Design" (PIs Jose Correa, Adriana Piazza, Mario Bravo, Juan Escobar, and Victor Verdugo). The starting date is flexible, but ideally between June and October 2023. The selected candidate will fully devote to research and work with one or more of the PIs. While the position is at the Universidad de Chile, the selected candidate may spend (part of) their time at one of the associated institutions: Universidad de O'Higgins and Universidad Adolfo Ibanez.

The appointment will be for 12 months, renewable by mutual agreement, with a monthly salary of 1.900.000 CLP. Shorter periods may also be considered. Generous travel support is available, and in particular, the selected candidate may spend up to 4 months working abroad with one of the grant's International Researchers (Itai Ashlagi (Stanford), Federico Echenique (UC Berkeley), Paul Duetting (Google Research Zurich), Panayotis Mertikopoulos (CNRS/INRIA)).

Applicants must hold a recent PhD in Computer Science, Economics, Mathematics, Operations Research, or related fields. Applications, including curriculum vitae, list of publications, research plan (1 page), and names of references with their e-mail addresses, should be sent electronically to anilloicmd@gmail.com. To ensure full consideration, the application should be sent before the deadline of January 27th, 2023. Late applications will be considered on a case-by-case basis.

**********************************************************
*
* 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, December 24, 2022

[DMANET] A postdoc position at Computer Science Institute, Charles University, Prague

A one-year postdoc position (with a possibility of extension) is offered at
Computer Science Institute of Charles University (https://www.mff.cuni.cz/en/iuuk).
The starting date is negotiable (not earlier than July 1, 2023).

The position is funded by the project "Flows and cycles in graphs on surfaces"
(https://iuuk.mff.cuni.cz/~rakdver/index.php?which=fcs). The candidates are expected to
submit an independent research proposal in the scope of the project
(nowhere-zero flows and their applications in graph coloring, cycles in
embedded graphs in connection to the Cycle Double Cover conjecture, study of
their algebraic properties via the surface Tutte polynomial, ...)

The candidates must have a PhD degree in mathematics or theoretical computer
science completed within the last 4 years (with exceptions for individual
circumstances such as parental leave) or be expected to obtain the degree by
the starting date of the position.

Deadline for the applications: February 24, 2023.

Further information and applications at
https://www.mff.cuni.cz/en/faculty/job-opportunities/open-competition/scientific-postdoc-positions-at-the-school-of-computer-science-application-deadline-february-24-2023
Informal inquiries are welcome and may be sent to the principal investigator
Zdeněk Dvořák <rakdver@iuuk.mff.cuni.cz>.

**********************************************************
*
* 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, December 23, 2022

[DMANET] Full-time faculty positions - HEC Liege

HEC Liège Management School of the University of Liège invites applications for several full-time faculty positions in the field Business Analytics & Supply Chain Management, starting on September 1, 2023:

Full-time Academic Position: Business Analytics, see

https://www.hec.uliege.be/cms/c_9653833/en/hec-liege-academic-position-busin
ess-analytics-2023

Full-time Academic Position: Computational Methods in Management, see

https://www.hec.uliege.be/cms/c_9653834/en/hec-liege-academic-position-compu
tational-methods-in-mgt-2023

Full-time Academic Position: Digital Business, see

https://www.hec.uliege.be/cms/c_9653835/en/hec-liege-academic-position-digit
al-business-2023

Full-time Academic Position: Optimization Methods in Management, see

https://www.hec.uliege.be/cms/c_9653836/en/hec-liege-academic-position-optim
ization-methods-in-mgt-2023

The deadline for application is February 1, 2023.

The full list of vacancies and online application forms are available at
https://www.hec.uliege.be/cms/c_8475866/en/hec-hec-liege-is-hiring.

Since the positions are in related fields (operational research and
analytics), candidates who recognize themselves in more than one profile
should not hesitate to apply for all the positions in which they are
interested. Candidates can apply for several positions by completing only
one online application form.

Please kindly disseminate the information to qualified candidates.

Yasemin ARDA

Full Professor of Supply Chain Management

HEC Liège Management School of the University of Liège

rue Louvrex, 14, 4000 Liège, Belgium

https://www.hec.uliege.be
http://www.quantom.hec.ulg.ac.be

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, December 22, 2022

[DMANET] CFP: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)

Call for Papers

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)
May 31 – June 2, 2023
Seattle, Washington, U.S.
The Sheraton Grand Seattle

(This is the conference of the SIAM Activity Group on Applied & Computational Discrete Algorithms <https://www.siam.org/membership/activity-groups/detail/applied-and-computational-discrete-algorithms>.
This conference is co-located with SIAM Conference on Optimization (OP23) <https://www.siam.org/conferences/cm/conference/op23>.)

Registration and Short Abstract Submission Deadline: January 9, 2023
Paper/Presentation Submission Deadline: January 16, 2023
(see details below)
ACDA brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA expands the area of Combinatorial Scientific Computing to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications.
Included Themes  <>
Topics of interest include but are not limited to discrete or combinatorial problems and algorithms arising in:   <>
Algorithm engineering
Algorithmic differentiation (AD)
Combinatorial optimization and mathematical programming, including scheduling and resource allocation problems
Combinatorial scientific computing (CSC) including models, algorithms, applications, numerical methods, and problems arising in data analysis
Computational biology and bioinformatics
Data management and data science
Design and analysis of application-inspired exact, randomized, streaming, and approximation algorithms
Graph and hypergraph algorithms, including problems arising in network science and complex networks
Interaction between algorithms and modern computing platforms, including challenges arising from memory hierarchies, accelerators, and novel memory technologies
Machine learning and statistical methods for solving combinatorial problems
Numerical linear algebra, including sparse matrix computations and randomized approaches
Parallel and distributed computing, including algorithms, architectures, distributed systems, and all parallelism ranging from instruction-level and multi-core all the way to clouds and exascale
Other applications arising from security, computational finance, computational chemistry/physics, quantum computing, etc.


Types of Contributions

All contributions must be submitted electronically via the EasyChair submission system (https://easychair.org/conferences/?conf=acda23  <https://easychair.org/conferences/?conf=acda23>). There are three types of submissions to ACDA, as follows. We strongly encourage making code and data available as well.

Archival Proceedings Papers
Submissions may be up to 10 pages in length, excluding references, and must present original research that is not published or concurrently submitted to a journal or a proceedings-based conference. Submissions will be refereed. Accepted papers will be included in the proceedings published by SIAM.
Short Abstract Submission and Registration Deadline: January 9, 2023
Paper Submission for Archival Proceedings Deadline: January 16, 2023

Conference Presentations Without Archival Proceedings
Alternatively, authors can elect (at the time of submission) to have an accepted paper be considered for presentation at the conference without appearing in the conference proceedings. Furthermore, in this case, it is allowed for papers to be concurrently submitted to a journal or to another proceedings-based conference; however, these papers
should not yet have been published.
Short Abstract Submission and Registration Deadline: January 9, 2023
Paper Submission for Conference Presentations without Archival Proceedings Deadline: January 16, 2023
Author Notification: March 8, 2023

Poster Submissions
A poster submission is in the form of a 2-page (maximum) abstract. Posters are not considered archival, and reviewing of posters will not be double-blind. Poster presentations will not appear in the conference proceedings.
Poster Submission Deadline: March 8, 2023
Author Notification: March 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] 84th GI Workshop on Algorithms and Complexity (Theorietag) in Hamburg, Germany

Dear all,

the 84th GI Workshop on Algorithms and Complexity (Theorietag) will be held in Hamburg, Germany.

The Theorietag is a recurring event featured by the Fachgruppe Algorithmen and Fachgruppe Komplexität of the GI - Gesellschaft für Informatik.

The workshop is aimed at all those interested in research in the field of theoretical computer science. The focus is mainly on complexity, algorithms and data structures, as well as parallel and distributed algorithms. We welcome presentations by junior researchers (PhD students) and senior researchers on recent topics in algorithms and complexity. There are no formal proceedings, so both published and unpublished work can be presented, without interfering with any past or future publication. A declared goal of the workshop is to enable contact between young and senior scientists.

The workshop will be held on 6 March, 2023, so that gives a great opportunity to participate in the STACS conference right afterwards (https://www.conferences.uni-hamburg.de/event/272/page/153-home).

The workshop is jointly organized by the Institute for Algorithms and Complexity and the Research Group for Theoretical Computer Science at Hamburg University of Technology.

Participation is free of charge.

If you would like to attend, please register until 22 February 2023 via e-mail to

Julia Ehrenbrecht, algo(at)tuhh.de

Participants are invited to give a contributed talk. We plan to allot about 25 minutes for each talk including discussion. If you want to give a talk, please provide the title and abstract in your e-mail.

For further information regarding the programme, and for local information, please visit

https://www.tuhh.de/algo/gi-theorietag-2023

We hope to welcome you in Hamburg,

Matthias Mnich and Antoine Mottet

--
Prof. Dr. Matthias Mnich
TU Hamburg
Institute for Algorithms and Complexity
www.algo.tuhh.de

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD Position in discrete mathematics at Umeå University

The Department of Mathematics and Mathematical Statistics at Umea University (Sweden) is seeking a PhD student in the area of heuristics for the Traveling Salesman problem. The expected starting date is spring 2023, or by agreement.

Very good command of the English language, good writing skills and ability to work both independently and in a team are required.
Furthermore, The candidate should have a good knowledge in discrete mathematics and combinatorial optimization as well as good programming skills.

The full announcement, including all requiremnts and the details of how to apply, can be found at

https://umu.varbi.com/en/what:job/jobID:578580/

The closing date for applications is Februrary 7th.

For more information, please contact

Associate Professor Gerold Jaeger (gerold.jaeger@umu.se, +46-90-786 6141)


**********************************************************
*
* 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] DEADLINE EXTENSION - 7th AIROYoung Workshop, Milan, February 15-17, 2023

Dear all,


The deadline to submit an abstract to present at the 7th AIROYoung Workshop in Milan has been extended: the new date is December 30, 2022.

If you haven't done yet, hurry up to secure a spot!

-----

Call for Registration and Contributions to the

7th AIROYoung Workshop
"Operations Research Beyond Frontiers"

University of Milan
15th – 17th February 2023
https://ayw2023.di.unimi.it/<http://ayw2023.di.unimi.it/>


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

Contributions concerning emerging applications of OR to computer science and statistical data analysis are especially welcomed.

SUBMISSIONS – Deadline December 23rd, 2022December 30th, 2022

Submitted abstracts are limited to one-page length in pdf format.
A LaTeX template for preparing your abstract is available at the link: https://ayw2023.di.unimi.it/content/7AYW-abstract.tex.

The deadline for submission is December 30th, 2022.

The acceptance of the contribution will be notified to the author by email by January 9th, 2023. Please, send your contribution to ayw2023@di.unimi.it<mailto:ayw2023@di.unimi.it>with "Abstract submission AYWorkshop 7" as email subject and file named SURNAME_NAME_7AYW.

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

REGISTRATION
The participation to the 7th AIROYoung Workshop is free. Please use the form on the event website https://ayw2023.di.unimi.it/registration.phpto proceed with the registration. You will be asked to provide some general information, your desire to give a talk during the workshop, and your willingness to participate in social activities.

Participants who will present an accepted abstract must register no later than January 16th, 2023. Moreover, they are asked to send us a proof of travel booking by the same date.

Participants who will attend the workshop without giving any talk can register to the event until February 8th, 2023.


Note that there is a limited number of participants allowed on site. Priority will be given to participants presenting their accepted abstracts. The remaining places will be assigned according to a first-come first-served policy.

Confirmation will be notified by email.

PLENARY SPEAKERS

- Prof. Claudia D'Ambrosio, École Polytechnique de Paris, France

- Prof. Paolo Boldi, University of Milan, Italy

ACCOMODATION AND GRANTS

The AIROYoung mission is to involve everyone to its events, independently from their funds. For this reason, our events are free for everybody and we work hard to secure some money to help with accommodation as well. Thanks to the financial support offered by AIRO<http://www.airo.org/>and our sponsors, we are able to provide 9 GRANTSto cover accommodation expenses for the entire event.

Accommodation will be provided in double rooms at the HOTEL FLORA, VIA NAPO TORRIANI 23, 20124 – MILAN, with check-in February 15th and check-out February 18th.

Grants will be given on a first-come first-served basis to participants who have successfully completed the event registration and that are (or are willing to become) AIROYoung members. To become an AIROYoung member, please write to airo.young.researchers@gmail.com<mailto:airo.young.researchers@gmail.com>.

Recipients of grants must send us proofs of AIROYoung membership and travel booking no later than January 16th, 2023.

ABSTRACT EXTENSION (after the workshop)

Accepted abstracts will be published online on the workshop website but will not be directly included in the workshop proceedings.

Abstracts accepted for presentation can be extended after the workshop.

The extended abstracts cannot exceed the 12 pages, including title page and bibliography (appendices excluded). They will be considered for publication in the proceedings of the event on a volume of the AIROSpringer Series (Springer) after a peer-review process.

More details on the extended abstract submission (template, deadline, etc.) will be communicated afterwards.

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

https://ayw2023.di.unimi.it/

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

Instagram: airoyoung<https://www.instagram.com/airoyoung/>
Twitter: AIROyoung<https://twitter.com/AIROyoung>


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

The Organizing Committee:

Michele Barbato
Alberto Boggio Tomasaz
Daniel Dissegna
Rosario Messana

Cristina Ondei

Marco Premoli

**********************************************************
*
* 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-Day Workshop Combinatorics in Digital Communication -- Registration Open

Dear Colleagues,

Registration is now open for the workshop Combinatorics in Digital Communication, see full description below.

We are organizing a 3-day workshop on combinatorics in digital communication.
The workshop will take place from April 19 to April 21, 2023, at Eindhoven University of Technology, The Netherlands. For more details see:
https://sites.google.com/view/workshop4tu/home

The goal of the workshop is to bring together researchers working on the interplay between digital communication and discrete mathematics.
The event is funded by the Netherlands Institute for Research on ICT (https://www.4tu.nl/nirict/) and is explicitly designed to foster collaborations between different fields.

We are very happy to have the following confirmed plenary speakers:

- John Bamberg, University of Western Australia (Australia)
- David Conlon, California Institute of Technology (U.S.A.)
- Ragnar Freij-Hollanti, Aalto University (Finland)
- Emina Soljanin, Rutgers University (U.S.A.)
- Andrea Švob, University of Rijeka (Croatia)
- Barbara Terhal, Delft University of Technology (The Netherlands)
- Frank Vallentin, University of Cologne (Germany)
- Zsuzsa Weiner, Eötvös Loránd University (Hungary)
- Eitan Yaakobi, Israel Institute of Technology (Israel)

There is an opportunity to submit contributed talks, as well as for PhD students to apply for travel grants. Please see the website for more details.

On behalf of the organizers,
Aida Abiad (Eindhoven University of Technology)
Anurag Bishnoi (Delft University of Technology)
Anina Gruica (Eindhoven University of Technology)
Relinde Jurrius (Netherlands Defence Academy)
Alberto Ravagnani (Eindhoven University of Technology)
Jos Weber (Delft University of Technology)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, December 21, 2022

[DMANET] Lecturer Position at HKUST, preferably with ICPC coaching experience

The Department of Computer Science and Engineering (CSE) at the Hong Kong
University of Science and Technology (HKUST) invites applications for a
Lecturer II position in the area of computer science commencing Summer/Fall
2023. The appointee will play an important role in the development and
teaching of computer science courses at undergraduate level.

See https://cse.hkust.edu.hk/admin/recruitment/lecturer/ for more details.

Past programming contest coaching experience is not compulsory but is a
plus. The appointee is also expected to participate in service-related
matters (e.g. interviewing student applicants, academic counseling and
student-related and outreach activity organization). Candidates should have
a PhD degree in computer science from a reputable university, and
preferably with demonstrated capacity for excellent teaching at tertiary
level.

**********************************************************
*
* 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 Presentations: Highlights of Logic, Games and Automata 2023

CALL FOR PRESENTATIONS HIGHLIGHTS OF LOGIC, GAMES, AND AUTOMATA

*HIGHLIGHTS'23* will happen *from July 24th to July 28th 2023*, at the
Campus Center of the University of *Kassel, Germany*. HIGHLIGHTS'23 will be
preceded by the *Highlights' Collaborative Research Week (HCRW), from 17h
to 21st*, at the Faculty of Electrical Engineering and Computer Science of
the University of Kassel.

*HIGHLIGHTS'23* key features and novelties:

- Highlights is a conference without publication, where speakers give
short presentations of their best work.
- The 2023 program chair is Supratik Chakraborty.
- The 2023 organisation chair is Stefan Göller.
- *(new)* The conference is now five days, tutorials included.
- *(new)* An early round of submissions is organised to help the
planning of travels.
- *(new)* The *Highlights' Collaborative Research Week* (*HCRW*) is a
new meeting, the week before the conference (from July 17th to July 21st),
devoted to research collaborations between highlights' participants.
*HCRW* happens the week after ICALP'23 in Paderborn, for encouraging
direct commutation.
- The *Highlights Extended Stay Support Scheme* (*HESSS*) helps
organising and funding collaborations in the area.

*HIGHLIGHTS'23* is the eleventh of the series of international conferences
"Highlights of Logic, Games and Automata", aiming at integrating the
community working in algorithmic model theory, automata theory, databases,
games for logic and verification, logic, and verification. Papers from
these areas are dispersed across many conferences, which makes them
difficult to follow. A visit to the Highlights conference should offer a
wide picture of the latest research in the field and a chance to meet
everybody in the community, not just those who happen to publish in one
particular proceedings volume. There are no publications.

We encourage you to attend and present your best work, be it already
published or not, at *HIGHLIGHTS'23*.
IMPORTANT DATES AND INFORMATION

- Main conference website: https://highlights-conference.org/2023/
- *HCRW* page: https://highlights-conference.org/2023/hcrw
- *HESSS* page: https://highlights-conference.org/2023/hesss
- Submission page: https://cmt3.research.microsoft.com/Highlights2023
- Registration page: TBA
- Early submission deadline: February 17
- Early notification: February 28
- Submission deadline: April 25
- Notification: May 5
- Early registration: TBA
- *Highlights' Collaborative Research Weak* (*HCRW*): July 17 - July 21,
2023.
- Conference: July 24 - July 28, 2023 (Tutorial day the 24th).

INVITED TALKS AND TUTORIALS Tutorials:

- Bernd Finkbeiner (Saarland Univ and CISPA, Germany)
- Edouard Bonnet (ENS Lyon, France)

Invited talks:

- Udi Boker (Reichman Univ, Israel)
- Véronique Bruyère (Univ of Mons, Belgium)
- Sophie Pinchinat (IRISA, France)
- Sven Schewe (Univ of Liverpool, UK)

MODALITIES OF ATTENDANCE

*HIGHLIGHTS'23* is an event that will take place on-site (barring
unforeseen circumstances), and the preferred form of participation is in
person. Remote attendance via a video stream will also be offered, but with
limited possible interactions for these participants.

Before coming from far away, please review how your trip and international
flights are contributing to climate change. We encourage you to take the
train as much as possible, possibly taking the opportunity for visiting
colleagues on the way and thus decomposing the travel into smaller pieces.

More generally, we encourage you to make the most of your stay. This means
extending your journey to the previous and/or following weeks for more
scientific activities in Kassel and around. Several initiatives are here to
help you in this task:

- You can participate in the *Highlights' Collaborative Research
Week* (*HCRW,
July 17-21*, the week before Highlights, in Kassel). We especially
encourage you to come to the *HCRW* if you attend ICALP'2023
<https://icalp2023.cs.upb.de/>, which happens just before the *HCRW*, in
Paderborn.
- You can attend ICALP'2023 <https://icalp2023.cs.upb.de/> (July 10-14,
in Paderborn)
- You can attend CAV'2023 <http://www.i-cav.org/2023/> (July 17-22, in
Paris)
- You can use the *Highlights Extended Stay Support Scheme* (*HESSS*)
for finding collaborators and organising visits.


- *HCRW* page: https://highlights-conference.org/2023/hcrw
- *HESSS* page: https://highlights-conference.org/2023/hesss

[EARLY] SUBMISSIONS AND GUIDELINES

Submissions should take the form of a short abstract describing the content
of the presentation and its interest. It should serve as a proposal for a
presentation. Hence, submissions should have a single author — the speaker.
They can concern any recently published, to be published, or ongoing work
of the speaker. We expect you to present your favourite result of the year,
so there should be at most one submission per speaker. The abstract should
list co-authors, if any. Optionally, an extended abstract of up to two
pages may be attached as a PDF file.

We encourage both young and senior researchers to present.

The *first early round of submissions is open until February 17*. By
submitting before this first deadline, you will profit from an *early
notification by February 28* which may help you in organising your journey.
Other presentations are to be submitted by April 25th, with a notification
May 5th.

Submissions will not lead to publications. There are no formal proceedings
and we encourage the presentation of work published or presented elsewhere.

The talk (which is short, around 10 minutes) can be doubled with a poster.
In this case, it has to be sent more than one week before the event, and
will be printed by the organisation team.

*Submission page:* https://cmt3.research.microsoft.com/Highlights2023
HIGHLIGHTS' COLLABORATIVE RESEARCH WEEK (HCRW)

*HIGHLIGHTS'23* also organises an extra week, the *Highlights'
Collaborative Research Week* (*HCRW*), *from July 17th to July 21st, at the
University of Kassel*.

Participants to Highlights can register to this week, and are then free to
organise any scientific activities. It is up to you to decide what this
week should be. Possibilities can be to

- meet someone in particular,
- organise or attend a seminar/workshop/reading group,
- gather for solving open problems.

Highlights' organisation is offering the opportunity, the working space and
support at the university, and some web-tools for the scientific
organisation.

We encourage participants to propose activities in advance. Please contact
the program chair (Supratik Chakraborty) and the organisation chair (Stefan
Göller) to communicate your proposals.

- *HCRW* webpage: https://highlights-conference.org/2023/hcrw
- Offering activities: Contact Supratik Chakraborty and Stefan Göller
- Registration to *HCRW* is done together with Highlights.

HIGHLIGHTS EXTENDED STAY SUPPORT SCHEME

The *HESSS* is an incentive for collaborations between participants to the
conference and researchers working in research units reachable by train
from the conference locations. The objective is to foster interactions with
low carbon footprint. The mechanism is as follows:

- Research units wanting to participate in the scheme are listed on the
webpage: https://highlights-conference.org/2023/hcrw. These units are
willing to fund collaborations between Highlights' participants and their
members.
- The pair of a Highlights' participant and a member of one of a listed
research unit submit a proposal which takes the form of a mail containing
names, period of collaboration, and a sentence describing the activity
planned. It has to be sent to the *HESSS* contact person of the research
unit.
- The decision of acceptation is up to the research unit. It may be in
particular subject to scientific scope, number or requests, or, eg,
favouring distant participants.
- The only strict rule is that the visit should be around the moment of
Highlights, and no plane should be taken by the visitor between Highlights
and the visit.
- Research units interested in participating in the program should
contact Thomas Colcombet.

SCOPE

Representative areas include, but are not restricted to:

- Algorithmic model theory
- Automata theory
- Databases
- Games for logic and verification
- Logic
- Verification

COMMITTEES PROGRAM COMMITTEE

- S. Akshay (India)
- Suguman Bansal (USA)
- Nathalie Bertrand (France)
- Supratik Chakraborty (India) (Chair)
- Krishnendu Chatterjee (Austria)
- Javier Esparza (Germany)
- Sandra Keifer (Germany)
- Anotonina Kolokolova (Canada)
- Orna Kupferman (Israel)
- Annabelle McIver (Australia)
- Madhusudan Parthasarathy (USA)
- Joanna Ochremiak (France)
- Daniela Petrisan (France)
- Michał Pilipczuk (Poland)
- Nir Piterman (Sweden)
- Jean-François Raskin (Belgium)

ORGANISING COMMITTEE

- Stefan Göller (chair)
- Alina Kappes
- Klaus Wich
- Matthias Wolf
- Katja Wuchterl

SAFETOC COUNSELOR

- Sylke Ernst

STEERING COMMITTEE

- León Bohn (webmaster)
- Antonio Casares (publicity chair)
- Thomas Colcombet (chair)
- Sławek Lasota
- Luc Segoufin
- Sophie Tison

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, December 20, 2022

[DMANET] Ph.D. program at ESD pillar, Singapore University of Technology and Design

The Engineering Systems and Design Pillar at the Singapore University of
Technology and Design <https://www.sutd.edu.sg/> (SUTD) invites
applications to its Ph.D. program for the year 2023. SUTD is the fourth
autonomous and public university in Singapore, founded in 2009 in
collaboration with MIT to create a leading university in design,
engineering, technology, and architecture. The ESD Ph.D. program aims to
produce the next generation of leading engineering systems researchers and
thinkers.

The ESD faculty members <https://esd.sutd.edu.sg/people/faculty/> specialize
in the theory and practice of data-driven decision making using analytical
tools from optimization, statistics, stochastic modeling, game theory,
economics, artificial intelligence and machine learning. Candidates
interested in these topics are encouraged to apply. Successful applicants
will have the opportunity to work on important applications including
manufacturing
and service operations, transportation and logistics, environment and
sustainability, risk management, energy systems, telecommunication
systems, financial systems, healthcare, social networks, and, supply
chains. Applications can be submitted using the following link:
https://www.sutd.edu.sg/Admissions/Graduate/PhD-Programmes/SUTD-PhD-Programme/Application

There are numerous available funding opportunities
<https://www.sutd.edu.sg/Admissions/Graduate/Scholarships>. For
international students, the Singapore International Graduate Award (SINGA)
offers competitive support for up to 4 years of studies. Interested
candidates need to apply separately for SINGA. Application Deadline is 1st
of June 2023 for January 2024 intake. More details about the SINGA
scholarship and how to apply can be found at:
https://www.a-star.edu.sg/Scholarships/for-graduate-studies/singapore-international-graduate-award-singa
. For Singapore Citizens and Permanent Residents, the EDB-IPP initiative
provides an opportunity to work for a Company while pursuing a PhD. Details
can be found at:
https://sutd.edu.sg/Admissions/Graduate/Industrial-Programmes/EDB-IPP.

For further questions, please contact Mr. Chen Sin Chee at
sinchee_chen@sutd.edu.sg or relevant faculty members.

**********************************************************
*
* 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] ICALP 2023 second CFP

========================================================
ICALP 2023 - Second Call for Papers
========================================================

The 50th EATCS International Colloquium on Automata, Languages, and Programming
(ICALP) will take place in:

Paderborn, Germany, on 10-14 July 2023.

ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). As usual, ICALP will
be preceded by a series of workshops, which will take place on July 10.

The 2023 edition has the following features:
- Submissions are anonymous, and there is a rebuttal phase.
- The conference is planned as a physical, in-person event.
- This will be the 50th ICALP conference and some special events are planned.

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

Submissions: February 11, 2023 at 11am CET
Rebuttal: March 22-25, 2023
Author notification: April 21, 2023
Camera-ready version: May 5, 2023
Early registration: TBA
Conference: July 10-14, 2023 (Workshops on July 10, 2023)

Deadlines are firm; late submissions will not be considered.

Conference website: https://icalp2023.cs.upb.de/ [https://icalp2023.cs.upb.de/]
Twitter: @ICALPconf
Submission (tracks A and B): https://easychair.org/conferences/?conf=icalp2023 [https://easychair.org/conferences/?conf=icalp2023]

========================================================
Invited Speakers
========================================================

Anna Karlin - University of Washington, USA
Rasmus Kyng - ETH Zurich, Switzerland
Rupak Majumdar - Max Planck Institute for Software Systems, Germany
Thomas Vidick - California Institute of Technology, USA, and Weizmann Institute
of Science, Israel
James Worrell - University of Oxford, UK

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

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

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

3) Submissions are anonymous. The conference will employ a fairly lightweight
double-blind reviewing process.
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 are 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 double-blind process is to help PC members and external
reviewers come to an initial judgment
about the paper without bias, and not to make it impossible for them to
discover who the authors are if they were
to try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing
the paper more difficult. In particular, important references should not be
omitted or anonymized. In addition,
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.

4) The submissions are done via Easychair to the appropriate track of the
conference (see topics below). The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate
significantly from the required format risk
rejection without consideration of merit.

5) During the rebuttal phase, authors will have from March 22-25 to view and
respond to initial reviews. Further
instructions will be sent to authors of submitted papers before that time.

6) At least one author of each accepted paper is required to register for the
conference, and all talks are
in-person. In exceptional cases, there may be support for remotely presenting a
talk.

7) Papers authored only by students should be marked as such upon submission in
order to be eligible for the best
student paper awards of the track.


========================================================
Awards
========================================================

During the conference, the following awards will be given:
– the EATCS award,
- the Church prize,
– the Presburger award,
– the EATCS distinguished dissertation award,
– the best papers for Track A and Track B,
– the best student papers for Track A and Track B (see submission guidelines).

========================================================
Proceedings
========================================================

ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is
a series of high-quality conference proceedings across all fields in
informatics established in cooperation with
Schloss Dagstuhl – Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of
Open Access, i.e., they are available online and free of charge.

========================================================
Topics
========================================================

Papers presenting original research on all aspects of theoretical computer
science are sought. Typical but not
exclusive topics of interest are:

Track A: Algorithms, Complexity and Games
-----------------------------------------------------------

Algorithmic and Complexity Aspects of Network Economics
Algorithmic Aspects of Biological and Physical Systems
Algorithmic Aspects of Networks and Networking
Algorithmic Aspects of Security and Privacy
Algorithmic Game Theory and Mechanism Design
Approximation and Online Algorithms
Combinatorial Optimization
Combinatorics in Computer Science
Computational Complexity
Computational Geometry
Computational Learning Theory
Cryptography
Data Structures
Design and Analysis of Algorithms
Distributed and Mobile Computing
Foundations of Machine Learning
Graph Mining and Network Analysis
Parallel and External Memory Computing
Parameterized Complexity
Quantum Computing
Randomness in Computation
Sublinear Time and Streaming Algorithms
Theoretical Foundations of Algorithmic Fairness

Track B: Automata, Logic, Semantics, and Theory of Programming
----------------------------------------------------------------------------------------

Algebraic and Categorical Models of Computation
Automata, Logic, and Games
Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
Formal and Logical Aspects of Learning
Formal and Logical Aspects of Security and Privacy
Logic in Computer Science and Theorem Proving
Models of Computation: Complexity and Computability
Models of Concurrent, Distributed, and Mobile Systems
Models of Reactive, Hybrid, and Stochastic Systems
Principles and Semantics of Programming Languages
Program Analysis, Verification, and Synthesis
Type Systems and Typed Calculi

========================================================
ICALP 2023 Programme Committee
========================================================

Track A: Algorithms, Complexity and Games

Amir Abboud (Weizmann Institute, Israel)
Mikkel Abrahamsen (University of Copenhagen, Denmark)
Sepehr Assadi (Rutgers University, USA)
Aditya Bhaskara (University of Utah, USA)
Arnab Bhattacharyya (National University of Singapore, Singapore)
Greg Bodwin (University of Michigan, USA)
Karl Bringmann (Saarland University, Germany)
Clément Canonne (University of Sydney, Australia)
Vincent Cohen Addad (Google Research, Zurich)
Amin Coja Oghlan (TU Dortmund, Germany)
Michael (Mike) Dinitz (Johns Hopkins University, USA)
Uriel Feige (Chair) (Weizmann Institute and MSR, Israel)
Moran Feldman (University of Haifa, Israel)
Sebastian Forster (University of Salzburg, Austria)
Sumegha Garg (Harvard University, USA)
Parikshit Gopalan (Apple, USA)
Russell Impagliazzo (University of California, San Diego, USA)
Karthik C.S.(Rutgers University, USA)
Yin Tat Lee (University of Washington, USA)
Stefano Leonardi (Sapienza Universita di Roma, Italy)
Sepideh Mahabadi (MSR Redmond, USA)
Giulio Malavolta (Max Planck Institute for Security and Privacy, Germany)
Jesper Nederlof (Utrecht University, Netherlands)
Vianney Perchet (Ensae and Criteo AI Lab, France)
Will Perkins (Georgia Institute of Technology, USA)
Marcin Pilipczuk (University of Warsaw, Poland, and IT University of
Copenhagen, Denmark)
Aviad Rubinstein (Stanford University, USA)
Barna Saha (University of California San Diego, USA)
Rahul Santhanam (University of Oxford, UK)
Thatchaphol Saranurak (University of Michigan, USA)
Igor Shinkar (Simon Fraser University, Canada)
Mohit Singh (Georgia Institute of Technology, USA)
David Steurer (ETH Zurich, Swizerland)
Ola Svensson (EPFL, Switzerland)
Inbal Talgam-Cohen (Technion, Israel)
Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai, India)
Vera Traub (University of Bonn, Germany)
Salil Vadhan (Harvard University, USA)
David Wajc (Google Research, USA)
Henry Yuen (Columbia University, USA)
Meirav Zehavi (Ben-Gurion University, Israel)

Track B: Automata, Logic, Semantics, and Theory of Programming

Shaull Almagor (Technion, Israel)
Albert Atserias (Universitat Politecnica de Catalunya, Barcelona, Spain)
Christel Baier (TU Dresden, Germany)
Véronique Bruyère (University of Mons, Belgium)
Thomas Colcombet (IRIF / CNRS / Université Paris Cité, France)
Andrei Bulatov (Simon Fraser University, Canada)
Wojciech Czerwiński (University of Warsaw, Poland)
Kousha Etessami (Chair) (University of Edinburgh, UK)
John Fearnley (University of Liverpool, UK)
Dana Fisman (Ben-Gurion University, Israel)
Rob van Glabbeek (University of New South Wales, Australia)
Chris Heunen (University of Edinburgh, UK)
Justin Hsu (Cornell University, USA)
Stefan Kiefer (University of Oxford, UK)
Kohei Kishida (University of Illinois Urbana-Champaign, USA)
Jan Kretinsky (Technical University of Munich, Germany)
Karoliina Lehtinen (CNRS, Université Aix Marseille et Université de Toulon,
LIS, France)
Anthony Widjaja Lin (TU Kaiserslautern & MPI-SWS, Germany)
Wim Martens (University of Bayreuth, Germany)
Joanna Ochremiak (CNRS, University of Bordeaux, France and University of
Warsaw, Poland)
Daniela Petrisan (Université Paris Cité, IRIF, France)
Sam Staton (University of Oxford, UK)
Ashutosh Trivedi (University of Colorado - Boulder, USA)
Takeshi Tsukada (Chiba University, Japan)
Mahesh Viswanathan (University of Illinois Urbana-Champaign, USA)

========================================================
ICALP 2023 Workshop Chair
========================================================

Track A and B: Matthias Fischer

Selection Committee:

Johannes Blömer
Christian Scheideler
Friedhelm Meyer auf der Heide

See more details on the Call for Workshops webpage:
https://icalp2023.cs.upb.de/workshops/ [https://icalp2023.cs.upb.de/workshops/]

========================================================
ICALP 2023 Proceedings Chair
========================================================

Gabriele Puppis (University of Udine, Italy)

========================================================
ICALP 2023 Organizing Committee
========================================================

Ulrich Ahlers
Bernard Bauer
Johannes Blömer
Tanja Bürger
Nadija Carter
Fabian Eidens
Rainer Feldmann
Matthias Fischer
Sevag Gharibian (Chair)
Marion Hucke
Claudia Jahn
Friedhelm Meyer auf der Heide
Franziska Reichelt
Petra Schäfermeyer
Christian Scheideler
Ulf-Peter Schroeder
Christian Soltenborn
Anna Steinig
Thomas Thissen
Heinz Georg Wassing


**********************************************************
*
* 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] Postdoctoral position at the Czech Technical University in Prague

A one-year full-time postdoc position (with probable extension) is available in
the G2OAT research group at the Czech Technical University in Prague (CTU),
Czech Republic with a preferred starting date of April 2023 (slightly
negotiable). The research interests of the group range from graph algorithms,
through classical and parameterized complexity and integer linear programming
to combinatorial games.
The prospective mentor for the position is Tomáš Valla. The main topic for the
project is in the algorithmic and combinatorial game theory, with extension to
related fields like approximation algorithms or parameterized complexity.

The research group Graphs, Games, Optimization, Algorithms, and Theoretical
Computer Science (G2OAT) is a part of the Department of Theoretical Computer
Science at the Faculty of Information Technology at CTU. The department also
includes Stringology and Arborology research groups. The G2OAT research group
is rather small, comprising 2 associate professors, 3 assistant professors, 3
postdocs, and 3 Ph.D. students. A successful candidate will work at CTU's main
campus which features a range of amenities such as the National Technical
Library, and a laid-back atmosphere with cafes and other social hangout places.

The successful candidate will get a monthly salary of 65 thousand CZK (about
2650 EUR) (the Czech Republic's cost of living is at 66% of the US price level
according to the OECD statistics). There are no teaching duties associated with this
position. The position is institutionally funded, i.e., funded by the Czech
Technical University in Prague.

We are seeking highly motivated individuals holding a Ph.D. in computer
science, discrete mathematics, or related areas.
The applicants are expected to have a strong background in combinatorics, graph
theory, foundations of algorithmic game theory or combinatorial game theory.
Additionally, specialization in the following areas is a bonus: graph
algorithms, cops-and-robber-type problems, computational complexity or
approximation algorithms, Ramsey theory and positional games. The candidate's
high scientific potential should be witnessed by publications in the area of
algorithms or discrete math in impacted journals and in proceedings of highly
ranked international conferences.

The successful candidate must:

* Be a researcher who has received a Ph.D. or its equivalent within the last 7 years
* have a strong publication record (with at least two publications in a journal
with IF), and
* be fluent in English (both written and spoken), prior knowledge of Czech is
not required.

The closing date is January 9, 2023.
The preliminary communication and informal inquiries should be sent to tomas.valla@fit.cvut.cz.
The final submission should be done according to the instructions at
https://fit.cvut.cz/en/life-at-fit/fit-live/news/18972-available-postdoc-positions-at-fit
However, it is strongly recommended that the applicant sends at least the CV
and motivation letter in advance before the deadline to the address tomas.valla@fit.cvut.cz,
where the interested candidate is also encouraged to make informal inquiries.
Also, if you are interested and you cannot meet this deadline, don't hesitate to
contact us at the mentioned address: there will be another call during spring.

**********************************************************
*
* 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 in theory of nature-inspired algorithms at Technical University of Denmark

The section for Algorithms, Logic and Graphs at DTU Compute, Technical
University of Denmark, has an open position as postdoctoral researcher
starting from May 1, 2023, financed by the Independent Research Fund
Denmark. The scope of the project is within the theory of
nature-inspired algorithms and aims at deriving results on the running
time complexity and optimal parameter settings for evolutionary
computation, with a focus on estimation-of-distribution algorithms.
Candidates must have a PhD degree in computer science, applied
mathematics or related academic qualifications. Preference will be given
to candidates who can document a strong background in the theory of
randomized algorithms or of nature-inspired algorithms.

Further information can be obtained from Carsten Witt (cawi@dtu.dk).

Submit your application by Jan. 20, 2023 on
https://efzu.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/1240/?utm_medium=jobshare
**********************************************************
*
* 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] EASSS23: First Call for Tutorials

We invite tutorial proposals for the 23rd European Agent Systems
Summer School, which will be held at the Faculty of Information
Technology of Czech Technical University in Prague the Czech Republic
from July 17th to 21st, 2023. The EASSS 2023 is organized under the
auspices of EURAMAS, the European Association for Multi-Agent Systems.

Important Dates
---------------------
Deadline for tutorial proposals February 28, 2023
Notification of acceptance March 12, 2023
Teaching materials July 02, 2023
Summer School July 17 - 21, 2023

For more information, please see
https://easss23.fit.cvut.cz/call-for-tutorials.html
**********************************************************
*
* 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/
*
**********************************************************