Wednesday, August 31, 2022

[DMANET] 2nd Call for Papers for WABCT 2022

ICS 2022 Workshop on Algorithms, Bioinformatics, and Computation Theory

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

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

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

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

-----------------------
Submission Instructions
-----------------------
Authors are invited to submit high-quality manuscripts reporting original
unpublished research in the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings is
not allowed.
Each submission should consist of the main part of the paper, not exceeding
12 pages (including the title page and the references), plus an optional
clearly marked appendix (to be read at the discretion of the program
committee). Any figure pertaining to the main part of the paper should be
included therein (within the 12 page limit). The first page must include an
indication of whether the paper is eligible for the best student paper
award. Papers that deviate from these guidelines risk being rejected
without consideration of their merits. Submission is through the EasyChair
conference system. The submission process requires registration to create
an EasyChair account prior to submission.

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

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

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

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


+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Due to COVID-19, ICS 2022 will be a hybrid conference with both online and
onsite participants. At least one author of each accepted paper will be
expected to register at the conference and give an onsite talk or an online
talk for the paper.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

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

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

[DMANET] [CFP] CARDINAL 2023 - 1st International Workshop on Cost-effective Algorithms for Robots and Drones In Novel AppLications

CARDINAL 2023 - 1st International Workshop on Cost-effective Algorithms for Robots and Drones In Novel AppLications

January 4-7, 2023
co-located with ICDCN 2023

Website: https://cardinal2023.github.io/ (https://link.getmailspring.com/link/E7230C4C-C4F1-458F-B9A9-61E9C4299B71@getmailspring.com/0?redirect=https%3A%2F%2Fcardinal2023.github.io%2F&recipient=ZG1hbmV0QHpwci51bmkta29lbG4uZGU%3D)
Submission link: https://easychair.org/conferences/submission_new?a=29224148 (https://link.getmailspring.com/link/E7230C4C-C4F1-458F-B9A9-61E9C4299B71@getmailspring.com/1?redirect=https%3A%2F%2Feasychair.org%2Fconferences%2Fsubmission_new%3Fa%3D29224148&recipient=ZG1hbmV0QHpwci51bmkta29lbG4uZGU%3D)

Aims and Scope
Recently, the rapid development of Unmanned Vehicles (UVs) such as Unmanned Ground Vehicles (UGVs) (i.e., robots) and Unmanned Aerial Vehicles (UAVs) (i.e., drones), has highlighted a myriad of new emergent applications such as infrastructure inspection and surveillance, smart agriculture, monitoring, search and rescue, parcel delivery, communications, and post-disaster recovery, just to mention a few. In all these novel applications, ground and aerial vehicles may jointly work together, and also coexist with ground Internet of Things (IoT) devices. For instance, multiple UGVs can perform particular tasks relying on the IoT sensors' perceived data, while a swarm of UAVs can assist the UGVs relaying the collected data by the UGVs to the base station, in order to infer opportune decisions and take actions. Therefore, efficient data collection and networking algorithms should be devised for.
For this workshop, we are looking for papers that combine the design of novel algorithms and testbed implementations to develop the theoretical foundations for UVs as well as the synergies with IoT devices. The numerous emergent applications raised by IoT may require an interdisciplinary approach, involving techniques from algorithm foundations and different areas, such as computer networks, artificial intelligence, concurrent, parallel and distributed computing, networking, security, digital signal, image and sound processing.

Topics of Interest
- 5G and 6G applications with UVs
- Autonomous sensing via UVs
- Topology monitoring with UVs
- Remote sensing networks via UVs
- Communication protocols of UVs
- Modeling and analysis of UVs
- Precision agriculture and UVs
- UVs for environmental monitoring
- UVs path planning and scheduling
- Parcel delivery using UVs
- Constrained and multi-objectives problems
- Sensors localization with UVs
- UVs tracking techniques
- Cooperative control of multiple UVs
- Cyber-security communications and UVs
- Optimal UV deployment strategies
- Test-beds and experimental results for UVs
- Single- and Multi-UV applications
- Energy-efficient UV communications
- Machine learning for UV communications

Important dates
- Abstract Submission: September 8th, 2022
- Paper Submission: September 15th, 2022
- Acceptance Notification: October 15th, 2022
- Camera Ready: October 31st, 2022


--
**Fai crescere le giovani ricercatrici e i giovani ricercatori*

**con il 5
per mille alla Sapienza
*Scrivi il codice fiscale dell'Università 
*80209930587
Cinque per mille <https://www.uniroma1.it/it/node/23149>*

**********************************************************
*
* 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] Fifth Computational Geometry Challenge - First Announcement

Dear colleagues,

We are happy to announce the Fifth Computational Geometry Challenge,
as part of CG Week in Dallas, TX, USA, June 12-15, 2023.

As in previous years, the objective will be to compute good solutions
to instances of a difficult geometric optimization problem.
The specific problem chosen for the 2023 Challenge is
Minimum Coverage by Convex Polygons, as follows.

Description
Given a geometric region, P, in the plane, which may be
a simple polygon or a polygon with holes.

The task is to cover P with a collection, C_1,…, C_k,
of convex polygons, each contained within P.

Objective
Minimize k, the number of convex polygons in the cover.

Motivation
Optimal coverage problems have an extensive history in
Computational Geometry. In fact, the well-known SoCG logo
shows that an optimal solution to the Minimum Cover by rectangles
may include (rotated) rectangles whose vertices are not among those of the
input polygon P, even in the case that P is an orthogonal simple polygon.
(See reference [1] and https://www.computational-geometry.org/logo.html <https://www.computational-geometry.org/logo.html>.)
It is also relevant in practical contexts, such as surveillance and robot navigation.

The Minimum Cover by Convex Polygons problem is not only NP-hard [2],
but was recently shown to be ∃R-complete [3], which most likely implies
that it is not in the class NP.

Details of the competition (such as benchmark instances, data formats,
and rules for submission and evaluation) will be announced in the coming
weeks. Appropriate steps will be undertaken (e.g., by restricting the
classes of feasible subsets) to ensure straightforward, automated
verification of solutions.

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

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

Instances
A large number and variety of input polygonal regions P will be
provided for the competition. These will be released at a later time.
(See below.)

Credit
This problem was suggested by Dan Halperin, Tel Aviv University.

References
[1] Joseph O'Rourke. "The complexity of computing
minimum convex covers for polygons,"
Proc. 20th Allerton Conf. Commun. Control Comput., 1982, pp. 75-84.
(See https://www.computational-geometry.org/logo.html <https://www.computational-geometry.org/logo.html>)

[2] Joseph C. Culberson and Robert A. Reckhow.
"Covering polygons is hard". Journal of Algorithms 17.1 (1994), pp. 2–44.

[3] Mikkel Abrahamsen. Covering polygons is even harder.
FOCS 2021: 375-386.

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

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

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

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

[DMANET] Deadline Extended: Sept 30, 2022 - MOBILWARE 2022 - 11th International Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications

*** Please accept our apologies if you receive multiple copies of this CFP
***
=========================================================
CALL FOR PAPERS
******************************************************************
MOBILWARE 2022 - 11th International Conference on MOBILe Wireless
MiddleWARE, Operating Systems, and Applications (MOBILware 2022), November
23-25, 2022
Kanazawa, Japan
https://mobilware.eai-conferences.org/2022/
******************************************************************

Call for Papers

*Important Dates*
Full Paper Submission deadline
30 September 2022
Notification deadline
5 October 2022
Camera-ready deadline
25 October 2022
Start of Conference
23 November 2022
End of Conference
25 November 2022

Paper submission:
https://mobilware.eai-conferences.org/2022/submission/

Scope
The era of higher-speed communication, based on technologies such as 5G,
Bluetooth 5.0 and standard-based low-power wide-area network (LPWAN)
protocols, has witnessed their maturities these days. These techniques have
also been adopted in many services in society such as intelligent
environments, autonomous driving, intelligent manufacturing and so on,
allowing brand new applications. On the other hand, it is crucial to ensure
its reliability, adaptivity, and ubiquity with the advancement of software
technology in these communication sectors. In MobilWare 2022, we will
discuss various related topics ranging from communication middleware and
operating systems to networking protocols and applications.
Topics
• Mobile middleware enabling machine-to-machine communication
• Mobile crowdsourcing and people-centric collaborative sensing
• Big data from mobile sensors-generated data streams
• 5G and beyond networks
• Big data and machine learning for networks
• Dynamic spectrum sharing
• Energy efficiency in networks
• Information security and privacy
• Information-centric networking
• Localization and location-based services
• Software-defined networking
• Vehicular networks
• Middleware-aware big data platforms and services
• Data-intensive services for next-generation middleware
• Smart space/city middleware and applications
• Uncertain and imprecise information processing over middleware
• Mobile Middleware services for big data access
• Middleware for mobile cloud computing (e.g., seamless offloading)
• Novel mechanisms for wireless-sensor and home networks
• QoS awareness, adaptation, and fault-tolerance of mobile services
• Modeling, simulation, and performance evaluation of mobile wireless
systems
• Trustworthiness, security, and privacy of mobile and wireless systems
• Opportunistic, delay-tolerant, and store-carry-forward techniques for
mobile and wireless networking
• Location/context-dependent support and services
• Energy-efficient applications, services, and middleware
• Mobility and handoff management
Publication
All registered papers will be submitted for publishing by Springer and made
available through SpringerLink Digital Library: MOBILWARE Conference
Proceedings.
Proceedings will be submitted for inclusion in leading indexing services,
such as Web of Science, Compendex, Scopus, DBLP, EU Digital Library, Google
Scholar, IO-Port, MathSciNet, Inspec, and Zentralblatt MATH.

Paper submission
Papers should be submitted through EAI 'Confy+' system, and have to comply
with the Springer format (see Author's kit section).
• Regular papers should be up to 12-15+ pages in length.
• Short papers should be 6-11 pages in length.

Paper submission:
https://mobilware.eai-conferences.org/2022/submission/

Important dates
Full Paper Submission deadline
30 September 2022
Notification deadline
5 October 2022
Camera-ready deadline
25 October 2022
Start of Conference
23 November 2022
End of Conference
25 November 2022

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

Tuesday, August 30, 2022

[DMANET] MSc/PhD positions in Quantum Computing, Graph Algorithms, Machine Learning, University of Delaware

We are looking for excellent candidates for M.Sc. and Ph.D. positions in
the Department of Computer and Information Sciences at the University of
Delaware. Students will work under the supervision of Dr. Ilya Safro in
three research areas. Some projects will include collaboration with
national labs including internships.

Research Area 1: Quantum computing for graph algorithms, machine
learning, and mathematical optimization. The ideal candidate should have
a basic background in theoretical computer science, discrete
mathematics, algorithms, principles of machine learning, numerical
methods, and linear algebra.

Research Area 2: Graph algorithms, combinatorial scientific computing,
large-scale optimization, network science. The ideal candidate should
have a basic background in algorithms, theoretical computer science and
graph/network libraries (such as Boost Graph Library, GraphBLAS, and
NetworkX).

Research Area 3: AI, machine learning and knowledge discovery with
applications in natural language processing and text mining. The ideal
candidate should have a basic background in machine learning (including
deep learning). Some experience with Tensorflow, Keras or other machine
learning libraries and high-performance computing will be considered as
an advantage.

Apply at academentory.com. Direct link to all positions:
https://academentory.com/prof-profile/06c62703-05ce-46d6-bf54-9957a7286d40

The preliminary screening will be done only at Academentory. Do not
forget to include pdfs with

- cover letter or/and essay
- resume
- grades
- contact details of 2-3 references

The 7th oldest institution of higher education in USA, the University of
Delaware (with about 18,000+ undergraduate and 3,000+ full-time graduate
students) is conveniently situated halfway between Washington, D.C., and
New York City, and about forty minutes away from Baltimore and
Philadelphia. The University is a home to such world-class research
centers as Data Science Institute, Delaware Energy Institute, Delaware
Biotechnology Institute, National Institute for Innovation in
Manufacturing Biopharmaceuticals, and many more. Additional information
about the Department and the University is available at:
www.cis.udel.edu and www.udel.edu/about/, respectively.

P.S. For faculty: feel free to contact me if you are interested in
getting an invitation token to advertise your academic position at
Academentory.com

--
Prof. Ilya Safro
Department of Computer and Information Sciences
Department of Physics and Astronomy
Data Science Institute
University of Delaware
https://www.eecis.udel.edu/~isafro

**********************************************************
*
* 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 Fellowship at Lehigh University

We invite applications for a *three-year postdoctoral fellowship
at Lehigh University* under the supervision of Prof. Ted Ralphs. The
position is funded by a grant from the Office of Naval Research that is
part of a collaboration between Lehigh (under PI Ted Ralphs) and University
of Pittsburgh (under PI Oleg Prokopyev). The project will focus on the
development of new methodology for the solution of bilevel
optimization problems
and related problem classes, including theory, algorithms, and
implementation.

Applications are welcome immediately and will be reviewed on a rolling
basis until a suitable candidate is identified. The starting date is
negotiable, but we would ideally like to identify someone who can start as
soon as possible.

Candidates should have attained a Ph.D or equivalent degree in a
relevant field by the time of starting the position and should have a
strong background in mathematical optimization, particularly
computational work involving software development. Applicants should submit
a cover letter, CV, research statement, and the names of at least three
references by e-mail to ted@lehigh.edu.

Lehigh University is an affirmative action/equal opportunity employer and
does not discriminate on the basis of age, color, disability, gender,
gender identity, genetic information, marital status, national or ethnic
origin, race, religion, sexual orientation, or veteran status.

--
Dr. Ted Ralphs
Professor, Industrial and Systems Engineering
Lehigh University
(610) 628-1280
ted 'at' lehigh 'dot' edu
coral.ie.lehigh.edu/~ted

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

[DMANET] postdoc position

Postdoc position (two years) at Luiss University on the topic

Learning in strategic and stochastic environments

This project lies at the interface of mathematical game theory, algorithmic
game theory, machine learning, optimization, and high-dimensional
probability. Despite its theoretical nature, it will be motivated by
applications in operations management, supply chain, algorithmic mechanism
design, online matching markets, computational social choice, queueing,
networks, etc.

Deadline: September 30, 2022 - 2 p.m. - Central European Summer Time
(CEST), UTC +2

Details available at
https://economiaefinanza.luiss.it/en/research/post-doc-fellowship/research-grants-2022

*******************************************************
Marco Scarsini
Dipartimento di Economia e Finanza
Luiss University
Viale Romania 32
00197 Roma, ITALY

URL: http://docenti.luiss.it/scarsini/

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

Monday, August 29, 2022

[DMANET] Ph. D. positions in Cryptography and Blockchains at UNSW, Sydney

*Ph. D. positions in Applied Cryptography, Post Quantum Cryptography and
Blockchains at UNSW, Sydney*


We are looking for motivated Ph. D. students to work with us on Applied
Cryptography, Post Quantum Cryptography and Blockchain problems at the
School of Computer Science and Engineering, UNSW, Sydney. Some topics are
(but not limited to ) :

- (Verifiable ) Computation and Search on Encrypted Data
- Secure Decentralized Storage
- Post Quantum Cryptography for Blockchains
- Securing the Internet against Quantum Attacks
- Layer-2 scaling solutions for Blockchains
- Interoperable Blockchains
- Attacks on Blockchains and Defences
- Applications such as Cloud Security, IoT security/Privacy, privacy
preserving analytics

The scholarship is in the range of 30k-35K AUD. The projects on post
quantum cryptography are funded by Sydney Quantum Academy
<https://www.sydneyquantum.org/program/sqa-phd-scholarships/>. Exceptional
students will receive financial benefits like medical insurance cover and
relocation costs.

Prospective students are expected to have strong mathematical inclination
and strong background in data structures, discrete mathematics and
algorithms. Candidates with knowledge of cryptography (such as completion
of undergraduate/graduate course or research project) will be preferred.

Open to students who have completed a bachelor's degree or a master's
degree in Computer Science, Mathematics or a related discipline. Candidates
in their final year of study are welcome to apply.

Students will be working in a supportive and collegial environment within
the School of Computer Science and Engineering in UNSW, Sydney.

UNSW, Sydney is one of the founding members of Group of Eight, a coalition
of Australian research-intensive universities and ranks within the Top 50
universities in the world.

Kensington Campus where we are based is around 6 km from Sydney CBD, 2 Km
from the nearest beach, and 8 Km from Sydney International Airport. Sydney
has been constantly ranked among the most livable cities of the world.
Sydney is a nature lover's paradise with beautiful beaches, and vast
stretches of national parks.

*The next application deadline is September 30, 2022. *

Interested students are welcome to contact Dr. Sushmita Ruj at
sushmita.ruj@unsw.edu.au.

--

Sushmita Ruj

Senior Lecturer (equiv. to US Associate Professor)

School of Computer Science and Engineering

University of New South Wales, Sydney

Kensington, NSW 2052
Australia

E: sushmita.ruj@unsw.edu.au

T: +61 2 9348 0960

https://research.unsw.edu.au/people/sushmita-ruj


"7. What we cannot speak about we must pass over in silence.": Ludwig
Wittgenstein, Tractatus Logico-Philosophicus

**********************************************************
*
* 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 and PhD Position at INESC-ID Lisbon (EU SparCity Project)

** Apologies if you received multiple copies of these open positions **

Fully funded Postdoctoral and PhD positions are available at INESC-ID <https://www.inesc-id.pt/ >, Lisbon, Portugal.

Join the research team of Leonel Sousa and Aleksandar Ilic within the EU-HPC SparCity Project <http://sparcity.eu/ >, a forward-looking project with a significant contribution to building Europe's strengths in the application of HPC and related software tools.

These positions aim at investigating efficient algorithms and accelerators for optimising performance and energy efficiency of emerging HPC systems. Special emphasis is given to sparse matrix, tensor and graph computations, while also opening up new application areas in data analytics and deep learning.

The positions are open in the scope of the European Project SparCity (Euro-HPC project No 956213). Opportunities for performing high quality research, as part of a well-known and highly motivated consortium of international researchers and students. Possibilities to collaborate with international industry and academic partners, and perform research visits to other universities or labs.

This positions are full time and extendable until 31st of March 2024. Application deadline: September 9, 2022.

Further details and application procedure can be found at the following links:
• PostDoc Position Call: https://www.euraxess.pt/jobs/797038
• PhD Candidate Call: https://www.euraxess.pt/jobs/797036
------
Aleksandar Ilic
Assistant Professor
INESC-ID (HPCAS Research Group)
Instituto Superior Técnico (IST), University of Lisbon, Portugal

Rua Alves Redol 9, 1000-029 Lisboa, Portugal
Phone: +351 213100300
Website: https://hpcas.inesc-id.pt/~ilic/
**********************************************************
*
* 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/
*
**********************************************************

Re: [DMANET] Workshop "Polytope Diameter and Related Topics"

Dear all,

As announced earlier, Workshop "Polytope Diameter and Related Topics"
will be held online via Zoom on September 2, 2022.

If you are interested in joining the workshop, please register at the
following site.
https://uec-tokyo.zoom.us/meeting/register/tZ0qfuyrqDsiEtLvY3ud3jl__yCaiyWSYpDb


Below is our program (Time in CEST).
8:20- 8:30 Organizer: Introduction to the workshop
8:30- 9:30 Hariharan Narayanan: A Spectral Approach to Polytope Diameter
9:45-10:45 Vincent Pilaud: Diameters of generalizations of the
associahedron
11:00-12:00 Francisco Santos: TBA
12:00-14:00 Lunch and Free Discussion
14:00-15:00 Daniel Dadush: Asymptotic Bounds on the Combinatorial
Diameter of Random Polytopes
15:15-16:15 Jean Cardinal: Flip graphs and polytopes
16:30-17:30 Jesús De Loera: On Polyhedra Parametrizing ALL pivot
rules for the Simplex Method

For further detail, please visit the following website.
http://dopal.cs.uec.ac.jp/okamotoy/misc/2022/pdart.html

Thank you. We are looking forward to your participation.

Best regards,
Yoshio Okamoto
okamotoy@uec.ac.jp


On 2022/07/15 15:42, Yoshio Okamoto wrote:
> Call for Participation
> ===============================================================================
>
> Workshop "Polytope Diameter and Related Topics"
> September 2, 2022
> Online via Zoom
> http://dopal.cs.uec.ac.jp/okamotoy/misc/2022/pdart.html
> ===============================================================================
>
>
> As a part of the research project "Fusion of Computer Science,
> Engineering and Mathematics Approaches for Expanding Combinatorial
> Reconfiguration" (head investigator: Takehiro Ito), we are going to
> organize Workshop "Polytope Diameter and Related Topics" via Zoom on
> September 2 (based on European Timezone), 2022.
>
> A basic idea is to share fundamental concepts and recent trends of
> polytope diameter and related topics. The question on polytope diameter
> is closely related to the performance of a combinatorial algorithm such
> as the simplex method for linear programming. It is a big open problem
> whether there exists a combinatorial polynomial-time algorithm for
> linear programming while known polynomial-time algorithms such as the
> ellipsoid method and the interior-point methods are not considered
> combinatorial. Several algorithmic challenges in linear programming and
> integer programming rely on properties on "diameter". A cerebrated
> conjecture by Hirsch states that the diameter of a convex polytope is
> bounded from above by the number of facets minus the dimension. The
> conjecture was disproved by Santos, but a question still remains that
> the diameter can be bounded by a polynomial of the number of facets and
> the dimension. Furthermore, several questions on combinatorial upper
> bounds for reconfiguration problems are related to polytope diameter.
> For example, the diameter of an associahedron is equal to the maximum
> flip distance between two triangulations of a convex polygon. A
> breakthrough result by Sleator, Tarjan and Thurston gave a lower bound
> for that diameter with hyperbolic geometry, which has been well-known in
> theoretical computer science since it is also related to the rotation
> distance between rooted trees.
>
> This workshop aims at the broad audience of discrete mathematics and
> theoretical computer science, who wish to learn and work on this active
> research area.
>
> The program will be exclusively composed of invited talks. Each talk is
> planned to span one hour, including discussion.
>
> *Registration*
>
> The workshop is held as a Zoom meeting. If you are interested in
> participation, please register yourself at the following site.
> https://uec-tokyo.zoom.us/meeting/register/tZ0qfuyrqDsiEtLvY3ud3jl__yCaiyWSYpDb
>
>
> After registration, the detail will be sent as an email.
>
> Participation is free of charge.
>
> *List of Confirmed Invited Speakers (in alphabetical order)*
>
> -Jean Cardinal (Université Libre de Bruxelles, Belgium)
> -Daniel Dadush (CWI, the Netherlands)
> -Jesús De Loera (University of California, Davis, CA, USA)
> -Hariharan Narayanan (Tata Institute of Fundamental Research, India)
> -Vincent Pilaud (CNRS and École Polytechnique, France)
> -Francisco Santos (University of Cantabria, Spain)
>
> Program and the talk titles will be announced later.
>
> *Organizer*
>
> -Yoshio Okamoto (The University of Electro-Communications, Japan)
>  okamotoy@uec.ac.jp
>
> If you have an inquiry, please send it to the organizer.
>

--
Yoshio Okamoto, Prof. <okamotoy@uec.ac.jp>
Dept. of Computer and Network Engineering
University of Electro-Communications
Chofugaoka 1-5-1, Chofu, Tokyo 182-8585
**********************************************************
*
* 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] Minisymposium "Mathematics and Arts" hybrid from the Annual Meeting of the German Mathematical Society

On September 15th and 16th, there will be the third edition of the
"Minisymposium Mathematics and Arts" at the annual meeting of the German
Mathematical Society. Find the program here:
https://ms-math-computer.science/projects/dmv_math_art_22.html.

For those of you attending the annual meeting, I would like to extend a
warm invitation to drop by.
For those of you not attending, we will stream the talks via Zoom (no
registration to the conference necessary as it is solely the talks from
the minisymposium that are shared).

Please get in touch with me if you want access to the Zoom-link. Looking
forward to seeing many of you (in-place or virtually) at the talks!
--
Dr. Martin Skrodzki
https://ms-math-computer.science
Twitter: @msmathcomp
**********************************************************
*
* 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 researcher position at CRIL Lab - Artois University, Lens, France

Dear colleagues,

The CRIL (Lens Computer Science Research Lab - UMR 8188) Lab at University
of Artois (Lens) is hiring a one-year postdoctoral researcher to work on
the POSTCRYPTUM project, funded by the Agence Nationale de Recherche (ANR)
and AID/DGA. This is a three-years project focused
on algebraic cryptanalysis of public key cryptosystems, focused mainly on
post-quantum schemes.

For more details on the project, please check here:

https://home.mis.u-picardie.fr/~ionica/postcryptum/Welcome.html

The ideal candidate should hold a Phd degree in Computer Science, Symbolic
AI, propositional satisfiability (SAT) and beyond. Skills in one or
several of the following topics will be appreciated:

· SAT solving,

· Problem encodings and reformulation,

· Cryptography,

· Pattern mining and machine learning.

The starting date is flexible, but preferably no later than December

2022.

For more information, please contact us (audemard@cril.fr, *jabbour@cril.fr
<jabbour@cril.fr>, *sais@cril.fr*).*

Best regards,

Gilles Audemard, Said Jabbour & Lakhdar Saïs
Pr. Lakhdar Saïs
---
CRIL <http://www.cril.fr> - CNRS <http://www.cnrs.fr/ins2i/>, UMR 8188
Université d'Artois, Lens
http://www.cril.fr/~sais

**********************************************************
*
* 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 Mathematics (Discrete Optimization) at FAU Erlangen-Nuernberg

The research group Analytics & Mixed-Integer Optimization at
Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Germany,
invites applications for a full-time (100% TV-L E13)

PhD Position in Mathematics (Discrete Optimization)

at the Department of Data Science / Mathematics. The position is to be
filled as soon as possible for an
initial period of three years. The successful applicant will work in a
research project on the

Optimization of Operating Theatre Management in Hospitals

in cooperation with a software company and several hospitals of all care
levels (care level I - III) in Bavaria.
The focus of the research work will be the development of optimization
models
and exact solution methods based on linear and mixed integer programming
(LP / MIP)
for the optimized planning and coordination of processes in operating
theatre management, e.g. (online) scheduling problems.
The mathematical work in this project will focus on the structural
analysis and algorithm development for
these problems, drawing e.g. upon polyhedral analysis, graph theory and
decomposition methods.
The multitude of uncertainties and perturbations in optimization
problems in the field of operating theatre management (deviating
surgical procedure durations, incoming medical emergencies, etc.)
will furthermore require the development of robust or stochastic
optimization approaches as well as the use of online optimization
methods.
The PhD candidate will also be part of a consortium that is funded by
the Federal Ministry of Education and Research
within the framework of the funding programme "KI-basierte
Assistenzsysteme für prozessbegleitende Gesundheitsanwendungen",
see
https://www.interaktive-technologien.de/foerderung/bekanntmachungen/kias.

Applicants should have completed their master studies in mathematics,
ideally with specialization in discrete optimization.
Prior experience with MIPs is desired but not a requirement.
Applicants should have programming experience, e.g. in Python,
and should have experience in the use of optimization solvers like
Gurobi, CPLEX or SCIP.
Fluency in both German and English is required.
We seek excellent, open-minded and team-spirited PhD candidates
who are interested in both the theory of discrete optimization
as well as the practical solution of optimization problems in
cooperation with industry.

The research group Analytics & Mixed-Integer Optimization at FAU
focusses on the development of mathematical optimization models for
industrial applications.
This includes the theoretical analysis of the models, the design and
implementation of efficient solution algorithms
and their transfer into practice.
Especially, we use techniques from mixed-integer linear and non-linear
optimization,
combined with methods from robust, stochastic, multilevel and
combinatorial optimization.
Our application partners come from all sectors of industry, e.g.
logistics and production, mobility or energy systems.
For further information, e.g. about our team and current research
projects, see our homepage:
https://www.edom.fau.de

Please send your complete application documents (motivation letter and
detailed CV preferrably written in German,
certificates, transcript of records for BSc and MSc courses, copy of
bachelor and master thesis, etc.) in electronic form
until 30 September 2022 to:
Alexander.amr.Mueller@fau.de

Postal address:
Alexander Müller
FAU Erlangen-Nuernberg
Lehrstuhl fuer Analytics & Mixed-Integer Optimization
Cauerstrasse 11
91058 Erlangen, Germany
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] RTNS 2023 Call for papers

****************************************
RTNS 2023 Call for Papers
June 7-8, 2023, Dortmund, Germany
https://rtns2023.cs.tu-dortmund.de [1]
****************************************

RTNS is a friendly and inclusive conference with a great sense of
community that presents excellent opportunities for discussion and
collaboration. This 31st occurrence of RTNS is a special one. First,
this 31st edition will be the first occurrence outside France. Second,
RTNS offers now two deadlines: one in September, and a second in
January.

Important dates
****************************************

First round:
Abstract submission: Sept. 18th, 2022
Paper submission: Sept. 22th, 2022
Notification: Nov. 10th, 2022

Second round:
Abstract submission: Jan. 13th, 2023
Paper submission: Jan. 17th, 2023
Notification: Feb. 25th, 2023

Submission link: https://easychair.org/conferences/?conf=rtns2023

Conference date: June 7-8, 2023
Conference location: Dortmund, Germany

Double submission model
****************************************

RTNS 2023 adopts a double submission model, with two rounds.

Submissions done at the first round may be:
* Rejected: no re-submission possible to the second round
* Accepted: accepted papers will receive a DOI, the list will be
published on the conference WEB site, and the author may put an author
version on their own web page. The publication will occur after the
conference.
* Under major revision: the paper may be re-submitted in the second
round and will be evaluated again by the same reviewers.

Submissions done in the second round may be only accepted or rejected.

Scope of the conference
****************************************

Original unpublished papers on all aspects of real-time systems and
networks are welcome. RTNS covers a wide-spectrum of topics in
real-time and embedded systems, including, but not limited to:

* Real-time applications design and evaluation: automotive, avionics,
space, railways, telecommunications, process control, multimedia.
* Real-time aspects of emerging smart systems: cyber-physical systems
and emerging applications, real-time big data, real-time edge/fog and
cloud computing, smart grid.
* Real-time system design and analysis: real-time tasks modeling,
task/message scheduling, evaluation, mixed-criticality systems,
Worst-Case Execution Time (WCET) analysis, quality of service, security,
thermal and power-aware system design.
* Software technologies for real-time systems: model-driven
engineering, programming languages, compilers, WCET-aware compilation
and parallelization strategies, middleware, Real-time Operating Systems
(RTOS), virtualization, and hypervisors.
* Formal specification and verification: application of formal models,
such as model checking, satisfiability modulo theories, or constraint
programming, to solve real-time problems.
* Real-time distributed systems: fault tolerance, time
synchronization, task/messages allocation, adaptability and
reconfiguration, publisher/subscriber protocols, distributed real-time
database.
* Real-time networks: Time-Sensitive Networks (TSN), industrial IoT,
wired and wireless sensor and actuator networks, SDN, 5G, Networks on
Chip (NoC), end-to-end latency analysis.
* Hardware support for real-time systems: hardware/software co-design,
power/temperature-aware techniques, design of predictable hardware,
multi-core and many-core platforms, hardware accelerators, cache-related
issues, interconnect, and memory.

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

Authors are invited to submit English-language research and
application papers representing original, previously unpublished work,
not simultaneously submitted to another journal or conference. The
papers are limited to 10 two-column pages (not including references)
in ACM conference format. The proceedings will be published by well
known editor (ongoing discussions). RTNS accepts only full papers. All
accepted papers can extend to 11 pages (excluding references) with the
extra page only to address reviewers' comments but not to add new
content.

RTNS tends to be a community, not a bunch of individual experts. Then,
authors are invited to present the results in a way such that the main
ideas can be understood by any real-time researcher and lead to
discussions and exchanges.

Authors of outstanding papers will be invited to submit an extended
version of their work to a special issue of the Springer Real-Time
Systems journal [2]. The extended papers must have at least 35% new
content. Best papers and best student papers awards will be presented at
the conference, along with an award for the best presentation.

Organizing Committee
****************************************
* General chair: Jian-Jia Chen, TU Dortmund
* PC co-chairs:
* Marc Boyer, ONERA, France
* Zhishan Guo, NC State University
* Publicity co-chairs:
* Georg von der Brüggen, TU Dortmund
* Nan Guan, City University of Hong Kong
* Web chair: Kuan-Hsun Chen, University of Twente
**********************************************************
*
* 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] Two postdoc positions on Foundations of Data Science, KTH, Sweden

We are looking for 2 postdoctoral researchers in the area of foundations of data science. The positions are in a research team in KTH led by professor Aristides Gionis. The team focuses on developing novel methods to extract knowledge from data, modeling large-scale complex systems, and exploring new application areas in data science. Areas of interest include but are not limited to models and algorithms for knowledge discovery, novel algorithmic and statistical techniques for big data management, optimization for machine learning, analysis of information and social networks, fairness, accountability, and transparency in learning systems. Applicants must have a strong interest in the development of the underlying theory, applications, and methods to distill knowledge from large complex datasets. The advertised positions are funded by Wallenberg AI, Autonomous Systems and Software Program (WASP), Sweden's largest individual research program, and by an ambitious 5-year European Research Council (ERC) Advanced Grant titled REBOUND, which aims to study the phenomena of polarization and echo chambers in online media, and develop methods to mitigate these phenomena. Funding is also provided by H2020 European project SoBigData++. The postdoc positions involve individual and collaborative research, participation in research projects, and interaction with faculty, postdocs, and students. Opportunities to enhance important skills, such as research leadership, teaching, and grant-proposal writing, will also be given.

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

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

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

[DMANET] (2nd Call For papers) WEPA 2022: Workshop on Enumeration Problems and Applications

WEPA 2022: Fifth Workshop on Enumeration Problems and Applications
November  22-25, Clermont-Ferrand (France)


IMPORTANT DATES

*Submission deadline: September 7, 2022 *
Notification: October 5
Registration deadline: October 19
Event:November 22-25


WEBSITE: https://wepa-2022.sciencesconf.org/


AIMS AND SCOPE

WEPA is an international forum for researchers in the area of design,
analysis, experimental evaluation and engineering of algorithms for
enumeration problems. The objective of the workshop is to gather
researchers working in enumeration algorithms, including their
applications in Biology, Data Mining, Logic, and Database. The goal is
to present recent results, identify and explore directions for future
research, and foster collaborations. Some slots will be devoted
for work sessions in small groups.

Submissions to WEPA should describe results in any area of enumeration
problems and including, but not restricted to:
- Applications in Biology, Data Mining, Logic, and Database
- Approximate enumeration and counting
- Combinatorial enumeration and counting (hypergraph dualization,
lattices, functional dependencies,...)
- Input-sensitive algorithms
- Output-sensitive algorithms

This edition will take place in Clermont-Ferrand (France)


INVITED SPEAKERS


* Florent Capelli - LINKS -  University of Lille
* Nofar Carmeli - DI - ENS Paris
* Alessio Conte - University of Pisa - Italy
* Torsten Mütze - Department of Computer Science - University of Warwick
- UK

SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 2
pages (excluding references). Both original research and discussion of
published results are welcome. Submissions are to be made electronically
via EasyChair at the link
https://easychair.org/conferences/?conf=wepa2022


PROGRAM COMMITTEE

* Boros  Endre - Rutgers Business School - USA
* Defrain Oscar -  University Aix Marseille - France
* Golovach Petr - University of Bergen - Norway
* Grossi Roberto - University of Pisa - Italy
* Kimmelfed Benny - Technion - Haïfa - Israel
* Knauer Kolja - University of Barcelona
* Limouzy Vincent - University Clermont Auvergne - France
* Marino Andrea - University of Firrenze - Italy
* Mary Arnaud - University Claude Bernard - Lyon - France
* Nourine Lhouari - University Clermont Auvergne
* Sagot Marie-France - INRIA/University Claude Bernard - Lyon - France
* Strozeki Yann - University Versailles Saint Quentin en Yvelines - France
* Uno Takeaki - NII - Tokyo - Japan
* Wasa Kunihiro - Toyohashi University of Technology - Japan

ORGANIZING COMMITTEE

* Bourdieu Béatrice  - University Clermont Auvergne - France
* Limouzy Vincent  - University Clermont Auvergne - France
* Mary Arnaud - University Claude Bernard - Lyon - France
* Miginiac Séverine - University Clermont Auvergne - France
* Nourine Lhouari - University Clermont Auvergne - France

**********************************************************
*
* 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] Mailing list submission

The research group Analytics & Mixed-Integer Optimization at
Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Germany,
invites applications for a full-time (100% TV-L E13)

PhD Position in Mathematics (Discrete Optimization)

at the Department of Data Science / Mathematics. The position is to be
filled as soon as possible for an
initial period of three years. The successful applicant will work in a
research project on the

Optimization of Operating Theatre Management in Hospitals

in cooperation with a software company and several hospitals of all care
levels (care level I - III) in Bavaria.
The focus of the research work will be the development of optimization
models
and exact solution methods based on linear and mixed integer programming
(LP / MIP)
for the optimized planning and coordination of processes in operating
theatre management, e.g. (online) scheduling problems.
The mathematical work in this project will focus on the structural
analysis and algorithm development for
these problems, drawing e.g. upon polyhedral analysis, graph theory and
decomposition methods.
The multitude of uncertainties and perturbations in optimization
problems in the field of operating theatre management (deviating
surgical procedure durations, incoming medical emergencies, etc.)
will furthermore require the development of robust or stochastic
optimization approaches as well as the use of online optimization
methods.
The PhD candidate will also be part of a consortium that is funded by
the Federal Ministry of Education and Research
within the framework of the funding programme "KI-basierte
Assistenzsysteme für prozessbegleitende Gesundheitsanwendungen",
see
https://www.interaktive-technologien.de/foerderung/bekanntmachungen/kias.

Applicants should have completed their master studies in mathematics,
ideally with specialization in discrete optimization.
Prior experience with MIPs is desired but not a requirement.
Applicants should have programming experience, e.g. in Python,
and should have experience in the use of optimization solvers like
Gurobi, CPLEX or SCIP.
Fluency in both German and English is required.
We seek excellent, open-minded and team-spirited PhD candidates
who are interested in both the theory of discrete optimization
as well as the practical solution of optimization problems in
cooperation with industry.

The research group Analytics & Mixed-Integer Optimization at FAU
focusses on the development of mathematical optimization models for
industrial applications.
This includes the theoretical analysis of the models, the design and
implementation of efficient solution algorithms
and their transfer into practice.
Especially, we use techniques from mixed-integer linear and non-linear
optimization,
combined with methods from robust, stochastic, multilevel and
combinatorial optimization.
Our application partners come from all sectors of industry, e.g.
logistics and production, mobility or energy systems.
For further information, e.g. about our team and current research
projects, see our homepage:
https://www.edom.fau.de

Please send your complete application documents (motivation letter and
detailed CV preferrably written in German,
certificates, transcript of records for BSc and MSc courses, copy of
bachelor and master thesis, etc.) in electronic form
until 30 September 2022 to:
Alexander.amr.Mueller@fau.de

Postal address:
Alexander Müller
FAU Erlangen-Nuernberg
Lehrstuhl fuer Analytics & Mixed-Integer Optimization
Cauerstrasse 11
91058 Erlangen, Germany
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, August 28, 2022

[DMANET] [Deadline Sep. 1][Hybrid Conference] The 2022 IEEE International Conference on Privacy Enhancing Technologies

CFP: The 2022 IEEE International Conference on Privacy Enhancing
Technologies
The 2022 IEEE International Conference on Privacy Computing (IEEE PriComp
2022)
Dec. 15-18, Haikou, China
[Submission Deadline: Sep. 1]
[10+ Special Issues]

IEEE PriComp 2022 supports Virtual Conference for foreign authors out of
China.

http://www.ieee-smart-world.org/2022/pricomp/

PriComp 2022 is the 8th in this series of conferences started in 2015 that
are devoted to algorithms and architectures for Privacy Computing. PriComp
conference provides a forum for academics and practitioners from countries
around the world to exchange ideas for improving the efficiency,
performance, reliability, security and interoperability of Privacy
Computing systems and applications.

Following the traditions of the previous successful PriComp conferences
held in Fuzhou, China (2015); Qingdao, China (2016); Melbourne, Australia
(2017); Boppard, Germany (2018); Canterbury, UK (2019); Hainan, China
(2020) and Xi'an, Shanghai, China (online, 2021); PriComp 2022 will be held
in Haikou, China. PriComp 2022 will focus on an evolving pathway from
privacy protection to privacy computing, by serving as an international
premier forum for engineers and scientists in academia, industry, and
government to address the resulting profound challenges and to present and
discuss their new ideas, research results, applications and experience on
all aspects of privacy computing. The conference of PriComp 2022 is
co-organized by Chinese Information Processing Society of China, Institute
of Information Engineering, CAS, and Hainan University.


==================
Special Issues
==================
All accepted papers will be submitted to IEEE Xplore and Engineering Index
(EI). Best Paper Awards will be presented to high quality papers.
Distinguished papers, after further revisions, will be published in SCI &
EI indexed prestigious journals.
1. Special issue on "Dark side of the Socio-Cyber World: Media
Manipulation, Fake News, and Misinformation", IEEE Transactions on
Computational Social Systems
http://cyber-science.org/2022/assets/files/si/220412_IEEE%20TCSS_SI.pdf
2. Special issue on "Responsible AI in Social Computing", IEEE Transactions
on Computational Social Systems
https://www.ieeesmc.org/images/publications/pdfs/Call_for_Paper_-_SI_on_Responsible_AI_in_Social_Computing.pdf
3. Special issue on "Decentralized Trust Management with Intelligence",
Information Science
https://www.journals.elsevier.com/information-sciences/call-for-papers/decentralized-trust-management-with-intelligence
4. Special issue on "Resource Sustainable Computational and Artificial
Intelligence", IEEE Transactions on Emerging Topics in Computational
Intelligence
5. Special issue on "Smart Blockchain for IoT Trust, Security and Privacy",
IEEE IoT Journal
https://ieee-iotj.org/wp-content/uploads/2022/05/IEEEIoT-SmartBlockchain-TSP.pdf
6. Special issue on "Edge Computing Optimization and Security", Journal of
Systems Architecture
https://www.journals.elsevier.com/journal-of-systems-architecture/call-for-papers/edge-computing-optimization-and-security-vsi-edgeos2022
7. Special issue on "Distributed Learning and Blockchain Enabled
Infrastructures for Next Generation of Big Data Driven Cyber-Physical
Systems", Journal of Systems Architecture
http://cyber-science.org/2022/assets/files/si/JSA_SI_0331.pdf
8. Special issue on "Distributed and Collaborative Learning Empowered Edge
Intelligence in Smart City", ACM Transactions on Sensor Networks
https://dl.acm.org/pb-assets/static_journal_pages/tosn/pdf/ACM_TOSN_CFP1210-1640635690003.pdf
9. Special issue on "Robustness, Privacy, and Forensics in Intelligent
Multimedia Systems" Information Science
https://www.journals.elsevier.com/information-sciences/forthcoming-special-issues/robustness-privacy-and-forensics-in-intelligent-multimedia-systems

** More special issues can be found at:
http://www.ieee-smart-world.org/2022/pricomp/si.php

==================
Important Dates
==================
Paper Submission: September 01, 2022
Author Notification: October 01, 2022
Camera-Ready Submission: October 31, 2022
Conference Date: December 15-18, 2022


==================
Topics of interest include, but are not limited to
==================
- Theories and foundations for privacy computing
- Programming languages and compilers for privacy computing
- Privacy computing models
- Privacy metrics and formalization
- Privacy taxonomies and ontologies
- Privacy information management and engineering
- Privacy operation and modeling
- Data utility and privacy loss
- Cryptography for privacy protection
- Privacy protection based information hiding and sharing
- Data analytics oriented privacy control and protection
- Privacy-aware information collection
- Privacy sensing and distribution
- Combined and comprehensive privacy protection
- Privacy-preserving data publishing
- Private information storage
- Private integration and synergy
- Private information exchange and sharing
- Privacy inference and reasoning
- Internet and web privacy
- Cloud privacy
- Social media privacy
- Mobile privacy
- Location privacy
- IoT privacy
- Behavioral advertising
- Privacy in large ecosystems such as smart cities
- Privacy of AI models and systems
- AI for privacy computing
- Privacy and blockchain
- User-centric privacy protection solutions
- Human factors in privacy computing
- Privacy nudging
- Automated solutions for privacy policies and notices
- Legal issues in privacy computing and other interdisciplinary topics


==================
Paper Submission
==================
All papers need to be submitted electronically through the conference
submission website (https://edas.info/N29960) with PDF format. The
materials presented in the papers should not be published or under
submission elsewhere. Each paper is limited to 8 pages (or 10 pages with
over length charge) including figures and references using IEEE Computer
Society Proceedings Manuscripts style (two columns, single-spaced, 10
fonts). You can confirm the IEEE Computer Society Proceedings Author
Guidelines at the following web page: http://www.computer.org/web/cs-cps/

Manuscript Templates for Conference Proceedings can be found at:
https://www.ieee.org/conferences_events/conferences/publishing/templates.html

Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). At
least one of the authors of any accepted paper is requested to register the
paper at the conference.

==================
Organizing Committee
==================
General Chairs
- Fenghua Li, Institute of Information Engineering, CAS, China
- Laurence T. Yang, Hainan University, China
- Willy Susilo, University of Wollongong, Australia

Program Chairs
- Hui Li, Xidian University, China
- Mamoun Alazab, Charles Darwin University, Australia
- Jun Feng, Huazhong University of Science and Technology, China

Local Chairs
- Weidong Qiu, Shanghai Jiaotong University, China
- Jieren Cheng, Hainan University, China

Publicity Chairs
- Bocheng Ren, Huazhong University of Science and Technology, China
- Xin Nie, Huazhong University of Science and Technology, China
- Peng Tang, Shanghai Jiao Tong University, China

--
Dr. Jun Feng
Huazhong University of Science and Technology
Mobile: +86-18827365073
WeChat: junfeng10001000
E-Mail: junfeng989@gmail.com

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

[DMANET] Call for Participation: Computational Logic Autumn Summit, 19-30 September 2022, Tbilisi, Georgia

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

Computational Logic Autumn Summit (CLAS 2022)

19-30 September 2022, Tbilisi, Georgia

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

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


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


# Conferences


- International Colloquium on Theoretical Aspects of Computing (ICTAC)

- Conference on Intelligent Computer Mathematics (CICM)

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

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

- International Conference on Mathematics of Program Construction (MPC)

- International Conference on Runtime Verification (RV)

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

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


# Schools


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

- International School on Rewriting

- International Tbilisi Summer School in Logic and Language


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

Venue of CLAS

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


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


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

Social Events

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

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


# Excursions


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

- Wine tour in Kartli

- Wine tour in Kakheti

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

# Banquets

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

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

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

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

Friday, August 26, 2022

[DMANET] [Deadline Sep. 1][Virtual Conference] The 8th IEEE International Conference on Privacy Computing [**10+ Special Issues**]

CFP: The 8th IEEE International Conference on Privacy Computing (PriComp
2022)
[10+ Special Issues]
Dec. 15-18, Haikou, China
[Submission Deadline: Sep. 1]
[Hybrid/Virtual Conference]

****PriComp 2022 supports Virtual Conference for foreign authors out of
China. ****


http://www.ieee-smart-world.org/2022/pricomp/


PriComp 2022 is the 8th in this series of conferences started in 2015 that
are devoted to algorithms and architectures for Privacy Computing. PriComp
conference provides a forum for academics and practitioners from countries
around the world to exchange ideas for improving the efficiency,
performance, reliability, security and interoperability of Privacy
Computing systems and applications.

Following the traditions of the previous successful PriComp conferences
held in Fuzhou, China (2015); Qingdao, China (2016); Melbourne, Australia
(2017); Boppard, Germany (2018); Canterbury, UK (2019); Hainan, China
(2020) and Xi'an, Shanghai, China (online, 2021); PriComp 2022 will be held
in Haikou, China. PriComp 2022 will focus on an evolving pathway from
privacy protection to privacy computing, by serving as an international
premier forum for engineers and scientists in academia, industry, and
government to address the resulting profound challenges and to present and
discuss their new ideas, research results, applications and experience on
all aspects of privacy computing. The conference of PriComp 2022 is
co-organized by Chinese Information Processing Society of China, Institute
of Information Engineering, CAS, and Hainan University.


==================
Organizing Committee
==================
General Chairs
- Fenghua Li, Institute of Information Engineering, CAS, China
- Laurence T. Yang, Hainan University, China
- Willy Susilo, University of Wollongong, Australia

Program Chairs
- Hui Li, Xidian University, China
- Mamoun Alazab, Charles Darwin University, Australia
- Jun Feng, Huazhong University of Science and Technology, China

Local Chairs
- Weidong Qiu, Shanghai Jiaotong University, China
- Jieren Cheng, Hainan University, China

Publicity Chairs
- Bocheng Ren, Huazhong University of Science and Technology, China
- Xin Nie, Huazhong University of Science and Technology, China
- Peng Tang, Shanghai Jiao Tong University, China

==================
Topics of interest include, but are not limited to
==================
- Theories and foundations for privacy computing
- Programming languages and compilers for privacy computing
- Privacy computing models
- Privacy metrics and formalization
- Privacy taxonomies and ontologies
- Privacy information management and engineering
- Privacy operation and modeling
- Data utility and privacy loss
- Cryptography for privacy protection
- Privacy protection based information hiding and sharing
- Data analytics oriented privacy control and protection
- Privacy-aware information collection
- Privacy sensing and distribution
- Combined and comprehensive privacy protection
- Privacy-preserving data publishing
- Private information storage
- Private integration and synergy
- Private information exchange and sharing
- Privacy inference and reasoning
- Internet and web privacy
- Cloud privacy
- Social media privacy
- Mobile privacy
- Location privacy
- IoT privacy
- Behavioral advertising
- Privacy in large ecosystems such as smart cities
- Privacy of AI models and systems
- AI for privacy computing
- Privacy and blockchain
- User-centric privacy protection solutions
- Human factors in privacy computing
- Privacy nudging
- Automated solutions for privacy policies and notices
- Legal issues in privacy computing and other interdisciplinary topics

==================
Special Issues
==================
All accepted papers will be submitted to IEEE Xplore and Engineering Index
(EI). Best Paper Awards will be presented to high quality papers.
Distinguished papers, after further revisions, will be published in SCI &
EI indexed prestigious journals.
1. Special issue on "Dark side of the Socio-Cyber World: Media
Manipulation, Fake News, and Misinformation", IEEE Transactions on
Computational Social Systems
http://cyber-science.org/2022/assets/files/si/220412_IEEE%20TCSS_SI.pdf
2. Special issue on "Responsible AI in Social Computing", IEEE Transactions
on Computational Social Systems
https://www.ieeesmc.org/images/publications/pdfs/Call_for_Paper_-_SI_on_Responsible_AI_in_Social_Computing.pdf
3. Special issue on "Decentralized Trust Management with Intelligence",
Information Science
https://www.journals.elsevier.com/information-sciences/call-for-papers/decentralized-trust-management-with-intelligence
4. Special issue on "Resource Sustainable Computational and Artificial
Intelligence", IEEE Transactions on Emerging Topics in Computational
Intelligence
5. Special issue on "Smart Blockchain for IoT Trust, Security and Privacy",
IEEE IoT Journal
https://ieee-iotj.org/wp-content/uploads/2022/05/IEEEIoT-SmartBlockchain-TSP.pdf
6. Special issue on "Edge Computing Optimization and Security", Journal of
Systems Architecture
https://www.journals.elsevier.com/journal-of-systems-architecture/call-for-papers/edge-computing-optimization-and-security-vsi-edgeos2022
7. Special issue on "Distributed Learning and Blockchain Enabled
Infrastructures for Next Generation of Big Data Driven Cyber-Physical
Systems", Journal of Systems Architecture
http://cyber-science.org/2022/assets/files/si/JSA_SI_0331.pdf
8. Special issue on "Distributed and Collaborative Learning Empowered Edge
Intelligence in Smart City", ACM Transactions on Sensor Networks
https://dl.acm.org/pb-assets/static_journal_pages/tosn/pdf/ACM_TOSN_CFP1210-1640635690003.pdf
9. Special issue on "Robustness, Privacy, and Forensics in Intelligent
Multimedia Systems" Information Science
https://www.journals.elsevier.com/information-sciences/forthcoming-special-issues/robustness-privacy-and-forensics-in-intelligent-multimedia-systems

* More special issues can be found at:
http://www.ieee-smart-world.org/2022/pricomp/si.php

==================
Important Dates
==================
Paper Submission: September 01, 2022
Author Notification: October 01, 2022
Camera-Ready Submission: October 31, 2022
Conference Date: December 15-18, 2022

==================
Paper Submission
==================
All papers need to be submitted electronically through the conference
submission website (https://edas.info/N29960) with PDF format. The
materials presented in the papers should not be published or under
submission elsewhere. Each paper is limited to 8 pages (or 10 pages with
over length charge) including figures and references using IEEE Computer
Society Proceedings Manuscripts style (two columns, single-spaced, 10
fonts). You can confirm the IEEE Computer Society Proceedings Author
Guidelines at the following web page: http://www.computer.org/web/cs-cps/

Manuscript Templates for Conference Proceedings can be found at:
https://www.ieee.org/conferences_events/conferences/publishing/templates.html

Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). At
least one of the authors of any accepted paper is requested to register the
paper at the conference.


--
Dr. Jun Feng
Huazhong University of Science and Technology
Mobile: +86-18827365073
WeChat: junfeng10001000
E-Mail: junfeng989@gmail.com

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

[DMANET] PhD-Position in Engineering a Graph Algorithms Library, Uni Rostock

We announce an opening for a PhD- or PostDoc-position in Engineering a
new Graph Algorithms Library for full 3 years. The position begins as
soon as possible and comes with social security and the competitive
salary TV-L E13 100% according to the German public sector (about
50.000-73.000 Euro/year gross, depending on the applicant's qualifications).

The PhD-position will be hosted at the Institute for Computer Science at
the University of Rostock and be supervised by Jens M. Schmidt.
We want to design and implement a new library specialized on very basic
graph algorithms with a focus on speed and highly optimized and scalable
platform-independent code. This shall be done from an algorithm
engineering perspective, be supported by continuous testing and
profiling of the written code, and adaptive to the particular algorithm
that is called. Hence, candidates should have an excellent background in
algorithm engineering, graphs and C++17-programming (ideally
stackoverflow is your regular friend). The position comes with a
teaching load of 4 SWS, which is generally conducted in German, so that
a basic knowledge of the German language is required. Solid English
mathematical writing skills are desirable.

Applicants should submit their application until September 9th on the
official application portal [1] containing
- a curriculum vitae
- a list of publications (if there are any)
- a summary of the (possibly preliminary) thesis (max. 1 page)
- a list of courses and grades, and
- names and emails of one or two references (including thesis advisor)

Informal inquiries about the position can be made by writing to
jens.schmidt (ät) udo.edu.

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

[DMANET] Postdoc Position in Approximation Algorithms, University of Augsburg

The Faculty of Applied Computer Science of Augsburg University (Prof.
Dr. Tobias Mömke) is inviting applications for one

Postdoc

starting at the earliest possible date. The contract will be restricted
to at most one year. Part-time employment is possible. The salary is
based on personal and collectively agreed conditions up to Entgeltgruppe
13 TV-L.

Tasks

- Scientific research on algorithms as part of the DFG project "Novel
Approximation Techniques for Traveling Salesman Problems"

We Offer

- Collaboration in research on up-to-date scientific questions, in
particular within Approximation Algorithms

- Active support for work on individual research questions

- Possibility to attend workshops, conferences and summer schools

We Expect

- A finished PhD degree in Computer Science, Mathematics or another
related subject with experience in the analysis and design of algorithms

- Fun pursuing mathematical scientific work and knowledge transfer

- Ability to work self-sufficiently and good communication skills


The required qualification should be part of the application documents
in form of transcripts. 

The University of Augsburg promotes gender equality at work. Women are
expressly asked to apply. The University of Augsburg particularly
supports the compatibility of family and work. For further information,
please contact the women's representative of the Faculty of Applied
Computer Science. Disabled candidates with otherwise equal suitability,
ability and subject-specific performance will be preferred.

Please compile your application composed of the habitual documents (CV,
transcripts of grades, description of scientific interests, name and
contact details of one or two references) to a single pdf file and
e-mail it to Prof. Dr. Tobias Mömke (moemke@informatik.uni-augsburg.de)
until 

30th September 2022.


Inquiries are welcome and can be directed to Prof. Dr. Tobias Mömke
https://www.uni-augsburg.de/en/fakultaet/fai/informatik/prof/raa/team/tm/

--
Prof. Dr. Tobias Mömke
University of Augsburg
Room 1026, Building N
Universitätsstraße 6a
86159 Augsburg
Germany

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

Thursday, August 25, 2022

[DMANET] ACM/IEEE Workshop on Quantum Computing: Call for papers

Call for papers: ACM/IEEE International Workshop on Quantum Computing

The ACM/IEEE International Workshop on Quantum Computing is a forum that
brings together researchers and practitioners interested in quantum,
hybrid quantum-classical and quantum inspired computing. Sponsored by
ACM and IEEE, the workshop seeks to act as a conduit for the
presentation of recent research results in all areas of quantum
computing. Papers reporting on initial results or work in progress as
well as papers discussing mature research projects or case studies of
deployed systems are sought out. Submissions describing big ideas that
may have significant impact and could lead to interesting discussions at
the workshop are encouraged.

Topics of interest include but are not limited to: quantum algorithms,
applications of quantum computing, quantum machine learning, quantum
optimization, quantum blockchain, quantum software development,
gate-based quantum devices, quantum annealers, digital annealers,
quantum network, quantum security, quantum Internet. The keyword
"quantum" refers to pure quantum, hybrid quantum-classical and quantum
inspired approaches and technologies.

Authors should follow the IEEE guidelines when preparing their
contributions (maximum paper length: 6 pages with 10-pt font:
https://www.ieee.org/conferences/publishing/templates.html).

Workshop website: https://iwqc22.github.io
Submission site: https://easychair.org/conferences/?conf=acmieeequantum22

At least one of the authors of each paper accepted for presentation in
Quantum 2022 must register for the workshop. All papers presented at the
workshop will be included in the IEEE Digital Library.

Important Dates
Deadline for Submission: September 20, 2022, (AOE)
Notifications of Acceptance: October 5, 2022 (AOE)
Camera-ready Paper Submission: October 14, 2022 (AOE, firm)
Workshop Date: December 5, 2022

Workshop Organizers:
Qun Li, William and Mary, USA
Xiaoyuan Liu, Fujitsu Research of America, USA
Ilya Safro, University of Delaware, USA

TPC Members:
Yuri Alexeev, Argonne National Lab
Nai-Hui Chia, Rice University
Lukasz Cincio, Los Alamos National Laboratory
Thang N. Dinh, Virginia Commonwealth University
Yu Du, University of Colorado Denver
Alexey Galda, Menten AI
Dylan Herman, JPMorgan Chase
Rebekah Herrman, University of Tennessee Knoxville
Ang Li, Pacific Northwest National Laboratory
Qun Li, William & Mary
Xiaoyuan Liu, Fujitsu Research USA
Phillip Lotshaw, Oak Ridge National Laboratory
Danylo Lykov, University of Chicago
Catherine McGeoch, DWave
Ilya Safro, University of Delaware
Yiyu Shi, University of Notre Dame
Yuan Su, Microsoft Quantum
Tamás Terlaky, Lehigh University
Davide Venturelli, NASA
Jonathan Wurtz, QuEra Computing

(More TPC committee members will be added soon)

--
Prof. Ilya Safro
Department of Computer and Information Sciences
Department of Physics and Astronomy
Data Science Institute
University of Delaware
https://www.eecis.udel.edu/~isafro

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