Thursday, November 24, 2022

[DMANET] One PostDoc position (40 hours/week) at JKU Linz, Austria

One 1-year PostDoc position (40 hours/week, all genders welcome) within
the project "MOSOPT - Solving Multi-Objective Facility Layout Problems
via Semidefinite Optimization" is available at the Institute of
Production and Logistics Management at the Johannes Kepler University
Linz, Austria.

The project concerns the development of solution methods for
combinatorial multi-objective programs with semidefinite programming
(SDP) relaxations. It is funded by the Linz Institute of Technology
(LIT). The earliest possible starting date is January 1, 2023. The gross
salary is 4,061.50 per month (14 times a year). Participation and
presentations at scientific conferences are expected and will be funded.

Candidates interested the above position should have
* a PhD in Mathematics, Operations Research, Computer Science or a
related field
* programming skills (e.g., C++, Python, MATLAB, Julia, ...)
* experience in the implementation of (optimization) algorithms
* profound knowledge in one or more of the following fields:
semidefinite programming, multi-objective programming, mixed-integer
programming, combinatorial optimization
* a strong interest in all areas of the research project
Applications from excellent candidates from other fields within discrete
mathematics are also very welcome.

If you are interested in working in a young international research team
at one of the nicest campus universities in Austria, please send the
following documents
* motivation letter (including the date of finishing the PhD and the
title of the PhD thesis)
* detailed CV
* certificates
* list of bachelor, master and PhD courses and grades
* PhD thesis (if in another language than English, an abstract in
English with at most three pages)
to elisabeth.gaar@jku.at with the subject "Application MOSOPT", until
December 14, 2022. In addition a confidential letter of reference by a
professor should be sent directly by the professor to
elisabeth.gaar@jku.at until December 14, 2022. For further information
please contact Elisabeth Gaar (elisabeth.gaar@jku.at).

The Johannes Kepler University wishes to increase the proportion of
academic female faculty and, for this reason, especially welcomes
applications by qualified women. If applicants are equally qualified, a
woman will be given preference for this position. The university
welcomes applications from qualified applicants with physical
disabilities. These applications will be given special consideration.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Lecturer Positions at University of Leeds

The School of Computing at the University of Leeds invites applications for a number of Lecturer posts.
We are seeking candidates whose research aligns with one or more of our existing research themes, and would particularly welcome applications from candidates with research interests in Algorithms and Complexity.

Closing date: 9 January, 2023

For further details please see:

https://jobs.leeds.ac.uk/vacancy.aspx?ref=EPSCP1116


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

Wednesday, November 23, 2022

[DMANET] ECOPRO online workshop "Developments in Combinatorics" Nov 28-29

Dear Colleagues,

Join us on our online workshop on Monday and Tuesday Nov 28-29! Look
forward to seeing many of you there. More information can be found at:
https://www.ibs.re.kr/ecopro/online-workshop-developments-in-combinatorics/

- *Zoom: 346 934 4087, password: 202209*

Time in KoreaNov 28 MondayNov 29 Tuesday
15:30-16:10 Jie Han Chong Shangguan
16:10-16:50 Joonkyung Lee Zdeněk Dvořák
16:50-17:30 Lior Gishboliner Andrzej Grzesik
17:40-18:20 Alex Scott Imre Leader
18:20-19:00 Dongyeap Kang Jozef Skokan

*Jie Han, H-factors in graphs with sublinear independence number*

*Joonkyung Lee, Extended commonality of paths and cycles via Schur
convexity*

*Lior Gishboliner, Polynomial removal lemmas*

*Alex Scott, Invertibility of digraphs and tournaments*

*Dongyeap Kang, Thresholds for Latin squares and Steiner triple systems:
Bounds within a logarithmi**c factor*

*Chong Shangguan, Some problems in extremal set theory*

*Zdeněk Dvořák, On density of Z_3-flow-critical graphs*

*Andrzej Grzesik, Maximizing cycles of a given length in oriented graphs*

*Imre Leader, Euclidean Ramsey Theory*

*Jozef Skokan, Graphs with large minimum degree and no small odd cycles are
three-colourable*


Best,
Hong Liu
IBS ECOPRO

**********************************************************
*
* 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] Reminder: DEON Seminar Series Autumn Edition: Marija Slavkovik – Nov 24

The Society of Deontic Logic and Normative Systems (DEON) has launched a
seasonal online seminar series designed to promote interdisciplinary
cooperation amongst scholars interested in linking the formal-logical study
of normative concepts, normative language, and normative systems with
computer science, artificial intelligence, linguistics, philosophy,
organization theory, and law. We view the seminar series as an opportunity
to keep in touch with the DEON community and listen in or contribute to
presentations and informal discussions on ongoing work. Everyone who is
interested in this wonderful area and its questions is welcome.

We are happy to announce that our speaker for the DEON autumn seminar will
be

Marija Slavkovik
(University of Bergen)

Finding Common Ground for Incoherent Horn Expressions

Autonomous systems that operate in a shared environment with people need to
be able to follow the rules of the society they occupy. While laws are
unique for one society, different people and institutions may use different
rules to guide their conduct. We study the problem of reaching a common
ground among possibly incoherent rules of conduct. We formally define a
notion of common ground and discuss the main properties of this notion.
Then, we identify three sufficient conditions on the class of Horn
expressions for which common grounds are guaranteed to exist. We provide a
polynomial time algorithm that computes common grounds, under these
conditions. We also show that if any of the three conditions is removed
then common grounds for the resulting (larger) class may not exist.

Date and time: November 24, 2pm – 3:30pm CET

Zoom data:
https://umd.zoom.us/j/89287004976
Meeting ID: 892 8700 4976

Virtual gathering: join us for a virtual gathering on wonder.me after the
talk! No registration is needed, just follow this link:
https://www.wonder.me/r?id=3536c0e5-c486-4ff2-876a-91e569f4190b

If you are interested in the upcoming events in this series, subscribe here:
https://icr.uni.lu/deonticlogic/mailinglist.html

Please check this website to see our previous events:
https://icr.uni.lu/deonticlogic/lectureseries.html


We hope to see you on the 24th of November!


Ilaria Canavotto, Réka Markovich, and Huimin Dong
DEON Seminar Series organizers


======== Guidelines of Participation =========

1) Please MUTE your microphone during the talk and during the Q&A unless
you have been called on to ask a question. (And please do not ask questions
or follow-ups in the Q&A unless you've been called on – i.e., no
interrupting).

2) If you would like to ask a question during the Q&A, please use the
"raise hand" tool on Zoom.

3) Please frame your questions in a constructive and collegial spirit!

Many thanks in advance!

**********************************************************
*
* 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] SAND 2023 - 2nd Call for Papers

======================================
SAND 2023: 2nd Call for Papers
======================================

2nd Symposium on Algorithmic Foundations of Dynamic Networks
June 19-21, 2023
Pisa, Italy

https://www.sand-conf.org/
Twitter: https://twitter.com/SANDconference


======================================
Important Dates
======================================

Submission deadline: January 23, 2023, 23:59 AoE
Notification: March 23, 2023
Revised papers due: April 8, 2023
Conference: June 19-21, 2023


======================================
Scope
======================================

We are pleased to announce the 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND).

The objective of SAND is to provide a primary venue for the presentation and discussion of research on fundamental aspects of computing in dynamic networks. Focusing on the theory, design, analysis, and application of computing in dynamic networks, SAND seeks high-quality results characterized by a marked algorithmic aspect that shed insights on the computability landscape for dynamic environments or that can be foundational for practical and impactful systems. SAND aims at bringing together researchers from Computer Science and related areas such as Mathematics, Complex Systems, Sociology, Transportations, Robotics, Physics, and Biology to present and discuss original research at the intersection of Algorithms and Dynamic Networks and Systems.

We encourage contributions from all viewpoints, including theory and practice, addressing or being motivated by the role of dynamics in computing. We welcome both conceptual and technical contributions, as well as novel ideas and new problems that will inspire the community and facilitate the further growth of the area.

Topics of interest include, but are not limited to:

- Temporal graphs
- Continuous models of dynamic networks
- Geometric dynamic models
- Reconfigurable and swarm robotics, programmable matter, DNA self-assembly
- Population protocols and chemical reaction networks
- Distributed computation in dynamic networks
- Multilayer, peer-to-peer and overlay networks
- Randomness in dynamic networks
- Wireless networks, mobile computing, autonomous agents
- Streaming models
- Boolean networks
- Information spreading, gossiping, epidemics
- IoT, Cloud, Edge/Fog computing
- Computability and Complexity within dynamic networks
- Offline and online algorithms for dynamic networks
- Learning approaches for dynamic networks
- Complex systems, social and transportation networks
- Fault-tolerance, network self-organization and formation
- New models for dynamic networks
- Bio-inspired, physical, and chemical dynamic models


======================================
Paper Submission
======================================

Papers should be submitted electronically through Easychair (https://easychair.org/conferences/?conf=sand2023).

A submission must be original research and reporting on novel results that have not appeared previously in/(or are concurrently submitted to) a journal or a conference with published proceedings. Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (https://submission.dagstuhl.de/series/details/5#author) with

\documentclass[a4paper,anonymous,USenglish]{lipics-v2021}.

Submissions must be anonymous, without any author names, affiliations, or email addresses. A submission must not exceed 15 pages, excluding the references. Additional details can be provided in a clearly marked appendix. Reviewers are not required to read the appendix. Submissions deviating from the above guidelines will be rejected without consideration of their merits.

The program committee may decide that some of the papers not selected for publication are suitable for publication in the brief announcement format. Any authors who do not wish their paper to be considered for the brief announcement format in case of rejection, are asked to clearly indicate this on the first page of their submission.


======================================
Instructions for Double-Blind Review
======================================

The reviewing process is double-blind, the authors' names must not be included in the paper, and the writing of the manuscript should be done in such a way to not de-anonymize authors (e.g., instead of, our result [1], they should use, the result of [1]). We assume that reviewers do not actively try to recognize the authors. Therefore, authors are allowed to publish their results on pre-print services before or at any point of the submission/reviewing process. Non-anonymous submissions will be rejected.


======================================
Publication
======================================

The conference proceedings will be published by LIPIcs. The final version of the paper must be formatted following the LIPIcs guidelines (https://submission.dagstuhl.de/documentation/authors). Papers accepted in full will have 15 pages in the final proceedings (excluding references). Any papers accepted in the brief announcement format will have 3 pages in the final proceedings (including everything).

Extended and revised versions of selected papers will be considered for a special issue in a journal (for example, the SAND 2022 SI will appear in the Journal of Computer and System Sciences).

For every accepted regular paper and brief announcement, at least one of the authors must fully register and present the paper during the conference and according to the conference program. Any paper accepted but not presented will be withdrawn from the final proceedings.


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

All papers are eligible for the best paper award. Papers co-authored by full-time students may also be eligible for the best student paper award. For a paper to be considered for the best student paper award, the nominated authors should be full time students at the time of submission and should have a significant contribution to the paper. In case the authors think that their paper is eligible for the best student paper award, they should clearly indicate this on the first page of their submission and briefly justify. The program committee may decline to make these awards or may decide to split them.


======================================
Organization
======================================

Program Committee:

- David Doty, University of California, Davis, USA (co-chair)
- Paul Spirakis, University of Liverpool, UK (co-chair)
- Mostefaoui Achour, Université de Nantes, France
- Hagit Attiya, Technion, Israel
- Petra Berenbrink, Universität Hamburg, Germany
- Silvia Bonomi, Sapienza Università di Roma, Italy
- Janna Burman, Université Paris-Saclay, France
- Arnaud Casteigts, University of Bordeaux, France
- Ho-Lin Chen, National Taiwan University
- Giuseppe Di Luna, Sapienza Università di Roma, Italy
- Mahsa Eftekhari, Microsoft, USA
- Jessica Enright, University of Glasgow, UK
- Javier Esparza, Technische Universität München, Germany
- Pierre Fraigniaud, CNRS, France
- Leszek Gasieniec, University of Liverpool, UK
- Chryssis Georgiou, University of Cyprus
- Peter Kling, Universität Hamburg, Germany
- Dariusz Kowalski, Augusta University, USA
- Marios Mavronicolas, University of Cyprus
- George Mertzios, Durham University, UK
- Othon Michail, University of Liverpool, UK
- Slobodan Mitrović, University of California, Davis, USA
- Sotiris Nikoletseas, Patras University, Greece
- Thomas Nowak, Université Paris-Saclay, France
- Giuseppe Prencipe, University of Pisa, Italy
- Andrea Richa, Arizona State University, USA
- Elad Schiller, Chalmers University of Technology, Sweden
- Stefan Schmid, Technische Universität Berlin, Germany
- George Skretas, Hasso Plattner Institute, Germany
- Yuichi Sudo, Osaka University, Japan
- Przemysław Uznański, University of Wrocław, Poland
- Hirozumi Yamaguchi, Osaka University, Japan
- Yukiko Yamauchi, Kyushu University, Japan


Organizing Committee:

- Giuseppe Prencipe, Pisa University, Italy (General Chair 2023)
- Samuele Bonini, Pisa University, Italy


Steering Committee:

- Paola Flocchini, University of Ottawa, Canada (chair)
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy (General chair 2022)
- Viktor Zamaraev, University of Liverpool, UK (General chair 2022)
- Giuseppe Prencipe, Pisa University, Italy (General Chair 2023, Treasurer)
- James Aspnes, Yale University, USA (PC chair 2022)
- Othon Michail, University of Liverpool, UK (PC chair 2022)
- David Doty, University of California, Davis, USA (PC chair 2023)
- Paul Spirakis, University of Liverpool, UK (PC chair 2023)


Advisory Board:

- James Aspnes, Yale University, USA
- Luca Becchetti, University of Rome Sapienza, Italy
- Arnaud Casteigts, University of Bordeaux, France
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy
- Paola Flocchini, University of Ottawa, Canada
- George Mertzios, Durham University, UK
- Othon Michail, University of Liverpool, UK
- Rotem Oshman, Tel Aviv University, Israel
- Nicola Santoro, Carleton University, Canada
- Paul Spirakis, University of Liverpool, UK
- Viktor Zamaraev, University of Liverpool, UK





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

[DMANET] [CFP] IEEE MetaCom 2023- IEEE International Conference on Metaverse Computing, Networking and Applications, Kyoto, Japan

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

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

CALL FOR PAPERS

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

*IEEE International Conference on Metaverse Computing, Networking and
Applications (IEEE MetaCom 2023), June 26-28, 2023, Kyoto, Japan*

http://www.ieee-metacom.org/2023

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

*IMPORTANT DATES:*

*Paper Submission Due: 30 December 2022*

Author Notification: 15 March 2023

Camera-Ready Due: 10 May 2023

Conference Dates: 26-28 June 2023

*Submission Link: **https://easychair.org/conferences/?conf=metacom2023*
<https://easychair.org/conferences/?conf=metacom2023>

IEEE MetaCom 2023 provides a forum for academic researchers and industry
practitioners to present research progresses, exchange new ideas, and
identify future directions in the field of Computing, Networking, and
Applications for Metaverse.

Scope and Objectives:

Metaverse is one of the key enablers for the future society, which is
envisioned to bring a new revolution to digital world. For Metaverse,
physical world will be seamlessly integrated with cyber world through
digitizing physical objects to create digital twins, which poses numerous
challenges on human-machine interfaces, ultra-low latency, extremely high
resource demands, low traffic, reliability and trustworthiness. To realize
this vision, it becomes indispensable for the convergence of computing,
networking and applications for Metaverse in a wide range of domains
including industry, finance, medical care, smart cities, entertainment,
education, and agriculture.

The conference solicits submissions from all research areas related to
Metaverse computing, networking, as well as their corresponding systems and
applications. Topics of interests are covered by the following tracks:

*Track 1: Metaverse Architectures and Applications*

https://www.ieee-metacom.org/2023/track1.php

*Track Chairs: *Bo Han,George Mason University, USA

Luiz Fernando Bittencourt,University of Campinas, Brazil

· Architecture and system design

- Immersive services
- Digital twin modeling and rendering
- Animations and physical world simulations
- Model evolution, composition and library
- Holographic applications
- Virtual reality, augmented reality, mixed reality, extended reality
- Metaverse applications in different domains, such as industry,
healthcare
- Design, implementation, and evaluation of novel applications
- Measurement of commercial platforms
- Scalability and interoperability

*Track 2: Networking and Communications*

https://www.ieee-metacom.org/2023/track2.php

*Track Chairs: *Lijun Dong,Futurewei, USA

Lei Lei,University of Guelph, Canada

· Network architectures and design principles for metaverse

- Routing metrics and algorithms
- Rendezvous services for metaverse
- Resource control and allocation
- Network management
- Interactions between cyber and physical spaces
- Data center communications for metaverse
- Decentralized communications for metaverse
- Ultra-low-time communications for metaverse
- Green communications for metaverse
- Holographic communications
- B5G/6G for metaverse applications

*Track 3: Metaverse Computing *

https://www.ieee-metacom.org/2023/track3.php

*Track Chairs:* Paolo Bellavista,University of Bologna, Italy

Yehia Elkhatib,University of Glasgow, U.K.

· Adaptive resource provisioning and monitoring in the Metaverse
cloud continuum

· Resource elasticity in the cloud continuum for Metaverse
applications

· Computation offloading for extremely low latency in the cloud
continuum

· Building flexible data paths in the cloud continuum

· High-performance Metaverse data streaming and storage

· QoS assurance and SLA in the cloud continuum

· QoE-aware Metaverse service management

· Distributed Digital Twins in the Metaverse

· Tactile Internet for the Metaverse

· End-to-end quality of service/experience in collaborative Metaverse
applications

· Distributed AI/ML for Metaverse resource management and applications

· Data governance mechanisms in the Metaverse

· Metaverse computing for cross-domain service interoperability

· Metaverse computing for cross-context security and trust management

· Scalability and resilience of cloud continuum-based Metaverse
applications

· System design and evaluation for immersive Metaverse experiences

· Innovative proposals, middleware, and application components in the
following vertical domains

*Track 4: Blockchain and Web 3.0*

https://www.ieee-metacom.org/2023/track4.php

*Track Chairs:* Henry M. Kim,York University, Canada

Bin Cao,Beijing University of Posts and Telecommunications, China

- Zero-trust architecture and protocol design for blockchain and web3.0
- Incentive and consensus mechanisms for blockchain and web3.0
- Identity Management System for blockchain and web3.0
- Distributed storage, identifiers, and data verification in blockchain
and web3.0
- Fundamental limits and theoretical guidance for blockchain and web3.0
- Emerging technologies for blockchain and web3.0
- Hardware and infrastructure implementation for blockchain and web3.0
- Smart contract and chain code
- NFT applications and protocols
- Semantic computing and services in blockchain and web3.0
- Blockchain and web3.0 applications
- Blockchain and web3.0 standardizations

*Track 5: Security, Privacy, and Trust*

https://www.ieee-metacom.org/2023/track5.php

*Track Chairs: *Rongxing Lu,University of New Brunswick, Canada

Yogachandran Rahulamathavan,Loughborough University, U. K.

· Security, privacy and/or trust frameworks for metaverse

· Secure protocols for dynamic IoT networks and metaverse

· Privacy mitigation techniques for IoT-enabled extended reality for
metaverse

· Secure data sharing and integration mechanisms across extended IoT
networks for metaverse

· Trust issues to address AI/ML techniques in metaverse

· Security, privacy, and trust in the context of the metaverse

· New cryptographic technologies for metaverse

- Data security and governance
- Privacy preserving technologies
- Policy and regulation compliance
- Trust management framework
- ID management, authentication and authorization
- Accountability for metaverse
- Zero-knowledge proof for metaverse
- Zero-trust architecture for metaverse

*Track 6: Theories, Experiments and Evaluations*

https://www.ieee-metacom.org/2023/track6.php

*Track Chairs: *Zehui Xiong,Singapore University of Technology and Design
(SUTD), Singapore

Kim-Kwang Raymond Choo,The University of Texas at San Antonio, USA

· Theoretical investigations on metaverse

- Optimization, game theory, incentive designs
- AI (e.g., machine / deep learning) experiments for metaverse
- Simulators, testbeds, prototypes
- Implementations, and field experiments
- Verification of the existing knowledge
- Performance evaluation and modeling
- Quality of service and quality of experience
- Standardizations for metaverse

*IEEE MetaCom will arrange exciting panels and tutorials.*

Panel Chair: Tarek Abdelzaher Unniversity of Illinois Urbana-Champaign, USA

Tutorial Chairs: Yan Zhang University of Oslo, Norway

Andreas Veneris, University of Toronto, Canada

*The workshops are open for proposals and the PhD forum are also open for
submissions.*

https://www.ieee-metacom.org/2023/cf-workshops.php

*Best Paper Award and Journal Special Issues:*

Three accepted papers will be selected for best paper awards. Selected
papers will be recommended to Digital Communications and Networks (IF:
6.797) for potential fast-track publications.

*Regular Paper Submission Guidelines:*

IEEE MetaCom 2023 invites submission of manuscripts with original research
results that have not been previously published or posted on public
websites or that are not currently under review by another conference or
journal. Submitted manuscripts must be prepared according to IEEE Computer
Society Proceedings Format (double column, 10pt font, letter paper) and
submitted in the PDF format. The manuscript submitted for review should be
no longer than 8 pages. After the manuscript is accepted, the camera-ready
paper may have up to 10 pages, subject to an additional fee per extra page.
Reviewing will be *double-blind*. Submissions must not reveal the authors'
names and their affiliations and avoid obvious self-references. Manuscripts
should be submitted to one of the research tracks. Submissions not meeting
these guidelines will be rejected without consideration of their merits.
Accepted and presented papers will be published in the IEEE MetaCom 2023
Conference Proceedings and included in IEEE Xplore.

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

*IMPORTANT DATES:*

Paper Submission Due: 30 December 2022

Author Notification: 15 March 2023

Camera-Ready Due: 10 May 2023

Conference Dates: 26-28 June 2023

General Chairs:

Chonggang Wang, Interdigital, USA

Dusit Niyato, Nanyang Technological University, Singapore

TPC Chairs:

Ruidong Li, Kanazawa University, Japan

Enzo Mingozzi, University of Pisa, Italy

Max (Chong) Li, Computecoin Network and Columbia University, USA

*Supported by IEEE SIG on Metaverse (METASIG): www.ieee-metacom.org/sigmeta

*METASIG Linkedin Group: https://www.linkedin.com/groups/14120645

**********************************************************
*
* 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] 9 PhD positions and 6 Postdoc positions in theoretical computer science, algebra, and logic (Barto, Bodirsky, Pinsker)​

Dear colleague,

Please find below a job announcement of our ERC Synergy Grant POCOCOP. We would be grateful if you could forward it to anyone interested.

Best wishes,

Michael Pinsker, Libor Barto, Manuel Bodirsky
The ERC Synergy Grant POCOCOP (Polynomial-time computation: opening the black boxes in constraint problems) is offering 9 PhD and 6 Postdoc positions at TU Vienna, Charles University Prague, and TU Dresden. The goal of the project is to systematically explore polynomial-time tractability in the field of constraint satisfaction and its extensions, in particular promise CSPs, valued CSPs, and CSPs over infinite domains. The project is jointly led by three principal investigators: Manuel Bodirsky (TU Dresden), Michael Pinsker (TU Vienna), and Libor Barto (Charles University Prague).

We are looking for highly motivated and creative candidates and in particular encourage female researchers to apply. The applicants should have a strong background in at least one of the following fields: theoretical computer science, model theory, or universal algebra. For the PhD positions the requirements are a Master's degree or equivalent in mathematics or computer science. For the Postdoc positions the requirements are a PhD or equivalent in mathematics or computer science. Successful candidates will be based at one of the three sites (Prague, Dresden, Vienna), but collaborate with the other two groups intensively.

The starting date of the grant is the 1st of March 2023, but applications will be considered until the positions are filled. For full consideration, we encourage applicants to express their interest by the 15th of December 2022. The duration of the PhD positions will be 3-4 years, and the duration of the Postdoc positions will be up to 3 years. The positions come with a very good salary, are fully funded from the ERC grant and carry no teaching load; however, if desired participation in teaching might be arranged via other sources of funding. There is sufficient funding for conference and research exchange trips.

Applicants should send a CV, a statement of research experience and interests, and a list of publications (if applicable) in a single PDF file to jobs@pococop.eu (mailto:jobs@pococop.eu). The application may also include a short annotation of at most three of their best papers; in the case of the PhD positions, a copy of the Master's thesis should be included. Applicants should moreover arrange for at least two recommendation letters to be sent directly to the same email address. Informal inquiries are very welcome.

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

Abstract of POCOCOP:

The class P of polynomial-time computable computational problems is the most important and robust complexity class for the study of efficient computation. Answering what problems belong to P will lead to groundbreaking applications in science and modern society where computation is omnipresent. Moreover, P is a relatively recent mathematical object and radically different from classical notions studied for centuries; thus, capturing it promises the discovery of new fundamental theorems in mathematics.

Our current understanding of P is limited; for instance, the P=NP millennium problem is wide open. There neither exists a uniform reduction technique, nor a single algorithmic scheme capturing the power of P, nor a description of P in purely logical terms. We intend to provide these in a context which is so rich and vast that it requires the unification of some of the most important techniques, and will enhance our general understanding of P.

Within the microcosm of finite-domain constraint satisfaction problems (CSPs), the recent resolution of the Feder-Vardi conjecture by Bulatov and by Zhuk provides a satisfactory picture of P. Our goal is a vast and uniform generalisation of this result in three directions: towards approximation via Promise CSPs, towards optimisation via Valued CSPs, and towards infinite domains via omega-categorical CSPs and CSPs over numeric domains. In particular, our setting includes the linear programming problem as a numeric Valued CSP, the approximate graph coloring problem as a Promise CSP, and many problems from qualitative reasoning as infinite-domain CSPs. Our methods range from universal algebra, model theory, Ramsey theory, to complexity theory. Building on cross-connections between these extensions, we will provide a uniform description of P within this diverse and applicable universe, thus making a revolutionary leap in the resolution of the general problem.

**********************************************************
*
* 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] 10% Assistant professor in Graph Theory and Combinatorial Algorithms, Ghent University (Belgium)

Applications are invited for a 10% Assistant professor in Graph Theory and Combinatorial Algorithms in the Department of Applied Mathematics, Computer Science and Statistics at Ghent University (Belgium).

Candidates are expected
- to have already conducted eminent academic research in the given discipline and a special interest in and experience with structural graph theory are recommended,
- to have demonstrated the ability to initiate, to supervise and acquire research funding,
- to be didactically skilled to teach university students to develop academic competences.

The successful candidate will be expected to conduct research in the discipline of structural graph theory, to participate in the (on campus) teaching commitments of the department as a lecturer-in-charge and to take part in the internal and external service provision of the department.

The post is available from February 1 2023 and has a renewable duration for a maximum of 6 years. The deadline for applications to be received is 11th December 2022.

Further information about this vacancy can be found at: https://www.ugent.be/en/work/copy_of_overview.htm

Further information about the department and the research group can be found at: https://www.ugent.be/we/twist/en/research

Note that this is a 10% post that is remunerated as such.

--

Marnix Van Daele
Hoogleraar, vakgroepvoorzitter
T +32 9 264 48 09

Vakgroep Toegepaste Wiskunde, Informatica en Statistiek
Campus Sterre, S9, Krijgslaan 281, 9000 Gent, België
T secretariaat +32 9 264 47 57

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

[DMANET] PostDoc positions in Algorithms at Bocconi University in Milan

There are several postdoc openings at recently created
Department of Computing Sciences at Bocconi University in Milan
https://cs.unibocconi.eu/

Scientific areas include Online Algorithms, Combinatorial Optimization,
and Algorithmic Game Theory.
Preferable starting date is between January and Jun 2023
and early applications are encouraged.

For more information, contact
Andrea Celli andrea.celli2@unibocconi.it
Laura Sanità laura.sanita@unibocconi.it
or Marek Eliáš marek.elias@unibocconi.it

If you would like to learn more about life in Milan and Bocconi University,
I can recommend related blogposts of Luca Trevisan:
https://lucatrevisan.wordpress.com/category/places/bocconi/

**********************************************************
*
* 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] [Cryptography] (ISSN 2410-387X, ESCI & Scopus Journal) Top Cited Papers

We are sharing with you the Top Cited Papers published in the open
access journal /Cryptography/ (https://www.mdpi.com/journal/cryptography)
in the past 2 years, which are free to access and can be downloaded here:

1. Why Is Deep Learning Challenging for Printed Circuit Board (PCB)
Component Recognition and How Can We Address It?
https://www.mdpi.com/2410-387X/5/1/9

2. Designing a Practical Code-Based Signature Scheme from Zero-Knowledge
Proofs with Trusted Setup
https://www.mdpi.com/2410-387X/6/1/5

3. Variations of QKD Protocols Based on Conventional System
Measurements: A Literature Review
https://www.mdpi.com/2410-387X/6/1/12

4. Towards Accurate Run-Time Hardware-Assisted Stealthy Malware
Detection: A Lightweight, yet Effective Time Series CNN-Based Approach
https://www.mdpi.com/2410-387X/5/4/28

5. TRNGs from Pre-Formed ReRAM Arrays
https://www.mdpi.com/2410-387X/5/1/8

It would be highly appreciated if you could share the information to
your colleagues, friends and any scholars you know in this field. Thanks
in advance for your help.

Best regards,
Xue Cheng
Managing Editor
--
MDPI Branch Office, Wuhan
Cryptography Editorial Office
https://www.mdpi.com/journal/cryptography
MDPI, St. Alban-Anlage 66, 4052 Basel, Switzerland

News: Cryptography will receive Impact Factor June 2023

Highly Cited Papers:
Why Is Deep Learning Challenging for Printed Circuit Board (PCB)
Component Recognition and How Can We Address It?
https://www.mdpi.com/2410-387X/5/1/9
A New Class of Q-Ary Codes for the McEliece Cryptosystem
https://www.mdpi.com/2410-387X/5/1/11

Twitter: @Cryptogr_MDPI https://twitter.com/Cryptogr_MDPI

Disclaimer: The information and files contained in this message are
confidential and intended solely for the use of the individual or entity
to whom they are addressed. If you have received this message in error,
please notify me and delete this message from your system. You may not
copy this message in its entirety or in part, or disclose its contents
to anyone.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, November 22, 2022

[DMANET] PhD opening in TCS and/or combinatorial optimization in Lund

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Groebner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.

Quite recently, we have made research breakthroughs on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our goal is to design a new generation of certifying combinatorial solvers with so-called proof logging, meaning that the solvers output not only a solution but also a machine-verifiable mathematical proof that is easy to check and provides 100% formal guarantees that the claimed solution is correct. This work has only started, but our tool VeriPB (gitlab.com/MIAOresearch/software/VeriPB) can already handle techniques that have long remained beyond the reach of other approaches, and we have recently received prestigious AAAI '22 distinguished paper and SAT '22 best paper awards for our work.

With this call, we are mainly looking for a mathematically gifted PhD student with excellent programming skills to continue our ground-breaking work on certifying algorithms. There is some flexibility as to what kind of research PhD students in the group pursue, though, and all candidates are welcome, both those who want to go deep into either theory or practice and those who are inspired by the challenge of bridging the gap between the two.

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting date is negotiable, but should ideally be during the first half of 2023, or at the latest in August/September 2023. All positions in the research group are fully funded, employed positions (including travel money) that come with an internationally competitive salary.

The application deadline is January 12. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-230112.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.


**********************************************************
*
* 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 -- Save the Date

Dear Colleagues,

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 will be an opportunity to submit contributed talks, as well as for PhD students to apply for travel grants. More information about this and on the opening of the registration will be announced soon - stay tuned!

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

[DMANET] Professor of the Practice Position in Computer Science

The Department of Computer Science at Duke University in Durham, North Carolina, invites applications and nominations for a Professor of the Practice position starting in Fall 2023. The appointment will be made at the Assistant/Associate/Full Professor of the Practice rank depending on the candidate's experience. Duke has a long history of supporting faculty with practice-of titles who are educators, practitioners, and scholars, and the Computer Science Department has set high standards in providing a teaching and work environment in which the Practice-of faculty thrive.

Candidates are expected to have a doctoral degree in computer science or a related field. Successful candidates must have a strong commitment to and demonstrated excellence in teaching. They must show commitment to educating a broad and diverse group of students and to increasing the participation and success of students from groups underrepresented in computer science. Successful candidates at the Associate and Full Professor of the Practice level must also show examples of academic, scholarly, and educational success outside the classroom that have resulted in, or have the potential to result in, significant advancements in computer science education.

The term of an initial appointment depends on the rank, but is typically four years for a junior position. Reappointment and promotion are governed by departmental and university bylaws and guidelines that encourage faculty to be innovative, to succeed locally and nationally, and to develop new courses and curricula that mesh with ongoing and new initiatives. Practice-of faculty typically teach two undergraduate courses per semester with support from graduate and undergraduate Teaching Assistants as well as Teaching Associates.

Applicants should submit the following materials electronically through AcademicJobsOnline (https://academicjobsonline.org/ajo/jobs/23302) , and solicit letters of reference:

* Cover letter
* Curriculum vitae
* A statement on teaching describing your teaching philosophy as well as your experience with teaching and mentoring, including evidence of teaching effectiveness (such as teaching evaluations)
* A statement of scholarly activities, which may include research on pedagogical focus
* A statement on diversity describing your experience in advancing diversity in teaching, scholarship and/or service, as well as your understanding of the importance of diversity and inclusion to the mission of Duke University
* Letters from at least three referees who can comment on the candidate's pedagogical skills, among other attributes.
For full consideration, applications and references should be received by December 15, 2022.

Duke is committed to further enhancing the diversity of its faculty and students. We seek faculty members who are also committed to building a diverse and inclusive community. We strongly encourage applications from women and underrepresented minorities in computing. Please see www.cs.duke.edu<http://www.cs.duke.edu> and www.faculty.duke.edu<http://www.faculty.duke.edu> for information about the Department and advantages that Duke offers to faculty.

Durham, Chapel Hill, and the Research Triangle of North Carolina are frequently ranked among the best places in the country to live and work. Duke and the many other universities in the area offer a wealth of education and employment opportunities for spouses, partners, and families.

Duke University is an Affirmative Action/Equal Opportunity Employer committed to providing employment opportunity without regard to an individual's age, color, disability, genetic information, gender, gender expression, gender identity, national origin, race, religion, sex, sexual orientation, or veteran status.

**********************************************************
*
* 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] Tenure-Track or Tenured Faculty Positions in Computer Science

The Department of Computer Science at Duke University in Durham, North Carolina, invites applications for tenure-track or tenured faculty positions at all ranks. Candidates are expected to have a doctoral degree in computer science or a related field. Successful candidates must have a solid disciplinary foundation and demonstrate the promise of outstanding scholarship in every regard, including research and teaching.

Applicants should submit their materials (cover letter, curriculum vita, research statement, teaching statement, contacts for at least three references) electronically through AcademicJobsOnline (https://academicjobsonline.org/ajo/jobs/23526), and solicit letters of reference. For full consideration, applications and references should be received by December 15, 2022.

Duke is committed to further enhancing the diversity of its faculty and students. We seek faculty members who are also committed to building a diverse and inclusive community, which fosters excellence in research and teaching. We strongly encourage applications from women and underrepresented minorities in computing. Please see www.cs.duke.edu<http://www.cs.duke.edu> and www.faculty.duke.edu<http://www.faculty.duke.edu> for information about the Department and advantages that Duke offers to faculty.

Durham, Chapel Hill, and the Research Triangle of North Carolina are frequently ranked among the best places in the country to live and work. Duke and the many other universities in the area offer a wealth of education and employment opportunities for spouses, partners, and families.

Duke University is an Affirmative Action/Equal Opportunity Employer committed to providing employment opportunity without regard to an individual's age, color, disability, genetic information, gender, gender expression, gender identity, national origin, race, religion, sex, sexual orientation, or veteran status.


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

[DMANET] CFP - Genetic Improvement Workshop GI @ ICSE 2023 - 13 Jan 2023 (submission deadline)

The 12th International Workshop on Genetic Improvement
Co-located with the 45th IEEE/ACM International Conference on Software Engineering,
ICSE 2023, Melbourne, Australia and online, 14--20 May 2023

http://geneticimprovementofsoftware.com/events/icse2023
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


Important Dates:
~~~~~~~~~~~~~
Submission: 13 Jan 2023
Notification: 24 Feb 2023
Camera-ready: 17 Mar 2023
Workshop: 14-20 May 2023 (one day)

Submission:
~~~~~~~~~~
Submit anonymised (double blind) PDF in IEEE conference proceedings format
https://www.ieee.org/conferences/publishing/templates.html

Research and Position Papers:
~~~~~~~~~~~~~~~~~~~~~~~~
* Research papers (limit eight pages)
* Position papers (limit two pages)

Topics of interest:
~~~~~~~~~~~~~~
Research and applications include, but are not limited to,
using Genetic Improvement to:

* Improve efficiency
* Decrease memory consumption
* Decrease energy consumption
* Transplant new functionality
* Specialise software
* Translate between programming languages
* Generate multiple versions of software
* Improve low level or binary code
* Improve SE documentation, specification, training and educational
tools and techniques
* Improve software engineering artifacts, e.g., documentation,
specification, training and educational tools, materials and techniques
* Repair bugs
* GI techniques in industrial settings

Keynote speaker:
~~~~~~~~~~~~~
Dr. Myra B. Cohen, Iowa State University (USA)

Students travel awards:
~~~~~~~~~~~~~~~~~~
Up to five student travel awards

2 prizes:
~~~~~~~
* a prize will be awarded to the presenter who gives
the best presentation at the workshop.
* a prize will be given for the best paper.

Both prizes will be awarded at the workshop which will be held in
hybrid mode both in Melbourne, Australia and virtually on the Internet
as part of the 45th International Conference on Software Engineering
ICSE 2023.

Workshop Chairs:
~~~~~~~~~~~~~~
Vesna Nowack v.nowack@imperial.ac.uk<mailto:v.nowack@imperial.ac.uk>
Markus Wagner markus.wagner@adelaide.edu.au<mailto:markus.wagner@adelaide.edu.au>
Gabin An agb94@kaist.ac.kr<mailto:agb94@kaist.ac.kr>
Aymeric Blot aymeric.blot@univ-littoral.fr<mailto:aymeric.blot@univ-littoral.fr>
Justyna Petke j.petke@ucl.ac.uk<mailto:j.petke@ucl.ac.uk>


The full call for submissions:
~~~~~~~~~~~~~~~~~~~~~~
We invite submissions that discuss recent developments in all areas of
research on, and applications of, Genetic Improvement.

GI is the premier workshop in the field and provides an opportunity
for researchers interested in automated program repair and software
optimisation to disseminate their work, exchange ideas and discover
new research directions.

Topics of interest include both the theory and practice of
Genetic Improvement. Applications include, but are not limited to,
using GI to:
* Improve efficiency
* Decrease memory consumption
* Decrease energy consumption
* Transplant new functionality
* Specialise software
* Translate between programming languages
* Generate multiple versions of software
* Improve low level or binary code
* Improve SE documentation, specification, training and educational
tools and techniques
* Improve software engineering artifacts, e.g., documentation,
specification, training and educational tools, materials and techniques
* Repair bugs
* GI techniques in industrial settings

Keynote:
The keynote will be given by Dr. Myra B. Cohen head of
Iowa State's LaVA-Ops, Laboratory for Variability-Aware Assurance
and Testing of Organic Programs.

The invited keynote presentation will be given by Myra Cohen.
Dr. Cohen is a full professor at Iowa State University (USA), where
she holds the Lanh and Oanh Nguyen Chair in Software Engineering in
the Department of Computer Science. She is head of Iowa State's
LaVA-Ops, Laboratory for Variability-Aware Assurance and Testing of
Organic Programs. As well as genetic improvement, her research covers
software testing of highly-configurable software, SBSE, applications
of combinatorial designs (CIT), and the synergy between systems and
synthetic biology and software engineering. She has served on many
software engineering conferences, including this year as the
Technical Briefings-track chair of ICSE 2023.

Hybrid Event:
Due to the continued COVID19 pandemic, as with GI 2020-22, the
workshop may be held online with recordings available on YouTube.
Eg https://youtube.com/playlist?list=PLI8fiFpB7BoIHgl5CsdtjfWvHlE5N6pje

Students travel awards:
We are pleased to announce that we will offer up to 5 awards
of up to $250(USD) each to partially reimburse travel costs for
students whose work is presented at the GI@ICSE 2023 workshop.

Priority will be given based on the student's need and submission
quality.

Students applying for an award should submit a first-author
regular full paper to the genetic improvement workshop.

Moreover, their supervisor should send a one-paragraph note of
recommendation to Dr. Vesna Nowack v.nowack@imperial.ac.uk<mailto:v.nowack@imperial.ac.uk>
listing:
* the student's area of work.
* the supervisor's support of the student's application.

These awards are available thanks to the EPSRC grant on
"Automated Software Specialisation Using Genetic Improvement"

We encourage authors to submit early and in-progress work.
The workshop emphasises interaction and discussion.

All papers should be submitted electronically as PDFs via HotCRP
https://gi-at-icse2023-workshop.hotcrp.com/
double-blind
as PDFs in the ICSE conference format. All accepted
papers must be presented at GI 2023 and will appear in the ICSE
workshops volume. The official publication date of the workshop
proceedings is the date the proceedings are made available by IEEE.
This date may be up to two weeks prior to the first day of ICSE 2023.
The official publication date affects the deadline for any patent
filings related to published work.

Details about the Genetic Improvement workshop can be found via:
http://geneticimprovementofsoftware.com/events/icse2023
The webpage contains GI papers, blogs, success stories, a living survey, tools,
benchmarks, people, GitHub, as well as past events, tutorials and
workshops.

Details about ICSE 2023 can be found at the web page:
https://conf.researchr.org/home/icse-2023


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

[DMANET] Call for Abstracts --- IFORS 2023 - Cluster "OR for Development and Developing Countries"

Call for Abstracts for the "OR for Development and Developing Countries" Cluster

IFORS 2023 (10-14 July 2023, Santiago, Chile, https://ifors2023.com/ )


The 23rd Conference of the International Federation of Operational Research Societies (IFORS) will take place in Santiago, Chile, in summer 2023. We are excited to resume on-site IFORS conferences. Cluster "OR for Development and Developing Countries" aims to engage those involved in OR, MS or Analytics for development or developing countries and promote sharing of developmental experiences, insights and future plans.


The cluster's topics include all aspects of development and developing countries, supported by OR-MS / Analytics. If you are interested in serving here as a session chair with a new session theme, please do not hesitate to reach out to us.


Some sessions are in preparation already, and you are welcome to submit your abstract there:


Sessions: Code:


· EWG-ORD Workshop 5bf9371c

· OR for Developing Countries 1 b5d1aeba

· AI in South African Economic Development bc75d9ed

· Sustainable Practices for Developing Countries 2b99bc7c

Abstract submission system is available online at: https://www.euro-online.org/conf/ifors2023/.


Abstracts must be written in English with a maximum of 2500 characters; submission deadline: March 15, 2023.


Please do not hesitate to contact us.


Session Chairs : Gordon Dash (ghdash@uri.edu ), Nina Kajiji (nina@nkd-group.com), Elise del Rosario (elise@jgdelrosario.com), Olabode Adewoye (boka152002@yahoo.com), Sadia Samar Ali (sadiasamarali@gmail.com)

Cluster Chair : Gerhard-Wilhelm Weber (gerhard-wilhelm.weber@put.poznan.pl)


**********************************************************
*
* 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] IEEE Social Networks TC Invited Talk (Prof. Pan Hui)

Dear All,

IEEE TCSN is pleased to invite you for the invited talk on *"**The
Hitchhiker's Guide to the Metaverse**" by Prof. **Pan Hui* *on Nov. 29th
2022 from 10:00 AM Hong Kong Time (Nov. 28th 9pm EST).*

This talk is an endeavor of IEEE TCSN focusing on enhancing the awareness
of trending topics to the community.

Title: *The Hitchhiker's Guide to the Metaverse*

Speaker: *Prof. Pan Hui*

Date: * 29 November 2022 (Tuesday)*

Time: *10:00 AM HKT (UTC+08:00)*

*(Check your local time here: **https://www.thetimezoneconverter.com/
<http://enotice.ieee.org/link.cfm?r=IoDJNoL-xQC97aLHLaRfMA~~&pe=GxIJ2JMz2owXMXnxthjQlsxXd_r6-GHoYpQ4fN-U6uEzgPJfNo7nIZuvTj2SMQkXla5etaDdUm2MGDsC8X4fkA~~&t=uydO706YNZG4FGJ2CjnG_w~~>)*

*Zoom link: *

*https://rebrand.ly/HitchhikerGuideToMetaverse
<https://rebrand.ly/HitchhikerGuideToMetaverse>*

*Abstract*:

We envision in the future the virtual world will mix and co-exist with the
physical world in such an immersive way that we cannot tell what is real
and what is virtual. We will live and interact with the virtual objects
that are blended into our environments with advanced holographic technology
or with high-quality head-mounted displays and lose the virtuality
boundary. We call such a new reality Surreality. Our vision of "metaverse"
is a multi-world. There are multiple virtual worlds developed by different
technology companies and there is also the Surreality where real and
virtual merged. While the metaverse may seem futuristic, catalysed by
emerging technologies such as Extended Reality, 5G, and Artificial
Intelligence, the digital "big bang" of our cyberspace is not far away.
This talk aims to offer a comprehensive framework that examines the latest
metaverse development under the dimensions of state-of-the-art technologies
and metaverse ecosystems, illustrates the possibility of the digital "big
bang", and proposes a concrete research agenda for the development of the
metaverse.

*Speaker Bio: *

Pan Hui is a Chair Professor of Computational Media and Arts and Director
of the Center for Metaverse and Computational Creativity at the Hong Kong
University of Science and Technology (Guangzhou), and a Chair Professor of
Emerging Interdisciplinary Areas at the Hong Kong University of Science and
Technology. He is also the Nokia Chair in Data Science at the University of
Helsinki. He received his PhD from the Computer Laboratory at University of
Cambridge, and both his Bachelor and MPhil degrees from the University of
Hong Kong. He was an adjunct Professor of social computing and networking
at Aalto University, Finland, and a Distinguished Scientist at the Deutsche
Telekom Laboratories (T-labs), Germany. His industrial profile also
includes his research at Intel Research Cambridge, UK and Thomson Research
Paris, France. Pan Hui is an expert in Augmented Reality and Mobile
Computing, with more than 400 research papers, 30 patents, and over 24,000
citations. He is an International Fellow of the Royal Academy of
Engineering, a member of Academia Europaea, an IEEE Fellow, and an ACM
Distinguished Scientist.

We look forward to your participation.
[image: Prof. Pan Hui_13_plain.jpg]


**********************************************************
*
* 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] [Scheduling seminar] Sigrid Knust (Uni of Osnabrück) | November 23 | Synchronous flow shop scheduling problems

Dear scheduling researcher,

We are delighted to announce the talk given by Sigrid Knust (Uni of
Osnabrück).
The title is "Synchronous flow shop scheduling problems".
The seminar will take place on Zoom on Wednesday, November 23 at 14:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/91616587714?pwd=SFJGcnpVbTFSSWFGVWt5WHFwL2xuQT09
Meeting ID: 916 1658 7714
Passcode: 332102

You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
A synchronous flow shop is a variant of a non-preemptive permutation
flow shop where transfers of jobs from one machine to the next take
place at the same time. The processing is organized in synchronized
cycles which means that in a cycle all current jobs start at the same
time on the corresponding machines. Then all jobs are processed and have
to wait until the last one is finished. Afterwards, all jobs are moved
to the next machine simultaneously. As a consequence, the processing
time of a cycle is determined by the maximum processing time of the
operations contained in it. Furthermore, only permutation schedules are
feasible, i.e., the jobs have to be processed in the same order on all
machines. The goal is to find a permutation of the jobs such that the
makespan is minimized. Motivated by a practical application in
production planning at a company assembling shelf boards for kitchen
elements, we investigate different aspects of synchronous flow shop
problems. Especially, we consider the situation of dominating machines,
additional resources, setup times and leaving machines idle.
The next talk in our series will be in January 2023.
For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

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

Monday, November 21, 2022

[DMANET] Faculty positions at Rutgers University, New Brunswick, NJ

The Computer Science Department at Rutgers University, New Brunswick NJ,
invites applications for multiple tenure-track/tenured positions at the
Assistant Professor and Associate Professor levels. We will consider
outstanding candidates at the Professor level as well.

We invite applications from candidates making research contributions in any
area of CS, and welcome applicants with interdisciplinary approaches. We
are especially interested in Algorithms, Machine Learning and Data Science,
High-performance Computing and Scalable Systems, and other subfields with
broad potential for collaborative impact across the department and the
university.

For the official job posting see:
https://jobs.rutgers.edu/postings/183463

If you have any questions contact:
hiring-committee@cs.rutgers.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] Xpress Best Paper Award: Deadlines approaching

Dear colleagues,

We invite you to nominate or self-nominate papers for the Xpress Best Paper Award 2022.
The nomination deadline is January 31, 2023, 23:59 AoE.
The Xpress Best Paper Award acknowledges outstanding papers in the named areas in which the usage of FICO Xpress Optimization products played a significant role.
Papers published between January 1, 2021, and December 31, 2022, will qualify for the first edition awarded in 2023.
The award includes a cash prize of $1,500.

Detailed information can be found at this blog https://community.fico.com/s/blog-post/a5Q4w000000CvNvEAK/fico2819 or the award homepage https://www.i2damo.de/de/xpress-best-paper-award .
Feel free to contact me with any further questions.

Best regards,
Timo Berthold, on behalf of the award committee

PD Dr. Timo Berthold * Software Engineering - Principal Engineer * FICO
Fair Isaac Germany GmbH
Takustr. 7, 14195 Berlin, Germany
+49 30 84185 425
www.fico.com<http://www.fico.com/>

[A close up of a sign Description automatically generated]

Register Court (Registergericht): Amtsgericht Darmstadt, HRB 94074
Managing Directors (Geschäftsführer): Dr. Sebastian Hetzler, Dean Sanderson, Steven Weber
Chairman (Vorsitzender): Mark Scadina

**********************************************************
*
* 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] EURO Practitioners' Forum, Berlin, April 2023: Call for Contributions

Call for contributions: 4th conference of the EURO Practitioners' Forum
20 and 21 April 2023
Zuse Institute Berlin

Dear colleagues,

We cordially invite you to contribute to our discussions at the
4th conference of the EURO Practitioners' Forum.

During this event, we want to explore the use of OR techniques in unpredictable
situations that cause disruptive changes to established processes. Crises might
result from political or economic events, natural disasters, or social
upheaval. Technological advances such as AI techniques or Quantum Computing can
also induce radical changes.

We invite submissions on subjects that showcase the use of OR techniques when
facing disruptive changes, explaining how existing solutions could be adapted
or which new solutions have been developed to cope with previously unforeseen
challenges.

Please send your (maximum of) 1-page abstract in MS Word or PDF format to
ewgporberlin@zib.de<mailto:ewgporberlin@zib.de> .
Submission deadline: 15 December 2022

Confirmed Keynote Presentations:
- Using airline planning software to schedule nurses when COVID hit Sweden
by Daniel Roth, Jeppesen Systems, Sweden
- OR challenges related to the electricity system transition: a glance at some
latest modelling and solving advances
by Sandrine Charousset Brignol, EDF, France
- How to cope with the recent new challenges in gas transport
by Klaus Spreckelsen, OGE, Germany
- Optimal Pricing under macroeconomic shock and unstable customer behavior in
e-commerce
by Vladimir Fux, Zalando SE, Germany

Submission guidelines, venue information, and registration (free):
https://www.euro-online.org/websites/or-in-practice/epf-conference-2023

Sincerely,
Timo Berthold, on behalf of the program committee

PD Dr. Timo Berthold * Software Engineering - Principal Engineer * FICO
Fair Isaac Germany GmbH
Takustr. 7, 14195 Berlin, Germany
+49 30 84185 425
www.fico.com<http://www.fico.com/>

[A close up of a sign Description automatically generated]

Register Court (Registergericht): Amtsgericht Darmstadt, HRB 94074
Managing Directors (Geschäftsführer): Dr. Sebastian Hetzler, Dean Sanderson, Steven Weber
Chairman (Vorsitzender): Mark Scadina

**********************************************************
*
* 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] EuroCG 2023: 1st Call for Contributions

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

Sorry if you have received multiple copies of this email.

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

Call for Contributions

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


39th European Workshop on Computational Geometry
March 29-31 2023, Barcelona, Spain
https://dccg.upc.edu/eurocg23/

EuroCG 2023 will be held March 29-31, 2023 in Barcelona, Spain. EuroCG is
an annual workshop that combines a strong scientific tradition with a
friendly and informal atmosphere. The workshop is a forum where established
researchers and students can meet, discuss their work, present their
results, and establish scientific collaborations.

=============
Important Dates
=============

Submission Deadline: January 10, 2023
Acceptance Notification: February 17, 2023
Early Registration ends: February 23, 2023
Camera-ready version: March 3, 2023
EuroCG 2023: March 29–31, 2023
All deadlines are 23:59 AoE.


=============
Invited speakers
=============

- Alberto Márquez (Universidad de Sevilla, Spain)

- Sergio Cabello (University of Ljubljana, Slovenia)

- Evanthia Papadopoulou (Università della Svizzera italiana,
Switzerland)

=============
Topics of interest
=============

Topics of interest cover all aspects of computational geometry, including
but not limited to the following:


- discrete and combinatorial geometry and topology,
- design and analysis of geometric algorithms and data structures,
- implementation and experimental evaluation of geometric algorithms,
- numerical and algebraic issues arising from implementations,
- analysis of geometric configurations,
- geometric modeling, visualization and simulation,
- combinatorial optimization,
- graph drawing,
- structural molecular biology,
- geometric puzzle analysis,
- geographic information systems,
- robotics and virtual worlds, and
- computer-aided design and manufacturing.


=========
Submission
=========

We invite authors to submit extended abstracts of their original research.
Submissions must be formatted in LaTeX using a supplied class file, and not
be longer than 175 lines of text. Submissions will be handled through
EasyChair.

Authors must use the LaTeX class files euroCG23
<https://dccg.upc.edu/eurocg23/wp-content/uploads/2022/11/eurocg23.cls> and
eurocg23-submission
<https://dccg.upc.edu/eurocg23/wp-content/uploads/2022/11/eurocg23-submission.cls>,
which are based on the LIPICS class file. These class files should
automatically count all lines containing text, excluding title and
references, and excluding figures. Authors are expected to make reasonable
effort to make sure all lines that contain text are counted: the class file
should be considered an aid, and the responsibility of correctly counting
lines remains with the authors. A zip file containing an example of how to
use the class file can be found here
<https://dccg.upc.edu/eurocg23/wp-content/uploads/2022/11/eurocg23-ex.zip>.

Your submission should provide a clear statement of your results including
proofs. The main (175 line) body of your submission should be
self-contained and contain a clear and succinct description of your
results. Content that does not fit in the main body due to space
restrictions must be placed into a clearly marked appendix, which will only
be read at the discretion of the program committee.

==============
Acceptance Policy
==============

EuroCG is a non-competitive forum. We will accept all submissions which
are original, correct, well-presented, non-trivial, and in scope. The
program committee judges submissions on these five criteria, each of which
can lead to rejection. If a submission satisfies all criteria, then it will
be accepted: there is no competition against other submissions.

- Originality: If a submission does not contain original research by the
authors, or if there is good reason to believe this is the case, this is a
reason for rejection. We do not accept submissions which have already been
accepted for publication elsewhere. However, we do explicitly allow
submissions that are under review at another conference or journal (at the
time of submission to EuroCG).
- Correctness. If the main / a major result of a submission is not correct,
this is a reason for rejection. If an attentive reviewer cannot establish
correctness of the results from the content of the submission, this is a
reason for rejection. However, an acceptance at EuroCG is no correctness
guarantee.
- Presentation. If a submission is written in a way that makes it
unreadable, or it does not follow the submission guidelines as listed in
the call for contributions, this is a reason for rejection.
- Technical Depth. If a submission is trivial, this is a reason for
rejection. However, there is no "minimum level" of technical depth required.
- Scope. If a submission is out of scope, this is a reason for rejection.
However, we wish to be inclusive in our interpretation of scope, which
includes but is not limited to the list of topics in
the call for contributions.

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

EuroCG does not have formally reviewed proceedings. A booklet of abstracts,
without ISBN, will be accessible online on the website for the benefit of
the community and must be regarded as a collection of preprints rather than
a formally reviewed selection of papers. Results presented at EuroCG are
expected to appear in other conferences with formal proceedings and/or in
journals. In particular, papers that have been submitted to other formally
reviewed conferences are eligible for presentation at EuroCG, assuming they
have not been presented at a conference or published in a journal by the
time of the conference. Authors of selected papers will be invited to
submit extended versions to a special issue of the Computing in Geometry
and Topology (CGT) <https://www.cgt-journal.org/index.php/cgt/> journal.

Authors of accepted submissions are expected to present their work at the
conference (in-person). Failure to do so may result in removal of the
contribution from the abstract booklet and conference website.

There will also be a voting for the Best Student Presentation.

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

Program Committee

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

Elena Arseneva (Università della Svizzera italiana)

Michael Bekos (University of Ioannina)

Kevin Buchin (TU Dortmund)

Mark de Berg (Eindhoven University of Technology)

Radoslav Fulek (University of California San Diego)

Delia Garijo (Universidad de Sevilla)

Panos Giannopoulos (City, University of London)

Michael Hoffmann (ETH Zürich)

Clemens Huemer (Universitat Politècnica de Catalunya), CO-CHAIR

Michael Kerber (Graz University of Technology)

Boris Klemz (Universität Würzburg)

Leonardo Martínez Sandoval (Universidad Nacional Autónoma de México)

Fabrizio Montecchiani (University of Perugia)

Bengt Nilsson (Malmö University)

Arnau Padrol (Sorbonne Université)

Leonidas Palios (University of Ioannina)

Irene Parada (Utrecht University)

Pablo Pérez-Lantero (University of Santiago, Chile)

Valentin Polishchuk (Linköping University)

Maria Saumell (Czech Technical University in Prague)

Marko Savić (University of Novi Sad)

Manfred Scheucher (TU Berlin)

Lena Schlipf (Universität Tübingen)

Christiane Schmidt (Linköping University)

Dominique Schmitt (Université de Haute Alsace)

Patrick Schnider (ETH Zürich)

André Schulz (FernUniversität in Hagen)

Carlos Seara (Universitat Politècnica de Catalunya), CO-CHAIR

Fabian Stehn (Universität Bayreuth)

Paweł Żyliński (University of Gdańsk)

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

Organizing Committee

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


Andrea de las Heras (U. Politècnica de Catalunya)

Guillermo Esteban (U. de Alcalá & Carleton U.)

Delia Garijo (U. de Sevilla)

Clemens Huemer (U. Politècnica de Catalunya)

Mercè Mora (U. Politècnica de Catalunya)

Nicolau Oliver Burwitz (U. Politècnica de Catalunya)

David Orden (U. de Alcalá)

Carlos Seara (U. Politècnica de Catalunya)

Rodrigo Silveira (U. Politècnica de Catalunya), CHAIR

Looking forward to seeing you in Barcelona.

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

[DMANET] IST Austria: postdoctoral research position in discrete maths

Matthew Kwan's research group at IST Austria has an opening for a postdoctoral researcher. More details (and the application form) can be found at the mathjobs posting:

https://www.mathjobs.org/jobs/list/21614

**********************************************************
*
* 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, November 18, 2022

[DMANET] Six faculty positions in Computer Science at the University of Manitoba

Dear Colleagues,
The Department of Computer Science at the University of Manitoba is seeking six professors for Probationary (Tenure-track) or Tenured positions at the rank of Assistant Professor or Associate Professor, commencing July 1, 2023, or on a date mutually agreed upon. Exceptional candidates at the full Professor level will also be considered. Salary and rank will be commensurate with experience and qualifications.
The Department is seeking scholars with a commitment to excellence in teaching and research, and a collegial approach to departmental affairs. Outstanding candidates in all areas of Computer Science will be considered, with particular emphasis on candidates who will complement or extend the department's strengths: Algorithms and Theory of Computation, Artificial Intelligence and Machine Learning, Bioinformatics, Computational Finance, Data Mining, Human-Computer Interaction, Parallel and Distributed Computing, Privacy and Security. The successful candidate(s) will hold a Ph.D. in Computer Science or a related field by the appointment date. Post-doctoral experience is preferred, and other distinguishing experience will be considered.
Review of applications will commence on December 1, 2022, and will continue until the positions are filled.
More details about the position and instructions for applying can be found at the following URL:
https://viprecprod.ad.umanitoba.ca/default.aspx?REQ_ID=24078

Best regards,
Avery Miller
Associate Professor
Department of Computer Science
University of Manitoba
https://www.cs.umanitoba.ca/~amiller/

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