Dear All,
We invite submissions of papers on the theory of evolutionary
computation for publication in a special issue of Theoretical Computer
Science, Track C -Theory of Natural Computing.
=====================================
CALL FOR PAPERS
Theoretical Computer Science Special Issue on
Theoretical Foundations of Evolutionary Computation
https://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/special-issue-on-theoretical-foundations-of-evolutionary-com
Submission deadline: December 31, 2021
=====================================
Guest Editors
Per Kristian Lehre, University of Birmingham, U.K.
Aneta Neumann, The University of Adelaide, Australia
Chao Qian, Nanjing University, China
Aim
Evolutionary computation methods such as evolutionary algorithms and
swarm intelligence algorithms have been successfully applied to a wide
range of real-world optimization problems. Conventional optimization
algorithms often require objective functions to be differentiable,
continuous, or convex. However, these assumptions are often not met in
real-world optimization. In contrast, evolutionary computation methods
only assume (zeroth order) black-box access to the objective values of
solutions.
Mimicking natural phenomena, evolutionary computation methods are often
highly randomized and complex, making a theoretical analysis
challenging. During the past two decades, there have been significant
theoretical efforts. This research has brought general theoretical
analysis tools such as fitness levels and drift analysis. These results
provide useful insights into the working principles of evolutionary
computation methods which have helped practitioners design more powerful
algorithms. As evolutionary computation methods are applied to more
complex real-world optimization problems, there is a need to further
understand these methods theoretically. Thus, this special issue aims to
advance the theoretical understanding of evolutionary computation
methods.
Scope
This special issue solicits original, high-quality contributions on the
theory of evolutionary computation. The scope includes, but is not
limited to:
General analytical methods like fitness levels and drift analysis
Exact and approximation runtime analysis
Black-box complexity
Population diversity and dynamics
Variation and selection operators
Self-adaptation
Fitness landscape and problem difficulty analysis
All classes of evolutionary computation methods will be considered
including (but not limited to): evolutionary algorithms, ant colony
optimization, artificial immune systems, particle swarm optimization,
estimation of distribution algorithms and differential evolution. All
problem domains will be considered, including (but not limited to):
discrete and continuous optimization, single-objective and
multi-objective optimization, constrained optimization, and optimization
under uncertainty (e.g., noisy, dynamic and robust optimization).
Planned Schedule
Submission deadline: December 31, 2021
Notification: September 31, 2022
Final paper submission: October 31, 2022
Tentative publication date: 2023
Submission Instructions
Authors should submit their manuscripts to the Theoretical Computer
Science Editorial System (EM) at
https://www.editorialmanager.com/tcs/default.aspx, and indicate "Special
Issue: Theoretical Foundations of Evolutionary Computation" for their
submission.
Contributions should be typeset in PDF format or the system converts
article files to a single PDF file used in the peer-review
process. Editable files (e.g., Word, LaTeX) are required to typeset an
article for final publication, and must comply with TCS's author
guidelines, which can be retrieved from the Elsevier website,
https://www.elsevier.com/journals/theoretical-computer-science/0304-3975/guide-for-authors.
Please feel free to forward this call for submissions to your colleagues/other relevant mailing lists,
and do not hesitate to contact us if you have any questions.
We look forward to your contributions.
Best wishes,
Per Kristian Lehre, Chao Qian and Aneta Neumann
**********************************************************
*
* 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 21, 2021
[DMANET] Tenure-track position in Industrial Engineering, University of Illinois, Urbana-Champaign
The Department of Industrial and Enterprise Systems Engineering (ISE) at the University of Illinois at Urbana-Champaign invites applications for multiple full-time open rank faculty positions with emphases in the following areas: (i) Social, Human and Engineering Systems and (ii) AI, machine learning and optimization. ISE is committed to building a culturally diverse educational environment, with a focus on diversifying the faculty. We are seeking faculty who can teach in these and other areas while contributing to the diversity and excellence in our programs and courses through their research, teaching and service. Senior and mid-career faculty are encouraged to apply, though all qualified candidates will be considered. Endowed Chairs and Professorships for distinguished candidates are available in all research areas of the department including operations research, data analytics, decision and control systems, design and manufacturing, and financial engineering.
The University of Illinois is an Equal Opportunity, Affirmative Action employer that recruits and hires qualified candidates without regard to race, color, religion, sex, sexual orientation, gender identity, age, national origin, disability or veteran status. For more information, visit http://go.illinois.edu/EEO. To learn more about the University commitment to diversity, please visit https://engineering.illinois.edu/about/diversity.html.
Successful candidates are expected to direct graduate students in research, teach in the undergraduate and graduate programs, and develop a strong externally-funded research program. Ideal candidates include those who demonstrate evidence of a commitment to diversity, equity, and inclusion through research, teaching, and/or service endeavors. Successful junior candidates must exhibit exceptional promise and have interests in interdisciplinary research. Mid-career candidates are expected to be emerging leaders in their fields, exhibit a strong record of publication and externally funded research, and participate in interdisciplinary collaborations. Senior candidates must have outstanding track records. Salary will be commensurate with qualifications and experience. All candidates must have a PhD in Industrial, Systems, Electrical, Computer, or Mechanical Engineering, or a closely related discipline by the appointment start date.
Qualified senior candidates may also be considered for tenured Associate Professor and Full Professor positions as part of the Grainger Engineering Breakthroughs Initiative. Over the next few years, more than 35 new endowed professorships and chairs will be established in areas of strategic interest to The Grainger College of Engineering. Such areas include, but are not limited to, bioengineering, big data, quantum information, robotics and machine learning. More information about the Grainger Initiative can be found at https://grainger.illinois.edu/research/grainger-breakthroughs.
Application materials must be submitted online: http://jobs.illinois.edu. The application package should include a statement of teaching and research interests, statement on commitment to diversity, a curriculum vitae with email contact address, a publication list, and names and contact information of four references (no letters), all in a single .pdf file. The statement on diversity should address past and/or potential contributions to diversity, equity, and inclusion through research, teaching, and/or service. To ensure full consideration, applications must be received by December 1, 2021. Early applications are strongly encouraged as interviews may take place during the application period, however, no hiring decision will be made until after the closing date. The proposed start date is August 16, 2022. Questions should be referred to Rachael Coleman at rfoll2@illinois.edu<mailto:rfoll2@illinois.edu>.
--
Karthekeyan Chandrasekaran
Associate Professor
Department of Industrial and Enterprise Engineering
University of Illinois, Urbana-Champaign
https://karthik.ise.illinois.edu/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The University of Illinois is an Equal Opportunity, Affirmative Action employer that recruits and hires qualified candidates without regard to race, color, religion, sex, sexual orientation, gender identity, age, national origin, disability or veteran status. For more information, visit http://go.illinois.edu/EEO. To learn more about the University commitment to diversity, please visit https://engineering.illinois.edu/about/diversity.html.
Successful candidates are expected to direct graduate students in research, teach in the undergraduate and graduate programs, and develop a strong externally-funded research program. Ideal candidates include those who demonstrate evidence of a commitment to diversity, equity, and inclusion through research, teaching, and/or service endeavors. Successful junior candidates must exhibit exceptional promise and have interests in interdisciplinary research. Mid-career candidates are expected to be emerging leaders in their fields, exhibit a strong record of publication and externally funded research, and participate in interdisciplinary collaborations. Senior candidates must have outstanding track records. Salary will be commensurate with qualifications and experience. All candidates must have a PhD in Industrial, Systems, Electrical, Computer, or Mechanical Engineering, or a closely related discipline by the appointment start date.
Qualified senior candidates may also be considered for tenured Associate Professor and Full Professor positions as part of the Grainger Engineering Breakthroughs Initiative. Over the next few years, more than 35 new endowed professorships and chairs will be established in areas of strategic interest to The Grainger College of Engineering. Such areas include, but are not limited to, bioengineering, big data, quantum information, robotics and machine learning. More information about the Grainger Initiative can be found at https://grainger.illinois.edu/research/grainger-breakthroughs.
Application materials must be submitted online: http://jobs.illinois.edu. The application package should include a statement of teaching and research interests, statement on commitment to diversity, a curriculum vitae with email contact address, a publication list, and names and contact information of four references (no letters), all in a single .pdf file. The statement on diversity should address past and/or potential contributions to diversity, equity, and inclusion through research, teaching, and/or service. To ensure full consideration, applications must be received by December 1, 2021. Early applications are strongly encouraged as interviews may take place during the application period, however, no hiring decision will be made until after the closing date. The proposed start date is August 16, 2022. Questions should be referred to Rachael Coleman at rfoll2@illinois.edu<mailto:rfoll2@illinois.edu>.
--
Karthekeyan Chandrasekaran
Associate Professor
Department of Industrial and Enterprise Engineering
University of Illinois, Urbana-Champaign
https://karthik.ise.illinois.edu/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Papers
ECCO XXXV - CO 2022 Joint Conference, June 9-11, 2022
To: dmanet@zpr.uni-koeln.de
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
***************************************************************************=
****
Call for Papers
ECCO XXXV - CO 2022 Joint Conference
June 9=E2=80=9311, 2022, Saint-Petersburg, Russia
https://ecco2022.euro-online.org/
***************************************************************************=
****
ECCO XXXV - CO 2022 Joint Conference will be held in the beautiful city of
St. Petersburg
on June 9-11, 2022, during the white nights season. It will be host=
ed by
St. Petersburg
Department of Steklov Mathematical Institute of the Russian Academy of
Sciences.
ECCO (European Chapter on Combinatorial Optimization) is a Working Group of
EURO
(Association of European Operational Research Societies) that provides an
excellent opportunity
to discuss recent and important issues in Combinatorial Optimization and
its applications.
CO series of biennial symposia, International Symposium on Combinatorial
Optimization,
started in the UK in 1977 with meeting venues alternated between the UK and
continental Europe.
ECCO-CO is an official satellite of the International Congress of
Mathematicians.
IMPORTANT DATES
Abstract submission deadline: March 1, 2022
Notification of acceptance: March 15, 2022
Early registration deadline: March 30, 2022
PLENARY SPEAKERS
Andrea Lodi (=C3=89cole Polytechnique de Montr=C3=A9al)
Nikolaos Matsatsinis (Technical University of Crete)
Ulrich Pferschy (University of Graz)
COMMITTEES
* Program committee: Jacek Blazewicz, Van-Dat Cung, Alain Hertz, Alexander
S. Kulikov (chair),
Silvano Martello, Paolo Toth.
* Organizing committee: Tatiana Belova, Alexander S. Kulikov (chair), Danil
Sagunov,
Anastasia Sofronova, Artur Ryazanov.
ORGANIZERS
Steklov Institute of Mathematics at St. Petersburg of the Russian Academy
of Sciences
Monomax travel agency
SPECIAL ISSUE
A special issue of an international refereed journal containing selected
full length papers
will be dedicated to the conference. The submitted papers will undergo full
peer review.
FINANCIAL AID
The conference budget includes a limited amount of funds for fee waivers
for PhD students from
Eastern Europe presenting their work.
VENUE
The conference is hosted by St. Petersburg Department of V.A. Steklov
Institute of Mathematics
of the Russian Academy of Sciences which is located in the very center of
St. Petersburg.
St. Petersburg is particularly beautiful in the late spring =E2=80=94 early=
summer,
the white nights
season. The city is surrounded by wonderful tsar parks and palaces; an
excursion to one of them
will be a social program of the conference.
FURTHER INFORMATION AND CONTACTS
Web: https://ecco2022.euro-online.org/
Mirror: https://alexanderskulikov.github.io/ecco2022b/
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/
*
**********************************************************
To: dmanet@zpr.uni-koeln.de
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
***************************************************************************=
****
Call for Papers
ECCO XXXV - CO 2022 Joint Conference
June 9=E2=80=9311, 2022, Saint-Petersburg, Russia
https://ecco2022.euro-online.org/
***************************************************************************=
****
ECCO XXXV - CO 2022 Joint Conference will be held in the beautiful city of
St. Petersburg
on June 9-11, 2022, during the white nights season. It will be host=
ed by
St. Petersburg
Department of Steklov Mathematical Institute of the Russian Academy of
Sciences.
ECCO (European Chapter on Combinatorial Optimization) is a Working Group of
EURO
(Association of European Operational Research Societies) that provides an
excellent opportunity
to discuss recent and important issues in Combinatorial Optimization and
its applications.
CO series of biennial symposia, International Symposium on Combinatorial
Optimization,
started in the UK in 1977 with meeting venues alternated between the UK and
continental Europe.
ECCO-CO is an official satellite of the International Congress of
Mathematicians.
IMPORTANT DATES
Abstract submission deadline: March 1, 2022
Notification of acceptance: March 15, 2022
Early registration deadline: March 30, 2022
PLENARY SPEAKERS
Andrea Lodi (=C3=89cole Polytechnique de Montr=C3=A9al)
Nikolaos Matsatsinis (Technical University of Crete)
Ulrich Pferschy (University of Graz)
COMMITTEES
* Program committee: Jacek Blazewicz, Van-Dat Cung, Alain Hertz, Alexander
S. Kulikov (chair),
Silvano Martello, Paolo Toth.
* Organizing committee: Tatiana Belova, Alexander S. Kulikov (chair), Danil
Sagunov,
Anastasia Sofronova, Artur Ryazanov.
ORGANIZERS
Steklov Institute of Mathematics at St. Petersburg of the Russian Academy
of Sciences
Monomax travel agency
SPECIAL ISSUE
A special issue of an international refereed journal containing selected
full length papers
will be dedicated to the conference. The submitted papers will undergo full
peer review.
FINANCIAL AID
The conference budget includes a limited amount of funds for fee waivers
for PhD students from
Eastern Europe presenting their work.
VENUE
The conference is hosted by St. Petersburg Department of V.A. Steklov
Institute of Mathematics
of the Russian Academy of Sciences which is located in the very center of
St. Petersburg.
St. Petersburg is particularly beautiful in the late spring =E2=80=94 early=
summer,
the white nights
season. The city is surrounded by wonderful tsar parks and palaces; an
excursion to one of them
will be a social program of the conference.
FURTHER INFORMATION AND CONTACTS
Web: https://ecco2022.euro-online.org/
Mirror: https://alexanderskulikov.github.io/ecco2022b/
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] Faculty position: full professor in data and business analytics, RWTH Aachen
The RWTH Aachen School of Business and Economics invites applications for a
tenured full/chaired professorship (W3) position in data & business analytics.
We are seeking qualified applicants for teaching and research in the
area of data & business analytics. The position is to be filled at the
earliest possible date. Applicants should work on business/economic
issues that create a data-driven foundation for operational and
strategic decisions in companies, organizations and markets. They will
further enhance the quantitative orientation of the School and will
have demonstrated their expertise through publications in highly
ranked business or economics journals. Applicants will have strong
methodological expertise in the application or further development of
machine learning approaches and/or statistical and econometric methods
in the fields of predictive or prescriptive analytics. Possible
specializations may include fields such as causal inference or deep
learning. Content-related applications can come from all areas of
business and economics.
The successful applicant will be expected to advance the strategic
initiatives of both the School and the University, including the
acquisition of third-party funding. In addition to providing teaching
to students of business administration and business administration and
engineering, the candidate will be expected to engage in new
interdisciplinary teaching programs, e.g. in the areas of business
mathematics or business informatics/information systems.
The requirements include a doctoral degree and additional research
experience, such as a habilitation (post-doctoral lecturing
qualification) or equivalent achievements gained as a university
researcher or professor or in a research position outside academia.
Ability in and commitment to teaching are essential. The application
should include supporting documents regarding success in teaching.
German is not necessary to begin but will be expected as a teaching
language within the first 5 years.
Applicants are also required to provide an approximately 2-page
description of their intended profile relating to how they propose to
connect to and further develop the teaching and research initiatives
of both the School and RWTH Aachen University. We kindly draw your
attention to the fact that the School of Business and Economics is
currently also
seeking a W3 professor in the field of Hybrid Intelligence in Organizations.
The German opening contains a little more info:
https://www.rwth-aachen.de/global/show_document.asp?id=aaaaaaaabfpyohw
Feel free to contact me for any informal inquiries.
--
Prof. Dr. Marco Lübbecke
RWTH Aachen University
Chair of Operations Research
Kackertstrasse 7
D-52072 Aachen
Germany
fon / fax: +49 241 80-93362 / 92369
marco.luebbecke@rwth-aachen.de
www.or.rwth-aachen.de/luebbecke
**********************************************************
*
* 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 20, 2021
[DMANET] Bioinformatics Research Scientist (E13 TV-L) at HPC/A-Lab at Bonn University
What: Bioinformatics Research Scientist, Permanent position 13 TV-L at the High Performance computing & Analytics Lab (HPC/A-Lab) of University of Bonn, Germany
Main tasks: Scientific consulting, support and supervision of researchers as well as independent research in Bioinformatics and high performance computing and analytics in the field of life sciences, especially systems biology and bioinformatics (interdisciplinary bridging function)
Application deadline: November 5, 2021
Details:
The HPC/A-Lab of the Digital Science Center (DiCe) bundles and further strengthens the existing competence in the field of High Performance Computing (HPC) and Analytics at the University of Bonn. It has an important bridging function to support interdisciplinary research activities, especially with the natural sciences, life sciences and neurosciences. A scientific focus of the HPC/A-lab is the close integration of HPC, optimization and data analysis.
Tasks:
- Scientific consulting, support and guidance of researchers as well as independent research in High Performance Computing and Analytics in the field of life sciences, especially systems biology and bioinformatics (interdisciplinary bridging function),
- Representation of the HPC/A-Lab internally and externally,
- development and maintenance of the supra-regional and international research network,
- Participation in the application and implementation of (third-party) projects,
- Resource planning and management, determination of requirement profiles of the cooperation partners,
- Participation in academic self-administration,
- Participation in the implementation of courses.
Your profile:
- Completed scientific university studies (Master) and PhD in systems biology, computational biology, bioinformatics or related fields,
- Experience in scientific research projects and publication of their results,
- deep knowledge and experience in mathematical modeling, simulation, and massively parallel data analysis
- Experience in deployment and/or coordination of mainframe computers and/or specialized HPC architectures,
- Knowledge of modern computer architectures and their suitability for various application profiles,
- experience in programming data- or computationally-intensive methods as well as in experimental evaluation,
- excellent communication skills, both written and spoken (German and Eng- lish),
- experience in teaching, i.e. independent implementation or supervision of teaching events,
- committed, flexible, team-oriented and interested in further education.
We offer:
- Salary classification according to the collective agreement of the federal states 13 TV-L (including special annual payment),
- Opportunity to work on varying and challenging projects in a motivated interdisci- plinary team, with one of the largest employers in the region, job security and loyalty to location,
- Flexible working hours and work arrangements,
- Complementary public service pension plan (VBL),
- Numerous offers of university sports,
- Access to reduced-fare public transport through the possibility to purchase a `VRS-Großkundenticket`,
- Numerous education and training opportunities
Details: https://www.uni-bonn.de/de/universitaet/medien-universitaet/medien-arbeiten-an-der-uni/medien-personalmanagement/pdfs-stellenausschreibungen-wiss.ma/15-21-33_eng.pdf <https://www.uni-bonn.de/de/universitaet/medien-universitaet/medien-arbeiten-an-der-uni/medien-personalmanagement/pdfs-stellenausschreibungen-wiss.ma/15-21-33_eng.pdf>
-------------------------------------------------
Professor Dr. Petra Mutzel
Lehrstuhl für Computational Analytics
Wiss. Leitung HPC/A-Lab am DiCe
Universität Bonn
Institut für Informatik
Abteilung I, R. 2.077
Friedrich-Hirzebruch-Allee 8
(umbenannt von: Endenicher Allee 19A)
53115 Bonn
=======================================
ACHTUNG: NEUE STRASSENBEZEICHNUNG:
neu: Friedrich-Hirzebruch-Allee 8
vorher: Endenicher Allee 19A
=======================================
**********************************************************
*
* 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] Hiring in Distributed Systems, Big Data, Graph algorithms at University of Houston
Assistant Professor positions at University of Houston, Computer Science
(UHCS)
UHCS is hiring researchers working in AI, Distributed Systems, Big Data,
and Graph algorithms.
If your research overlaps with any of these areas, you are highly
encouraged to apply.
Theory researchers focusing on applications in AI, Distributed systems, Big
Data are also encouraged to apply.
There are also multiple other junior faculty openings with focus on
Security, Privacy, and Data Science,
and Healthcare. For more details please see the advertisement at
https://www.uh.edu/nsm/computer-science/people/faculty-search/
If you have any questions, you are encouraged to contact the department
chair, Prof. Shishir Shah
(sshah@central.uh.edu).
Best,
Gopal.
Gopal Pandurangan
http://www.cs.uh.edu/~gopal
**********************************************************
*
* 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/
*
**********************************************************
(UHCS)
UHCS is hiring researchers working in AI, Distributed Systems, Big Data,
and Graph algorithms.
If your research overlaps with any of these areas, you are highly
encouraged to apply.
Theory researchers focusing on applications in AI, Distributed systems, Big
Data are also encouraged to apply.
There are also multiple other junior faculty openings with focus on
Security, Privacy, and Data Science,
and Healthcare. For more details please see the advertisement at
https://www.uh.edu/nsm/computer-science/people/faculty-search/
If you have any questions, you are encouraged to contact the department
chair, Prof. Shishir Shah
(sshah@central.uh.edu).
Best,
Gopal.
Gopal Pandurangan
http://www.cs.uh.edu/~gopal
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PostDoc in Formal Methods and Mathematical Modelling at Aalborg University
PostDoc in Formal Methods and Mathematical Modelling
We are looking for a highly motivated researcher in the area of formal
methods and mathematical modelling. The ideal candidate will have a PhD
degree in computer science or mathematics. She/he is required to
demonstrate a strong background and understanding in at least one of the
following areas:
--- Mathematical modelling via dynamical systems (e.g., differential
equations)
--- Tool development in the area of formal verification (e.g., model
checking)
The position is for up to two years, the tentative starting date is
February 2022 or soon thereafter. Fluent written and verbal
communication skills in English are required, while a knowledge of
Danish is not necessary.
Topic: The envisaged research will focus on the development and
implementation of model abstraction algorithms. The PostDoc will be
supervised by Max Tschaikowski and be a member of the DEIS group led by
Kim G. Larsen. She/he will be expected to perform independent research,
collaborate with team members and help with the supervision of PhD and
MSc students as appropriate.
For an idea about the research, candidates may take a look at the ERODE
tool page (www.erode.eu) and the following publications:
--- L. Cardelli et al. Maximal aggregation of polynomial dynamical
systems. Proceedings of the National Academy of Sciences (PNAS), 2017
--- L. Cardelli et al. ERODE: A tool for the evaluation and reduction of
ordinary differential equations. Tools and Algorithms for the
Construction and Analysis of Systems (TACAS), 2017
Host institution: The Computer Science Department at Aalborg University
takes a leading international position within data management and
quantitative modelling, while Aalborg is a vibrant student city with an
international airport. Denmark took the top spot on the United Nation's
World Happiness Report, 2013 & 2014 & 2016 and came in third in the 2015
report: http://www.https://www.visitdenmark.com/
Application procedure: The applicant must have obtained a PhD degree
before the appointment day. In addition to an academic CV and
recommendation letters, the applicant should provide a short cover
letter which describes applicant's background and research interests.
More specifically, interested applicants should provide the following:
--- Cover letter describing the reasons for applying and qualifications
in relation to the position
--- Current academic CV
--- Research statement (max. 2 pages)
--- Letters of recommendation (2 - 3, can be send by the referees)
--- Copies of relevant certificates (BSc, MSc. and PhD). On request you
could be asked for an official English translation
--- Additional qualifications in relation to the position, e.g., secured
scientific grants, participation in committees, organization of
scientific events etc.
--- Personal data
For any questions concerning the position, please contact Max
Tschaikowski: tschaikowski@cs.aau.dk
Applications should be send by email to Max Tschaikowski no later than
the 1st of December 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] 10th IFAC Triennial Conference MIM in Nantes, 22 to 24 June, 2022
Dear Colleagues:
I Invite youto attend the 10th Triennial IFAC Conference
on /Manufacturing Modelling, Management and Control /(MIM 2022) in
Nantes, June 22-24, 2022
and so celebrate with us in Nantes the/60th Volume Anniversary/ of *IJPR*
(the proceedings will be published by Elsevier and a large number of
papers will be selected
for post-conference publication of extended versions in IJPR and other
journals).
*Please save the dates
*
*and start to prepare your proposals of special sessions and your
contributed papers*.
The previous edition of the conference was in Berlin in 2019 with 740
attendees:
https://blog.hwr-berlin.de/mim2019/
The deadlines for IFAC MIM 2022:
* 25 November 2021: submission of invited sessions
* 25 December 2021 : submission of papers (6 pages in IFAC format)
* 15 February 2022: Notification to authpors/ Start of registration
* 15 March 2022: final paper submission
* 30 April 2022: Early registration rates expire
Sincerely yours,
Prof. Dr. Alexandre Dolgui
General chair of MIM 2022, Vice-chair of IFAC TC 5.2
Prof. Dr. Dmitry Ivanov
IPC chair of MIM 2022, Chair of IFAC TC 5.2
--
____________________________________________________________________________
Alexandre Dolgui, Dr.habil., Ph.D., IISE Fellow,
Professor and Head
Automation, Production and Computer Sciences Dept.
IMT Atlantique, LS2N-CNRS
La Chantrerie, 4, rue Alfred Kastler - B.P. 20722
F-44307 NANTES Cedex 3, France
E-mails:alexandre.dolgui@imt-atlantique.fr
URL:www.researchgate.net/profile/Alexandre_Dolgui
Editor-in-Chief
International Journal of Production Research
https://www.tandfonline.com/toc/tprs20/current
Last Book: Scheduling in industry 4.0 and cloud manufacturing
https://www.springer.com/gp/book/9783030431761#aboutAuthors
Invite you to celebrate the 60th Volume Anniversary of IJPR at
10th IFAC MIM conference, June 22 to 24, Nantes, 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] [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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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/
*
**********************************************************
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
------------------------------------------------------------
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/
*
**********************************************************
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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
