Thursday, March 28, 2024

[DMANET] 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024) - TUTORIAL AND WORKSHOP PROPOSALS EXTENDED DEADLINE

Call for Tutorial and Workshop Proposals
21st International Conference on
Principles of Knowledge Representation and Reasoning, KR 2024
November 2 - November 8, 2024, Hanoi, Vietnam

Deadline for submissions EXTENDED : 11 April, 2024
Conference web site: www.kr.org/KR2024

-- Call for Tutorial and Workshop Proposals--

The 21st International Conference on Principles of Knowledge
Representation and Reasoning (KR 2024) solicits proposals for its
tutorial and workshop program. Tutorials and workshops will be held on
2nd to 4th of November 2024, prior to the KR main technical program.
KR will take place physically in Hanoi, Vietnam. The attendance of
tutorials is complimentary to all KR registered participants. Workshop
attendance will be subject to payment of a workshop fee, which is
separate from that of the main conference.

-- Important Dates --

• Proposal submission deadline EXTENDED: April 11, 2024
• Notification: April 17, 2024
• Workshop paper submission deadline: July 17, 2024
• Workshop paper notification: August 21, 2024
• Workshop registration deadline: September 4, 2024
• Tutorial and workshop dates: November 2-4, 2024

-- Submission Instructions --

Each proposal (tutorial or workshop) should be in English and must be
submitted electronically to the Workshop and Tutorial track of KR 2024.
The submission site will open on Thursday 15 February 2024.
For all accepted proposals, KR will take care of all local
arrangements.

-- Submission Requirements for Tutorial Proposals --

KR tutorials are half-day or (exceptionally) full-day events that
introduce general or special topics in KR and relevant neighboring
areas. They can be first introductions to an established area or an
emerging field, but also advanced courses on specialized methods or
new approaches. The content should be adequately established and
balanced, and not be limited to advertising an individual research
work or product. A focus on specific tools and methodologies can still
be useful to offer concrete examples and hands-on activities to
participants.

Each accepted tutorial will entitle a discount on the KR registration
fee for one tutorial presenter.

Each tutorial proposal should contain the following information:

• Title, presenters and proposed length of the tutorial (half-day is
recommended, but an argument can be made for a full-day tutorial)
• A half-page introduction to the tutorial's subject and relevance
to KR
• A half-page on the target audience, prerequisite knowledge, and
learning goals
• One page outline of the tutorial contents and intended structure
• A brief resume of each presenter including name, affiliation,
email address, and evidence of scholarship in the area, mentioning
relevant publications or professional experience.

The main duties of tutorial organizers are:

• Setup a web-page for the tutorial, which should at least include
the information from the proposal, tutorial material and related
references.
• Deliver the tutorial at KR 2024. A future call will provide
details on the presentation options.

-- Submission Requirements for Workshop Proposals --

Workshops provide a place to exchange ideas in emerging fields in KR
research and application. They can take many forms, including
mini-conferences (with peer-reviewed publications), competitions and
shared tasks, working sessions (discussions, hackathons, etc.),
line-ups of invited contributions, or a mix of these. Innovative
formats are welcome, but organizers must provide means of estimating
attendance and required length up-front (by number of submissions,
invited speakers, or early registered participants).

Workshop proposals can use up to 4 pages, which should include the
following information:

• Title, acronym of the workshop, proposed duration (half day,
one day, ...)
• Workshop description: goals, format, and expected activities
during the workshop
• Audience: target audience, research groups in the area, planned or
confirmed invited speakers, expected number of submissions and
participants
• Related events: history of the workshop (if applicable),
relationship to recent similar events
• Tentative list of PC members with their respective affiliations
• A brief resume of each organizer including name, affiliation,
contact details, and evidence of scholarship in the area,
mentioning relevant publications or professional experience.
• Appendix: tentative call for contributions

The main duties of the chair(s) of each accepted workshop are:

• Set up a webpage for the workshop
• Advertise the workshop, distribute its call for papers and call
for participation
• Coordinate the peer-reviewing of submitted contributions
• If workshop proceedings are desired, it is the duty of the
organizers to produce and distribute their workshop proceedings
• Organize a schedule for the workshop in collaboration
with the local organizers and the KR workshop co-chairs
• Coordinate and moderate the workshop participation and content

KR reserves the right to cancel a workshop if it does not have enough participants to cover its running costs.

-- Inquiries --

Inquiries should be sent by email to the KR 2024 Tutorial and Workshop Chairs:

• Elena Botoeva, University of Kent (e.botoeva@kent.ac.uk)
• Abhaya Nayak, Macquarie University, Australia
(abhaya.nayak@mq.edu.au)

KR Inc., not for profit Scientific Foundation, , Massachusetts, USA , ,

Manage preferences (https://hs-5228907.s.hubspotstarter.net/preferences/en/manage?data=W2nXS-N30h-zMW3ZYV9k21sCNzW3T29kS1Lj8ggW2YcVrr3Cc05hW3Sy0Hc3P77LqW3H62XZ3DZXxTW2nH_nr45mgcrW4kJbyJ1_f4g5W3_SjXp47pF-WW3Y2CzN30G5ZsW2CSltw32ktC7W1Vd5qN1Qlh80W384ltQ3yL03cW1N5-GV2s_9tXW2nZ2SP2qLDB3W2FMytq2KsktJW346tT22vYWckW45XkmL2MWh36W2y3Pg01TZXQJW3ZW0Ym3_pCWMW47ywKB2HTZ10W1BtP-L3_-QRpW2Kr3HN4kmLfpW2-cfLy38mk6wW49sj8s4rBfRnW4krVc91NDtpmW3F6Fbp4ph80hW3yWyBC2PzYXLW25nRWX1VbqY2W1NC9ln47znfcW3VY1Q232H9bdW1BFZZK2nT5Q0W2nTYkd3BYWflW4mlhlR23qg9xW2TsmDW3j6stpW4p9Nff2TKvmgW20ZvYT3C61y4W1B9tRS2MQcf5W2Yvlgf2-nQk0W3_svvf2Wp6ngW3GJ7Tf3XyT2xW41QnCx2vY2RqW1QDKWH43s3DJW1Vq3YR41pQb4W3d1XF724RWLsW2KRJwm3K4fjJf2p3N8X04&_hsenc=p2ANqtz-_MbLlw73KpRaUW4U6LGLPMHTLz3b-wyeQaA5kzXzV18HSp8cAeHVKy9WHwSiLG_-1NOFhfX-uFTK6r21lh2Wg1w0uizA&_hsmi=300228723 )

**********************************************************
*
* 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] Permanent positions in mathematics and AI

Lancaster University is hiring under our new £15m investment in
"Mathematics for AI in Real-world Systems" programme. We have a Professor,
2 senior lecturer (=associate prof), 2 lecturer (=assistant prof) posts and
a research software engineer position.

If you're interested in bringing your applied mathematics, mathematical AI,
or theoretical computer science expertise to Lancaster please see the job
adverts here:

Prof: https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=0404-24
SLs: https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=0471-24
Ls: https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=0449-24
RSE: https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=0444-24

Interested applicants with discrete mathematical interests might like to
contact Tony Nixon (a.nixon@lancaster.ac.uk) for an informal chat about the
positions.

**********************************************************
*
* 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] FedCSIS 2024 Data Science Challenge: Predicting Stock Trends

We would like to cordially invite you to participate in our data science
challenge:
https://knowledgepit.ai/fedcsis-2024-challenge/

The topic of this year's competition is the prediction of stock trends.
The dataset contains key financial indicators for 300 companies chosen
from 11 different sectors of the S&P 500 index, from 10 years. Each
company is described by values of 58 indicators that are derived from
its financial statements. The dataset also contains information on
1-year change for each indicator, which can indicate a trend in the
considered values. The task for the competition participants is to
develop a predictive model able to accurately forecast stock trend
movements based on the provided financial fundamental data. Such a model
could have a vital role in algorithmic or manual trading, providing the
trading signals for making decisions about whether it is a good moment
to buy or sell the stock, or maybe not to trade at all. The
competition's sponsor is Mobi Banka (part of the PPF group) – the
first bank in the Western Balkan region where banking is done fully
mobile.

Apart from money prizes provided by the sponsor, winners can count on
free FedCSIS 2024 conference registrations!

**********************************************************
*
* 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 27, 2024

[DMANET] POS 2024 Call for Papers.

CfP: 15th International Workshop on Pragmatics of SAT
http://www.pragmaticsofsat.org/2024/

The 15th International Workshop on Pragmatics of SAT will be co-located with the 27th International Conference on Theory and Applications of Satisfiability Testing and will be held on 20th of August, 2024 in Pune, India.

The aim of the Pragmatics of SAT (PoS) workshop series is to provide a venue for researchers working on the design and/or application of Boolean Satisfiability (SAT) solvers and related solver technologies, including but not restricted to Satisfiability modulo Theories (SMT), Answer Set Programming (ASP), and Constraint Programming (CP), as well as their optimization counterparts, to meet and share both fundamental theoretical insights into practical solvers, as well as new implementation-level technical details about their systems.

Topics of interest include, but are not limited to:

+ Efficient data structures
+ Techniques for debugging or certifying solvers
+ Visualization of benchmarks structure
+ Monitoring solver behavior
+ Evaluation of solvers
+ Domain specific encodings
+ Domain specific heuristics
+ Solver API
+ System and library description
+ New (successful) application of constraint-based technologies
+ New (potential) use cases of constraint-based technologies
+ Constraint solving and machine learning
+ Scaling using multi-core or distributed technology
+ Reflection on past and projection of future of applied SAT research
(position papers and talks are both welcome)

Special Calls of 2024:

+ Competition track: In addition to regular contributions, PoS 2024 invites submissions describing tools that are submitted to any of the competitions associated with the main SAT conference (e.g. SAT Competition, MaxSAT Evaluation, Model Counting, SMT Competition, QBF Gallery, etc.).

+ SAT fast track: Original papers that do not make it to SAT on PoS-related topics will have the option of late submission to the workshop.

Submissions will be reviewed by the program committee, which will select a balanced program of high quality contributions.

If a sufficient number of original and competition track papers are accepted for the workshop (6+), a post-proceedings in CEUR-WS Proceedings will be published.

Important Dates:

Abstract submission deadline: May 13, 2024 (all submissions except SAT fast track and competition solver descriptions)
Paper submission deadline: May 18, 2024
SAT fast track submission deadline: May 27, 2024 (no separate abstract registration is needed)
Competition Solver Description submission deadline: June 5, 2024 (no separate abstract registration is needed)
Notification to authors: June 23, 2024
Revised version due: July 14, 2024
Workshop: August 20, 2024

More information is available on the workshop's web page: http://www.pragmaticsofsat.org/2024/


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

[DMANET] Postdoc on the mathematics of supply chain

We have a postdoc position at Luiss University on the mathematics of supply
chain.

A supply chain is modeled as a network whose vertices are firms and whose
edges represent their interactions. The network evolves dynamically, and
may be affected by sudden disruptions. Many of the existing supply-chain
models are static and, when dealing with disruptions, compare pre- and
post-shock equilibria. In real life, the effects of disruption take time to
spread across the network. Understanding this temporal element is
fundamental for taking mitigating actions. The main goal of this project is
to study dynamic models of supply-chain disruption. The formal analysis of
this phenomenon will use tools from network theory, probability theory,
game theory, operations management, optimization, dynamical systems,
machine learning, data science. We are looking for a candidate who has a
strong expertise in at least one of the above fields.

Title of the project:
A dynamic analysis of supply-chain networks and their disruption

Length of the position: 36 months
Gross annual salary: € 36.480,57

Application deadline: 2024/05/03, 14:00 Central European Summer Time (CEST)

The call for this postdoc can be found here:
https://economiaefinanza.luiss.it/uploads/2024/03/Bando-Assegno-Prof.-Scarsini-PRIN-2022-PNRR-ENG.pdf

The candidates must submit their application online here:
https://cloudserverjsa.luiss.it/LGCAssegni/index.zul?CDS=AS4239


*******************************************************
Marco Scarsini
Dipartimento di Economia e Finanza
Luiss University
Viale Romania 32
00197 Roma, ITALY

**********************************************************
*
* 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] TAMC 2024 Call for Participation

Dear colleagues

We cordially invite you to attend the 2024 Annual Conference on Theory and
Applications of Models of Computation (TAMC 2024)
<https://tamc2024.comp.polyu.edu.hk/>to be held in Hong Kong, China, on May
13-15, 2024. The early registration ends on *March 31, 2024
<https://tamc2024.comp.polyu.edu.hk/registration/>*.

The conference will offer a platform for researchers interested in
computational theory and applications to exchange ideas and present their
work.

The accepted paper list is here: https://tamc2024.comp.polyu.edu.hk/program/

The Keynote speeches are as follows.

Keynote 1: Some Mathematical Problems in Quantum Circuit Synthesis and
Optimization

Speaker: Xiaoming Sun, Chinese Academy of Sciences, China

Keynote 2: On the Finite Character of Learnability: A Fundamental Theorem
of Supervised Learning

Speaker: Shang-Hua Teng, University of Southern California, USA

Keynote 3: Lightweight Algorithms to Learning Solutions for Large-scale
Maximization

Speaker: My T. Thai, University of Florida, USA

We look forward to seeing you in Hong Kong!

Best regards

TAMC Local Organization

**********************************************************
*
* 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 - 30th International Computing and Combinatorics Conference 2024 (Submission deadline: Apr. 1, 2024)

CALL FOR PAPERS - COCOON 2024 (Submission deadline: Apr. 1, 2024)

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

The 30th International Computing and Combinatorics Conference (COCOON 2024),
August 23-25, 2024
Shanghai, China

https://anl.sjtu.edu.cn/cocoon2024/

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

Original research papers in the areas of algorithms, theory of computation,
computational complexity, and combinatorics related to computing are
solicited. In addition to theoretical results, we are particularly
interested in submissions that report on experimental and applied research
of general algorithmic interest. Special consideration will be given to
research that is motivated by real-world problems. Experimental and applied
papers are expected to show convincingly the usefulness and efficiency of
the algorithms discussed in a practical setting.

The topics include, but are not limited to:

-Algorithms and Data Structures
-Algorithmic Game Theory and Online Algorithms
-Automata, Languages, Logic, and Computability
-Combinatorics Related to Algorithms and Complexity
-Complexity Theory
-Computational Learning Theory and Knowledge Discovery
-Cryptography, Reliability, Security, and Database Theory
-Computational Biology and Bioinformatics
-Computational Algebra, Geometry, and Number Theory
-Graph Drawing and Information Visualization
-Communication Networks, and Optimization
-Parallel and Distributed Computing

We particularly encourage submissions in emerging topics of high importance
such as algorithms, data structures, machine learning, quantum computing,
computational social science, blockchain, cyber-physical systems,
bio-inspired computing, and human-computer interaction.

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

Important Dates

-Paper Submission Due: Apr. 1, 2024
-Author Notification: May. 25, 2024
-Camera-Ready: Jun.10, 2024
-Conference Date: Aug.23 - Aug.25, 2024
https://equinocs.springernature.com/service/cocoon2024

Should you have any inquiries or require further information, please do not
hesitate to contact us at mailto: cocoon.sh2024@gmail.com

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

[DMANET] Postdoc in tropical and non-Archimedean geometry in Durham

Dear Colleagues,

Durham University is inviting applications for a 3 year postdoc
position in tropical and non-Archimedean geometry:
https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=24000491

The topic is applications of tropical and non-Archimedean geometry in
machine learning, and it is funded by an EPSRC hub on the mathematical
and computational foundations of AI. The position comes with no
mandatory teaching, and significant travel funds. Active participation
in the AI hub is expected.

Deadline is 23 April 2024 at 23:59 and the latest starting date is 31
January 2025. If there are any questions, please do not hesitate to
contact Jeff (jeffrey.giansiracusa@durham.ac.uk) or me
(yue.ren2@durham.ac.uk).

Best regards, Yue.
**********************************************************
*
* 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] QEST+FORMATS: Final Call for Papers

========================================================
FINAL CALL FOR PAPERS
========================================================

The joint event for the International Conferences on Quantitative
Evaluation of SysTems (QEST) and on Formal Modeling and Analysis of
Timed Systems (FORMATS)

9-13 September 2024, Calgary, Canada, as part of the CONFEST 2024
umbrella conference

https://www.qest-formats.org/

IMPORTANT DATES (UPDATED)

Abstract deadline: 10 April 2024 (Anytime on Earth)
Paper deadline: 15 April 2024 (Anytime on Earth)
Author notification: 31 May 2024
Camera ready submission: 17 June 2024
Conference: 9-13 September 2024

SCOPE AND TOPICS

The two flagship conferences of QEST (International Conference on
Quantitative Evaluation of SysTems) and FORMATS (International
Conference on Formal Modeling and Analysis of Timed Systems) are
pursuing a strategic process of joining forces and sparking a new joint
conference for quantitative modelling, analysis, and verification. This
year, the two conferences form the QEST+FORMATS joint conference in
2024, which will be held on 9-13 September 2024 in Calgary, Canada, as
part of the CONFEST 2024 umbrella conference.

The joint conference is the leading forum for the quantitative
evaluation and verification of systems, which aims to promote the study
of fundamental and practical aspects of systems with quantitative nature
(such as probability, timing, and cost), and brings together researchers
from different disciplines that share interests in the modelling, design
and analysis of computational systems. Systems of interest include
biological and chemical systems; computer networks; cyber-physical
systems; critical infrastructures; data-driven AI systems; energy
systems; hardware and software systems; industrial systems; and mobility
networks. The QEST+FORMATS joint conference also aims to attract
researchers interested in real-time issues in hardware design,
performance analysis, real-time software, scheduling, semantics and
verification of timed, hybrid and probabilistic systems.

Topics and scientific areas of interest include:

- Models and metrics for the correctness, performance, reliability,
safety, and security of systems (stochastic, probabilistic, and
non-deterministic models including Markov chains, Markov decision
processes, automata, Petri nets, process algebra, max-plus algebra,
and their variations);
- Languages and methods for the specification of quantitative
properties of systems;
- Techniques, algorithms, and data structures for analysis,
evaluation, and verification of the models mentioned above, e.g.,
for model checking, testing, constraint solving, scheduling,
optimization, and worst-case execution time analysis;
- Quantitative and probabilistic aspects of programming;
- Data-driven and machine-learning techniques for the analysis,
prediction, and verification of quantitative properties of systems;
- Case studies that highlight the role of quantitative specification,
modelling, and evaluation in the design and analysis of systems,
with emphasis on emerging problems and technologies;
- Novel software tools to support the practical application of
research results in all of the above areas;

The joint QEST+FORMATS conference is open to theoretical, experimental,
and applicative research and will set up an artifact evaluation process.
Papers may advance the state of the art on empirical approaches,
simulation methods, analysis techniques, and applications to
industrially relevant case studies.

The joint conference will have two tracks associated with QEST and
FORMATS. The authors are required to select one of these tracks when
submitting their papers. This is only used to facilitate the review
process.

This year, QEST+FORMATS will incorporate a special session on:

- Data-driven verification and synthesis of cyber-physical systems. We
encourage the submission of papers on all data-driven approaches
related to the formal analysis, verification, and synthesis of
cyber-physical systems, including learning techniques for
safety-critical systems and safe learning of such systems.

SUBMISSIONS

QEST+FORMATS 2024 considers three types of papers (authors will be able
to specify the type of contribution upon submission):

- Research papers: Theoretical, methodological, and application-based
contributions that advance the understanding on a topic or issue,
describe the development of new analysis processes and techniques,
or apply quantitative methods to relevant case studies.
- Tool papers: New tools and the formalisms they support. focusing on
the software architecture and practical implementation and use. Tool
papers must be accompanied by an artifact in the Artifact
Evaluation.
- Work-in-progress papers: We offer an opportunity to present
preliminary results and receive feedback from the community.
Work-in-progress contributions are not required to be fully
worked-out approaches, for example regarding validation or technical
depth; however the presented ideas should be mature enough to
appreciate soundness and how they advance our knowledge.

Research and tool papers can be regular or short:

- Regular papers must not exceed 14 pages, excluding references.
- Short papers should be limited to 7 pages, also excluding
references.

All papers can have an appendix containing supporting material. Note
that reviewers are not required to read the appendix to fully assess the
merits of the paper. Work-in-progress papers must not exceed 4 pages
including references. All papers must be submitted in Springer's LNCS
format. All submitted papers must be unpublished and not be submitted
for publication elsewhere. Papers should be submitted electronically
using EasyChair:

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

Springer encourages authors to include their ORCIDs in their papers.
Authors should consult Springer's authors' guidelines and use Springer's
LaTeX templates for the preparation of their papers. Submitted papers
not complying with the above guidelines may be rejected without
undergoing review.

The top two best papers of the conference will be selected for the QEST
Award and the FORMATS Oded Maler Award.

PUBLICATIONS

All accepted papers will be presented and discussed at the conference by
one of the authors. The QEST+FORMATS 2024 proceedings will be published
in the Springer LNCS series and indexed by ISI Web of Science, Scopus,
ACM Digital Library, dblp, Google Scholar. All submitted papers will be
evaluated by at least three reviewers on the basis of their originality,
technical quality, scientific or practical contribution to the state of
the art, methodology, clarity, and adequacy of references.

ARTIFACT EVALUATION

Reproducibility of experimental results is crucial to foster an
atmosphere of trustworthy, open, and reusable research. To improve and
reward reproducibility, QEST+FORMATS 2024 includes a dedicated Artifact
Evaluation (AE). Submission of an artifact is mandatory for tool papers
(both regular and short), and optional but encouraged for research
papers where it can support the results presented in the paper.
Artifacts will be reviewed concurrently with the paper review process,
and accepted papers with a successfully evaluated artifact will receive
a badge to be shown on the published paper's title page.

Detailed guidelines for preparation and submission of artifacts will be
available on the conference website. Exceptions to the submission
guidelines may be granted by the PC chairs in cases where the tool
cannot in any reasonable way be run by the AE committee.

SPECIAL ISSUES

A selection of the best papers (excluding work-in-progress papers) will
be invited to submit an extended version of their work to special issues
in the International Journal on Software Tools for Technology Transfer
(STTT) and the Performance Evaluation (PEVA) journals.

COMMITTEES

Program Chairs
Jane Hillston, Edinburgh University, UK
Sadegh Soudjani, Max Planck Institute, Germany

Track Chairs
Morteza Lahijanian, UC Boulder, USA (QEST)
Masaki Waga, Kyoto University, Japan (FORMATS)

Publicity Chairs
Jyotirmoy Deshmukh, University of Southern California, USA
Patrick Totzke, University of Liverpool, UK
Jie An, National Institute of Informatics (NII) in Tokyo, Japan

Artifact Evaluation Chairs
Tobias Meggendorfer, Lancaster University Leipzig, Germany
Andrea Vandin, Sant'Anna School for Advanced Studies, Italy

For any questions, feel free to contact the program chairs Jane Hillston
(Jane.Hillston@ed.ac.uk) and Sadegh Soudjani (sadegh@mpi-sws.org).

**********************************************************
*
* 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] [Deadline approaching] SNTA 2024 The Seventh International Workshop on Systems and Network Telemetry and Analytics

Deadline approaching! Submit your paper!

The Seventh International Workshop on Systems and Network Telemetry and Analytics (SNTA 2024)
Pisa, Italy, June 3 - 4, 2024 in conjunction with ACM HPDC 2024
https://sntaworkshop.github.io/2024/

Submission link
https://snta24.hotcrp.com/paper/new

Submission deadline
March 31, 2024

The tasks of systems and network telemetry are vital for effective operations and management of HPC and distributed computing systems by offering comprehensive measurement and analysis capabilities to provide visibility into what is occurring at any time. The tasks will be significantly complicated with the greater complexity of computing systems, increasing network speed, and the newly introduced mobile and IoT devices. Such changes will render the existing telemetry and analysis techniques outdated, and more scalable techniques may be in place for data-driven and deeper data analysis. In addition to the quantitative and qualitative challenges, data pressure in systems and networks also comes from various sources such as sensors, computing systems, networking and security devices, and other emerging computing elements speaking with different syntax and semantics, which makes organizing and incorporating the generated data difficult for extensive analysis. This workshop aims at bridging the systems and network measurement and the latest advances in artificial intelligence and data science technologies to advance the performance and reliability of HPC and distributed systems. New analysis techniques are needed in the modern world from the diverse angles of systems/network performance, availability, and security. For example, real-time streaming analytics algorithms and methods need to be explored for estimating network performance and summarizing the traffic variables to capture the network activities due to the network bandwidth increase. Multivariate analysis of telemetric variables may provide an intuitive, comprehensive view of the systems and network dynamics. New logging techniques are also needed with the latest developments in storage and archival technologies. In addition, many applications in this area may need to address the application-specific requirements and challenges. This workshop intends to share visions of investigating new approaches and methods at the intersection of data sciences and HPC/distributed computing systems.

Topics of Interest (but not limited to)

• Systems and network measurement, analysis, and summarization
• Data-driven, multivariate, streaming-based data processing
• Scalable distributed and federated machine learning
• Performance modeling, analysis, and optimization
• Cybersecurity, forensics, privacy, and anonymization
• Intelligent workflow, visualization, and applications
• Smart instruments, edge/fog-systems, and IoTs
• Wireless, sensor, 5G/6G networks measurement and analysis
• Software/Knowledge-Defined-* technologies
• Advances in network and storage technologies
• Design and evaluation of HPC and distributed systems
• Best practices and implementations tied to systems/network data analysis

Submission Guidelines
All papers must be original and not simultaneously submitted to another journal or conference. Authors are invited to submit either a full (max 8 pages) paper or a short/work-in-progress (max 5 pages) paper. Papers will be peer-reviewed, and accepted papers will be published in the workshop proceedings as part of the ACM digital library.

Submission link: https://snta24.hotcrp.com/paper/new

Important Dates
• Submission deadline: March 31, 2024
• Author notification: April 14, 2024
• Camera-ready deadline: April 21, 2024
• Workshop: June 3-4, 2024


Program Committee
• Mohammed Abuhamad, Loyola University Chicago, USA
• Stergios Anastasiadis, University of Ioannina, Greece
• Engin Arslan, University of Nevada at Reno, USA
• Ming-Hung Chen, IBM, USA
• Chunglae Cho, ETRI, Korea
• Italo Epicoco, University of Salento, Italy
• Wenjun Fan, Xi'an Jiaotong-Liverpool University, China
• In Kee Kim, University of Georgia, USA
• Alina Lazar, Youngstown State University, USA
• Chul-Ho Lee, Texas State University, USA
• Dongeun Lee, Texas A&M University-Commerce, USA
• Che-Rung Lee, National Tsing Hua University, Taiwan
• Wonjun Lee, Biola University, USA
• Amir H. Payberah, KTH Royal Institute of Technology, Sweden
• Marco Pulimeno, University of Salento, Italy
• Thomas Ropars, Univ. Grenoble Alpes, France
• Alex Sim, Lawrence Berkeley National Laboratory, USA
• Houjun Tang, Lawrence Berkeley National Laboratory, USA
• K. John Wu, Lawrence Berkeley National Laboratory, USA


Organizing Committee
• Massimo Cafaro, University of Salento, Italy
• Eric Chan-Tin, Loyola University Chicago, USA
• Jerry Chou, National Tsing Hua University, Taiwan
• Jinoh Kim, Texas A&M University-Commerce, USA

Keynote Speaker (TBD)

Publication
Papers will be peer-reviewed, and accepted papers will be published in the workshop proceedings as part of the ACM digital library.

Venue
The conference will be held in conjunction with ACM HPDC 2024.

Web
https://sntaworkshop.github.io/2024/

Contact
All questions about submissions should be emailed to SNTA.help@gmail.com.

-

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

Prof. Massimo Cafaro, Ph.D.
Associate Professor of Parallel Algorithms and Data Mining/Machine Learning

Department of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy

Voice/Fax +39 0832 297371

Web https://www.massimocafaro.it
Web https://www.unisalento.it/people/massimo.cafaro

E-mail massimo.cafaro@unisalento.it
E-mail cafaro@ieee.org
E-mail cafaro@acm.org

INGV
National Institute of Geophysics and Volcanology
Via di Vigna Murata 605
Roma

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.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] PhD position in Algebraic Combinatorics anf Finite Geometry at UGent and TU Eindhoven

In the Department of Mathematics: Algebra and Geometry at Ghent University
(Belgium), there is a vacancy for a 4 year PhD-position within the project
entitled "A spectral and geometric approach to edge-regular graphs with
regular cliques". This PhD position is jointly supervised by Bart De Bruyn (
https://cage.ugent.be/~bdb/) and Aida Abiad (https://aidaabiad.win.tue.nl/).

The vacancy will remain open until the position is filled. The ideal
starting date would be September or October 2024.

PROJECT DESCRIPTION
This project seeks to investigate structural, spectral and geometric
properties of a certain graph classes, like Neumaier graphs, Deza graphs or
more generally, edge-regular graphs. In this project we will tackle this
goal by using spectral methods and combining them with tools from other
fields like combinatorial optimization and finite geometry.

The successful candidate for this PhD position will work under the
supervision of Bart de Bruyn and Aida Abiad in the a dynamic group in
geometry and discrete mathematics (https://geometry.ugent.be/) of the
Department of Mathematics: Algebra and Geometry at Ghent University. Your
responsibilities include to perform scientific research on the topic of the
above-mentioned project and to publish your results at international
conferences and in international journals. For a small percentage of your
time, you will be asked to assist with educational tasks at Ghent
University (course support).

JOB REQUIREMENTS
- You have a bachelor and master degree in Mathematics.
- You have a strong background in Graph Theory, Finite Geometry,
Combinatorics.
- You are enthusiastic about programming, preferably in Sage/Python.
- You have good communication skills.
- You are creative, ambitious, as well as self-motivated, proactive, and
goal-oriented.
- You have a good command of the English language.

FURTHER INFORMATION
For more information about the project or about the working conditions,
please contact Bart de Bruyn (bart.debruyn@ugent.be) or Aida Abiad (
a.abiad.monge@tue.nl).

HOW TO APPLY
Applications should be done via the link:
https://jobs.tue.nl/en/vacancy/phd-on-algebraic-combinatorics-and-finite-geometry-1067394.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/
*
**********************************************************

Tuesday, March 26, 2024

[DMANET] Cauchy Post-doctoral fellowship

POST-DOCTORAL POSITION IN MATHEMATICS AT ECOLE DES PONTS (PARIS)
https://cermics-lab.enpc.fr/cauchy-fellowship/

==========================================================
CERMICS, the research center in applied mathematics of École des Ponts, Paris, is pleased to announce a two-year post-doctoral position in mathematics, with the possibility of extension to a third year. This position comes with a net salary from 27000€ per year (which can be adjusted depending on the experience of the selected candidate) and is free of teaching duties. However, candidates interested in consolidating their teaching experience will have the opportunity to give lectures at École des Ponts. The position is available for commencement anytime between September 1st and December 15th, 2024.

Candidates are encouraged to suggest collaborations with permanent researchers at CERMICS in their research activities. Additionally, a personal scientific agenda related to the areas covered by CERMICS —mathematical analysis of deterministic and stochastic models, numerical analysis, optimization, operations research, probability, discrete mathematics, etc.— is very much welcome.

For more details regarding living conditions in France, taxes, health insurance, teaching opportunities, welcoming packages, starting dates, visa applications, etc., do not hesitate to contact us at cauchy@liste.enpc.fr .

==========================================================
Important dates
• Deadline for applications: May 10, 2024.
• Result announcement: May 27, 2024.

==========================================================
Who can apply?
Individuals with a PhD or those preparing a PhD in mathematics, computer science, or related topics, of any nationality, are eligible to apply. However, the selected candidate must have defended the PhD thesis before the beginning of the post-doctoral contract.

==========================================================
How to apply?
Interested candidates should contact a permanent researcher at CERMICS. Upon endorsement of the application by the researcher, candidates are expected to prepare a research project in collaboration with him or her. The list of researchers at CERMICS is available here: https://cermics-lab.enpc.fr/annuaire/.

The candidate should then submit a single pdf file at cauchy@liste.enpc.fr containing the following elements:
• A cover page summarizing the application:
Name of the contacted permanent researcher at CERMICS.
Desired starting date.
Title of the research project.
• A resume with the publication list.
• The research project (maximum two pages).
• At least two recommandation letters.

==========================================================
Contact
For inquiries regarding the position or the application process, please contact cauchy@liste.enpc.fr .

**********************************************************
*
* 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 CFP for 3rd Workshop on Quantum Optimization @ GECCO 2024

(apologies for crossposting)

CALL FOR PAPERS

QuantOpt@GECCO-2024

3rd Workshop on Quantum Optimization

Genetic and Evolutionary Computation Conference (GECCO'24)

Melbourne, Australia, July 14-18, 2024

Paper Submission Deadline: April 8, 2024

Scope

Quantum computers are rapidly becoming more powerful and increasingly applicable to solve problems in the real world. They have the potential to solve extremely hard computational problems, which are currently intractable by conventional computers. Quantum optimization is an emerging field that focuses on using quantum computing technologies to solve hard optimization problems.

There are two main types of quantum computers: quantum annealers and gate-based quantum computers. Quantum annealers are specially tailored to solve combinatorial optimization problems. They find (near) optimal solutions via quantum annealing, which is similar to traditional simulated annealing, and use quantum tunnelling phenomena to provide a faster mechanism for moving between states and faster processing. On the other hand, gate-based quantum computers are universal and can perform general purpose calculations. These computers can be used to solve combinatorial optimization problems using the quantum approximate optimization algorithm and quantum search algorithms.

Quantum computing has also given rise to quantum-inspired computers and algorithms. Quantum-inspired computers use dedicated hardware technology to emulate/simulate quantum computers. Quantum-inspired optimization algorithms use classical computers to simulate some physical phenomena such as superposition and entanglement to perform quantum computations, in an attempt to retain some of its benefit in conventional hardware when searching for solutions.

To solve optimization problems on a quantum computer, we need to reformulate them in a format suitable for the quantum hardware, in terms of qubits, biases and couplings between qubits. In mathematical terms, this requirement translates to reformulating the optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. This is closely related to the renowned Ising model. It constitutes a universal class, since all combinatorial optimization problems can be formulated as QUBOs. In practice, some classes of optimization problems can be naturally mapped to a QUBO, whereas others are much more challenging to map.


Content

The aim of the workshop is to provide a forum for both scientific presentations and discussion of issues related to quantum optimization. As the algorithms that quantum computers use for optimization can be regarded as general types of randomized search heuristics, there are potentially great research benefits and synergy to bringing together the communities of quantum computing and randomized search heuristics.

The workshop aims to be as inclusive as possible and welcomes contributions from all areas broadly related to quantum optimization – by researchers from both academia and industry.


Particular topics of interest include, but are not limited to:

· Formulation of optimization problems as QUBOs (including handling of non-binary representations and constraints)

· Fitness landscape analysis of QUBOs

· Novel search algorithms to solve QUBOs

· Experimental comparisons on QUBO benchmarks

· Theoretical analysis of search algorithms for QUBOs

· Speed-up experiments on traditional hardware vs quantum(-inspired) hardware

· Decomposition of optimization problems for quantum hardware

· Application of the quantum approximate optimization algorithm

· Application of Grover's algorithm to solve optimization problems

· Novel quantum-inspired optimization algorithms

· Optimization/discovery of quantum circuits

· Quantum optimization for machine learning problems

· Optical Annealing

· Dealing with noise in quantum computing

· Quantum Gates' optimization, Quantum Coherent Control

All accepted papers of this workshop will be included in the Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'24) Companion Volume.

Key Dates
Submission Opening: February 12, 2024
Paper Submission Deadline: April 8, 2024
Notification of Acceptance: May 3, 2024
Camera-Ready Copy Due: May 10, 2024
Author Registration: date to be confirmed
Conference Presentation: 14 July 2024 to 18 July 2024

Instructions for Authors

We invite submissions of two types of paper:

· Regular papers (limit 8 pages)
· Short papers (limit 4 pages)

Papers should present original work that meets the high-quality standards of GECCO. Each paper will be rigorously evaluated in a review process. Accepted papers appear in the ACM digital library as part of the Companion Proceedings of GECCO. Each paper accepted needs to have at least one author registered by the author registration deadline. Papers must be submitted via the online submission system https://ssl.linklings.net/conferences/gecco/. Please refer to https://gecco-2024.sigevo.org/Paper-Submission-Instructions for more detailed instructions.


Workshop Chairs

- Alberto Moraglio, University of Exeter, UK

- Mayowa Ayodele, Fujitsu Laboratories of Europe, UK

- Francisco Chicano, University of Malaga, Spain

- Ofer Shir, Tel-Hai College and Migal Institute, Israel

- Lee Spector, Amherst College, USA

- Matthieu Parizy Fujitsu Limited, Japan

- Markus Wagner Monash University, Australia

**********************************************************
*
* 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] NCMA 2024 - First Call for Papers

**FIRST CALL FOR PAPERS**

14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)

August 12-13, 2024, Göttingen, Germany

Website: https://ncma2024.uni-goettingen.de/
NCMA workshop series website: https://www.cs.uni-potsdam.de/NCMA/

NCMA 2024 is the 14th edition in a series of events established in 2009. The workshop welcomes research papers that contain original contributions on classical and non-classical models of automata and applications and related subjects. Many models of automata and grammar-like structures are the natural objects of theoretical computer science. They are studied from different points of view in various areas, both as theoretical concepts and as formal models for applications. As such, the aim of the workshops on Non-Classical Models of Automata and Applications is to provide a forum for researchers who work on different aspects of classical and non-classical models of automata and grammars to exchange and develop novel ideas.

In order to emphasize the workshop character of NCMA 2024, we also invite short contributions that report on recent results (unpublished, or published in other venues) or ongoing work in addition to full papers. However, in contrast to the accepted regular (full) papers that will be published in the official proceedings (EPTCS), the accepted short papers will appear in a separate technical report.

Alongside the regular programme of contributed (full or short) talks, the workshop will also host two invited talks (see below).

**Venue**

The 14th edition of NCMA will be held at the historic University of Göttingen in Germany, August 12–13, 2024, collocated with the 28th International Conference on Developments in Language Theory (DLT 2024, https://dlt2024.uni-goettingen.de/ ).

It is hosted by the TCS research group of Florin Manea. For more information, see https://ncma2024.uni-goettingen.de/

**Important Dates**

Full papers:
Deadline for submission: 17 May 2024 (23:59 AOE)
Notification: 30 June 2024
Final Version: 12 July 2024

Short papers:
Deadline for submission: 7 July 2024 (23:59 AOE)
Notification: 19 July 2024
Final version: 26 July 2024.

NCMA 2024: 12-13 August 2024

**Invited Speakers**

Martin Kutrib (Gießen, Germany, unifying speaker with DLT 2024)
Robert Mercas (Loughborough, UK)

**Program Committee**

Marcella Anselmo (Salerno, Italy)
Péter Battyányi (Debrecen, Hungary)
Martin Berglund (Umeå, Sweden)
Erzsébet Csuhaj-Varjú (Budapest, Hungary)
Joel Day (Loughborough, UK)
Pamela Fleischmann (Kiel, Germany)
Tore Koß (Göttingen, Germany, chair)
Zbyněk Křivka (Brno, Czech Republic)
Andreas Malcher (Gießen, Germany)
Florin Manea (Göttingen, Germany, chair)
Victor Mitrana (Madrid, Spain)
Giovanni Pighizzini (Milano, Italy, chair)
Dana Pardubska (Bratislava, Slovak Republic)
Luca Prigioniero (Loughborough, UK)
Stefan Siemer (Göttingen, Germany)
Bianca Truthe (Gießen, Germany)
Brink Van Der Merwe (Stellenbosch, South Africa)
Petra Wolf (Bordeaux, France)


**Publication**

The Proceedings of NCMA 2024 will be published in the EPTCS series. A journal special issue (in the Journal of Automata, Languages and Combinatorics, https://jalc.de/) is planned.

**Submission Guidelines**

Authors are invited to submit papers presenting original and unpublished research. The proceedings of NCMA 2024 will be published in the EPTCS series.

Please submit your paper here:
https://easychair.org/conferences/?conf=ncma2024 .

Submitted full papers should not exceed 16 pages excluding bibliography, the title page (containing only the title, authors, affiliations, abstract), and a potential appendix (see below), and must follow the EPTCS LaTeX-style (available via https://info.eptcs.org/ ).

Proofs omitted from the main part of the paper due to space constraints should be put into an appendix, to be read by the program committee members at their discretion.

Further questions about submissions should be emailed to ncma2024@easychair.org.

Submitted short papers should not exceed 8 pages, following the same instructions as above.

Typical topics for the NCMA worskhops include (but are not limited) to :

formal models inspired by linguistics, bio-computing, text processing, document engineering, self-assembly, etc.,
bio-inspired models of automata and generative devices,
cellular automata,
forgetting automata and restarting automata,
automata with additional resources,
regulated rewriting/automata,
networks of automata or generative devices,
models of cooperation and communication,
quantum automata.
automata in the framework of membrane computing

Other related topics, in particular, contributions dealing with questions on classical automata and generative devices are also welcome.

**Sponsors**

The German Research Foundation (DFG).

==
Prof. Dr. Florin Manea,
Institute of Computer Science
Georg-August-Universität Göttingen

**********************************************************
*
* 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 25, 2024

[DMANET] Assistant Professor in Connected and Autonomous Vehicles at Coventry University (UK)

[Apologies if you receive multiple copies of this message]

Dear Colleagues,

The Centre for Future Transport and Cities
<https://www.coventry.ac.uk/research/areas-of-research/centre-for-future-transport-and-cities/>
at Coventry University is looking for an enthusiastic and ambitious
researcher with expertise in developing AI/ML models to enhance the
connectivity and security of wireless networked systems, with a focus on
Connected and Autonomous Vehicles (CAVs) and Unmanned Aerial Vehicles
(UAVs).

Position: Assisted Professor in Connected and Autonomous Vehicles
Department: Centre for Future Transport and Cities of Coventry University
Location: Coventry, United Kingdom
Closing date: *16 April 2024 *
Salary range: *£44,263.00 - £63,029.00 per annum*
Mode: *Permanent, Full Time*

*Job details can be found here
<https://www.coventry.ac.uk/globalassets/media/global/job-descriptions/new-folder-1/1499-jd.pdf>
*

*Apply for this job here
<https://cugcareers.coventry.ac.uk/job/Coventry-Assistant-Professor-in-Connected-and-Autonomous-Vehicles-Cove-CV1-5FB/790908802/>
*

For anyone wishing to find out more information about the Research Centre
and the job please contact Professor Soufiene Djahel at
ae3095@coventry.ac.uk

Best regards

**********************************************************
*
* 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] Last Call: Theorietag 2024: Workshop on Algorithms, Complexity and Logic

Dear colleagues,

we cordially invite you to the

86th Workshop on Algorithms, Complexity, and Logic (Theory Day)

on April 18 and 19, 2024, at Heinrich-Heine-Universität Düsseldorf
(HHU), organized by the working group Computational Complexity and
Cryptology.

The Theory Days enable an intensive dialogue between young researchers
and experienced researchers in the field of Theoretical Computer
Science. The talks will cover a broad spectrum between results of not
yet completed projects, which will be presented to a broader audience
for the first time, and completed research work, which will later also
be presented at conferences.

The workshop covers the topics of the specialist groups "Algorithms"
(Algo), "Complexity" (KP), and "Logic in Computer Science" (LogInf) in
their breadth.
The relevant topics include, in addition to algorithmic and
complexity-theoretical issues, in particular algorithm theory, algorithm
engineering, applied algorithms, parallel/distributed algorithms,
complexity classes, hierarchies, lower and upper complexity bounds for
special problems, structural issues, equivalence investigations, one-way
and trapdoor functions, cryptography, interactive proof systems,
complexity of logical decision problems, logical-descriptive complexity
classes, parameterized complexity, Kolmogorov complexity, nonuniform
computational models (special automata, circuits, branching programs,
formulas, etc.).

We would be pleased if you could contribute to the program of the
workshop with a talk. If applicable, please let us know and send the
title of your talk, the list of all co-authors (and who will give the
talk), and a one-page abstract as a LaTeX2e file by e-mail to
theorietag2024@uni-duesseldorf.de by March 31, 2024. As usual for the
Theory Days, there will be no proceedings.

Even when you won't give a talk but wish to participate in the 86th
Theory Day, please register by e-mail to
theorietag2024@uni-duesseldorf.de by March 31, 2024, and let us also
know whether you intend to join us for the Workshop Dinner at Scotti's.

The program and a collection of abstracts will be announced soon.
Further information (about the venue and travel etc.) can be found on
the website: https://ccc.cs.hhu.de/theorietag-2024/

Further details will follow shortly on the above website.

Participation in and registration for the 86th Theory Day is free. We
look forward to a lively participation in the workshop!

Jörg Rothe <rothe@hhu.de>
Paul Nüsken <paul.nuesken@hhu.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] INFORMS Annual Meeting 2024 - Call for Session Chairs in Telecommunications and Network Analytics Cluster

Dear Colleagues,


The INFORMS Telecommunication and Network Analytics Society (TNA) is inviting session chairs for the 2024 INFORMS Annual Meeting in Seattle. We cordially welcome individuals from both academia (students and faculty members) and industry.

Possible session types are Regular-talk, Flash-talk and Panel Discussion. Chairs are responsible for organizing 4-5 presentations of 15 minutes in a 75-minute session (regular), or 8-12 presentations of 5 minutes (flash). Each presentation will be in-person only - speakers can only present once.

Topics of interest include but are not limited to telecommunications modeling, network optimization, network science, machine learning on graphs, network economics, network design, network survivability & reliability, sensor networks, wireless & broadband networks, semantic networks, vehicle & mobile computing, information security & privacy, quality of service, social networks, internet, and multimedia.


If you are interested in organizing a session, please contact us via jinzhu.yu@uta.edu<mailto:jinzhu.yu@uta.edu> or alessandro.hill@gmail.com<mailto:alessandro.hill@gmail.com> by April 15. Please provide the following information: session chair name(s), email, affiliation, session type, tentative session title, and a short session description. We will review your request and provide instructions on how to invite presentations for your session.

Important Dates:

- April 15: Deadline Session Chair application

- May 1: Deadline for Session Chairs to submit Presenters

- May 15: Deadline for Presenters to submit Abstracts

- Aug 1: Deadline for Presenters to register for INFORMS

- October 20-23: INFORMS Annual Meeting<https://meetings.informs.org/wordpress/seattle2024> (https://meetings.informs.org/wordpress/seattle2024/)


Thank you for your consideration! If you have any questions regarding the session organization, please feel free to contact us.

Best regards,
Jinzhu Yu and Alessandro Hill

Cluster Chairs

Telecommunication and Network Analytics Cluster at INFORMS Annual Meeting 2024


**********************************************************
*
* 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] HALG 2024 reminder for short talks + list of speakers

9th IGAFIT Highlights of Algorithms conference (HALG 2024)
Warsaw, June 3-June 5, 2024
https://highlightsofalgorithms.org/

The Highlights of Algorithms conference is a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks, as well as the possibility for all researchers and students to present their recent results through a series of short talks and poster presentations. Attending the Highlights of Algorithms conference will also be an opportunity for networking and meeting leading researchers in algorithms.
-------------------------------------------------------------------

Call For Submissions of Contributed Presentations


The IGAFIT HALG 2024 conference seeks submissions for contributed presentations. Each presentation is expected to consist of a short talk followed by a question and answer session. There will be no conference proceedings, hence presenting work already published or accepted at a different venue or journal (or to be submitted there) is welcome.

Please submit the paper by registering in the link: https://systemcoffee.pl/?lang=en&go2rej=1&kid=1536
Please choose: Participant category = "participant with abstract". No payment should be made at this time.
After registration, you can login through the link: https://systemcoffee.pl/?lang=en&go2logPanel=1&kid=1536

The abstract should include (when relevant) information where the results have been published/accepted (e.g., conference), and where they are publicly available (e.g., ArXiv). All submissions will be reviewed by the program committee, giving priority to work accepted or published in 2023 or later.

Submissions deadline: March 29th, 2024, 23:00 GMT.
Acceptance/rejection notifications for contributed presentations: April 30th, 2024.

-------------------------------------------------------------------
Invited Speakers

Survey Speakers (partial): Shiri Chechik, Paul Duetting, Bernhard Haeupler, Sam Hopkins, Ronitt Rubinfeld

Invited Talks:

Soheil Behnezhad (Northeastern University): Dynamic Algorithms for Maximum Matching Size
Naama Ben-David (Technion): The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems
Christian Coester (University of Oxford): The Randomized k-Server Conjecture is False!
Andrés Cristi (University of Chile). A Constant Factor Prophet Inequality for Online Combinatorial Auctions
Gary Hoppenworth (University of Michigan): Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
Shang-En Huang (Boston College): Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Sanjeev Khanna (University of Pennsylvania): A Faster Combinatorial Algorithm for Maximum Bipartite Matching
Tomasz Kociumaka (Max Planck Institute for Informatics): Weighted Edit Distance Computation: Strings, Trees and Dyck
Tuukka Korhonen (University of Bergen): Dynamic treewidth
Annamária Kovács (Goethe University Frankfurt): A Proof of the Nisan-Ronen Conjecture
William Kuszmaul (Harvard University): Tiny Pointers
Kasper Green Larsen (Aarhus University): Bagging is an Optimal PAC Learner
Jason Li (CMU): Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Chris Schwiegelshohn (Aarhus University): Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation
Cameron Seth (University of Waterloo): Testing Graph Properties with the Container Method
David Wajc (Technion): Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time

**********************************************************
*
* 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 CFP: DCFS 2024 (Santa Clara, June 25-27, deadlines updated)

                           CALL FOR PAPERS
                              DCFS 2024
International Conference on Descriptional Complexity of Formal Systems
                        Santa Clara University
                          June 25 - 27, 2024

               https://sites.google.com/scu.edu/dcfs24
                          dcfs2024@gmail.com

               Paper submission deadline: April 12, 2024
                  Author notification: April 26, 2024
                Camera-ready deadline: May 10, 2024


The 26th edition of DCFS is organized by the Department of Mathematics
and Computer Science of Santa Clara University, USA and by the IFIP
Working Group 1.02 "Descriptional Complexity".

TOPICS

Original research papers concerning the descriptional complexity of
formal systems and structures (and its applications) are sought. Topics
include, but are not limited to:

  Automata, grammars, languages and other formal systems; various modes
of  operations and complexity measures.

  Succinctness of description of objects, state-explosion-like phenomena.

  Circuit complexity of Boolean functions and related measures.

  Size complexity of formal systems.

  Structural complexity of formal systems.

  Trade-offs between computational models and mode of operation.

  Applications of formal systems -- for instance in software and
hardware testing, in dialogue systems,  in systems modeling or in
modeling natural languages -- and their complexity constraints.

  Co-operating formal systems.

  Size or structural complexity of formal systems for modeling natural
languages.

  Complexity aspects related to the combinatorics of words.

  Descriptional complexity in resource-bounded or structure-bounded
environments.

  Structural complexity as related to descriptional complexity.

  Frontiers between decidability and undecidability.

  Universality and reversibility.

  Nature-motivated (bio-inspired) architectures and unconventional
models of computing.

  Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.


INVITED SPEAKERS

    1. Michaël Cadilhac (DePaul University, USA)

    2. Ian McQuillan (University of Saskatchewan, Canada)

    3. Bala Ravikumar (Sonoma State University, USA)

PROGRAM COMMITTEE

    Henning Bordihn (University of Potsdam, Germany), co-chair

    Pascal Caron (University of Rouen, France)

    Szilárd Fazekas (Akita University, Japan)

    Yo-Sub Han (Yonsei University, Republic of Korea)

    Galina Jirásková (Slovak Academy of Sciences, Slovakia)

    Stavros Konstantinidis (Saint Mary's University, Canada)

    Martin Kutrib (University of Giessen, Germany)

    Ian McQuillan (University of Saskatchewan, Canada)

    Timothy Ng (University of Chicago, USA)

    Alexander Okhotin (St. Petersburg State University, Russia)

    Giovanni Pighizzini (University of Milan, Italy)

    Chris Pollett (San Jose State University, USA)

    Luca Prigioniero (Loughborough University, UK)

    Bala Ravikumar (Sonoma State University, USA)

    Rogérior Reis (University of Porto, Portugal)

    Kai Salomaa (Queen's University, Canada)

    Shinnosuke Seki (The University of Electro-Communications, Japan)

    Howard Straubing (Boston College, USA)

    Nicholas Tran (Santa Clara University, USA), co-chair

    György Vaszil (University of Debrecen, Hungary)

    Hsu-Chun Yen (National Taiwan University, Taiwan)


PAPER SUBMISSION

Submissions to DCFS must not exceed 12 pages in Springer-Verlag's
Lecture Notes style including bibliography. If the authors believe that
more details are essential to substantiate the main claims, they may
include a clearly marked appendix that will be read at the discretion of
the program committee. Simultaneous submissions of papers to any other
conference with published proceedings or submitting previously published
papers is not allowed.  Papers should be submitted electronically as a
PDF document to

https://www.easychair.org/conferences/?conf=dcfs24.

After logging in to your EasyChair account, select the "New Submission"
menu item on the top of the page.  If you do not have an EasyChair
account, follow the instructions on the login page. The proceedings will
be published by Springer-Verlag in the series Lecture Notes in Computer
Science. In addition, a special issue of Journal of Automata, Languages,
and Combinatorics will be devoted to revised and extended versions of
selected papers of the conference.

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

[Apologies if you receive multiple copies of this message]
==========================================================
CALL FOR PAPERS
******************************************************************
The 20th International Conference on Wireless and Mobile
Computing, Networking and Communications (WiMob 2024), October 9-11, 2024
in Paris, France.

http://wimob.org/wimob2024/

******************************************************************
!**** IEEE Communications Society sponsorship ****!
!**** The papers will be included in the conference proceedings, published
by IEEE CS Press (IEEE Xplore) and indexed by Scopus and Ei Compendex.****!


The WiMob conference is an international forum for the exchange of
experience and knowledge among researchers and developers concerned with
wireless and mobile technology. For seventeen years, the International
WiMob conference has provided unique opportunities for researchers to
interact, share new results, show live demonstrations, and discuss emerging
directions in - Wireless Communication, - Wireless Networking, Mobility and
Nomadicity, - Ubiquitous Computing, Services and Applications, - Green and
sustainable communications and network computing and - Security on Wireless
and mobile Networks.

WiMob 2024 is soliciting high quality technical papers addressing research
challenges in the areas of wireless communications, wireless networking,
mobility, nomadicity, ubiquitous computing, services and
applications. Papers should present original work validated via analysis,
simulation or experimentation. Practical experiences and Testbed trials
also are welcome.

WiMob 2024 will host FIVE parallel symposia:

1. Wireless Communications (WC)
2. Wireless Networking, Mobility and Nomadicity (WNMN)
3. Ubiquitous Computing, Services and Applications (UCSA)
4. Green and Sustainable Communications and Network computing (GSCN)
5. Security on Wireless and Mobile Networks (SWMN)

For the detailed topics, you can refer to WiMob 2024 web site.

Important Dates

- Submissions Date: May 15, 2024
- Notifications Date: July 30, 2024
- Camera ready Date: September 9, 2024
- Registrations for Authors: September 9, 2024


INSTRUCTIONS FOR PAPER SUBMISSION

Authors are required to submit fully formatted, original papers (PDF), with
graphs, images, and other special areas arranged as intended for the final
publication.
Papers should be written in English conforming to the IEEE standard
conference format (two-column, 10 pt font, etc., including figures, tables,
and references). The review submissions are limited to six pages, with two
additional pages for final papers (additional charges may apply for
additional pages).
Conference content will be submitted for inclusion into IEEE Xplore as well
as other Abstracting and Indexing (A&I) databases.
Each accepted paper must be presented at the conference by one of the
co-authors or a third party, otherwise it will not be indexed and archived
through IEEE Xplore.
Only timely submissions through EDAS will be accepted. To submit your
paper, please, click here:
https://edas.info/newPaper.php?c=30581

For more details, please visit the WiMob 2024 official website (
http://wimob.org/wimob2024) and Facebook page for WiMob 2024:
https://www.facebook.com/profile.php?id=100088392632437

ACCEPTED PAPERS
Accepted papers will be submitted for inclusion into IEEE Xplore subject to
meeting IEEE Xplore's scope and quality requirements.

**********************************************************
*
* 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] 30th British Combinatorial Conference

30th British Combinatorial Conference
1–5 July 2024, Queen Mary University of London, UK

https://www.qmul.ac.uk/maths/news-and-events/30th-british-combinatorial-conference/

The British Combinatorial Conference is the foremost UK conference on combinatorics and its applications. In 2024 it will include nine plenary talks accompanying articles published in a volume of Surveys in Combinatorics, six mini-symposia covering the breadth of combinatorics, and contributed talks.

Deadline for submission of contributed talks: 5 May 2024
Early registration deadline: 13 May 2024

Plenary speakers:

Federico Ardila, SFSU (Clay Lecturer)
Paul Balister, Oxford
Matthew Jenssen, KCL
Shoham Letzter, UCL
Richard Montgomery, Warwick
Sarah Peluse, Michigan
Lisa Sauermann, Bonn (Richard Rado Lecturer)
Martin Skutella, TU Berlin
Maya Stein, Universidad de Chile

Mini-Symposia:

Probabilistic Combinatorics, organised by Gal Kronenberg (Oxford) and Asaf Shapira (Tel Aviv)
Extremal Combinatorics, organised by Eoin Long (Birmingham) and Candida Bowtell (Warwick)
Combinatorial Optimisation, organised by László Végh (LSE)
Combinatorial Geometry and Matroids, organised by Felipe Rincón (QMUL)
Designs and Algebraic Combinatorics, organised by Sophie Huczynska (St Andrews)
Additive Combinatorics, organised by Thomas Bloom (Oxford)

**********************************************************
*
* 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] A 2-year postdoc position in Structural and Algorithmic Graph Theory (Koper, Slovenia)

Dear colleagues,

The Departments of Mathematics of the Faculty of Mathematics, Natural
Sciences and Information Technologies (FAMNIT) of the University of
Primorska,
https://www.famnit.upr.si/,
and Andrej Marusic Institute (IAM) of the University of Primorska,
https://www.iam.upr.si/,
are seeking a top early-career researcher for a postdoctoral position in
the area of structural and algorithmic graph theory, in connection with
a research grant of Prof. Martin Milanic,
https://osebje.famnit.upr.si/~martin.milanic/,
"Beyond Sparsity: Graph Classes and Width Parameters" funded by the
Slovenian Research and Innovation Agency,
https://p1-0285.iam.upr.si/en/research-projects/n1-0370

The Graph Sparsity Theory of Nešetřil and Ossona de Mendez is a highly
active and rapidly developing topic in combinatorics and graph theory,
with applications in many areas including algorithmic graph theory,
complexity theory, and property testing. A recent focus of structural
and algorithmic graph theory has been to extend the graph sparsity
theory to dense graph classes. The proposed project aims at introducing
novel ways and methods of addressing this goal. This will be done along
the following two interconnected research lines:
– first, by advancing the recently emerging and fast developing theory
of graph width and depth parameters through a general framework based on
graph measures and an in-depth analysis of known and novel graph parameters;
– second, by developing a biparametric theory of hereditary graph
classes in which some parameter is bounded by a function of another one,
with the goal of identifying nontrivial structural and algorithmic
implications.
Our approach is expected to lead to an improved understanding of the
boundaries of tractability for maximum independent set and several other
practically relevant graph optimization problems.

The successful candidate will be part of the Departments of Mathematics
at UP FAMNIT and UP IAM and will work under the guidance of Prof. Martin
Milanic, PhD.

TERMS AND CONDITIONS:

- The position is for two years.
- Applicants must possess (or expect to obtain shortly) a PhD in
Mathematics, Computer Science, or a related area, and show evidence of
excellence in discrete mathematics or theoretical computer science.
Candidates who completed their PhD recently or will do so by next
September are encouraged to apply.
- Relevant expertise in structural and algorithmic graph theory is
required, including a solid knowledge of various aspects of graph
theory, algorithms, and computational complexity theory.
- The position will require teaching at most two courses per year in
Mathematics or Computer Science programs at UP FAMNIT (depending on the
candidate's background and expertise).
- The postdoctoral researcher will have access to a certain amount of
funding for travel, conferences, and visitors.
- The compensation is set according to the academic title by Slovenian
law governing higher education and is expected to be about 1680 EUR /
month after tax, which can increase to about 1780 EUR / month after the
first 6 months (if the tax residency status is obtained).

DEADLINE AND APPLICATION PROCESS:

Applications will be assessed on a rolling basis until the position is
filled, beginning April 15, 2024.

The starting date is flexible, but preferably not later than October 2024.
To apply, please send the following documents in electronic form to
razpisi@famnit.upr.si with the subject line "University of Primorska
Postdoc 2024" in the Subject field:
- Curriculum Vitae,
- Publication List,
- Research Statement,
- Copies of at most three recent papers or preprints,
- Names and e-mail addresses of two or three persons who can be
contacted for reference (and who have agreed to be contacted).

Informal inquiries may be directed by email to martin.milanic@upr.si.

Kind regards,
Martin Milanic

**********************************************************
*
* 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] Deadline Approaching (April 2nd): Two Professorships (open rank) interfacing classical Network Science and Graph Machine Learning at Goethe University Frankfurt

The recently founded Center for Critical Computational Studies (C3S) at
Goethe University Frankfurt am Main, Germany, seeks to fill the
positions of at least twelve professorships. The first round of
recruitment includes

Two professorships at the interface between classical network science
and graph machine learning.

The calls are open discipline and open rank (W1 to W2 Tenure Track; W2
to W3 Tenure Track; W3). Ideal candidates for these professorships will
possess a robust cross-disciplinary profile or interest, demonstrating
not only expertise within their specific domains but also a genuine
openness to collaborative, cross-disciplinary work. While the primary
focus is on researchers with a strong background in network science,
computer science or mathematics, proven by a matching PhD and
high-ranking publications in the research areas described above, other
degrees in suitable application areas are also welcome.
Envisioned research fields include but are not limited to:

- Mathematics of graph machine learning.
- Robustness and guaranteed performance, in particular dealing with
noise, data bias and application specific challenges (e.g., in
social/socio-ecological settings).
- Sustainability, in particular scalability, data and resource efficiency.
- Non-static graphs: dynamic, temporal, streaming settings.
- Random graphs and random processes.
- Dealing with higher-order structures such as motifs, graphlets, and
simplicial complexes.

In an explorative workshop from 25 to 27 June in Frankfurt am Main, we
will invite candidates to showcase their expertise and
cross-disciplinary interests in a dynamic, engaging, and collaborative
environment. Neither your application for the workshop nor the workshop
as such are part of the formal hiring process. The workshop will pave
the way for this hiring process, which will be conducted by
extraordinary selection committees ("Findungskommissionen" in German)
pursuant to the Rules of Recruitment ("Berufungssatzung" in German) of
Goethe University.

For more information see

https://www.c3s-frankfurt.de/workshop

We invite applications for the workshop until 02 April 2024 and will
cover travel and accommodation for invitees.


--
Prof. Dr. Ulrich Meyer
Algorithm Engineering Group
Institute of Computer Science
Goethe University Frankfurt am Main
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main, Germany

Tel: +49-69-798-28433
Fax: +49-69-798-28357
Email: umeyer@cs.uni-frankfurt.de
Web: http://www.uli-meyer.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/
*
**********************************************************