Wednesday, April 6, 2022

[DMANET] A Funded PhD Position in Optimisation at Deakin University, Australia

The Data to Intelligence (D2I) Research Centre at the School of IT at Deakin University has one open vacancy in the area of combinatorial optimisation for a fully funded doctoral student. The research topic will focus on developing advanced solution techniques to applied multi-component combinatorial optimisation problems.

The candidate should have a Master degree (or equivalent) in Computer Science, Operations Research, Artificial Intelligence, Applied Mathematics, or a related field. Strong academic performance, programming and mathematical skills as well as a good level of written and oral English are essential. Experience with metaheuristic and matheuristic optimisation methods, mathematical/constraint programming, and the knowledge of decomposition-based optimisation techniques is highly desirable.

This Deakin University funded research stipend available for both domestic and international candidates is worth of 28,900 AUD per annum (tax exempt) to support living costs for up to 3 years. During the study period, doctoral students are also allowed to participate on a part-time basis in ongoing paid teaching activities to secure additional income.

For more information or to apply, interested candidates should contact Dr Sergey Polyakovskiy (mailto:sergey.polyakovskiy@deakin.edu.au). The application package must include the following:
* Cover letter stating your motivation and outlining your research interests/experience
* Detailed curriculum vitae with a list of publications and awards (if any)
* Academic transcripts of Bachelor and Master programs
* Evidence of English proficiency if available (Deakin University expects the IELTS overall score or its equivalent to be at least 6.5, with no band score be less than 6.0)
* Contact details of two referees familiar with your research and/or studies

Applications will be considered once they are received but no later than April 25, 2022. Applicants must be generally eligible to enrol in a PhD program at Deakin University. For more information, please, refer to https://www.deakin.edu.au/study/fees-and-scholarships/scholarships/find-a-scholarship/hdr-scholarship-optimisation-problems.

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

[DMANET] PhD Position in Computational Logic

PhD Position in Computational Logic
RISC, Johannes Kepler University Linz, Austria

Applications are invited for one 4-year PhD position in computational
logic in the frame of the project "Symbolic Techniques for Quantitative
Extensions of Equality" funded by the Austrian Science Fund (FWF).

Application deadline: May 10, 2022.
Details at: https://www.risc.jku.at/projects/squee/.

**********************************************************
*
* 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] ISSAC 2022 - Important Information concerning participation

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

ISSAC 2022

International Symposium on Symbolic and Algebraic Computation
July 4-7 2022
Lille, France

IMPORTANT INFORMATION

https://www.issac-conference.org/2022/


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


This early call for participation contains some important information
to help attendees preparing their participation to ISSAC 2022.

A more detailed call for participation will be sent later this month


Organization
------------

Participation to the ISSAC 2022 Conference is in-person. The
conference location is on the campus of the University of Lille, in
Villeneuve-d'Ascq, France. On-line participation will be
exceptionally granted to colleagues who cannot travel to France due to
travel restrictions caused by pandemic related issues, or the
situation in Ukraine.


Accommodation
-------------

Two important local events may impact the accommodation during the
period of ISSAC. The first one is a concert (by the French band
Indochine) on Sunday evening, July 3rd around the conference location.
The second one is the "Tour de France" (a French national multi-day
cycling stage race) which will start from the city of Lille on
Wednesday morning, July 6th.

For these reasons, hotels in the Lille area are likely to be booked at
higher levels than usual on Sunday evening, July 3rd, and even more on
Tuesday evening, July 5th.

Therefore, we strongly recommend those planning to attend ISSAC to
arrange their accommodation as soon as possible. Recall that most
bookings can be canceled with no charges.
**********************************************************
*
* 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] ISSAC 2022 - Call for posters and software presentations

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

ISSAC 2022

International Symposium on Symbolic and Algebraic Computation
July 4-7, 2022
Lille, France

CALL FOR POSTERS AND SOFTWARE PRESENTATIONS

https://www.issac-conference.org/2022/

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

The International Symposium on Symbolic and Algebraic Computation is
the premier conference for research in symbolic computation and
computer algebra. ISSAC 2022 will be the 47th meeting in the series,
which started in 1966 and has been held annually since 1981. The
conference presents a range of invited talks, tutorials, poster
sessions, software demonstrations and vendor exhibits with a
center-piece of contributed research papers.

ISSAC 2022 is held on July 4-7 2022, at Lille, France.

The poster session at ISSAC is a venue to announce early research
results or ongoing projects that might not yet be complete.
Posters reporting on recent work published or accepted or submitted
elsewhere are also welcome (with original publications clearly
referenced).

The software presentations at ISSAC are for demonstrating and
communicating about new developments in software for symbolic and
algebraic computation. Presentations are welcome for software based
on previously published algorithms and mathematics.

Authors are invited to submit an extended abstract in PDF format of
no more than 4 pages. The abstracts will be reviewed by the poster
and software committees and relevant experts when needed. The review
criteria are content, originality, style and relevance. The accepted
poster and software abstracts will be printed and distributed at the
conference as well as published in an upcoming issue of the ACM
SIGSAM Communications in Computer Algebra.


Topics
-------
All areas of computer algebra and symbolic computation are of interest.
See the conference website for a detailed list.
https://www.issac-conference.org/2022/


Invited Speakers
----------------
Mioara Joldes (CNRS, LAAS, France)
Joris van der Hoeven (CNRS, LIX, France)
Avi Wigderson (Institute for Advance Study, Princeton, USA)


Tutorial Speakers
-----------------
Nathalie verdiere (Universite du Havre, France)
Aydin Buluc (UC Berkeley, USA)
Matías Bender (Technische Universität Berlin, Germany)

Important Dates:
----------------
Posters:
Abstract submission (.pdf) Mon, May 15, 2022
Notification of acceptance/rejection Fri, May 22, 2022
Final version (.tex) due Fri, June 3, 2022

Software:
Abstract submission (.pdf): Mon, May 15, 2022
Notification of acceptance/rejection: Fri, May 22, 2022
Final version (.tex) due: Fri, June 3, 2022


Submission Instructions:
------------------------
Please submit an extended abstract in PDF format via EasyChair at:
https://easychair.org/conferences/?conf=issac2022posterandso

The abstract should have no more than four pages using the SIGSAM
LaTeX style and the CCA templates which are available here:

https://www.issac-conference.org/2022/submission_guidelines.php


Authors of accepted contributions are expected to present their
work at the symposium.
**********************************************************
*
* 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] Vacancy at Lancaster University (Leipzig campus), Deadline 18 April 2022

[Apologies for cross/multiple postings]

Dear colleagues,
Please find below the advert for a Lecturer or Teaching fellow
position in Computing and Software Engineering:
https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=LZ11

Kind regards,
Marco

Marco Caminati

Lecturer in Computing
Lancaster University Leipzig
Strohsack-Passage, room 604
Nikolaistraße 10
04109 Leipzig
Germany

GPS: 51.3410, 12.3782
Landline: +49 341 339 77 646
Email: m.caminati@lancaster.ac.uk

www.lancasterleipzig.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] TERMGRAPH 2022 Workshop: Second Call for Paper

========================================================================
Second Call for Papers

TERMGRAPH 2022

Twelfth International Workshop on Computing with Terms and Graphs
http://termgraph.org.uk/2022

Technion, Haifa, Israel
Monday, 1st August 2022 *)

A Workshop that is part of FLoC 2022,
(associated with conference FSCD)
=======================================================================
*) preliminary, due to room capacity decisions the FLoC organizers can
reschedule to Sunday, 31st July 2022 (decision on 15 June 2022)

Graphs and graph transformation systems are used in many areas within
Computer Science: to represent data structures and algorithms, to define
computation models, as a general modeling tool to study complex systems,
etc.

Topics of interest for TERMGRAPH encompass all aspects of term-/graph
rewriting (term-graph and graph rewriting), and applications of graph
transformations in programming, automated reasoning and symbolic
computation, including:

* Theory of first-order and higher-order term graph rewriting
* Graph rewriting in lambda calculus (sharing graphs, optimality)
* Term-/graph based models of computation
* Graph grammars
* Term-/graph based languages and modelling frameworks
* Term-/graph rewriting tools:
-- system descriptions and case studies
* Applications of term-/graph rewriting in, and term-/graph rewriting
aspects of:
-- semantics and implementation of programming languages
-- compiler construction
-- interaction nets and proof nets
-- software engineering
-- automated reasoning and symbolic computation
-- functional and logic programming
-- pattern recognition
-- bioinformatics

The aim of this workshop is to bring together researchers working in
these different domains, to foster their interaction, to provide a
forum for presenting new ideas and work in progress, and to enable
newcomers to learn about current activities in this area.


Invited Speaker(s):
-------------------
Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands

(Second invited speaker to be announced in April)


Submissions and Publication:
----------------------------

We invite submissions of extended abstracts of at most 8 pages typeset
in EPTCS (Electronic Proceedings in Theoretical Computer Science) style.
This may include, concerning any of the topics above:

-- original work,
-- tutorials,
-- work in progress,
-- system descriptions of term-/graph rewriting tools.

Extended abstracts have to be submitted no later than 10 May 2022 (AoE)
electronically (pdf) via the EasyChair submission site:

https://easychair.org/conferences/?conf=termgraph2022

Papers will be judged on relevance, originality, correctness, and
usefulness. Preliminary proceedings will be available for the workshop.

After the workshop, authors will be invited to submit a longer version
of their work (a 15-pages paper) for the publication of the Workshop
Post-Proceedings in EPTCS. These submissions will undergo a second
round of refereeing with:

submission deadline in the mid of October 2022,
notification in December 2022,
publication in February or March 2023.

Important Dates:
----------------

Submission deadline: 10 May 2022
Notification: 7 June 2022
Program publication: 15 June 2022
PreProceedings version due: 21 June 2022
Workshop: 1 August 2022 (see proviso (*) above)


Programme Committee:
--------------------

Sandra Alves, Universidade do Porto, Portugal
Martin Avanzini, INRIA Sophia Antipolis - Méditerranée, France
Patrick Bahr, IT University Copenhagen, Copenhagen, Denmark
Thierry Boy de la Tour, CNRS, France
Clemens Grabmayer (chair), Gran Sasso Science Institute, Italy
Wolfram Kahl, McMaster University, Canada
Ian Mackie, LIX, France
Koko Muroya, Kyoto University, Japan
Femke van Raamsdonk, Vrije Universiteit Amsterdam, The Netherlands
Adrian Rutle, Western Norway University, Norway
Kazunori Ueda, Waseda University, Japan


Contact:
--------

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

[DMANET] 2nd call for papers: 8TH WORKSHOP ON PRACTICAL ASPECTS OF AUTOMATED REASONING PAAR2022

SECOND CALL FOR PAPERS

PAAR 2022: 8TH WORKSHOP ON PRACTICAL ASPECTS OF AUTOMATED REASONING
-- co-located with FLoC/IJCAR 2022 --
August 11-12, 2022, Haifa, Israel
Web site: https://paar2022.github.io/

Submission link: https://easychair.org/conferences/?conf=paar2022
Abstract registration deadline: April 19, 2022
Submission deadline: April 26, 2022

** Description **

The automation of logical reasoning is a challenge that has been studied intensively in fields including mathematics, philosophy, and computer science. PAAR is the workshop on turning this theory into practice: how can automated reasoning tools be built that work and are useful in applications? PAAR covers all aspects of this challenge: which theories, logics, or fragments are well-behaved in practice, and connect well to application domains? which reasoning tasks are tractable and useful? which algorithms are able to solve real-world instances? how should automated reasoning tools be designed, implemented, tested, and evaluated?

The goal of PAAR is to bring together theoreticians, tool developers, and users, to concentrate on the practical aspects of automated reasoning. The workshop welcomes high-quality contributions of any kind, including new research results, presentation of work in progress, presentation of new tools, new implementation techniques, new application domains, or case studies.

PAAR 2022 will host the meeting of the working group on Automated Theorem Provers of the EuroProofNet COST action (https://europroofnet.github.io/). Every workshop participant is welcome to attend.

** Submission Guidelines **

Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages), excluding references, via EasyChair at https://easychair.org/conferences/?conf=paar2022. Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome.

Submissions should be prepared in LaTeX using the CEUR-WS.org<http://CEUR-WS.org> style template (CEURART, one-column). The package containing the class file and the user guide can be downloaded from http://ceur-ws.org/Vol-XXX/CEURART.zip.

** SCOPE **

Topics include, but are not limited to:
--------------------------------------
* automated reasoning in propositional, first-order, higher-order, and
non-classical logics;
* implementation of provers (SAT, SMT, resolution, superposition, tableau,
instantiation-based, rewriting, logical frameworks, etc.);
* automated reasoning tools for all kinds of practical problems and
applications;
* pragmatics of automated reasoning within proof assistants;
* practical experiences, usability aspects, feasibility studies;
* evaluation of implementation techniques and automated reasoning tools;
* performance aspects, benchmarking approaches; non-standard approaches to
automated reasoning, non-standard forms of automated reasoning, new
applications;
* implementation techniques, optimisation techniques, machine learning,
strategies and heuristics, fairness;
* tools or methods that support prover development;
* system descriptions and demos.

** Invites speakers **

* Geoff Sutcliffe (U Miami, US)
* N.N.

** Programme Committee **

* Boris Konev, University of Liverpool, UK (PC co-chair)
* Claudia Schon, University of Koblenz-Landau, DE (PC co-chair)
* Alexander Steen, University of Greifswald, DE (PC co-chair)
* Simon Cruanes, Imandra, US
* Hans de Nivelle, Nazarbayev University, KZ
* Gabriel Ebner, Vrije Universiteit Amsterdam, NL
* Pascal Fontaine, Université de Liège, BE
* Ulrich Furbach, University of Koblenz, DE
* Cezary Kaliszyk, University of Innsbruck, AT
* Daniel Le Berre, CNRS - Université d'Artois, FR
* Ondrej Lengal, Brno University of Technology, CZ
* Tomer Libal, American University of Paris, FR and University of Luxembourg, LU
* Cláudia Nalon, University of Brasília, BR
* Jens Otten, University of Oslo, NO
* Philipp Ruemmer, Uppsala University, SE
* Renate A. Schmidt, The University of Manchester, UK
* Stephan Schulz, DHBW Stuttgart, DE
* Mihaela Sighireanu, ENS Paris-Saclay and CNRS, FR
* Frieder Stolzenburg, Harz University of Applied Sciences, DE
* Martin Suda, Czech Technical University in Prague, CZ
* Sophie Tourret, Inria and MPI for Informatics, DE
* Petar Vukmirović, Vrije Universiteit Amsterdam, NL
* Sarah Winkler, Free University of Bolzano-Bozen, IT
* Aleksandar Zeljić, Stanford University, US

** Publication **

PAAR proceedings will be published electronically in the CEUR workshop proceedings.

** Venue **

FLoC 2022 at Haifa, Israel

** Important dates **

* Abstract submission: April 19, 2022
* Paper submission: April 26, 2022
* Workshop: August 11 - August 12, 2022

--
Prof. Boris Konev
Head of Department of Computer Science
University of Liverpool
Liverpool, L69 3BX, UK
Email: konev@csc.liv.ac.uk<mailto:konev@csc.liv.ac.uk>
Tel: (+44) 151 795 4260
URL: http://www.csc.liv.ac.uk/~konev

**********************************************************
*
* 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] Highlights Extended Stay Support Scheme (Deadline April 15th)

This year, financial support is proposed to participants of HIGHLIGHTS 2022
coming from far away and wishing to extend their stay to visit some
research center close to Paris.

Highlights is an annual conference with the goal of integrating the
community of researchers working on logic, games and automata. The 2022
edition of Highlights will happen *from June 28th to July 1st, 2022, in
Paris, France*. The conference will be hosted by Université de Paris, and
happen on the site of Grands Moulins.

Just like other conferences in the field, Highlights proposes tutorials and
invited talks. However, the contributed talks are just ten minutes long,
allowing participants to get an overview of a wide range of different
topics in a short amount of time. Additionally, authors are encouraged to
prepare posters about their work, which are then presented and discussed in
poster sessions.

Highlights is an informal event which will take place on-site (barring
unforeseen circumstances), and the preferred form of participation is to
give your talk in-person. Highlights is mostly intended for a local
community of participants who can attend with a limited carbon footprint
(e.g., no plane travel). Before coming from further away, please review how
your trip and international flights are contributing to climate change. If
you do come, we encourage you to make the most of your stay in Paris, e.g.,
by also attending the ICALP'22 conference and/or using this opportunity for
a research visit (see below).

*Conference website:* https://highlights-conference.org/2022/

*HIGHLIGHTS EXTENDED STAY SUPPORT SCHEME *

If you are coming from far away to attend Highlights and wish to do a
research visit while in Paris, we have a scheme in place to help you secure
financial support for your visit, by listing laboratories close to Paris
who can consider funding such visits. This is the Highlights extended stay
support scheme (HESSS). The following laboratories are participating in the
scheme:

-École normale supérieure (Paris), VALDA team, contact: Pierre Senellart
-Télécom Paris (Palaiseau, greater Paris), DIG team, contact: Antoine
Amarilli
-IRIF (Paris), contact: Thomas Colcombet
-CRIStAL (Lille, France), contact: Sophie Tison
-Université de Mons (Mons, Belgium), contact: Véronique Bruyère
-LaBRI (Bordeaux, France), M2F team, contact: Hugo Gimbert
-IGM (Marne-la-Vallée, France), contact: Claire David
-LMF (Orsay, France), contact: Dietmar Berwanger
-CRIL (Lens, France), contact: Stefan Mengel
-IRISA (Rennes), SUMO team, contact: Nathalie Bertrand
-Move team, Laboratoire d'Informatique et Systèmes (Marseilles,
France), contact: Pierre-Alain Reynier
-Hasselt University (Hasselt, Belgium), Data Science Institute,
contact: Jan Van Den Bussche

*HOW TO APPLY*

To apply, you should first contact a collaborator in these laboratories,
with whom you are already working or would like to discuss. Once you have a
collaborator, the two of you should get in touch with the laboratory
contact listed above, Cc'ing the Highlights organizers Antoine Amarilli.
You should indicate the planned dates of the visit, the broad theme, and
the country of origin of the visitor.

Applications will be reviewed on a rolling basis and should be sent as
early as possible, and *no later than April 15th*. The funding may cover
accommodation and transportation from Paris by train. This scheme is only
available for participants at the Highlights conference, for dates just
before or after Highlights. We stress that it is not intended to cover the
expenses of attending the Highlights conference itself, or attending the
ICALP'22 conference.


*IMPORTANT DATES*
Submission: March 18th
Notification: April 1st
HESSS applications: April 15th
Registration: TBA
Conference: June 28-July 1st, 2022

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

Monday, April 4, 2022

[DMANET] Final CPF + Grad Symposium | DIAGRAMS 2022

*Friendly Reminder: April 07, 2022* is the deadline to submit your long or
short paper, abstract or poster to DIAGRAMS 2022 * (Note that papers will
be accepted without pre-submission of the abstract, though we appreciate
the submission of these metadata as they help us convene our pool of
reviewers). *

*We are also happy to announce the Call for our Graduate Symposium* aimed
at senior grad students, recent Masters and Doctoral graduates.
Participants will present a 3-page report of their research, and have
opportunities for networking and mentorship with the wider Diagrams
community. *Submission Deadline June 6, 2022*
CFP:
http://www.diagrams-conference.org/2022/index.php/calls/graduate-symposium/

*Important Dates*
Workshop/Tutorials : March 6th, 2022
Pre-submission of title & abstract : March 31, 2022
Long Papers and Short Papers (full) : April 7, 2022
Abstracts and Posters categories (full) April 7, 2022
Graduate Symposium submission June 6, 2022

*Conference Dates (Rome, Italy)*
Workshops & Tutorials : September 13, 2022
Main Conference : September 14-16, 2022
Graduate Symposium : September 17, 2022

*All important dates and information can be found
at www.diagrams-conference.org/2022
<http://www.diagrams-conference.org/2022>*
We look forward to seeing you in Rome!

--
*Publicity Chair, Diagrams Conference 2022*
Amy Rae Fox (she / her) <https://www.mypronouns.org/what-and-why/>
PhD Candidate
Cognitive Science, UC San Diego
www.amyraefox.com @thoughtafox <https://twitter.com/thoughtafox>

**********************************************************
*
* 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] LATIN 2022 Final Call for Papers

Final Call for Papers

LATIN 2022
The 15th Latin American Theoretical Informatics Symposium will be held
in Guanajuato, Mexico.

DATES
All deadlines are at 23:59 anywhere on earth.
Abstract Submission: May 15, 2022
Full Paper Submission: May 22, 2022
Notification: July 25, 2022
Camera Ready: August 15, 2022
Symposium: October 17-21, 2022

SCOPE AND TOPICS
LATIN is devoted to different areas in theoretical computer science
including, but not limited to: algorithms (approximation, online,
randomized, algorithmic game theory, etc.), analytic combinatorics and
analysis of algorithms, automata theory and formal languages, coding
theory and data compression, combinatorial algorithms, combinatorial
optimization, combinatorics and graph theory, complexity theory,
computational algebra, computational biology, computational geometry,
computational number theory, cryptology, databases and information
retrieval, data structures, formal methods and security, foundations
of data science and theoretical machine learning, Internet and the
web, parallel and distributed computing, pattern matching, programming
language theory, quantum computing, and random structures.

SUBMISSION
Papers are to be submitted in PDF format using the EasyChair server
(https://easychair.org/conferences/?conf=latin2022). Submissions are
limited to fifteen (15) single-column letter-size pages in Springer
LNCS format (see LNCS author guidelines at
http://www.springer.com/la/computer-science/lncs/conference-proceedings-guidelines).
This limit does not include references. An optional appendix (to be
read at the program committee's discretion) may be included if
desired. Simultaneous submission of papers to any other conference
with published proceedings, as well as the submission of previously
published papers, is not allowed. Papers must be written in English.
If there is a physical meeting, as hoped for, for each accepted paper
at least one author must register and attend the symposium to present
it. Moreover, an author cannot register for multiple papers. That is,
each accepted paper must have its own registrant. An exception will be
made if a group of one or more authors has more papers accepted than
group members.

PROCEEDINGS
Accepted papers will appear in the proceedings of LATIN, which will be
published in Springer Lecture Notes in Computer Science
(http://www.springer.com/la/computer-science/lncs).

ALGORITHMICA SPECIAL ISSUE
A Special Issue of ALGORITHMICA will be dedicated to selected paper of
LATIN 2022.

IMRE SIMON TEST-OF-TIME AWARD
As of 2012, the Imre Simon Test-of-Time Award is given to the LATIN
paper deemed most influential among all those published at least ten
years prior to the current edition of the conference. Papers published
in the LATIN
proceedings up to and including 2010 are eligible for the 2022 award.

BEST PAPER AWARD
Papers presented at the conference will be considered for the LATIN
2022 Alejandro Lopez-Ortiz Best Paper Award.

COVID-19 PANDEMIC
The state of the COVID-19 pandemic in October 2022 cannot be predicted
now. We will do our best to have a meeting in person, but it may
happen that some or all attendees participate online. Questions can be
sent to: Latinconferenciachair2022@delta.cs.cinvestav.mx.

CONFERENCE CHAIR
Francisco Rodríguez Henríquez, Centro de investigación y de Estudios
Avanzados, México. Cryptography Research Centre, TII, Abu Dhabi,
United Arab Emirates.

PROGRAM COMMITTEE
Martin Aumüller, University of Copenhagen, Denmark
Jérémy Barbay, Universidad de Chile, Chile
Leonid Barenboim, The Open University of Israel, Israel
Frédérique Bassino, Université Sorbonne Paris Nord, France
Luciana Buriol, Amazon, USA
Armando Castañeda, Universidad Nacional Autónoma de México, Mexico (Chair)
Witold Charatonik, University of Wrocław, Poland
Min Chih Lin, Universidad de Buenos Aires, Argentina
Amalia Duch Brown, Universitat Politècnica de Catalunya, Spain
Leah Epstein, University of Haifa, Israel
Martín Farach-Colton, Rutgers University, USA
Esteban Feuerstein, Universidad de Buenos Aires, Argentina
David Flores-Peñaloza, Universidad Nacional Autónoma de México, Mexico
Fedor Fomin, University of Bergen, Norway
Jesper Jansson, Kyoto University, Japan
Gabriela Jeronimo, Universidad de Buenos Aires, Argentina
Christos Kaklamanis, University of Patras & CTI "Diophantus", Greece
Shuji Kijima, Kyushu University, Japan
Gregory Kucherov, CNRS/LIGM, France
François Le Gall, Nagoya University, Japan
Jérémy Ledent, University of Strathclyde, UK
Reut Levi, IDC Herzliya, Israel
Giovanni Manzini, Università di Pisa, Italy
Andrea Marino, Università degli Studi di Firenze, Italy
Elvira Mayordomo, Universidad de Zaragoza, Spain
Marco Molinaro, Pontifical Catholic University of Rio de Janeiro, Brazil
Guilherme Oliveira Mota, Universidade de São Paulo, Brazil
Lucia Moura, University of Ottawa, Canada
Gonzalo Navarro, Universidad de Chile, Chile
Rafael Oliveira, University of Waterloo, Canada
Daniel Panario, Carleton University, Canada
Gopal Pandurangan, University of Houston, USA
Seth Pettie, University of Michigan, USA
Miguel A. Pizaña, Universidad Autónoma Metropolitana, Mexico
Igor Potapov, University of Liverpool, UK
Svetlana Puzynina, Sobolev Institute of Mathematics, Russia
Pablo Rotondo, Université Gustave Eiffel, France
Jared Saia, University of New Mexico, USA
Rodrigo I. Silveira, Universitat Politècnica de Catalunya, Spain
Mohit Singh, Georgia Tech, USA
José A. Soto, Universidad de Chile, Chile
Frank Stephan, National University of Singapore, Singapore
Martin Strauss, University of Michigan, USA
Subhash Suri, University of California, USA
Dimitrios M. Thilikos, LIRMM, Université de Montpellier, CNRS,
Montpellier, France
Christopher Thraves, Universidad de Concepción, Chile
Denis Trystram, Université de Grenoble Alpes, France
Seeun William Umboh, The University of Sydney, Australia
Jorge Urrutia, Universidad Nacional Autónoma de México, Mexico
Alfredo Viola, Universidad de la República, Uruguay
Mikhail V. Volkov, Ural Federal University, Russia
Sebastian Wild, University of Liverpool, UK
Georg Zetzsche, Max Planck Institute, Germany

STEERING COMMITTEE
Michael A. Bender, Stony Brook University, USA
Cristina G. Fernandes, Universidade de São Paulo, Brazil
Joachim von zur Gathen, Bonn-Aachen International Center for
Information Technology, Germany
Evangelos Kranakis, Carleton University, Canada
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Flávio Keidi Miyazawa, Universidade Estadual de Campinas, Brazil

**********************************************************
*
* 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] 54th ACM Symposium on Theory of Computing (STOC 2022) - Theory Fest

Call for Participation

54th ACM Symposium on Theory of Computing (STOC 2022) - Theory Fest
<http://acm-stoc.org/stoc2022/>

June 20-24, 2022

Rome, Italy

The 54th ACM Symposium on Theory of Computing (STOC 2022) is sponsored by
the ACM Special Interest Group on Algorithms and Computation Theory and
will be held in Rome, Italy, Monday June 20 – Friday, June 24, 2022.

STOC 2022 - Theory Fest will feature technical talk sessions, 6 workshops
<http://acm-stoc.org/stoc2022/workshops.html> with introductory tutorials,
poster sessions, social events, and a special joint session with "Accademia
Nazionale dei Lincei <https://www.lincei.it/en>", the oldest and most
prestigious Italian academic institution, followed by a reception and a
concert at the Academy historic site
<https://www.lincei.it/en/corsini-palace>.

Registration

STOC 2022 registration is available here
<http://acm-stoc.org/stoc2022/registration.html>.

Early registration deadline: April 30th.

Student Travel Grants

Information for student travel grant applications is available here
<http://acm-stoc.org/stoc2022/travel-support.html>.

Application deadline: April 20th.

STOC 2022 is sponsored by Algorand, Amazon, Apple, Google, IOHK, Microsoft,
Sapienza University of Rome.

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