Wednesday, October 20, 2021

[DMANET] [CFP] Neuroevolution: Methods and Applications

Dear colleagues,

We are organizing an SI entitled Neuroevolution: Methods and Applications
in the journal of Computational Intelligence and Neuroscience of Hindawi
(IF 3.633).

Potential topics include but are not limited to the following:


- Evolutionary computation algorithms, such as enetic algorithm (GA),
particle swarm optimization (PSO), differential evolution (DE), genetic
programming (GP), ant colony optimization (ACO) in combination with ANNs
- Neural networks, such as convolutional neural networks (CNN), long
short-term memory (LSTM), deep belief network (DBN), feedforward neural
networks (FNN), recurrent neural networks (RNN), radial basisfunction
neural networks (RBF) in combination with EC
- Novel algorithms for learning the weights of an ANN, and finding the
proper hyperparameters
- Evolutionary neural architecture
- Novel search mechanisms
- Surrogate assisted neuroevolution
- Novel representations and objective functions
- Hybrid EC/ANN approaches
- Multi-objective neuroevolution
- Analysis of the complexity of neuroevolution
- Landscape analysis by ANN for EC
- Application of neuroevolution in other scientific fields including
image processing and computer vision, text mining and natural language
processing, speech processing, software engineering, time series analysis,
healthcare, cybersecurity, finance and fraud detection, social networks,
recommender systems, and evolutionary robotics



More Information: https://www.hindawi.com/journals/cin/si/450675/

Regards

Dr. Diego Oliva
diegoliva.com <http://www,diegoliva.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] [CFP] Evolutionary computation in Edge, Fog and Cloud computing

Dear colleagues

We are organizing a special session on Evolutionary Computation in Edge,
Fog, and Cloud Computing, as a part of the 25th International Conference on
the Applications of Evolutionary Computation (EvoApplications) at EvoStar
2022.
EvoApplications accepts original research papers (including significant
work-in-progress) on various aspects of applications of Evolutionary
Computation. Accepted papers will appear in the proceedings of
EvoApplications published in the Springer Lecture Notes in Computer Science.

We are looking forward to receiving your submissions.
Deadline: 1st Nov. 2021

More information: http://www.evostar.org/2022/evoapps/ecefcc/

--
Dr. Diego Oliva
diegoliva.com <http://www,diegoliva.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/
*
**********************************************************

Tuesday, October 19, 2021

[DMANET] Postdoc position in Graph Theory at KIT

The Department of Mathematics at the Karlsruhe Institute of Technology, Germany, invites applications for a Postdoctoral Position (Akademische/n Mitarbeiter/in) to work on Graph Theory and Combinatorics.

Young researchers with strong background in discrete mathematics are invited to apply. A Ph.D. in mathematics or theoretical computer science is required. Knowledge and experience in graph theory and combinatorics are expected. Knowledge of English is required and some command of German is desired.

Specific research topics include Ramsey-type problems, graph coloring problems, extremal problems in set systems and posets, extremal problems in graphs. Teaching responsibilities of the position might include up to four academic hours per week.

The intended starting date is April 1, 2022 or earlier. The salary grade is E13. This is a 2-year position. An application should include a curriculum vitae, a publication list, an outline of research interests, and the names of at least two references. Application materials should be sent as a single .pdf file per e-mail to maria.aksenovich@kit.edu with a subject line "Postdoc KIT".

For further inquiries about the positions, please contact Prof. Maria Axenovich: https://www.math.kit.edu/iag6/~axenovich/en

The Karlsruhe Institute of Technology (KIT) is the result of the merger of the University of Karlsruhe and the Research Center, Karlsruhe. It is a unique institution in Germany, which combines the mission of a university with that of a large-scale research center of the Helmholtz Association. With 9400 employees, 25000 students, and an annual budget of EUR 901 million, KIT is one of the largest research and education institutions worldwide. Karlsruhe is centrally located - with direct and quick train connections to major cities such as Paris, Zurich, Amsterdam, Frankfurt, Stuttgart, Cologne, and Munich.


**********************************************************
*
* 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] Industrial PhD studentship at the University of Glasgow

The School of Computing Science at the University of Glasgow is seeking an excellent candidate for an industrially co-funded PhD studentship, together with Huawei Technologies R&D (UK) Ltd. The project, "Approximate counting in graph databases", lies at the interface of theory and practice: the goal is to exploit recent progress in the theoretical algorithm design for counting and sampling problems to address practical challenges in the area of graph databases. Over the course of the PhD, the student will need to develop expertise on both the theoretical side of the project (algorithms and complexity, graph theory, discrete probability) and practical side (coding skills in C/C++/Rust, and an understanding of concurrent data structures/programming, computer architecture, and (transactional) database system internals). The ideal candidate should have prior expertise in at least one of these areas together with some knowledge of the other and strong motivation to assimilate new skills and knowledge.

The studentship will cover home fees and living expenses at the current UKRI rate; for exceptional candidates there may also be the possibility of covering full international fees (to be decided on a case-by-case basis). The student will be encouraged to undertake one or more paid internships working with Huawei Technologies R&D (UK) Ltd during the PhD.

Prospective candidates should in the first instance send a CV to Kitty Meeks (kitty.meeks@glasgow.ac.uk) as soon as possible, and by Friday 12th November at the latest.

---
Kitty Meeks

Senior Lecturer

School of Computing Science, University of Glasgow

http://www.dcs.gla.ac.uk/~kitty/

Direct line: +44 (0)141 330 1631


**********************************************************
*
* 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] three-years fixed-term researcher position at the University of Pisa on Local Public Transport Optimization

The Department of Computer Science of the University of Pisa has opened a three-years, fixed-term researcher position (RTD-A) on the project "A contribution to greenhouse emissions reduction by a more efficient Public Local Transport".

The RTD-A position is considered the first significant step of the academic career in Italy. Despite being strictly a fixed-term contract with the duration of three years, it is a staff position giving right of vote in the Council of the Department, full access to labor and pension rights (with a gross salary around 35000 Euro/year), and requiring some teaching duties (about one course per annum). It can also be prolonged for two (but no more than two) years subject to availability of funding and mutual interest.

The position has to be viewed in the context of the multi-decades research collaboration between the Department of Computer Science of the University of Pisa and M.A.I.O.R. S.r.l.

https://www.maior.it/en

The research activity will address decision-making processes in organized systems, with particular focus to, but not exclusively, those relating to Local Public Transport. The research considers all the different phases that characterize the decision-making process: the definition of the problem, its mathematical formalization, the formulation of constraints, objectives and action alternatives, the development of solution algorithms as well as their implementation, evaluation and certification. Besides the methodological and theoretical aspects, the research will focus on the development of efficient and well-engineered software implementing the proposed approaches for the solution of either large-scale structured optimization problems or of sub-problems with specific structures that can result from the application of algorithmic methodologies (decomposition, implicit enumeration, large-scale local search, ...) to the original problems. A proper balance will be struck between the development of algorithms for general classes of problems and for the specific problems encountered by M.A.I.O.R. within planning and management (operational and real time) of Local Public Transport systems.

The call can be found at

https://alboufficiale.unipi.it/wp-content/uploads/2021/10/Bando_RTDA_PON_43.pdf

(it's one of 43 positions, check the record RIC2021PON_A19) and the strict deadline for applications is 13:00 November 4, 2021 (Italian time). Selection procedures are expected to be completed before year's end with the position starting around February 2022 at the latest.

Thank you for helping us to disseminate the news to any potentially interested researcher. Further information about the project and the working environment at the Department of Computer Science of the University of Pisa can be requested to Antonio Frangioni <frangio@di.unipi.it> and Laura Galli <galli@di.unipi.it>. In particular, sorry for the call text being Italian-only. A bout of Google Translator or suchlike should be enough to get the gist of it (the important part so far are Articles 2 to 5), but should you need any clarification about the selection procedure do not hesitate to rely on us.

----------------------------------------------------------------------
Youth is friendship, LEGO, SF, assembler, love, and mobile suits


**********************************************************
*
* 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, October 18, 2021

[DMANET] Pre-announcement IWOCA 2022: Save the Dates

IWOCA 2022, 33rd International Workshop on Combinatorial Algorithms, will take place June 7th - 9th, 2022, followed by Graph- and Stringmasters.


Abstract submission: January 6th, 2022

Paper submission: January 11th, 2022


Confirmed invited speakers:

Akanksha Agrawal, IITM Chennai, India

Erik Demaine, MIT Boston, USA


For more information, we refer to the conference webpage:

https://www.uni-trier.de/en/universitaet/fachbereiche-faecher/fachbereich-iv/faecher/informatikwissenschaften/professuren/theoretische-informatik/research/conferences-and-workshops/iwoca-2022


PC chairs / contacts:

Cristina Bazgan cristina.bazgan@lamsade.dauphine.fr

Henning Fernau fernau@uni-trier.de<mailto:fernau@uni-trier.de>


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

[DMANET] Short-term position in optimisation for last-mile delivery

We have a short-term position (Nov-Dec 2021) at the Barcelona School of Economics. Such a position could be a good filler between, e.g., a PhD and a Post-doc starting next year. Both full-time and part-time is possible. Both in presence (Barcelona, Spain) and remote work is possible.

Link: https://euraxess.ec.europa.eu/jobs/697316

For any info do not hesitate to write to: alberto.santini@bse.eu

Description:

We are looking for a Research Assistant with relevant experience in developing optimisation algorithms. The candidate will work on integrating public transport vehicles in last-mile delivery, i.e., can we transport parcels on urban buses/trams/metro trains? How many of them? What are the disadvantages? How much carbon emissions can we save? Can we still guarantee on-time delivery? These are some of the research questions we tackle.

Skills and abilities:

Demonstrated ability to produce correct, fast and maintainable code in a programming language of their choice (some preference is given to previous experience with C or C++). Please include in your application a link to publicly available code (e.g., a Github profile).

Familiarity with the operational research literature and, in particular, literature on routing problems. Documented previous experience in developing a (meta-)heuristic optimisation algorithm. Publications in the field of operational research, combinatorial optimisation, or similar.

Application process:

Interested candidates should send an email to research@bse.eu with the subject SO2021-10 Research Assistant.

It has to include one single file named SO2021-04 RA Lastname_Firstname.

The file should have:

* 1 page explaining the research interests of the candidate, how he/she meets the specific requirements of the job position, and if he/she has a Spanish working permit. This page is welcome to include a link to sample code written by the candidate (in the past, or for the specific purpose of this application) in a programming language of choice.
* A Curriculum Vitae.
**********************************************************
*
* 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] Crypto Postdoc @ Durham

The Department of Computer Science at Durham University is looking for a
postdoctoral researcher from 1 Jan 2022 to work on an EPSRC project on
topics related to password-hashing algorithms and idealized models of
computation for a period of two years.

We would be interested in applicants holding (or nearing the completion of)
a PhD in Cryptography, Algorithms and Complexity, or Mathematics who have
strong interests in the foundational aspects of crypto, proof techniques,
and definitional work. For those with backgrounds Complexity/Math, the
position would be a good opportunity for transitioning into Cryptography.

Durham is one of the top (and oldest) universities in the UK, and the CS
department hosts one of the strongest Theory groups across the ACiD and
NESTiD groups:

https://algorithmscomplexity.webspace.durham.ac.uk/

https://nestid.webspace.durham.ac.uk/

For informal queries about the position please contact Pooya Farshim:
pooya.farshim@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] Post-Doc Position in Algorithm Engineering

You love algorithms, their analysis and efficient implementation? You
are about to or know somebody who will get their PhD soon and is looking
for a Post-doc position? Then please read on:

We are looking for a highly motivated and bright applicant with a strong
expertise and interest in graph and network algorithms in particular,
and in theoretical computer science in general, to join the Algorithm
Engineering Group Heidelberg at Heidelberg University. We are inviting
applications for a full-time PostDoc position starting on January 1st,
2021 (the exact date is negotiable). The successful candidate has
completed a PhD thesis in the scalable algorithms or a related area in
computer science or mathematics and has demonstrated independence in
conducting research and presenting scientific ideas, supported by
publications in international top-tier peer-reviewed conferences and
journals.

Our group tackles a broad spectrum of scalable graph algorithms in
particular in the context of very large inputs. In general, our research
is based on five pillars: multilevel algorithms, practical
kernelization, parallelization, memetic algorithms as well as dynamic
algorithms that are highly interconnected. To this end, our group
engineers algorithms that improve known methods in practice. Typically,
we release the techniques and algorithms developed as easy-to-use open
source software. Examples include a widely used library of algorithms
for graph partitioning, graph drawing, (weighted) independent sets,
hypergraph partitioning, graph clustering, graph generation, minimum
cuts, process mapping and many more.

Working Area:
A successful candidate will work under the supervision of Prof. Dr.
Christian Schulz in the broad area engineering scalable (graph)
algorithms. The position comes with a lot of flexibility as well as
teaching requirements. We expect a research and a teaching agenda from a
successful applicant. He or she is also given the possibility to carry
out a Habilitation.

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

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

Please *forward this email to anyone who may be interested* or send your
application documents (cover letter, CV, copies of certificates,
research agenda, teaching agenda, two references that we can contact for
letter of recommendations) to the address below. To receive full
consideration, submit the documents via *email* by November 15th, 2021 to:

Univ.-Prof. PD. Dr. Christian Schulz

Algorithm Engineering
Heidelberg University
Telephone: +49 (0) 6221 54- 14342
E-Mail: christian.schulz@informatik.uni-heidelberg.de

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

[DMANET] Computational optimization

Call for Papers

17th International Workshop on Computational Optimization (WCO22)
Sofia, Bulgaria, September 4-7, 2022

organized in the framework of CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2022

IEEE CS is a technical co-sponsor of FedCSIS 2022

https://fedcsis.org/2022/wco

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

We invite original contributions related to both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing techniques
and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are not
limited to:

* classical operational research problems (knapsack, traveling salesman,
etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics, chemistry,
biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best WCO22 paper will be awarded during the social dinner of
FedCSIS2022.
The best paper will be selected by WCO22 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular paper
and 4 pages for short papers (IEEE style). IEEE style templates are
available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at WCO21 will be published
in edited book of the series "Studies of Computational Intelligence",
Springer with SJR 183.

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

Important dates:


+ Paper submission (strict deadline): May 10, 2022, 23:59:59 pm HST (there
will be no extension)
+ Position paper submission: June 07, 2022
+ Author notification: July 06, 2022
+ Final paper submission and registration: July 12, 2022
+ Payment: August: 02, 2022
+ Conference date: September 02-05, 2022

===============================================================================
Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2022@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* 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, October 17, 2021

[DMANET] XVII Summer School in Discrete Mathematics (virtual)

XVII Summer School in Discrete Mathematics (virtual)
http://eventos.cmm.uchile.cl/discretas2022/
Dates: January 17-21, 2022
------------------------------------------------------------

TARGET AUDIENCE
The school is aimed at mathematics, science and engineering students
with interests in algorithms, theory of computing, combinatorics,
optimization, game theory, and their applications. The courses are oriented
towards advanced undergraduate and graduate level.
------------------------------------------------------------

COURSES
* "Prophets, Secretaries, and other online puzzles"*
Shuchi Chawla
University of Texas Austin, USA

*"TBA"*
Christian Reiher,
University of Hamburg, Germany

* "Submodular functions in combinatorial optimization"*
Jan Vondrak
Stanford University, USA

More information can be found on the website of the school
http://eventos.cmm.uchile.cl/discretas2022/
------------------------------------------------------------

APPLICATION
The application form is available at
http://eventos.cmm.uchile.cl/discretas2022/postulaciones/
The application starts October 15 and ends December 12, 2021

**********************************************************
*
* 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 and Ph.D. Student Positions in Symbolic Algorithms - University of Bergen (Norway) - Deadline 14/Nov/2021 (2nd Call for Applications)

Symbolic algorithms are algorithms where the input data is represented
implicitly. Such algorithms are particularly relevant in contexts where the
data to be processed is too large to be specified in an explicit form. The
Algorithms Group at the University of Bergen (Norway) has currently two
open positions in the field of symbolic algorithms. These positions are
financed by the project "Symbolic Algorithms: A Parameterized Approach", a
12 Million NOK research project funded by the Research Council of Norway
under the Ground Breaking Research framework.

Postdoc Position - 3-year position with an initial salary of 535,500 NOK
per year (approx 52,500 EUR per year) before taxes.

Ph.D. Position - 3-year position, with the possibility of a fourth year, if
teaching is involved. Initial salary: 491,200 NOK per year (approx 48,000
EUR per year) before taxes.

Applicants for the Ph.D. student position should have a master's degree (or
obtain a master's degree before 31/01/2022) and a strong background in a
related subfield of theoretical computer science. Applicants for the
Postdoc position should have in addition, a Ph.D. degree (or obtain a Ph.D.
degree before 31/01/2022) and a strong publication record in some related
subfield of theoretical computer science. Examples of fields of relevance
to the position are: algorithms, graph theory, combinatorics, automata
theory, type theory, etc.
For more information, please contact the project leader, Mateus de Oliveira
Oliveira (mateus.oliveira@uib.no). The links for the official announcements
of the positions are given below.

Postdoc position:
https://www.jobbnorge.no/en/available-jobs/job/212553/postdoctoral-research-fellow-position-within-informatics-symbolic-algorithms

Ph.D. student position:
https://www.jobbnorge.no/en/available-jobs/job/212570/phd-research-fellow-in-informatics-symbolic-algorithms

-------------------------------------------------------------------
Mateus de Oliveira Oliveira
Researcher
Department of Informatics - University of Bergen
mateus.oliveira@uib.no
https://autoproving.org/mateus-de-oliveira-oliveira

**********************************************************
*
* 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, October 15, 2021

[DMANET] Multiple vacancies at the University of Melbourne

We have advertised five opportunities to join the top ranked School of Computing and Information Systems in Australia (THES and QS). Please share with your networks and encourage applications.. Full details below.

Algorithmic Fairness:
https://jobs.unimelb.edu.au/en/job/906606/senior-lecturerassociate-professor-in-algorithms-and-fairness

Machine Learning and Systems (two positions):
https://jobs.unimelb.edu.au/caw/en/job/906506/lecturer-or-senior-lecturer-in-machine-learningcomputer-systems
Digital Ethics:
https://jobs.unimelb.edu.au/caw/en/job/906636/senior-lecturerassociate-professor-digital-ethics

Information Systems:
https://jobs.unimelb.edu.au/caw/en/job/904639/lecturersenior-lecturer-information-systems-female-only




Professor Uwe Aickelin | Head of School of Computing and Information Systems
Faculty of Engineering and Information Technology
Level 3, Melbourne Connect – 700 Swanston Street
The University of Melbourne, Victoria 3010 Australia
T: +61 3 8344 3635 E: uwe.aickelin@unimelb.edu.au<mailto:uwe.aickelin@unimelb.edu.au>
http://aickelin.com/ | http://linkedin.com/in/aickelin


**********************************************************
*
* 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] CP2021 - 2nd Call for Registrations

The CP 2021 Program is online !

We are pleased to inform you that the program of the CP 2021 conference is online on the website : https://cp2021.lirmm.fr/schedule <https://cp2021.lirmm.fr/schedule>

Registration is open. Please fill in the form on the website (registration is free but required to attend the conference online) : https://cp2021.lirmm.fr/attendee/registration <https://cp2021.lirmm.fr/attendee/registration>

Don't hesitate to visit the website <https://cp2021.a4cp.org/> to stay informed !

Twitter : @cp2021conf


Don't forget to register yourself to the ACP to get regular information : http://cp2014.a4cp.org/user/register <http://cp2014.a4cp.org/user/register>


**********************************************************
*
* 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] Special Issue: "Artificial Intelligence Approaches for Green Transportation Planning" (Journal of Advanced Transportation; Wiley-Hindawi)

Special Issue: Artificial Intelligence Approaches for Green Transportation
Planning
(Journal of Advanced Transportation; Wiley-Hindawi)
https://www.hindawi.com/journals/jat/si/564025/
Deadline extended: 13 of November of 2021
----------------------------- CALL FOR PAPERS
----------------------------------------

Artificial Intelligence Approaches for Green Transportation Planning

Green and environmentally transport planning is a current challenge for
public and private organizations demanding the implementation of innovative
and advanced transport solutions to reduce environmental and social impacts
in their operations. In this context, current trends are calling for the
incorporation of novel strategies and approaches in transport systems for
reducing energy usage as well as waste and pollution generation. The
consideration of that goal and the connection to this green dimension leads
to the need of developing and reviewing current models and methods in the
light of modern transport solutions and technologies, e.g., energy reuse,
alternative fuels, hybrid and green-energy based vehicles, autonomous
vehicles, collaborative planning, truck platooning, to name a few.

The previous discussion results in a current keen interest in the
development of solutions, approaches, and methodologies that can assist
managers and decision-makers in the design and development of
transportation systems while jointly considering environmental-related
advances. This can be certainly progressed by better collecting,
processing, and using data within quantitative and decision support
approaches. Furthermore, with the incorporation of new smart transport
technologies as well as advances from artificial intelligence such as
machine learning, meta-learning, etc., significant effects can be obtained.
In this way, to properly capture and utilize the full potential of the
latest developments, it is necessary to consider and analyze how artificial
intelligence approaches and decision support systems can jointly foster
efficient and environmentally friendly transport operations.

This special issue aims at examining the current progress on artificial
intelligence approaches for designing, developing, and promoting green and
sustainable transportation systems through optimization, intelligent use of
data, and advanced decision support. This also involves the incorporation
of smart and current transportation solutions, e.g., unmanned and
autonomous vehicles, IoT, truck platooning, etc. Thus, this issue will
provide readers with high-quality contributions exploring and dealing with
transportation problems within the interplay between transportation
management, planning, and green logistics. The scope of this issue,
therefore, will cover relevant research and reviews focusing on the
incorporation and use of advanced transport technologies and artificial
intelligence techniques to support and enhance transport planning while
promoting green development and mitigating negative environmental impacts.

Potential topics include but are not limited to the following:
- Maritime, land, air, and multimodal transportation
- Artificial intelligence techniques for green transport planning
- Quantitative evaluation of green transportation systems
- Theoretical and/or empirical analysis of AI approaches in green
transportation
- Intelligent techniques for online and offline planning
- Joint use of artificial intelligence and mathematical programming
- Sustainability in advanced transportation systems
- Advances in vehicle routing problems within green logistics
- Combination of artificial intelligence and operations research to address
sustainable planning
- Data-driven planning approaches considering environmental-related features
- Smart transport solutions to reduce environmental impacts
- Emerging transport technologies to support synchromodal transport network
planning
- Collaborative transport management to reduce waste and emissions
- Use of autonomous vehicles and their impact to reduce emissions
- Heuristics, metaheuristics, and hyper heuristics-based systems
- Integrating real-time information into the optimization frameworks
- Transportation approaches with shared infrastructure and resources

Submission deadline:
13 November 2021
Papers are published upon acceptance, regardless of the Special Issue
publication date.

Lead Guest Editor:
- Eduardo Lalla-Ruiz, University of Twente, Enschede, Netherlands
e.a.lalla@utwente.nl

Guest Editors:
- Rosa G. González-Ramírez, Universidad de Los Andes Chile, Santiago,
Chile. rgonzalez@uandes.cl
- Carlos Castro, University Federico Santa María, Valparaíso, Chile
carlos.castro@inf.utfsm.cl
- Frederik Schulte, Delft University of Technology, Delft, Netherlands
f.schulte@tudelft.nl

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

[DMANET] Data Scientist (Operational Research) position, UK

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

Data Scientist (Operational Research) position, UK
----------------------------------------------------------------------------------------

Permanent, Nottingham, UK

As part of the on-going expansion of our Data Science and Operational
Research team, Microlise, a leading Transport Management Solutions
Provider, are looking for a Data Scientist specialising in Operational
Research to join us at our Head Office in Nottingham, to support the growth
and exciting projects we are working on!

Our Data Science and Operational Research team consists of five PhD-level
Data Scientists (including one Senior and one Lead), a Junior Data
Scientist and a Senior Research Developer. As a team, we regularly
collaborate with a number of universities on various R&D projects and
MSc/PhD research studies, as well as work on a great variety of
collaborative R&D projects with partners and customers globally in the area
of Operational Research, Predictive modelling, Analytics, and Artificial
Intelligence.

Role & Responsibilities:
- Applying operational research, combinatorial optimisation, heuristics,
computational/artificial intelligence and big data analytics techniques
- Designing and implementing Local Search, Heuristics and Meta-heuristics
algorithms
- Performing exploratory, experimental, analytical and visualisation works
- Complete the analysis, design and build of data models, analytical models
and business and personal insights
- Preparing technical and scientific reports, presentations and patent
applications
- Framing business problems into questions that can be answered through
data analysis, and translating business needs into requirements that can be
understood by technical teams

You can find more details and apply online at:
https://www.microlise.com/careers/job/?jobID=150435

Deadline: 13/11/2021

Please note that we are able to offer visa sponsorship for the right
candidate; if you require sponsorship, please ensure this is stated on your
application.

Interviews will take place whilst the advert is still live. Informal
enquiries are welcome and may be sent to mohammad.mesgarpour@microlise.com


Dr Mohammad Mesgarpour
Head of Data Science and Operational Research
Microlise

**********************************************************
*
* 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, October 14, 2021

[DMANET] Tenure-track position, mathematics of data science, University of California, Davis. Apply by Nov 1

Faculty Positions in Mathematics

University of California, Davis

The Department of Mathematics at the University of California, Davis
invites applications for one Assistant Professor (tenure-track)
faculty position starting July 1, 2022. This position is in the area
of the mathematics of data science.

Minimum qualifications for the position include a Ph.D. or its
equivalent in the Mathematical Sciences or a related field and
demonstrated potential for performance in teaching and research.
Duties include mathematical research, undergraduate and graduate
teaching, and departmental, university and professional service.

Applications include:

Cover Letter,
CV,
Research Statement,
Teaching Statement,
Letters of Reference and
a Statement of Contributions to Diversity.

Additional information about the Department may be found at
http://www.math.ucdavis.edu

Applications will be accepted until the position is filled. To
guarantee full consideration, the application should be received by
November 1, 2021. The application is available through UCRecruit @
https://recruit.ucdavis.edu/JPF04318

The University of California, Davis, is an affirmative action/equal
opportunity employer with a strong institutional commitment to the
achievement of diversity among its faculty and staff.

The University of California is committed to creating and maintaining
a community dedicated to the advancement, application, and
transmission of knowledge and creative endeavors through academic
excellence, where all individuals who participate in University
programs and activities can work and learn together in a safe and
secure environment, free of violence, harassment, discrimination,
exploitation, or intimidation. With this commitment, UC Davis conducts
a reference check on all first choice candidates for Academic Senate
Assistant Professor or Lecturer with Potential for Security of
Employment, Steps 4, 5, or 6, or Acting Professor of Law positions.
The reference check involves contacting the administration of the
applicant's previous institution(s) to ask whether there have been
substantiated findings of misconduct that would violate the
University's Faculty Code of Conduct. To implement this process, UC
Davis requires all applicants for any open search for assistant
professor to complete, sign, and upload the form entitled
"Authorization to Release Information" into RECRUIT as part of their
application. If an applicant does not include the signed authorization
with the application materials, the application will be considered
incomplete, and as with any incomplete application, will not receive
further consideration. Although all applicants for faculty
recruitments must complete the entire application, only finalists
considered for Academic Senate Assistant Professor or Lecturer with
Potential for Security of Employment, Steps 4, 5, or 6, or Acting
Professor of Law positions will be subject to reference checks.

https://www.math.ucdavis.edu/about/employment

--
Dr. Matthias Koeppe . . . . . . . . http://www.math.ucdavis.edu/~mkoeppe
Professor of Mathematics

**********************************************************
*
* 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] 17th International Computer Science Symposium in Russia (CSR 2022): Call for Papers

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

Call for Papers

17th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2022)

June 29-July 3, 2022, St. Petersburg, Russia

https://logic.pdmi.ras.ru/csr2022/

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

CSR is an annual international conference held in Russia and designed to
cover a broad range of topics in Theoretical Computer Science.

The list of previous CSR conferences can be found at
https://logic.pdmi.ras.ru/~csr/

Conference proceedings are published in Springer's Lecture Notes in
Computer Science series.

In 2022, CSR is an official satellite of the International Congress of
Mathematicians

(July 6–14, 2022, St. Petersburg).

IMPORTANT DATES

Deadline for submissions: January 10, 2022

Notification of acceptance: March 10, 2022

Conference dates: June 29-July 3, 2022

TOPICS

include, but are not limited to:

(i) algorithms and data structures

(ii) computational complexity, including hardness of approximation and
parameterized complexity

(iii) randomness in computing, approximation algorithms, fixed-parameter
algorithms

(iv) combinatorial optimization, constraint satisfaction, operations
research

(v) computational geometry

(vi) string algorithms

(vii) formal languages and automata, including applications to
computational linguistics

(viii) codes and cryptography

(ix) combinatorics in computer science

(x) computational biology

(xi) applications of logic to computer science, proof complexity

(xii) database theory

(xiii) distributed computing

(xiv) fundamentals of machine learning, including learning theory,
grammatical inference and neural computing

(xv) computational social choice

(xvi) quantum computing and quantum cryptography

(xvii) theoretical aspects of big data


OPENING LECTURE

Umesh Vazirani (University of California at Berkeley, USA)

PROGRAM COMMITTEE

Alexander Belov (University of Latvia)

Sergio Cabello (University of Ljubljana, Slovenia)

Marco Carmosino (Boston University, USA)

Michael Elkin (Ben-Gurion University of the Negev, Israel)

Edith Elkind (University of Oxford, United Kingdom)

Nathanaël Fijalkow (CNRS, LaBRI, France, and the Alan Turing Institute,
United Kingdom)

Fedor Fomin (University of Bergen, Norway)

Alexander Golovnev (Georgetown University, USA)

Moses Ganardi (MPI-SWS, Germany)

Prahladh Harsha (TIFR, India)

Oded Lachish (University of London, United Kingdom)

Daniel Lokshtanov (University of California Santa Barbara, USA)

Dániel Marx (CISPA Helmholtz Center for Information Security, Germany)

Alexander Okhotin (St. Petersburg State University, Russia)

Madhusudan Parthasarathy (UIUC, USA)

Vladimir Podolskii (Steklov Mathematical Institute & HSE University, Russia)

Svetlana Puzynina (St. Petersburg State University, Russia)

Ramyaa Ramyaa (New Mexico Tech, USA)

Sofya Raskhodnikova (Boston University, USA; Program Committee Chair)

Barna Saha (University of California San Diego, USA)

Jeffrey Shallit (University of Waterloo, Canada)

Alexander Shen (University of Montpellier, France)


ORGANIZERS

Steklov Institute of Mathematics at St. Petersburg of the Russian Academy
of Sciences


SUBMISSIONS

Authors are invited to submit an extended abstract or a full paper of at
most

12 pages in English, not including references, in the LNCS format (LaTeX,
as pdf;

final version with source); instructions are here:

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

Proofs and other material omitted due to space constraints are to be put
into

a clearly marked appendix to be read at discretion of the referees. Papers

must present original (and not previously published) research. Simultaneous

submission to journals or to other conferences with published proceedings is

not allowed. The proceedings of the symposium will be published in
Springer's

LNCS series.

Submissions by PC members will be allowed but will be held to a higher
standard

than non-PC submissions.

Submission server: https://easychair.org/conferences/?conf=csr2022

BEST PAPER AWARDS

There will be awards for the best paper and for the best student paper
sponsored by Springer.


FORMAT

We are carefully watching the situation with the Covid-19 pandemic. We are
hoping to have the conference in person, but it will be possible to
participate in the event online for those who are unable to attend due to
travel restrictions or other circumstances. If the situation in Russia does
not allow us to organize the conference in person, our plan is to hold the
event online at the scheduled dates rather than postponing it.

FURTHER INFORMATION AND CONTACTS

Web: http://logic.pdmi.ras.ru/csr2022/

Email: alexander.s.kulikov@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] Young Researchers in Extremal and Probabilistic Combinatorics - online workshop - October 20-22

An online workshop "Young Researchers in Extremal and Probabilistic
Combinatorics" will be held from October 20-22. There will be excellent
talks each day from 4pm KST (9am in UTC+2) to 8pm KST (1pm in UTC+2).

Zoom ID: 554 788 7710.


More details available here: https://dimag.ibs.re.kr/event/2021-10-20/

**********************************************************
*
* 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, October 13, 2021

[DMANET] CFP: Special Issue "Design of Online and Approximation Algorithms" of Algorithms -- Deadline Extended to 30th November 2021

Dear Colleagues,



We would like to invite scientific articles on the topic "Design of Online and Approximation Algorithms". Online and approximation algorithms require fundamental research in order to deal with situations where the algorithm capability is limited: online algorithms have limited knowledge of the whole input and have to make irrevocable decisions, while approximation algorithms have limited computational power to find an optimal solution. Both problems arise from both theoretical interest and practical concern in a variety of areas.



For this Special Issue of Algorithms, we would like to invite articles on paradigms to design and analyze online and approximation algorithms. We are looking for manuscripts of online/approximation algorithms, competitive analysis and beyond, distributed and parallel approximation/online algorithms, hardness of approximation/competitiveness, parameterized approximation/online algorithms, etc. We welcome manuscripts using different problem-solving frameworks (mathematical programming methods, embeddings and metric space methods, etc.) or approaches that go beyond worst-case analysis.



**The submission deadline is 30th November 2021.**



For more details, please find:

https://www.mdpi.com/journal/algorithms/special_issues/online_approx_algo



Prof. Dr. Prudence W.H. Wong

Dr. Hsiang-Hsuan Liu

Guest Editors


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