Friday, March 25, 2022

[DMANET] CFP: EC+DM@GECCO-2022 - Workshop on Evolutionary Computation and Decision Making

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

CALL FOR PAPERS

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

Workshop on

Evolutionary Computation and Decision Making (EC+DM)

The Genetic and Evolutionary Computation Conference (GECCO 2021), July 9-13,
2022, Boston, USA. Please note that the conference will be held as a hybrid
conference. More details will be provided soon.

Webpage:
http://blogs.exeter.ac.uk/ecmcdm/

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

About the workshop

Solving real-world optimisation problems typically involve an expert or
decision-maker. Decision-making tools have been found to be useful in
several such applications e.g. health care, education, environment,
transportation, business, and production. In recent years, there has also
been growing interest in merging Evolutionary Computation (EC) and
decision-making techniques for several applications. This workshop will
showcase research that is both at the interface of EC and decision making.

The workshop on Evolutionary Computation and Decision Making to be held in
GECCO 2022 aims to promote research on theory and applications in the field.
Topics of interest (but not limited to) include:

§ Interactive multiobjective optimization or decision-maker in the loop

§ Visualization

§ Aggregation/trade-off operators & algorithms

§ Fuzzy logic-based decision-making techniques

§ Bayesian and other decision-making techniques

§ Interactive multiobjective optimization for (computationally) expensive problems

§ Using surrogates (or metamodels) in decision making

§ Hybridization of EC and decision making

§ Scalability in EC and decision making

§ Decision making and machine learning

§ Decision making in Big data

§ Decision making in real-world applications

§ Use of psychological tools to aid the decision-maker


Submission

We invite papers up to 8 pages relevant to the workshop and position papers
of up to 2 pages showing preliminary results. We also welcome posters,
demonstrations or presentations on ground-breaking theoretical and
application results in the field.

For paper submission instructions and templates, please see: Paper
submission instructions


Keynote talk

Prof. Julia Handl will be giving a keynote talk in the workshop.


Important (STRICT) deadline dates

Submission opening: February 11, 2022

Submission deadline: April 11, 2022

Notification: April 25, 2022

Camera-ready: May 2, 2022

Presenter mandatory registration: May 2, 2022


Workshop organizers

Tinkle Chugh (University of Exeter, UK), Richard Allmendinger (Alliance
Manchester Business School, University of Manchester, UK), Jussi Hakanen
(Faculty of Information Technology, University of Jyväskylä, Finland)

More information about the organizers can be found on the workshop webpage
http://blogs.exeter.ac.uk/ecmcdm/


Contact

Please feel free to contact any of the special session organizers at
t.chugh@exeter.ac.uk,
richard.allmendinger@manchester.ac.uk,
jussi.hakanen@jyu.fi

-----

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 articipants and Subjects
https://www.acm.org/publications/policies/research-involving-human-participants-and-subjects.

-----

**********************************************************
*
* 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] Reminder: PostDoc in Algorithms at HHU Düsseldorf

Postdoctoral Researcher Position in Algorithms
at HHU Düsseldorf

A postdoctoral position is available in the Group "Algorithms
and Data Structures" at the Institute of Computer Science at
HHU Düsseldorf. The position is initially for one year with
an option of extension.

The successful applicant is expected to perform innovative research
in the area of approximation algorithms, in particular for the
area of clustering or algorithmic data analysis and to cooperate
with the Emmy Noether project on „Approximation Algorithms for
Geometric Data Analysis and Their Practicability".
Moreover, they will assist in teaching algorithm courses in German
and advice Bachelor's and Master's theses.

Applications are accepted until April, 12th, 2022.
Please send your application (covering letter, CV, list of publications,
PhD certificate) to the email address mschmidt@hhu.de in PDF format.

Further information can be found at

https://www.hhu.de/fileadmin/redaktion/ZUV/Dezernat_3/Stellenausschreibungen/Doku_wiss_Besch/114.22-3.1_deutsch.pdf
(in German)

https://www.hhu.de/fileadmin/redaktion/ZUV/Dezernat_3/Stellenausschreibungen/Doku_wiss_Besch/114.22-3.1_englisch.pdf
(in English)

Melanie Schmidt
Heinrich-Heine Universität Düsseldorf
Institut für Informatik
Lehrstuhl für Algorithmen und Datenstrukturen
Universitätsstraße 1
40225 Düsseldorf
Email: mschmidt@hhu.de
http://melanie-schmidt.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] Logic Colloquium deadline extension

The Logic Colloquium 2022 will take place from June 27 to July 1, 2022 at Reykjavik University, in Iceland.

The deadline to submit abstracts has been extended to March 31.

For updates, please visit the website: http://icetcs.ru.is/lc2022/

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

The Logic Colloquium is the European Summer Meeting of the Association for Symbolic Logic, that in 2022 will be held from the 27th of June to the 1st of July 2022 at Reyjavik University, Iceland. We encourage you to submit abstracts for contributed talks.

On behalf of the OC,
Antonis Achilleos

**********************************************************
*
* 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 Summer School in Discrete Mathematics, Rogla, Slovenia

Dear Colleagues,

We are happy to announce the "10th PhD Summer School in Discrete
Mathematics" will be held on Mt. Rogla, Slovenia, from June 26 till July 2,
2022. The summer school consists of two mini-courses, whose titles will be
announced later on, and will be lectured by:


- Michel Lavrauw (Sabancı University)

- Mikhail Muzychuk (Ben-Gurion University of the Negev)


There will also be a session of invited talks. Currently, the confirmed
invited speakers are:


- Edwin van Dam (Tilburg University)

- Robert Jajcay (Comenius University Bratislava)

- Tamás Szőnyi (Eötvös Loránd University and University of Primorska)


PhD students will have the opportunity to present their research work and
give a talk during the summer school. By doing so, they will be
automatically competing for the best student talk award. The submissions
should be sent via the Call for Abstracts, which is available on the
event webpage
(link below), by May 31, 2022.


We also have limited financial support for PhD-students. This includes
half-board in one of the bungalows and the exemption from conference fee
payment. Students that want to apply for it, should indicate this in the
registration form and send their motivation letter and a short CV (in
English). The deadline for the financial support application is April 15,
2022.

The registration form together with other relevant information (overview of
the mini-courses, accommodation, traveling information, mode of payment,
instructions for students etc.) is available at


https://conferences.famnit.upr.si/event/28/


Please feel free to forward this message to your colleagues and students.
For further questions please contact sygn@upr.si.

Best regards,


The Scientific Committee of 10th PhD Summer School in Discrete Mathematics:

Ademir Hujdurović, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič,
Štefko Miklavič, Primož Šparl


The Organizing Committee of 10th PhD Summer School in Discrete Mathematics:

Amar Bapić, Boštjan Frelih, Ademir Hujdurović, Boštjan Kuzman, Rok Požar

**********************************************************
*
* 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 24, 2022

[DMANET] Support for Ukrainian doctoral students in computer science at the, University of Vienna

The Doctoral School for Computer Science (DoCS) at the University of
Vienna (https://docs.univie.ac.at/) supports Ukrainian doctoral students
in computer science (who are currently enrolled in a Ukrainian
university) with 6-month stipends to continue their doctoral studies in
Vienna.

If you would like to apply for such a stipend, please send an email to

uadocs2022@univie.ac.at

including a CV and a brief description of your dissertation topic. We
will then contact you asap regarding further details.

We ask for your understanding though that our funds may not cover
stipends for all applicants.

For other initiatives, please also see

https://scienceforukraine.eu/

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

Wednesday, March 23, 2022

[DMANET] Three-year Postdoc Position in Algorithms and Complexity

We are seeking candidates for a three-year postdoctoral research position
funded by the EPSRC project "New Techniques for Resolving Boundary Problems
in Total Search"

The project will be led by John Fearnley (https://cgi.csc.liv.ac.uk/~john/)
and Rahul Savani (http://www.csc.liv.ac.uk/~rahul) and will run for three
years starting from the 1st of September 2022.

The project will explore new techniques for showing hardness in TFNP,
following on from the STOC 2021 best paper "The complexity of gradient
descent: CLS = PPAD ∩ PLS". The project will particularly focus on the
complexity class CLS, which contains problems from a wide variety of
disciplines, including:
* Algorithmic Game Theory (eg. Network congestion games, Network
coordination games, Shapley stochastic games)
* Formal Verification (eg. Tarski fixed points, Contraction map fixed
points, Unique sink orientations, Simple-stochastic games)
* Optimization and Machine Learning (eg. finding KKT points of
polynomials, gradient descent in a neural network)

An ideal candidate will have a strong research background in at least one
of the three areas listed above. That candidate will also have, or be close
to completing, a PhD in Computer Science or a related area.

Informal enquiries are welcome, and should be directed to
john.fearnley@liverpool.ac.uk.

The application form can be found here:
https://my.corehr.com/pls/ulivrecruit/erq_jobspec_version_4.display_form?p_company=1&p_internal_external=E&p_display_in_irish=N&p_process_type=&p_applicant_no=&p_form_profile_detail=&p_display_apply_ind=Y&p_refresh_search=Y&p_recruitment_id=040746

**********************************************************
*
* 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] LPNMR 2022 - 2nd Call for Papers

[Apologies in case of multiple posting]

1 month to abstract submission!

Call for Papers
---------------------------------------------------------------------------------------------

16th International Conference on
Logic Programming and Non-monotonic Reasoning
LPNMR 2022

https://lpnmr2022.dibris.unige.it

Genova, Italy
September 5-9, 2022

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


AIMS AND SCOPE

LPNMR 2022 is the sixteenth in the series of international meetings
on logic programming and non-monotonic reasoning. LPNMR is a forum
for exchanging ideas on declarative logic programming, non-monotonic
reasoning, and knowledge representation. The aim of the conference is
to facilitate interactions between researchers and practitioners
interested in the design and implementation of logic-based programming
languages and database systems, and those working in knowledge
representation and non-monotonic reasoning. LPNMR strives to encompass
theoretical and experimental studies that have led or will lead to
advances in declarative programming and knowledge representation, as
well as their use in practical applications. A Doctoral Consortium
will also be a part of the program.

LPNMR 2022 aims to bring together researchers from LPNMR core areas and
application areas of the aforementioned kind in order to share research
experiences, promote collaboration and identify directions for joint future research.


TOPICS

Authors are invited to submit papers presenting original and unpublished
research on all aspects of non-monotonic approaches in logic programming
and knowledge representation. We invite submissions of both long and
short papers on topics detailed below.

Conference topics include, but are not limited to:

1. Foundations of LPNMR Systems:
* Semantics of new and existing languages;
* Action languages, causality;
* Formalization of Commonsense Reasoning and understanding
its laws and nature;
* Relationships among formalisms;
* Complexity and expressive power;
* Inference algorithms and heuristics for LPNMR systems;
* Extensions of traditional LPNMR languages such as new logical
connectives or new inference capabilities;
* Updates, revision, and other operations on LPNMR systems;
* Uncertainty in LPNMR systems.

2. Implementation of LPNMR systems:
* System descriptions, comparisons, evaluations;
* Algorithms and novel techniques for efficient evaluation;
* LPNMR benchmarks.

3. Applications of LPNMR:
* Use of LPNMR in Commonsense Reasoning and other areas of KR;
* LPNMR languages and algorithms in planning, diagnosis, argumentation,
reasoning with preferences, decision making and policies;
* Applications of LPNMR languages in data integration and exchange
systems, software engineering and model checking;
* Applications of LPNMR to bioinformatics, linguistics, psychology,
and other sciences;
* Integration of LPNMR systems with other computational paradigms;
* Embedded LPNMR: Systems using LPNMR subsystems.


SUBMISSION AND PUBLICATION

LPNMR 2022 welcomes submissions of long papers (13 pages) or short papers
(6 pages) in the following categories:

* Technical papers
* System descriptions
* Application descriptions

The indicated number of pages includes title page, figures, tables, references
and appendix. All submissions will be peer-reviewed and accepted papers will
appear in the conference proceedings published in the Springer's
Lecture Notes in Artificial Intelligence (LNAI) series. At least one
author of each accepted paper is expected to register for the conference
to present the work. Submissions must be written in English, present
original research, and be formatted according to Springer's guidelines
and technical instructions available at:
https://www.springer.com/gp/authors-editors/conference-proceedings/conference-proceedings-guidelines

Paper submission is enabled via the LPNMR 2022 Easychair site:
https://easychair.org/conferences/?conf=lpnmr2022

The two best papers of general AI interest will be invited for rapid
publication in the Artificial Intelligence Journal.

Also, the 2-5 best papers with a logic programming focus will be invited
for rapid publication in the journal of Theory and Practice of Logic Programming.


MULTIPLE SUBMISSION POLICY

LPNMR 2022 will not accept any paper which, at the time of submission, is
under review or has already been published or accepted for publication in
a journal or another conference. Authors are also required not to submit
their papers elsewhere during LPNMR's review period. However, these
restrictions do not apply to previous workshops with a limited audience
and without archival proceedings.


COLOCATED WORKSHOPS

* DATALOG 2.0 Workshop
* 1st International Workshop on HYbrid Models for Coupling Deductive and
Inductive ReAsoning (HYDRA 2022)
* 29th RCRA workshop on Experimental evaluation of algorithms for solving
problems with combinatorial explosion (RCRA 2022)


ASSOCIATED EVENTS

LPNMR DOCTORAL CONSORTIUM - A mentoring event where PhD students have a
chance to present their current research, get feedback from peers and
senior researchers, and establish contacts for their future career.


FURTHER INFORMATION

WWW:https://lpnmr2022.dibris.unige.it
Email:lpnmr2022@easychair.org (program)
lpnmr2022@dibris.unige.it (general matters)
Facebook:https://www.facebook.com/lpnmr2022
Twitter:https://twitter.com/lpnmr2022
Instagram:https://www.instagram.com/lpnmr2022


IMPORTANT DATES

* Paper registration: April 23, 2022
* Paper submission: April 30, 2022
* Notification: June 10, 2022
* Final versions due: June 30, 2022


VENUE

The main conference will take place in Genova Nervi, Italy, in the Collegio Emiliani
(http://www.collegioemiliani.it/, information available only in Italian on this link),
which is a college directly situated on the sea.
Nervi is a former fishing village, now a suburb of Genoa. Nervi is 7 km
east of central Genova. Genova is the capital of Liguria, stretching along the
bay of the same name from Nervi to the east as far as Voltri to the west.
The pride of Nervi is the sea promenade, a 2 km walkway along the cliffs.
The stunning views make it one of Italy's most beautiful promenades. Nervi is also
well known for its Parchi, a park of about 22 acres (9 hectares) created from the
gardens of the Villa Grimaldi, Villa Groppallo, and Villa Serra. It has typical
Mediterranean plant species and many exotic species.
Genova's old town district (reachable by local train, by bus, as well as by boat) is
one of the largest in Europe, and hosts some remarkable artistic and architectural
treasures, including the Palazzi dei Rolli, fifty or so homes of the aristocracy entered
on the UNESCO World Heritage List.
In addition to offering a wealth of cultural attractions, Genova is a fascinating
destination for tourists, with its scenic vantage points, sea promenades, aristocratic
villas and of course the Riviera to the east and west, both easy to reach: Portovenere
and Le Cinque Terre (also UNESCO World Heritage Sites), Portofino and Camogli to the east
and Alassio, Sanremo, Bordighera to the west.

Associated events (workshops) are planned to be held at the University, which is in the
city center of Genova, but we are still considering if they can be done in the main
conference venue.

Of course, we will continuously monitor the pandemic situation in order to evaluate whether
the conference can be indeed held as an in-person event, or we will need to switch to a
hybrid event, if not completely on-line.

GENERAL CHAIR

Georg Gottlob, Oxford University, UK


PROGRAM CHAIRS

Daniela Inclezan, Miami University, USA
Marco Maratea, University of Genova, Italy


PUBLICITY CHAIR

Jessica Zangari, University of Calabria, Italy


WORKSHOPS CHAIR

Viviana Mascardi, University of Genova, Italy


DOCTORAL CONSORTIUM CHAIR

Martin Gebser, University of Klagenfurt, Austria


LOCAL ORGANIZATION

Matteo Cardellini, University of Genova, Italy
Angelo Ferrando, University of Genova, Italy (Chair)
Marco Mochi, University of Genova, Italy


PROGRAM COMMITTEE

Mario Alviano, Department of Mathematics and Computer Science, University of Calabria
Chitta Baral, Arizona State University
Marcello Balduccini, Saint Joseph's University
Francesco Calimeri, Department of Mathematics and Computer Science, University of Calabria
Marina De Vos, University of Bath
Carmine Dodaro, Department of Mathematics and Computer Science, University of Calabria
Agostino Dovier, University of Udine
Daniele Theseider Dupré, Universita' del Piemonte Orientale
Thomas Eiter, Vienna University of Technology
Esra Erdem, Sabanci University
Wolfgang Faber, Alpen-Adria-Universität Klagenfurt
Johannes K. Fichte, TU Wien
Paul Fodor, Stony Brook University
Gerhard Friedrich, Alpen-Adria-Universitaet
Sarah Alice Gaggl, TU Dresden
Martin Gebser, University of Klagenfurt
Michael Gelfond, Texas Tech University
Gopal Gupta, The University of Texas at Dallas
Katsumi Inoue, NII
Tomi Janhunen, Tampere University
Gabriele Kern-Isberner, Technische Universitaet Dortmund
Matthias Knorr, Universidade NOVA de Lisboa
Emily Leblanc, Drexel University
Joao Leite, Universidade NOVA de Lisboa
Vladimir Lifschitz, The University of Texas at Austin
Enrico Pontelli, New Mexico State University
Francesco Ricca, Department of Mathematics and Computer Science University of Calabria
Alessandra Russo, Imperial College London
Orkunt Sabuncu, TED University, Ankara
Chiaki Sakama, Wakayama University
Torsten Schaub, University of Potsdam
Guillermo R. Simari, Universidad del Sur in Bahia Blanca
Theresa Swift, NOVALINKS, Universidade Nova de Lisboa
Matthias Thimm, FernUniversität in Hagen
Hans Tompits, Vienna University of Technology
Mirek Truszczynski, Computer Science Department, University of Kentucky
Johannes P. Wallner, TU Graz
Kewen Wang, Griffith University
Stefan Woltran, Vienna University of Technology
Jia-Huai You, University of Alberta


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

[DMANET] Call for Papers: Graph Drawing and Network Visualization - GD 2022

Sorry if you have received multiple copies of this email
================================================================

Call for Papers

GD 2022

30th International Symposium on
Graph Drawing and Network Visualization

September 13-16, 2022 - Tokyo, Japan
https://graphdrawing.github.io/gd2022/

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

PDF version: https://graphdrawing.github.io/gd2022/assets/pdfs/CallforPapers2022.pdf

HTML version: https://graphdrawing.github.io/gd2022/pages/cfp/


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

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering.

GD has been the main annual event in this area for about 30 years. Its focus is on combinatorial and algorithmic aspects of graph drawing, as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute papers and posters and to participate in the symposium and the graph drawing contest.

GD 2022 will be held at the Tokyo Institute of Technology, Japan, on September 13-16, 2022, with a reception on the evening of September 13. A pre-conference PhD school is planned for September 12-13, 2022.
While we hope that a physical conference will be possible, details of the exact format of the venue (onsite, online, hybrid) will be announced before the submission deadline. Regardless of the format, we are committed to offering remote participation for both presenters and the audience.

The code of conduct for the GD conference can be found at
http://graphdrawing.org/codeOfConduct.html

PAPERS
------

We invite authors to submit papers describing original research of theoretical or practical significance to graph drawing and network visualization.
To promote a balanced coverage of the field, GD has two distinct tracks, and papers submitted to one track will not compete with papers submitted to the other track. Regular papers must be submitted explicitly to one of the two tracks. However, all program committee members may review papers from either track.


Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as combinatorial aspects and algorithm design. The range of topics for this track includes (but is not limited to):
* Design and analysis of graph drawing algorithms
* Geometric and topological graph theory
* Computational topology of graphs on surfaces
* Geometric network design and optimization
* Geometric computing

Track 2: Experimental, applied, and network visualization aspects
--------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing, such as the development and evaluation of network visualization algorithms, systems, and interfaces in different application areas. The range of topics for this track includes (but is not limited to):
* Visualization of networks in real world applications
* Engineering of graph drawing algorithms and network visualization systems
* Benchmarks and experimental studies of algorithms, systems, and user interfaces for graph drawing and network visualization
* Cognitive studies on network visualization readability and user interaction
* Interfaces and methods for interacting with graphs and networks

Authors of accepted applied papers can request the opportunity to show a demo of their software/system during the poster session.

Short papers
------------

In addition to the above two tracks, there will be a separate category for short papers, describing theoretical or applied contributions of shorter length. Papers in this category will be assigned a shorter time for presentation during the conference.

Submission format
-----------------

All submissions must be formatted using the appropriate LaTeX style file, either gd-llncs.cls for long papers or gd-llncs-short.cls for short papers; these are derived from the style file used for the conference series Lecture Notes in Computer Science (LNCS) provided by Springer. The default margins and fonts must not be modified; in particular, the use of packages such as times.sty is not allowed. Submissions that do not comply with this format risk rejection without consideration of their merits.

To promote inclusion of figures in the submitted papers, submissions will have a strict number of lines limit. Regular papers must have at most 400 lines, (excluding references and figures) and at most 14 pages (excluding references). Short papers must have at most 225 lines (excluding references and figures) and at most 7 pages (excluding references). The claims of the paper should be fully substantiated. If this information does not fit within the line/page limits, the authors should include it in a clearly marked appendix, whose length is not constrained and which the reviewers may read at their own discretion.

All submissions will be handled through EasyChair at the web site https://easychair.org/conferences/?conf=gd2022

Posters & Contest
-----------------

Submissions of posters on graph drawing, network visualization, and related areas are solicited. The poster session will provide a forum for the communication of late-breaking research results (which may also appear elsewhere) to the GD community. Authors of posters should prepare an abstract (up to 2 pages in the LNCS style) that must be submitted together with the poster itself.

Details about the traditional Graph Drawing Contest held at the conference are provided on the conference web site https://graphdrawing.github.io/gd2022/pages/contest/

LIGHTWEIGHT DOUBLE-BLIND REVIEW PROCESS
--------------------------------

This year, for the first time in the GD conference, the review process will be handled in a "lightweight double-blind mode". This means that authors are not allowed to reveal their identity in the paper that they submit to GD'22, but are free to disseminate draft versions of the paper prior to the conference and to give talks on the topic as they normally would. In particular, the submitted paper should not contain authors' names, affiliations, and email addresses, or acknowledgements to workshops or funding projects. References to their own related work are allowed, as long as the supporting text maintains anonymity (e.g., using sentences in the third person, anonymizing references).

Members of the Program Committee will not have the identity of the authors of any paper revealed to them during the entire review process. To handle conflicts of interest effectively, authors will be offered the opportunity to declare conflict of interest with relevant PC members when they submit their paper.


PUBLICATION: PROCEEDINGS AND SPECIAL ISSUES
-----------------------

All accepted papers (including the two-page poster abstracts) will appear in the conference proceedings, published by Springer in the Lecture Notes in Computer Science (LNCS) series. The LNCS proceedings will be made freely accessible to the GD community upon publication and openly accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv repository at the same time as submitting their camera-ready versions, in order to provide immediate and unrestricted open access to them. The self-archived arXiv papers shall consist of the LNCS proceedings version (identical, except for possibly changed references to the appendix resp. the arXiv version) plus an optional clearly marked appendix. This appendix could contain a long version of the entire paper or proofs that have been omitted from the main text. Subsequent submissions of revised versions of the paper to the arXiv (known as arXiv "replacements") are allowed. Upon submission of the camera-ready version of an accepted paper, the authors will be required to specify the arXiv identifier associated with the paper for inclusion in a conference index, which will be also published in the arXiv repository. Failure to comply with these guidelines will impede the publication of the paper.

Each paper or poster must be presented at the conference by an author (barring unforeseen circumstances), otherwise the paper will not be included in the proceedings. Should any visa/travel restriction prevent an author from attending the conference and presenting a paper, he/she will be given ways to participate and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a special issue of the Journal of Graph Algorithms and Applications (JGAA). The authors of two selected papers in Track 2 will be invited to submit a substantially extended and enhanced version of their work to IEEE Transactions on Visualization and Computer Graphics (TVCG). Invitations to the special issues will be sent at most two weeks after the conference.

A TVCG papers session at the Graph Drawing conference will also feature regular TVCG papers. Please find more details at
https://www.computer.org/digital-library/journals/tvcg/tvcg-partners-with-conferences


AWARDS
------

For each of the two tracks, the Program Committee of GD 2022 will bestow a Best Paper Award. In addition, to recognize the effort of participants to present their work and to prepare their posters in a clear and elegant way, there will be a Best Presentation Award and a Best Poster Award voted on by the GD 2022 attendees.

IMPORTANT DATES
---------------

Abstract submission deadline: June 1 (23:59 PDT)
Paper submission deadline: June 8 (23:59 PDT)
Notification of paper acceptance: July 18
Poster submission deadline: August 10 (23:59 PDT)
Notification of poster acceptance: August 19
Final versions due : September 5 (23:59 PDT)
Contest submission deadline: September 6 (23:59 PDT)
Symposium: September 13-16
Invitations to special issues: September 30

INVITED SPEAKERS
----------------

Ulrik Brandes, ETH Zurich, Switzerland
Kazuo Misue, University of Tsukuba, Japan

PROGRAM COMMITTEE
-----------------

Patrizio Angelini (co-chair), John Cabot University, Italy
Therese Biedl, University of Waterloo, Canada
Sabine Cornelsen, Universität Konstanz, Germany
Giordano Da Lozzo, Roma Tre University, Italy
Stephan Diehl, Universität Trier, Germany
Henry Förster, Universität Tübingen, Germany
Martin Gronemann, TU Wien, Austria
Yasuhiro Hashimoto, The University of Aizu, Japan
Michael Hoffmann, ETH Zurich, Switzerland
Hiroshi Hosobe, Hosei University, Japan
Yifan Hu, Yahoo! Research, USA
Takayuki Itoh, Ochanomizu University, Japan
Philipp Kindermann, Universität Trier, Germany
Karsten Klein, Universität Konstanz, Germany
Stephen Kobourov, University of Arizona, USA
Jan Kratochvíl, Charles University of Prague, Czech Republic
Kim Marriott, Monash University, Australia
Irene Parada, TU Eindhoven, The Netherlands
Sergey Pupyrev, Facebook, US
Helen Purchase, University of Glasgow, Scotland
Arnaud Sallaberry, LIRMM, Université Paul-Valéry Montpellier, France
Ingo Scholtes, University of Zurich, Switzerland
Falk Schreiber, Universität Konstanz, Germany
André Schulz, FernUniversität in Hagen, Germany
Andrew Suk, University of California San Diego, USA
Antonios Symvonis, National Technical University of Athens, Greece
Alessandra Tappini, University of Perugia, Italy
Meirav Zehavi, Ben-Gurion University, Israel
Reinhard von Hanxleden (co-chair), Christian-Albrechts-Universität zu Kiel, Germany
Tatiana von Landesberger, Universität Köln, Germany


ORGANIZING COMMITTEE
--------------------

Takayuki Itoh (chair), Ochanomizu University, Japan
Ken Wakita, Tokyo Institute of Technology, Japan
Masahiko Itoh, Hokkaido Information University, Japan
Hsiang-Yun Wu, St. Pölten University of Applied Sciences, Austria
Rina Nakazawa, IBM Research, Japan


CONTEST COMMITTEE
-----------------

Philipp Kindermann (chair), Universität Trier, Germany
Tamara Mchedlidze, Utrecht University, The Netherlands
Wouter Meulemans, TU Eindhoven, The Netherlands

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

[DMANET] Two lecturer positions in theoretical computer science at the University of Auckland

The School of Computer Science at the University of Auckland invites excellent early-career researchers to apply for one of two lecturer positions in Theoretical Computer Science (broadly interpreted). A lecturer position in New Zealand is roughly equivalent to an assistant professor position in the US, and a successful candidate is expected to do research and teaching.

For more information, please see: https://smrtr.io/8sZv8.

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

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

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


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

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

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

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

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

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

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

*The next application deadline is May 13, 2021. *

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


--


--

Sushmita Ruj

Senior Lecturer

School of Computer Science and Engineering

University of New South Wales, Sydney

Kensington, NSW 2052
Australia

Email: sushmita.ruj@unsw.edu.au

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

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

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

[DMANET] PhD Position in Algorithms and Complexity at Max Planck Institute for Informatics, Germany

We offer a full-time PhD position (German salary level TVöD Bund E 13)
at the Algorithms and Complexity Department at the Max Planck Institute
for Informatics (MPI-INF) in Saarbrücken, Germany. The starting date is
negotiable and could be as early as June, 2022.

You will be part of a research project on "Approximation Algorithms for
Combinatorial Optimization Problems with Packing Constraints", which is
funded by the DFG (German Research Foundation). You will design and
analyze algorithms for problems arising in clustering, submodular
optimization, network design, and geometric optimization. Moreover, you
will identify the limits of the algorithmic solvability of these
problems, in particular, the hardness of approximation. For more details
on the topics and project-relevant algorithmic / mathematical tools, I
refer to the project description and a list of related papers.

https://gepris.dfg.de/gepris/projekt/399223600?language=en
https://people.mpi-inf.mpg.de/~jspoerha/project.html

You will be co-supervised by Prof. Danupon Nanongkai and myself. I am
the principal investigator of the project.

You hold a master's degree (ideally) or a bachelor's degree in computer
science, mathematics (or a related field) and have an excellent academic
record. You are enthusiastic about theoretical and mathematical
foundations of computer science and have a solid background in this
regard. You are highly self-motivated, excited to work independently on
hard problems, to learn new techniques, but also to discuss ideas with
your supervisors or in a team with other researchers.

We, the Algorithms and Complexity Department headed by Prof. Danupon
Nanongkai, are a strong, vibrant, broadly interested, and
internationally highly renowned group of researchers. We are part of one
of the strongest research clusters for algorithms and complexity in
Europe. We closely collaborate with researchers in other institutes on
the  campus, including the Department of Computer Science of Saarland
University, CISPA Helmholtz  Center for Information Security, and Max
Planck Institute for Software Systems.

https://www.mpi-inf.mpg.de/departments/algorithms-complexity

Our institute, MPI-INF, is among the more than 80 institutes run by the
Max Planck Society. The MPIs are Germany's premier basic research
institutes performing world-class, basic research in the fields of
medicine, biology, chemistry, physics, technology, and the humanities.
Since 1948, MPI researchers have been awarded 21 Nobel prizes certifying
the excellence of the research at MPIs.

The  Max  Planck  Society  seeks  to  increase  the  number  of women in
those areas where they are underrepresented and therefore explicitly
encourages women to apply. The  Max  Planck  Society is further
committed to employing more individuals with handicaps and particularly
encourages these to apply.

Please send your application by April, 15 to my email address below.
Include a short letter of motivation (about one page), a CV, names of
two references, as well as electronic copies of your degree
certificates, all as a single PDF. Do not hesitate to contact me in case
of questions.

Dr. Joachim Spoerhase
jspoerha "at" mpi-inf.mpg.de
https://people.mpi-inf.mpg.de/~jspoerha/
https://people.mpi-inf.mpg.de/~jspoerha/project.html

**********************************************************
*
* 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] The Logic Colloquium 2022

The Logic Colloquium 2022 will take place from June 27 to July 1, 2022 at Reykjavik University, in Iceland.

The deadline to submit abstracts is quite soon, on 24/3.

The website is: http://icetcs.ru.is/lc2022/

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

The Logic Colloquium is the European Summer Meeting of the Association for Symbolic Logic, that in 2022 will be held from the 27th of June to the 1st of July 2022 at Reyjavik University, Iceland. We encourage you to submit abstracts for contributed talks.

Call for Papers
The deadline for contributed talk submissions and for student travel grants applications is March 24, 2022.

Contributed talks
Abstracts for contributed talks should conform to the Rules for Abstracts of the ASL, and should be sent to asl@uconn.edu<mailto:asl@uconn.edu>. Online contributed talks are welcome and we will do our best to make this event hybrid, although we of course encourage you to come to Iceland (see the travel information) to meet the community.

Topics of interest include:

Set Theory
Proof Theory
Model Theory
Computability Theory
Philosophical Logic
Logic in Computer Science
Student travel grants
To be considered for a travel award, please

send a letter of application, and
ask your thesis supervisor to send a brief recommendation letter.
Your application letter should be brief (preferably one page) and should include:

your name;
your home institution;
your thesis supervisor's name;
a one-paragraph description of your studies and work in logic, and a paragraph indicating why it is important to attend the meeting;
your estimate of the travel expenses you will incur;
(for citizens or residents of the USA) citizenship or visa status; and
(voluntary) indication of your gender and minority status. Women and members of minority groups are strongly encouraged to apply.

Travel grant applications are accepted from students and also from recent Ph.D. recipients, until the deadline of March 24, 2022, and ASL membership is not required. Applications should be submitted via email to asl@uconn.edu<mailto:asl@uconn.edu> or to the ASL Business Office:
ASL, Dept. of Mathematics,
Univ. of Connecticut,
341 Mansfield Road,
U-1009, Storrs, CT 06269-1009, USA.
Decisions will be communicated at least two months prior to the meeting.


Important Dates

Deadline for Abstract Submission: 24th of March
Start of the Conference: 27th of June
End of the Conference: 1st of July


For more information, please visit http://icetcs.ru.is/lc2022/

On behalf of the OC,
Antonis Achilleos

**********************************************************
*
* 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 student position in parameterized complexity and multiobjective optimization - University of Lille, France

The ORKAD team at University of Lille, France, is looking for a
full-time PhD student to work on a project mixing parameterized
complexity and multiobjective optimization. The PhD will be supervised
by Laetitia Jourdan and Julien Baste. If the application is accepted,
we offer a fully funded position for a period of 3 years. This work
should lead to a PhD degree. The detail of the PhD is attached to the
email.

Applicants for the PhD position should hold a master's degree in
computer science or mathematics. In order to apply, the student should
send a fully detailed CV, an academic record (Master degree or
equivalent), a cover letter, and at least one recommendation letter.
The application should be sent before April 23th 2022 to
phd-application-orkad-2022@univ-lille.fr.
If you have any question regarding the offer, feel free to send us an
email to phd-application-orkad-2022@univ-lille.fr.

Regards,

--
Julien Baste
julien.baste@univ-lille.fr
https://www.iut-info.univ-lille.fr/~julien.baste/

**********************************************************
*
* 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 Nominations: Prize for Innovation in Distributed Computing 2023

Nominations are requested for the *Prize for Innovation In Distributed
Computing 2023*, awarded by the Colloquium on Structural Information and
Communication Complexity <http://sirocco.hiit.fi/> (SIROCCO).

This prize was established to recognize individuals whose research
contributions expanded the collective investigative horizon in SIROCCO
<http://sirocco.hiit.fi/>'s area of interest. That is, they formulated new
problems, or identified new research areas, that were at the time of their
introduction, unorthodox and outside the mainstream, but later attracted
the interest of the SIROCCO community.

This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity – the qualities that reflect the spirit of the
SIROCCO conference.

The winner of the Prize for Innovation in Distributed Computing 2023 is
expected to give an invited talk at SIROCCO 2023. The winner of the 2022
edition of the prize (Christian Scheideler) will give a talk at *SIROCCO *2022
which will be held in Paderborn June 27 – 29.

Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, Pierre Fraigniaud, Michel Raynal, Masafumi
Yamashita, Shmuel Zaks, Zvi Lotker, Paola Flocchini, Amos Korman, Friedhelm
Meyer auf der Heide, and Christian Scheideler.

The prize may not necessarily be awarded every year.

Deadline for nominations: *April 30, 2022*.

*Eligibility*

The following conditions must be met by the nominees to be eligible for the
prize. It is requested that a nomination letter explains and demonstrates
how the nominee matches these conditions.

(1) The original innovative contribution was introduced by the nominee(s)
for the first time in a publication at least five years before the
nomination deadline, and the publication must have appeared in a conference
proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper closely related to the innovative contribution, must have
appeared in a SIROCCO proceedings.

A nomination letter should identify the paper(s) that make(s) the nominee
eligible according to conditions (1) and (2) above, as well as explain the
contribution, its originality, and its significance.

Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or DBLP
<http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html>.

*Selection process*

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference, the PC
chairs, including co-chairs, of the three SIROCCO conferences immediately
preceding the nominations deadline, plus one additional member of the
Advisory Board, or one past winner, selected by the Steering Committee for
the current year.

The Award Committee of the Prize for Innovation in Distributed Computing
2022 consists of: Keren Censor-Hillel (Technion), Michele Flammini
(University of L'Aquila), Pierre Fraigniaud (University of Paris and
CNRS), Magnus M. Halldorsson - chair (Reykjavik University), Thomas
Jurdzinski (Wroclaw University), Andrea Richa (University of Arizona),
Christian Scheideler (Paderborn University), and Stefan Schmid (University
of Vienna).

Nominations can be made by any member of the scientific community.

*The deadline for nominations is April 30, 2022.*

Please send the nomination to the prize committee chair, Magnus M.
Halldorsson, by e-mail mmh@ru.is. Please write "SIROCCO Prize Nomination" *in
the subject line*.

Please help in recognizing the contributions of members of our community.

**********************************************************
*
* 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] [RO] Euro 2022 - Call for abstracts: "Synergies: Learning for and with Optimization" session

Dear Colleagues,

We would like to invite you to submit your abstracts to the special session
"Synergies: Learning for and with Optimization" within the "Machine
Learning and Mathematical Optimization" stream of the 32nd European
Conference on Operational Research (EURO 2022).

We welcome contributions at the intersection of machine learning and
optimization. These might concern, for example, the application of learning
paradigms to improve the solution of an optimization problem, the use of
optimization techniques to customize a machine learning predictor or
enhance/rewrite its training process, and more.

You can submit your abstract by going on the submission webpage (
https://euro2022espoo.com/submissions/) and using the code *6179b93f* .

Submission deadline: 25 March 2022.

If you have any questions, please feel free to contact me.

Looking forward to seeing you in Finland!

Gabriele Iommazzo (gab.iom89@gmail.com)

--
Gabriele Iommazzo
LIX
<https://www.google.it/maps/place/Inria+Saclay+%C3%8Ele-de-France/@48.7141058,2.2082825,17z/data=!4m5!3m4!1s0x47e6789395bd5717:0x1ce0964fac2d9f2a!8m2!3d48.7146403!4d2.2056539>
CNRS
<https://www.google.it/maps/place/Inria+Saclay+%C3%8Ele-de-France/@48.7141058,2.2082825,17z/data=!4m5!3m4!1s0x47e6789395bd5717:0x1ce0964fac2d9f2a!8m2!3d48.7146403!4d2.2056539>,
Ecole Polytechnique, Institut Polytechnique de Paris
Bâtiment Alan Turing, 1 rue Honoré d'Estienne d'Orves
91128 Palaiseau, France

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

[DMANET] [Green Scheduling] Last Call for Abstracts – AIROYoung @ EURO 2022

As in EURO2021, also this year AIROYoung will have the opportunity to organise and chair a session on Combinatorial Optimization, during the next EURO Conference that will be held in Espoo (Finland) on July 3-6, 2022.

The title of our session is "Green Scheduling", given our attention to current and important issues such as the environment and sustainability. This theme can cover both routing (e.g., air line and public transportation) and energy (e.g., wind, power, EV), but not only. If you work on these topics or others related, join us and present your research!
We will give priority to young researchers (under 35 years old or at the first stages of the career).

You can submit your abstract by going to the submission page at https://www.euro-online.org/conf/euro32 and inserting the following invitation code: e554caa5.

Just a few notes on the abstract submission:
- abstracts must be written in English and contain no more than 1500 characters (no formulas or mathematical notation are allowed);
- each attendee is allowed to present one paper at the conference;
- please note that the submission must be done by the person who will present the paper and will be shown as first author. No change to the first speaker will be allowed later;
- submission deadline: March 25, 2022.

We look forward to receiving your abstract! If you have any questions, do not hesitate and contact us at airo.young.researchers@gmail.com .

The AIROYoung board

PS: follow us on Twitter (https://twitter.com/AIROyoung), Instagram (https://www.instagram.com/airoyoung/?hl=en), and Facebook (https://www.facebook.com/AIROYoungResearchersChapter/) to stay updated with our latest news and events ;)


**********************************************************
*
* 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] ICGT 2022 | Montpellier, July 4-8 | Last CFP

[Apologies for multiple receptions]

============================
ICGT 2022 - Last CPF
============================

The 11th International Colloquium on Graph Theory and combinatorics (ICGT 2022)
will take place in

** Montpellier, France, July 4-8, 2022 **

Webpage of the conference: www.lirmm.fr/icgt-2022

* Submission deadline: March 25th 2022, 23h59 AoE ... this week!

* Practical information: we have affordable rooms in the university
residence available for students. More information here:
https://www.lirmm.fr/icgt-2022/registration

ICGT is a conference created in the honor of Claude Berge in 1976 and
organized by the French community in Graph Theory every 4-5 years. This
11th edition succeeds the editions of Lyon in 2018, Grenoble in 2014, Orsay
in 2010, and Hyères in 2005.

We welcome submissions whose main topic is graph theory (including graph
algorithms and computational aspects) and/or combinatorics.

Submission guidelines: https://www.lirmm.fr/icgt-2022/submission
Submission website: https://easychair.org/conferences/?conf=icgt-2022

Unless the situation of the pandemic gets significantly worse, we plan to
hold ICGT 2022 in a fully physical format. Should there be any change, we
will immediately announce it in the above conference webpage.

Contact email: icgt2022@lirmm.fr

==== Registration ====

Registration is now open: www.lirmm.fr/icgt-2022/registration

Early registration: February 18 to May 13, 2022.
Late registration: May 14 to June 29, 2022.
Students or retired researchers: 200€ (early), then 250€ (late).
Other participants: 300€ (early), then 350€ (late).

==== Invited speakers ====

- Reinhard Diestel (Hamburg University, Germany)
- Vida Dujmović (University of Ottawa, Canada)
- David Eppstein (University of California, Irvine, United States)
- Fedor Fomin (Bergen University, Norway)
- Martin Grohe (RWTH Aachen University, Germany)
- Gwenaël Joret (Université Libre de Bruxelles, Belgium)
- Jean-Sébastien Sereni (CSTB ICube, France)
- Virginia Vassilevska Williams (MIT, United States)
- Kristina Vušković (University of Leeds, United Kingdom)

==== Important dates ====

- Submission: February 1-March 25, 2022
- Notification of acceptance: April 22, 2022
- Early registration: February 18-May 13, 2022
- Late registration: May 14-June 29, 2022
- Conference: July 4-8, 2022

A special issue of DMTCS will be devoted to the conference. Instructions
will be sent after the conference. Tentative submission deadline for the
special issue: November 30, 2022.

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

Monday, March 21, 2022

[DMANET] Postdoc in Algorithmic Phylogenetics at the University of Auckland (Simone Linz)

Postdoc in Algorithmic Phylogenetics at the University of Auckland

A postdoctoral position is available to work on a project related to algorithmic foundations of phylogenetic networks. These networks are used to represent and analyse evolutionary relationships between entities such as species, viruses, and cancer cells. A particular focus of the project is the development of new parameterized algorithms and other algorithms with performance guarantee to reconstruct phylogenetic networks from biological data. The position is for 18 months, to commence in early 2023, and fully-funded by a Marsden Fund Grant from the Royal Society of New Zealand Te Apārangi. The successful candidate will be based in the School of Computer Science at the University of Auckland.

Requirements.
The successful applicant has a PhD degree in computer science or mathematics, and a strong background in theoretical computer science or discrete mathematics. An interest in biological questions is desirable, but not a strict requirement.

Application.
To apply, please email your CV, a cover letter including your motivation to apply for this position, a research statement (2 pages maximum), and names and contact details of two referees to Dr Simone Linz (s.linz@auckland.ac.nz). Informal inquiries can be directed to the same address. Applications will be reviewed starting 15 April 2022 and continue until the position is filled.
**********************************************************
*
* 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] Open Ph.D. positions at the Vienna School of Mathematics

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

The Vienna School of Mathematics
University of Vienna - TU Wien

Open Ph.D. Positions

https://www.vsmath.at

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

The Vienna School of Mathematics is a joint doctoral program of the
mathematics institutions of the University of Vienna and TU Wien. This
doctoral program intends to provide a top-level scientific training of
doctoral students in all fields of mathematics. The graduate school
aims at attracting excellent students from Europe and around the world
to Vienna and to guide them towards research at the forefront of
modern mathematics in an exciting and dynamic scientific environment
in Vienna.

The Vienna School of Mathematics invites applications for Ph.D. positions,
among others in combinatorics, discrete geometry, optimization, and
stochastics and probability theory. For application details see the
website.

The deadline for applications is April 20, 2022.


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

[DMANET] Call for papers: QBF '22

CALL FOR PAPERS

QBF 2022
--------
International Workshop on
Quantified Boolean Formulas and Beyond
August 1, 2022

To be held in hybrid format (virtually + in-person).

https://www.ac.tuwien.ac.at/qbf2022/

Affiliated to and co-located with:
Int. Conf. on Theory and Applications
of Satisfiability Testing (SAT 2022),
August 2-5, 2022.


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

Quantified Boolean formulas (QBF) are an extension of propositional
logic which allows for explicit quantification over propositional
variables. The decision problem of QBF is PSPACE-complete, compared to
the NP-completeness of the decision problem of propositional logic (SAT).

Many problems from application domains such as model checking, formal
verification or synthesis are PSPACE-complete, and hence could be
encoded in QBF in a natural way. Considerable progress has been made
in QBF solving throughout the past years. However, in contrast to SAT,
QBF is not yet widely applied to practical problems in academic or
industrial settings. For example, the extraction and validation of
models of (un)satisfiability of QBFs has turned out to be
challenging, given that state-of-the-art solvers implement different
solving paradigms.

The goal of the International Workshop on Quantified Boolean Formulas
(QBF Workshop) is to bring together researchers working on theoretical
and practical aspects of QBF solving. In addition to that, it
addresses (potential) users of QBF in order to reflect on the
state-of-the-art and to consolidate on immediate and long-term
research challenges.

The workshop also welcomes work on reasoning with quantifiers in
related problems, such as dependency QBF (DQBF), quantified constraint
satisfaction problems (QCSP), and satisfiability modulo theories (SMT)
with quantifiers.


===============
IMPORTANT DATES
===============

May 1: Submission
June 5: Notification of acceptance
June 19: Final versions of accepted papers due
August 1: Workshop

Please see the workshop webpage for any updates:

https://www.ac.tuwien.ac.at/qbf2022/

======================
CALL FOR CONTRIBUTIONS
======================

The workshop is concerned with all aspects of current research on all
formalisms enriched by quantifiers, and in particular QBF. The topics
of interest include (but are not limited to):

Applications, encodings and benchmarks with quantifiers
QBF Proof theory and complexity results
Experimental evaluations of solvers or related tools
Case studies illustrating the power of quantifiers
Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc.
Formats of proofs and certificates
Implementations of proof checkers and verifiers
Decision procedures
Calculi and their relationships
Data structures, implementation details and heuristics
Pre- and inprocessing techniques
Structural reasoning

==========
SUBMISSION
==========

Submissions of extended abstracts are invited and will be managed via
Easychair:

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

In particular, we invite the submission of extended abstracts on work
that has been published already, novel unpublished work, or work in
progress.

The following forms of submissions are solicited:

- Proposals for short tutorial presentations on topics related to the
workshop. Tutorial proposals will be reviewed by the PC. The number
of accepted tutorials depends on the overall number of accepted
papers and talks, with the aim to set up a balanced workshop
program.

- Talk abstracts reporting on already published work. Such an abstract
should include an outline of the planned talk, and pointers to
relevant bibliography.

- Talk proposals presenting work that is unpublished or in progress.

- Submissions which describe novel applications of QBF or related
formalisms in various domains are particularly welcome.
Additionally, this call comprises known applications which have been
shown to be hard for QBF solvers in the past as well as new
applications for which present QBF solvers might lack certain
features still to be identified.

Each submission should have an overall length of 1-4 pages in LNCS
format. Authors may decide to include an appendix with additional
material. Appendices will be considered at the reviewers' discretion.

The accepted extended abstracts will be published on the workshop
webpage. The workshop does not have formal proceedings.

Authors of accepted contributions are expected to give a talk at the
workshop.

=======
CONTACT
=======

qbf2022@easychair.org

=================
PROGRAM COMMITTEE
=================

Hubie Chen, Birkbeck, University of London
Florian Lonsing, Stanford University
Martina Seidl, JKU Linz
Friedrich Slivovsky, TU Wien


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