Monday, April 4, 2022

[DMANET] Double-Degree PhD Position in Theory of Algorithms

The Combinatorics and Algorithms group of Dr. Ralf Klasing at LaBRI, Université de Bordeaux is inviting applications for a position of a PhD candidate. The position will be co-supervised by Prof. Tobias Mömke at University of Augsburg, Germany, providing the possibility of obtaining a French-German double degree (Cotutelle).
The start of the position is October 2022.

The salary of the successful applicant is around 1300Euro/month after all taxes, including social benefits like healthcare. It is possible to earn an extra 300Euro/month if teaching about 2h/week (most likely only in French however). The position is for 3 years. The position will be mainly located at University of Bordeaux and partially at University of Augsburg.

To get the position, the applicant will have to go through a 2-phase selection process, in the 1st phase, her/his profile will be examined. In the 2nd phase, interviews will be performed.


Tasks

- Scientific research on theory of algorithms, broadly concerning
robust algorithmics for optimization problems in weighted metric graphs. [ https://www.adum.fr/as/ed/voirproposition.pl?langue=&site=edmi&matricule_prop=41324#version ] (Please find additional information at https://www.adum.fr/as/ed/voirproposition.pl?langue=&site=edmi&matricule_prop=41324#version )

We Offer

- International collaboration in research on up-to-date scientific questions, in
particular within Combinatorics and Approximation Algorithms

- Active support for work on individual research questions

- Possibility to attend workshops, conferences and summer schools

We Expect

- A Master's degree in Computer Science, Mathematics or another
related subject, ideally with experience in the analysis and design of algorithms
(finished the latest in October 2022)

- Fun pursuing mathematical scientific work and knowledge transfer

- Ability to work self-sufficiently and good communication skills


Possible research output in form of publications is a plus and should be mentioned in the application.


If you are interested in the position, please apply at


https://www.adum.fr/candidature/index.pl?matricule_prop=


until 09th May 2022.


Inquiries can be directed to Ralf Klasing
https://www.labri.fr/perso/klasing/
or Tobias Mömke
https://www.uni-augsburg.de/en/fakultaet/fai/informatik/prof/raa/team/tm/

**********************************************************
*
* 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] First call for abstracts - British Early Career Mathematicians’ Colloquium (BECMC) 2022

Registration and abstract submissions are now open for the British Early
Career Mathematicians' Colloquium (BECMC).

The BECMC will be held on the 21st - 22nd July 2022 at the University of
Birmingham. This will be a two-day event aimed at PhD students and early
career mathematicians. It offers participants a valuable opportunity to
network with others in their field, gain an insight into the active areas
of research in a wide range of mathematical disciplines, and give a talk in
a relaxed and friendly environment. The deadline for submission of
abstracts will be 20th May 2022 with the deadline for registration being 23
rd June 2022. (For more details, please visit
https://web.mat.bham.ac.uk/BYMC/BECMC22/.)

The committee recognises that the standard of access at academic
conferences across the UK is largely unacceptable. Our team are working to
improve this within their capabilities, both for this BECMC 2022 and for
future conferences. Please see our website for full details about the
accessibility at the conference.

For any questions or concerns, please email the committee on
becmc2022@contacts.bham.ac.uk

*Key dates:*
The BECMC: 21st - 22nd July 2022
The deadline for registration: 23rd June 2022
The deadline for submission of abstracts: 20th May 2022

*First call for abstract submissions to the British Early Career
Mathematicians' Colloquium (BECMC) 2022*

The BECMC will be held on the 21st - 22nd July 2022 at the University of
Birmingham. This will be a two-day event aimed at PhD students and early
career mathematicians. It offers participants a valuable opportunity to
network with others in their field, gain an insight into the active areas
of research in a wide range of mathematical disciplines, and give a talk in
a relaxed and friendly environment. The deadline for submission of
abstracts is *Friday 20**th** May 2022* so please send your abstracts to
becmc2022@contacts.bham.ac.uk. (For more details, please visit
https://web.mat.bham.ac.uk/BYMC/BECMC22/.)

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

[DMANET] PhD position at LIP6, Sorbonne University

A PhD position is available (subject to funding approval) at the
Laboratoire d'informatique de Paris 6 (LIP6) at Sorbonne University, in
Paris, France, starting in September or October 2022. The topic is on
learning-augmented online algorithms, and is addressed to students with
interests predominantly in Theoretical Computer Science. The proposal
can be accessed at the link

https://www.lip6.fr/Spyros.Angelopoulos/online-predictions.pdf

The thesis will be co-supervised by Spyros Angelopoulos and Christoph
Dürr (both CNRS members at LIP6).


Candidate profile:

-- Degree in Computer Science or related discipline such as Operations
Research.

-- Strong background and interest in theoretical analysis of algorithms.
Programming experience and willingness to work with real data may be
considered a plus.


Applications will be considered until the position is filled, with the
expectation that the candidate will be selected in the next few weeks.
No applications will be considered beyond May 1st. Applicants should
submit the following material to spyros.angelopoulos@lip6.fr :


-- Copies of degrees (if in progress, provide expected date of
graduation), and full transcripts of grades.

-- Detailed CV.

-- Cover letter (explaining the motivation behind the application).

-- Names and email addresses of two references (preferably academic).

Spyros Angelopoulos and Christoph Dürr

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

[DMANET] Call for Paper for IJTCS-FAW 2022

International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW 2022 ) will be held on August 15-19, 2022, hosted by City University of Hong Kong. We will cooperate with CSIAM, CCF, and ACM China Council to provide you with a feast of theoretical computer science.
It is the 3rd IJTCS and 16th FAW (originally run as a workshop). FAW is joining IJTCS as the main track selecting high quality submissions together with several new tracks.
The conference website can be found at https://conference.cs.cityu.edu.hk/ijtcs2022/index.html


Four tracks are open for submission. Authors are invited to submit an extended abstract of no more than 12 pages, excluding references and the front page(s) (authors, affiliation, keywords, abstract, ...), presenting original research on the theory of computer science. The specific requirements of submissions may be different in each track. All submissions must be formatted in the LNCS<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines> style and submitted via EquinOCS to the appropriate track of the conference, using the following link:
https://equinocs.springernature.com/service/IJTCS-FAW2022

The use of pdflatex and the LNCS style is mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.
No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) are allowed.
The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.
Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labeled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an online repository such as ArXiv, HAL, ECCC.
Every accepted paper requires at least one author to attend the meeting and deliver the talk.
The following tracks are open for submission this year:
Track A: Algorithmic Game Theory<https://conference.cs.cityu.edu.hk/ijtcs2022/cfp_A.html>
Track B: Game Theory in Blockchain<https://conference.cs.cityu.edu.hk/ijtcs2022/cfp_B.html>
Track G: The 16th Conference on Frontiers of Algorithmic W<https://conference.cs.cityu.edu.hk/ijtcs2022/cfp_G.html>isdom (FAW)
Track H: Computational and Network Economics<https://conference.cs.cityu.edu.hk/ijtcs2022/cfp_H.html>
The submission deadline of IJTCS-FAW 2022 is 15th April, 2021, 11:59 pm anywhere on Earth.
Special Issue
After the conference, selected papers will be invited to special issues in: IEEE Transactions on Network Science and Engineering, Theoretical Computer Science and Journal of Combinatorial Optimization.

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

[DMANET] PhD Scholarship on “Algorithms and Mechanisms for Blockchain”, University of Liverpool, UK.

PhD Scholarship on "Algorithms and Mechanisms for Blockchain" within EPSRC Centre for Doctoral Training (CDT) in Distributed Algorithms, University of Liverpool, UK.


(Application deadline: *** 18 April 2022 ***)


Applications are open for a 4 year fully-funded PhD scholarship in the area of Mathematics and Computer Science and particularly in Algorithmic Mechanism Design for problems inspired by blockchains. We are seeking mathematically oriented and motivated PhD students with a background in theoretical computer science or mathematics.

This PhD project will be based at the Computer Science Department in the University of Liverpool, UK. The successful applicant will be part of the CDT in Distributed Algorithms (https://www.liverpool.ac.uk/distributed-algorithms-cdt/), and will be a member of the Economics and Computation research group (https://www.liverpool.ac.uk/computer-science/research/econ-comp/). Primary academic supervisor will be Professor Piotr Krysta, and academic co-supervisors: Professor Rida Laraki, and Dr Olga Gorelkina.

This PhD project is in partnership with TriliTech (https://trili.tech/), which is a London based company that develops one the global blockchains and cryptocurrencies Tezos. This project will be co-supervised by Mr Arthur Breitman, the creator and funder of the Tezos blockchain.


Full project description:
https://www.liverpool.ac.uk/study/postgraduate-research/studentships/algorithms-mechanisms-blockchain/

Who can apply?


Qualifications: The candidates for the PhD position should have a strong Bachelor or Master's degree (or should be close to obtaining their degree) in computer science, mathematics, or a closely related academic discipline, with a background in at least one of the following fields: Design and Analysis of Algorithms, Optimisation, Randomised Algorithms, Probability Theory. Maturity in mathematics is desired, and prior exposure to game theory/mechanism design or machine learning techniques are a plus but not essential. Good programming skills in a general-purpose programming language are required.
This scholarship is open to Home and International candidates.


How and when to apply?

The deadline for application is *** 18 April 2022 ***. Informal enquiries can be directed to Professor Piotr Krysta (pkrysta@liverpool.ac.uk).

To apply follow this link: https://www.liverpool.ac.uk/distributed-algorithms-cdt/apply/


-----
Professor Piotr Krysta
University of Liverpool
Department of Computer Science
Ashton Building, Ashton Street
Liverpool L69 3BX, U.K.
http://www.csc.liv.ac.uk/~piotr

**********************************************************
*
* 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] DMD 2022 - Last week for submissions

----------------------------------
Discrete Mathematics Days 2022
Santander, Spain,
July 4-6, 2022
http://dmd2022.unican.es
----------------------------------


--------------------------------------------
Last call for submissions
--------------------------------------------

This is a reminder that the deadline for submissions to the Discrete Math Days is this coming Sunday, April 10th.

The Discrete Mathematics Days 2022 will take place at Universidad de Cantabria in Santander (Spain), in July 4-6, 2022. We expect the conference to take place fully on-site.

News:
* Deadline for submission of abstracts is approaching (April 10).
* Registration is open
* Some support for students available.

DMD 2022 is an international conference on current topics in Discrete Mathematics, with focus including (but not limited to):

Algorithms and Complexity
Combinatorics
Coding Theory
Cryptography
Discrete and Computational Geometry
Discrete Optimization
Graph Theory
Location and Related Problems

The previous two editions were held in Sevilla in 2018 (http://congreso.us.es/dmd2018/) and in Barcelona in 2016 (https://web.archive.org/web/20170504215505/http://discretemath.upc.edu/jmda16/), inheriting the tradition of the Jornadas de Matemática Discreta y Algorítmica (JMDA), the Spanish biennial meeting on Discrete Mathematics that has been taking place since 1988. The 2020 edition was intended to take place in Santander but was cancelled/postponed due to the pandemics.

The program consists of four plenary talks, a number of shorter contributed talks in two parallel sessions, and a poster session. The four plenary speakers are already confirmed:
Marthe Bonamy, Université de Bordeaux.
Janos Pach, EPFL Lausanne and Renyi Institute Budapest.
Guillem Perarnau, Universitat Politècnica de Catalunya.
Pascal Schweitzer, TU Darmstadt.

If you wish to contribute a talk or a poster, please submit an extended abstract (at most six pages) ** by April 10, 2022 **. See further instructions at https://dmd2022.unican.es/submission.html

Submissions will be reviewed and accepted by our Program Committee. In order to be accepted for the conference, submissions must contain original and interesting research in the area of discrete mathematics. If too many acceptable talks are received the PC may ask some of them to be presented as posters instead.

The extended abstracts of accepted talks and posters will be made available at the web of the workshop and published electronically by the Editorial of the Universidad de Cantabria, including DOI and ISBN codes.

Important dates
---------------
* Deadline for submitting extended abstracts: April 10, 2022
* Communication of acceptance: May 15, 2022
* Deadline for submitting final versions of accepted contributions: May 31, 2022
* Deadline for early registration and application for support.

For more information please visit our website, http://dmd2022.unican.es

Sincerely,

The organising committee
Francisco Santos Leal (Chair)
Luis Crespo Ruiz,
Ana Isabel Gómez Pérez,
Domingo Gómez Pérez,
Daniel Sadornil Renedo,
Luis Felipe Tabera Alonso,

--
Francisco Santos, francisco.santos@unican.es
Departamento de Matematicas, Estadistica y Computacion
Universidad de Cantabria, E-39005 Santander, SPAIN.
Phone: +34-942-201522 - Fax: +34-942-201402
http://personales.unican.es/santosf


**********************************************************
*
* 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, April 3, 2022

[DMANET] PhD student pos. at HU Berlin in alg. eng. -- new deadline: Apr 12th

You love combinatorial algorithms, their systematic analysis and
efficient implementation? You are about to graduate with an excellent
Master's degree? The research group "Modeling and Analysis of Complex
Systems" at the Dept. of Computer Science of HU Berlin advertises a
4-year PhD student position (pay grade 13 TV-L, 100%) on algorithm
engineering for combinatorial problems, in particular graphs. New
application deadline: April 12th.

More details (in German) at:
https://www.personalabteilung.hu-berlin.de/de/stellenausschreibungen/wissenschaftliche-r-mitarbeiter-in-m-w-d-befristet-fuer-4-jahre-e-13-tv-l-hu-1

Submit your formal application with the relevant documents (preferably
as 1 PDF attachment) to sekr-maks (at) informatik.hu-berlin.de.

Henning Meyerhenke
**********************************************************
*
* 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] CONCUR 2022 - last CFP

CONCUR 2022: last call for papers
==============================

September 12-16, 2022 at the University of Warsaw, Poland

Website: https://concur2022.mimuw.edu.pl/

The purpose of CONCUR 2022, the 33rd International Conference on Concurrency Theory, is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications.


IMPORTANT NOTE CONCERNING THE COVID-19 PANDEMIC

CONCUR 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. This should be definitely decided by the end of June 2022.


INVITED SPEAKERS

Wojciech Czerwiński, University of Warsaw, Poland
Philippa Gardner, Imperial College London, UK
Rupak Majumdar, Max Planck Institute for Software Systems, Germany
Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico, Mexico


CO-LOCATED CONFERENCES

19th International Conference on Quantitative Evaluation of SysTems (QEST 2022)
20th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2022)
27th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2022)


SATELLITE WORKSHOPS

Combined 29th Workshop on Expressiveness in Concurrency / 19th Workshop on Structural Operational Semantics (EXPRESS/SOS 2022)
11th IFIP WG 1.8 Workshop on Trends in Concurrency Theory (TRENDS 2022)
8th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT (SNR 2022)
10th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2022)


IMPORTANT DATES (all dates are AoE)

Abstract Submission: April 18, 2022
Paper Submission: April 25, 2022
Author Response: June 6-8, 2022
Notification: June 25, 2022
Camera Ready: July 9, 2022
Conference(s): September 13-16, 2022
Workshops: September 12, 2022


PAPER SUBMISSION

CONCUR 2022 solicits high quality papers reporting research results and/or experience related to the topics mentioned below. All papers must be original, unpublished, and not submitted for publication elsewhere.

Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.

The CONCUR 2022 proceedings will be published by LIPIcs.

Papers must be submitted electronically as PDF files via EasyChair:
https://easychair.org/conferences?conf=concur2022

Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style.


TOPICS

Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to):

* Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems;

* Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics;

* Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis;

* Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols;

* Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.


AWARDS

In 2022, CONCUR Test-of-Time and best paper awards will be given for the third time. The winners will be announced at the conference.


ORGANIZATION COMMITTEE

Lorenzo Clemente (workshop chair)
Piotrek Hofman
Bartek Klin
Sławek Lasota
Radek Piórkowski (webmaster)


PROGRAM COMMITTEE

C. Aiswarya, Chennai Mathematical Institute, India
S. Akshay, IIT Bombay, India
Shaull Almagor, Technion, Israel
Nathalie Bertrand, INRIA, France
Ilaria Castellani, INRIA, France
Constantin Enea, IRIF, Université de Paris, France
Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany
Blaise Genest, CNRS, France
Rob van Glabbeek, CSIRO, Sydney, Australia
Daniele Gorla, University of Rome La Sapienza, Italy
Jean Goubault-Larrecq, ENS Paris-Saclay, France
Ichiro Hasuo, National Institute of Informatics, Japan
Marcin Jurdzinski, The University of Warwick, UK
Stefan Kiefer, University of Oxford, UK
Bartek Klin, University of Oxford, UK (co-chair)
Barbara König, University of Duisburg-Essen, Germany
Sławomir Lasota, University of Warsaw, Poland (co-chair)
Martin Leucker, University of Lübeck, Germany
Bas Luttik, Eindhoven University of Technology, The Netherlands
P. Madhusudan, University of Illinois at Urbana-Champaign, US
Hernan Melgratti, Universidad de Buenos Aires, Argentina
Anca Muscholl, Bordeaux University, France (co-chair)
Jan Otop, University of Wrocław, Poland
Joel Ouaknine, Max Planck Institute for Software Systems, Germany
Jean-François Raskin, Université libre de Bruxelles, Belgium
Grigore Rosu, University of Illinois at Urbana-Champaign, US
Jurriaan Rot, Radboud University, The Netherlands
Davide Sangiorgi, University of Bologna, Italy
Alexandra Silva, University College London, UK and Cornell University, US
Paweł Sobociński, Tallinn University of Technology, Estonia
Ana Sokolova, University of Salzburg, Austria
Alwen Tiu, The Australian National University, Australia
Frits Vaandrager, Radboud University, The Netherlands
Nobuko Yoshida, Imperial College London, UK
Lijun Zhang, Chinese Academy of Sciences, China


STEERING COMMITTEE

Javier Esparza, TU München, Germany (chair)
Pedro D'Argenio, National University of Cordoba, Argentina
Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands
Joost-Pieter Katoen, RWTH, Germany
Catuscia Palamidessi, INRIA and Ecole Polytechnique, France
Davide Sangiorgi, University of Bologna, Italy
Jiri Srba, Aalborg University, Denmark
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Saturday, April 2, 2022

[DMANET] Global Optimization Workshop 2022 (HUGO22) - Call for Papers

Dear all, please consider attending this Global Optimization Workshop
(GOW). Here's the call for papers. Submission deadline for 4-page
abstracts: April 30. The organizers are trying to ascertain how many people
will attend, so if you're even just considering this workshop, please fill
this "possible attendance" form <https://forms.gle/tdB3XVUn3iM4KqLM7>.
Leo Liberti, CNRS & Ecole Polytechnique
--
Second Call for Papers to HUGO 2020 - XV. Global Optimization Workshop
<https://www.inf.u-szeged.hu/hugo/>

University of Szeged, Szeged, Hungary, 5-8 September 2022, hybrid setting

This workshop organized by the University of Szeged offers a traditional
forum for researchers and practitioners to discuss new issues, challenging
problems, advanced solutions and new trends in global optimization. Since
1985, a tradition of Global Optimization Workshops exists that senior
researchers and PhD students meet in a single-stream session environment to
discuss approaches, algorithms and challenging applications in the field of
global optimization.

You will also have the opportunity to visit Szeged, the sunniest city in
Hungary that is famous for its vibrant atmosphere, spectacular festivals
and last but not least for its internationally acclaimed university. The
University of Szeged gave Albert Szent-Györgyi the Nobel-prize awarded
scientist to the world, and nurtured Katalin Karikó the world renowned
biochemist. We also take great pride in the fact that the University of
Szeged has been the best Hungarian university for several years according
to QS World University Rankings.

The two closest international airports are those of Budapest and Timișoara
(in Romania). We offer some help for the airport transfer that will be
described later.

Plenary speakers:
Inmanuel Bomze, University of Vienna
Marco Locatelli, University of Parma
Ruth Misener, Imperial College London

Grant for young researchers: to renew the tradition to invite young
researchers to the Workshop on Global Optimization we are pleased to
announce that HUGO is offering a number of grants to support participation.
The support includes a waiver on the participation fee and a modest
accommodation in a student dormitory. To apply, send the following
documents as a single pdf by e-mail to hugo@inf.szte.hu: your extended
abstract, your CV, and a letter of recommendation from your supervisor, if
you are a PhD student.

The deadline for the application is the same as for the submission of the
abstract. Successful applicants will be notified together with the
acceptance of their talk. We especially encourage young researchers from
economically weak countries to apply.

Abstract submission: all participants wishing to present a talk at HUGO
2022 should prepare an extended abstract of 4 pages in our LaTeX style <
https://www.inf.u-szeged.hu/hugo/sites/default/files/2022-03/templateHUGO2022.zip>.
Detailed instructions for preparing a manuscript are given in the template.
Submission should be done through EasyChair <
https://easychair.org/conferences/?conf=hugo2022>.

Workshop fee: 300 EUR for on-site participants; it includes lunches, coffee
breaks, proceedings of the abstracts with ISBN, conference dinner, and some
cultural programmes.
150 EUR for online participants; including access to all talks and
discussions and some social programs that can be broadcasted.

Important dates:
Confirmation of participation: asap (please fill in our short form <
https://forms.gle/tdB3XVUn3iM4KqLM7> even if not sure)
Deadline for the submission of extended abstracts: April 30, 2022
Notification of acceptance: May 31, 2022
Camera-ready manuscripts for the proceedings due date: June 30, 2022
Deadline for registration: June 30, 2022

Special Issues:
A special issue of Mathematical Programming B and the Journal of Global
Optimization will be devoted to HUGO 2022. The submission deadlines will be
announced after the meeting.

Organizers:
Boglárka G.-Tóth, Balázs Bánhelyi, Tibor Csendes, Tamás Vinkó
(Institute of Informatics, University of Szeged, Hungary)

Contact: hugo@inf.u-szeged.hu or any of the organizers above

**********************************************************
*
* 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, April 1, 2022

[DMANET] CLAIO 2022 - Second call for papers

SECOND CALL FOR PAPERS - XXI LATIN IBERO-AMERICAN CONFERENCE ON
OPERATIONS RESEARCH

December 12-15, 2022 - University of Buenos Aires, Argentina
https://claio2022.dc.uba.ar

The Latin-Iberoamerican Conference on Operations Research takes place
biennially since 1982 in different Latin American cities and is
sponsored by the Association of Latin-Iberoamerican Operational Research
Societies (ALIO). The main goals of this conference are to further the
exchange of experiences, to establish and deepen ties between
researchers and practitioners in the region, and to help young
undergraduate and graduate students in their professional development.

CLAIO 2022 accepts short abstracts (up to 2000 characters), which must
be submitted in plain text format through our EasyChair space. After the
conference, a special issue in an international journal devoted to full
papers coming from presentations in CLAIO 2022 will be announced. These
full papers will be subjected to a new round of reviews.

The abstract submission is now open, and our EasyChair space can be
accessed through our webpage: https://claio2022.dc.uba.ar

Important dates:

 - Abstract submission closes: April 30th, 2022
 - Notification of acceptance: June 15th, 2022
 - Deadline for early registration: September 30th, 2022
 - CLAIO 2022 Conference: December 12th to 15th, 2022
 - Deadline for full paper submission: April 1st, 2023

We hope to see you in Buenos Aires!

CLAIO 2022 organizing committee


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

[DMANET] 10 PhD Positions in Computer Science at TU Wien, Vienna, Austria

The novel interdisciplinary Marie Skłodowska-Curie COFUND doctoral training programme

LogiCS@TUWien - Logics for Computer Science
http://www.vcla.at/msca


co-funded by the European Commission, offers 10 full-time PhD positions. The program is hosted by TU Wien, one of the most successful technical universities in Europe and the largest one in Austria. The Faculty of Informatics of TU Wien ranks among the top 20% research and teaching institutions in the field worldwide. In the heart of Europe, Vienna has a distinguished history in mathematics, computer science, and logic research and offers one of the highest living standards in the world.

The doctoral positions are open to international high-potential early-stage researchers with interest in working on Logical Methods in Computer Science and their applications, including:

* Artificial Intelligence
* Databases
* Verification
* Algorithms

The programme provides a 4-year long doctoral training for international PhD candidates within an English-language curriculum. LogiCS@TUWien will run for 60 months and foresees the recruitment of a further 10 PhD candidates. These new PhD candidates will each pursue research on one of the available projects (see http://www.vcla.at/msca/topics/) and be supervised by:

* Agata Ciabattoni
* Thomas Eiter
* Georg Gottlob
* Magdalena Ortiz
* Stefan Szeider
* Georg Weissenbacher
* Stefan Woltran
* Florian Zuleger

After filling 10 positions in the first call, this is the second call for another 10 positions applications.

The application deadline for this call is April 30, 2022.

For details on how to apply, see http://www.vcla.at/msca/apply or watch the video at https://youtu.be/Aq0JGJ9eqzQ.

**********************************************************
*
* 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] Registration open for MIP 2022

Registration is open for the Mixed-Integer Workshop MIP 2022, to be held at
DIMACS, Rutgers University, on May 23-26, 2022. Please register at

http://dimacs.rutgers.edu/ws-materials/mip-2022-registration

The fee is 30 USD before April 15 and 45 USD between April 15 and May 15.
Use the link above to register for the conference dinner.

The workshop will feature:
- DANniversary, a one-day conference honoring Dan Bienstock's 60th birthday
(in 2020);
- Three additional days of talks;
- A student poster session;
- Presentations from the best submissions of the MIP 2022 computational
competition.
The MIP 2022 website is https://mixedinteger.org/2022/, while the speakers
are:

* MIP
Manuel Aprile (University of Padova)
Beste Basciftci (University of Iowa)
Sam Burer (University of Iowa)
Marianna De Santis (University of Roma)
Bistra Dilkina (University of Southern California)
Samuel Fiorini (ULB)
Ignacio Grossman (CMU)
Oktay Günlük (Cornell)
Georgina Hall (INSEAD)
Kim-Manuel Klein (University of Kiel)
Christian Kroer (Columbia University)
Yin Tat Lee (University of Washington)
Jean-Philippe Richard (University of Minnesota)
Christopher Thomas Ryan (University of British Columbia)
Nick Sahinidis (Georgia Tech)
Felipe Serrano (I2Damo Gmbh)
Alfredo Torrico (Polytechnique Montréal)
Vera Traub (ETH Zurich)
Laszlo Vegh (LSE)
Juan Pablo Vielma (Google)
Yiling Zhang (University of Minnesota)

* DANniversary
Chen Chen (Ohio State University)
Misha Chertkov (University of Arizona)
Gérard Cornuéjols (CMU)
Jonathan Eckstein (Rutgers University)
Thorsten Koch (ZIB)
Jon Lee (University of Michigan at Ann Arbour)
Leo Liberti (CNRS)
Andrea Lodi (Cornell)
Gonzalo Muñoz (O'Higgins University)
Iraj Saniee (Nokia Bell Labs)
Willem Van Hoeve (CMU)

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

Taking into account the ongoing travel restrictions due to coronavirus, the
conference can be organized as a hybrid event.

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

[DMANET] PhD Studentship in Algorithmic Graph Theory [Deadline extended to 6th April]

The School of Computing at Newcastle University is advertising a PhD studentship on Algorithmic Graph Theory supervised by Dr Konrad Dabrowski.

Application deadline: 6th April 2022
Start Date: September 2022
Award Duration: 3.5 years
Award Summary: 100% of home tuition fees paid, a £1,000 annual research budget and annual stipend of £15,609.

Project description: This project studies classes of graphs both from a structural and an algorithmic point of view. From a structural perspective, the aim is to classify which classes have certain desirable properties, such as having bounded clique-width or being well-quasi-ordered. From an algorithmic perspective, the aim is to study computationally hard problems to systematically pinpoint exactly what type of structure makes such problems easy or hard (both from a classical complexity and a parameterized point of view).

The project tries to do this for many problems simultaneously by using the underlying structure rather than trying to solve problems in an ad hoc way.

As an extreme example, if we consider graphs that have bounded clique and independence number, Ramsey's Theorem tells us that such graphs have bounded size, so computational problems can be solved on them in polynomial (even constant) time. How far can we relax such a condition and maintain the property that large classes of problems are still polynomial-time solvable?

There is scope in the project to study discrete structures more from the perspective of fundamental computer science or more from a mathematical perspective, depending on the candidate's interests.

Eligibility Criteria: You must have, or expect to achieve, at least a 2:1 Honours degree in an appropriate subject e.g. Mathematics or Computer Science and are expected to have excellent mathematical skills as well as an interest in discrete mathematics and/or algorithms. The award is available to applicants with a UK Home fee status only.

How To Apply: Please contact Dr Konrad Dabrowski at konrad.dabrowski@newcastle.ac.uk before making an application. You should include all application documents and write "PhD Studentship in Algorithmic Graph Theory" in the subject line. Suitable candidates will be invited to make an official application in the online portal.

Further details: https://www.ncl.ac.uk/postgraduate/fees-funding/search-funding/?code=comp2115
**********************************************************
*
* 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] EATCS-IPEC Nerode award 2022 - CFN

EATCS-IPEC Nerode Prize - Call for Nominations

Deadline: 15 May, 2022

The EATCS-IPEC Nerode Prize for outstanding papers in the area of
multivariate algorithmics, is presented annually with the presentation
taking place at IPEC (International Symposium on Parameterized and Exact
Computation). IPEC 2022 is due to take place as part of ALGO 2022 on 5-9
September in Potsdam, Germany. The Prize is named in honor of Anil
Nerode in recognition of his major contributions to mathematical logic,
theory of automata, computability and complexity theory.


Award Committee

The winning paper(s) will be selected by the EATCS-IPEC Nerode Prize
Award Committee. This year's committee consists of the following people.

Anuj Dawar, chair (University of Cambridge, anuj.dawar@cl.cam.ac.uk)
Fedor Fomin (University of Bergen, fedor.fomin@uib.no)
Thore Husfeldt (IT University of Copenhagen, thore@itu.dk)

Deadline for Nominations: 15 May, 2022.

Decision: 1 July, 2022.

The Award Committee is solely responsible for the selection of the
winner of the award which may be shared by more than one paper or series
of papers. The Award Committee reserves the right to declare no winner
at all.

Eligibility

Any research paper or series of research papers by a single author or by
a team of authors published in a recognized refereed journal. The
research work nominated for the award should be in the area of
multivariate algorithms and complexity meant in a broad sense, and
encompasses, but is not restricted to those areas covered by IPEC. The
Award Committee has the ultimate authority to decide on the eligibility
of a nomination. Papers authored by a member of the Award Committee are
not eligible for nomination.

Note that the past restrictions that require a certain number of years
before/after the publication of the nominated papers have been removed.

Nominations

Nominations may be made by any member of the scientific community
including the members of the Award Committee. A nomination should
contain a brief summary of the technical content of each nominated paper
and a brief explanation of its significance. Nominations are done by an
email to the Award Committee Chair with copies to the members of the
committee. The Subject line of the nomination E-mail should contain the
group of words "Nerode Prize Nomination".

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

[DMANET] PhD position in Combinatorial algorithms, Charles University

One PhD position in Combinatorial algorithms is available at Charles
University, at the Department of Theoretical Computer Science and
Mathematical Logic. The position is partially funded by the project
"Principles of combinatorial generation" from the Czech Science
Foundation investigated by Petr Gregor
(http://ktiml.mff.cuni.cz/~gregor/) and Torsten Mütze
(http://tmuetze.de/). The starting date for the position is October 1st,
2022 or by mutual agreement.

We invite applications of candidates with a strong background in
discrete mathematics or theoretical computer science. Applicants should
send their CV with a research statement and one recommendation letter
electronically to
gregor@ktiml.mff.cuni.cz or torsten.mutze@mff.cuni.cz by April 20th,
2022. Informal enquiries about the position are welcome.

**********************************************************
*
* 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, March 31, 2022

[DMANET] QMUL/LSE Colloquia in Combinatorics 2022

Dear Colleagues,

The 15th edition of the QMUL/LSE Colloquia in Combinatorics will be
held on the 11th and the 12th of May 2022.
As in the past years, we will present a dozen of talks covering a wide
range of topics of interest to all working in combinatorics or related
fields.

On Wednesday (May 11), at Queen Mary, University of London, the
speakers will be Florian Frick (Berlin), Annika Heckel (Uppsala),
Alexander Holroyd (Bristol), Maura Paterson (Birkbeck), Julian
Saharasbude (Cambridge) and Laura Sanità (Eindhoven).

On Thursday (May 12), at the London School of Economics, the speakers
will be Mathilde Bouvel (LORIA), Amin Coja-Oghla (Dortmund), Matthew
Kwan (IST), Alex Scott (Oxford), Angelika Steger (Zurich) and Vera
Traub (Zurich).

Please note that registration is required this year. Visit the website
(https://tiny.cc/2dayCC ) for more details.

**********************************************************
*
* 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] DISC 2022 Second Call for Papers

===========================================
DISC 2022 Second Call for Papers
===========================================

36th International Symposium on Distributed Computing
October 25-27, 2022
Augusta, Georgia, USA
http://www.disc-conference.org/wp/disc2022/

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

Important Dates:

Submission deadline: May 13 (AoE)
Rebuttal period: June 29-July4 (AoE)
Notification: July 25
Final versions: August 12

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

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

Submissions are sought in all areas of distributed algorithms and
distributed systems including theory, design, implementation,
modelling, analysis, and application of distributed systems and
networks. Topics of interest include, but are not limited to:

* Biological and nature-inspired distributed algorithms
* Blockchain protocols
* Coding and reliable communication
* Communication networks: algorithms, protocols, and applications
* Complexity, lower bounds, and impossibility results
* Design and analysis of distributed algorithms
* Distributed and concurrent data structures
* Distributed algorithms for clouds and IoT
* Distributed graph algorithms
* Distributed machine learning and data science
* Distributed operating systems, middleware, database systems
* Distributed resource management
* Fault tolerance, reliability, self-organization, self-stabilization
* Formal methods for distributed computing: verification, synthesis and
testing
* Game-theoretic and knowledge-based approaches to distributed computing
* Internet and web applications, social networks, and recommendation systems
* Massively-parallel, high-performance, cloud and grid computing
* Mobile agents, autonomous distributed systems, swarm robotics
* Multiprocessor and multi-core architectures and algorithms
* Overlay networks and peer-to-peer networks
* Population protocols and chemical reaction networks
* Quantum distributed algorithms
* Replication, consensus, and consistency
* Security in distributed computing, cryptographic protocols
* Synchronization, persistence, and transactional memory
* Wireless, mobile, sensor and ad-hoc networks

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

PC Chair: Christian Scheideler (Paderborn University, Germany)

Program Committee:

John Augustine (IIT Madras, India)
Naama Ben David (VMware Research, USA)
Borzoo Bonakdarpour (Michigan State University, USA)
Marthe Bonamy (University of Bordeaux, France)
Christian Cachin (University of Bern, Switzerland)
Artur Czumaj (University of Warwick, UK)
Joshua Daymude (Arizona State University, USA)
Michal Dory (ETH Zürich, Switzerland)
Robert Elsässer (University of Salzburg, Austria)
Laurent Feuilloley (University of Lyon, France)
Michele Flammini (Gran Sasso Science Institute, Italy)
Paola Flocchini (University of Ottawa, Canada)
Davide Frey (Inria centre at Rennes University, France)
Luisa Gargano (University of Salerno, Italy)
Magnús M. Halldórsson (Reykjavik University, Iceland)
Mohammad Taghi Hajiaghayi (University of Maryland, USA)
Alex Kogan (Oracle Labs, USA)
Shay Kutten (Technion, Israel)
Thomas Locher (DFINITY Foundation, Switzerland)
Victor Luchangco (Algorand, USA)
Yannic Maus (TU Graz, Austria)
Othon Michail (University of Liverpool, UK)
Boaz Patt-Shamir (Tel Aviv University, Israel)
David Peleg (Weizmann Institute, Israel)
Maria Potop-Butucaru (Sorbonne University, France)
Sergio Rajsbaum (UNAM, Mexico)
Peter Robinson (Augusta University, USA)
Jared Saia (University of New Mexico, USA)
Stefan Schmid (TU Berlin, Germany)
Gokarna Sharma (Kent State University, USA)
Jukka Suomela (Aalto University, Finland)
Yukiko Yamauchi (Kyushu University, Japan)
Haifeng Yu (National University of Singapore, Singapore)

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

Papers:

A submitted paper should clearly motivate the importance of the
problem being addressed, discuss prior work and its relationship to
the paper, explicitly and precisely state the paper's key
contributions, and outline the key technical ideas and methods used to
achieve the main claims. A submission should strive to be accessible
to a broad audience, as well as having sufficient details for experts
in the area.

There are two types of submissions: regular papers and brief
announcements. Regular papers must report on original research that
has not previously been published (and may not be concurrently
submitted to other journals or conferences with proceedings).  All
ideas necessary for an expert to fully verify the central claims in a
paper, including experimental results, should be included in the
submission.

A brief announcement may describe work in progress or work presented
elsewhere. A brief announcement may also present a result that is
short and elegant, but does not require a longer paper. It may also be
used to announce a software distribution or an experimental results of
interest that can be concisely described.

Submission format:

Submissions must be in English in pdf format and they must be prepared
using the LaTeX style template for LIPIcs
(https://submission.dagstuhl.de/series/details/5#author) with

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

Submissions must be anonymous, without any author names, affiliations,
or email addresses. The contact information of the authors will be
entered separately in Easychair.

For regular papers, there is no page limit, and authors are encouraged
to use the full version of their paper as the submission. The
initial 15 pages should contain a clear presentation of the merits of
the paper, including a discussion of the paper's importance within the
context of prior work and a description of the key technical and
conceptual ideas used to achieve its main claims.  (Illustrative
figures are encouraged.) The submission must contain full proofs of
all claims in the paper.

Although there is no bound on the length of a submission, material
other than the first 15 pages will be read at the committee's
discretion. Papers submitted as brief announcements should comply with
the above rules, replacing 15 pages with 5 pages.

Submissions not conforming to the submission guidelines and papers
outside of the scope of the conference will be rejected without
consideration.

Anonymous Submissions:

We will use a relaxed implementation of double-blind peer review.
Submissions must not reveal the identity of the authors in any way. In
particular, authors' names and affiliation should not appear in the
document itself. Authors should ensure that any references to their
own related work are in the third person (e.g., not "We build on our
previous work …" but rather "We build on the work of …"). The purpose
of this process is to help PC members and external reviewers come to
an initial judgment about the paper without bias, not to make it
impossible for them to discover the authors if they were to try.

You are free to disseminate your work through arXiv and other online
repositories and give presentations on your work as usual. Moreover,
nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult. In
particular, important references should not be omitted or anonymized.

Brief announcements should also be submitted without author names and
affiliations so that a reviewer can form an initial judgment without
bias, but they can contain a reference to the full version of the work
in the bibliography.

Please feel free to ask the PC chair if you have any questions about
the double-blind policy of DISC 2022.

Conflict of Interest

The submission form provides an opportunity to specify conflicts of
interest with any of the PC members. If you feel that you have a
valid reason for a conflict of interest beyond the PC members, or any
other issues related to the fair treatment of your submission, contact
the PC chair or the SafeTOC representative for DISC (which can be
found on the DISC webpage).

Publication

The proceedings will be published by LIPIcs. The final version of the
paper has to be formatted following the LIPIcs guidelines. Regular
papers will have up to 15 pages in the final proceedings (excluding
the front page, the references, and a brief appendix (of up to 5
pages), and brief announcements will have 3 pages in the proceedings
(including everything). If more space is needed, the authors are
encouraged to post the full version e.g. on arXiv and refer to it in
their paper.

Accepted papers and brief announcements must be presented by one of
the authors, with a full registration and according to the final
schedule. Any submission accepted into the technical program but not
presented on-site will be withdrawn from the final proceedings.

The submission site will be posted shortly on the DISC website.

Awards

Awards will be given to the best paper and the best student paper. To
be eligible for the best student paper award at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper.

**********************************************************
*
* 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 BlockTEE: First Workshop on Blockchain Technologies and Trusted Execution Environments - Collocated with DISCOTEC

===============================================================================
===============================================================================
BlockTEE 2022
First Workshop on Blockchain Technologies and Trusted Execution Environments

collocated with DISCOTEC'2022
===============================================================================
===============================================================================


https://www.discotec.org/2022/blocktee

Blockchains and TEE (trusted execution environments) are popular emerging
\technologies, enabling new or existing use cases to be deployed under stronger
security and trust models. Blockchains and TEEs have been combined in the past to
enhance the performance, security, and applicability for blockchains. In this
workshop, we invite novel combinations of these two technologies. Some of the
topics we are interested in include practical results that show how to combine
these two technologies to operate under stricter security models, offering new
performance results, new proof-of-* systems enabled by TEEs, improvements over
state-of-the-art ledgers exploiting TEEs, mixed or hybrid TEE deployments for
distributed ledgers, or novel partitioning techniques dealing with heterogeneous
TEE setups for blockchains. Real-world results from large-scale deployments
combining TEEs and blockchains are highly encouraged.


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

We seek contributions in two different formats


* position papers, which should aim at fostering discussion and collaboration and
may summarize research published elsewhere or outline emerging ideas. The
submission must not exceed 4 pages excluding references.
* full papers, which should presenting fleshed out ideas, systems and or
experimental results. The submission must not exceed 12 pages excluding
references.


===============================================================================
Dates
===============================================================================
Paper submission deadline: April 17, 2022 (AoE timezone)
Notification of accepted papers: May 23, 2022
Workshop: June 17, 2022

===============================================================================
Program Committee
===============================================================================

- Valerio Schiavoni (University of Neuchatel), co-chair
- Miguel Matos (INESC-ID & U. Lisboa), co-chair
- Hans P. Reiser (Reykjavik University)
- Francisco Maia (INESC TEC)
- Pierre-Louis Aublin (IIJ Innovation Institute)
- Pierre Sutra (Télécom SudParis)
- Heverson Ribeiro
- Nuno Santos (INESC-ID / Instituto Superior Tecnico)
- Marcus Brandenburger ( IBM Research - Zurich)
- Marcelo Pasin (University of Neuchatel)
- Leander Jehl (TU Braunschweig)

--
Miguel Matos
Assistant Professor @ IST - U. Lisboa
Senior Researcher @ INESC-ID Lisboa
miguel.matos@inesc-id.pt
http://www.gsd.inesc-id.pt/~mm/


**********************************************************
*
* 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] Approaching Deadline!!: CfP ACM GECCO Workshop: 7th Industrial Application of Metaheuristics (IAM) @GECCO 2022

****************************************************************
*******************CfP: Call For Papers**********************
************************* IAM 2022 ***************************
*********** 7th GECCO Workshop on Industrial ***********
************** Applications of Metaheuristics ***************
********** Boston(hybrid), USA, July 9-13, 2022 **********
****************************************************************

Approaching Deadline!!: April 11, 2022


IAM is held as part of the 2022 Genetic and Evolutionary Computation Conference (GECCO-2022), July 9-13, Boston (hybrid), USA.


Aims and Scope
=============

Metaheuristics have been applied successfully to many aspects of applied mathematics and science, showing their capabilities to deal effectively with problems that are complex and otherwise difficult to solve. There are a number of factors that make the usage of metaheuristics in industrial applications more and more interesting. These factors include the flexibility of these techniques, the increased availability of high-performing algorithmic techniques, the increased knowledge of their particular strengths and weaknesses, the ever increasing computing power, and the adoption of computational methods in applications. In fact, metaheuristics have become a powerful tool to solve a large number of real-life optimization problems in different fields and, of course, also in many industrial applications such as production scheduling, distribution planning, and inventory management.

This workshop proposes to present and debate about the current achievements of applying these techniques to solve real-world problems in industry and the future challenges, focusing on the (always) critical step from the laboratory to the shop floor. A special focus will be given to the discussion of which elements can be transferred from academic research to industrial applications and how industrial applications may open new ideas and directions for academic research.

Topic areas include (but are not restricted to):

- Success stories for industrial applications of metaheuristics
- Pitfalls of industrial applications of metaheuristics.
- Metaheuristics to optimize dynamic industrial problems.
- Multi-objective optimization in real-world industrial problems.
- Meta-heuristics in large-scale constrained industrial optimization problems.
- Reduction of computing times through parameter tuning and surrogate modelling.
- Parallelism and/or distributed design to accelerate computations.
- Algorithm selection and configuration for complex problem solving.
- Advantages and disadvantages of metaheuristics when compared to other techniques.
- New research topics for academic research inspired from industrial applications.


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

Authors can submit:
- Short contributions including position papers of up to 4 pages - and/or
- Regular contributions of up to 8 pages.

In both cases, it is mandatory to follow the official GECCO paper formatting guidelines. Please see the GECCO 2022 information for workshop authors for further details regarding formats and how to submit, accessible through https://gecco-2022.sigevo.org/Call-for-Workshop-Papers.
Software demonstrations will also be welcome (please write to organizers for more info).


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

- Paper Submission deadline: April 11, 2022
- Notification of paper acceptance: April 25, 2022
- Camera ready submission: May 2, 2022
- Author registration deadline: May 2, 2022
- Conference dates: July 9-13, 2022
Note: The conference will be held in hybrid mode, with all events facilitating online participation.

Workshop Chairs
=================

Silvino Fernandez Alzueta (ArcelorMittal)
Pablo Valledor Pellicer (ArcelorMittal)
Thomas Stuetzle (Universite Libre de Bruxelles, ULB)


-----

As a published ACM author, you and your co-authors are subject to all ACM Publications Policies (https://www.acm.org/publications/policies/toc), including ACM's new Publications Policy on Research Involving Human Participants and Subjects (https://www.acm.org/publications/policies/research-involving-human-participants-and-subjects).

-----

The information contained in this email and any files transmitted with this email are ArcelorMittal Group information that is proprietary, privileged and confidential. It is intended solely for the use of the individual and entity to whom it is addressed. If the reader of this message is not the intended recipient, or the employee or agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, dissemination, distribution, copying or other use of this message is strictly prohibited. If you have received this communication in error, please notify us immediately and delete the e-mail and all attachments and any copies thereof. Nothing in this communication can be construed as a binding contract or a binding offer from ArcelorMittal Group.

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