[DMANET] ICALP 2023 Call for Participation

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

ICALP 2023 - Call for Participation

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

The 50th EATCS International Colloquium on Automata, Languages, and Programming

(ICALP) will take place in:

Paderborn, Germany, on 10-14 July 2023.

ICALP is the main conference and annual meeting of the European

Association for Theoretical Computer Science (EATCS). As usual, ICALP will

be preceded by a series of workshops, which will take place on July 10.

The 2023 edition has the following features:

- The conference is planned as a physical, in-person event.

- This will be the 50th ICALP conference and some special events are planned.

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

Important dates and information

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

Conference website: https://icalp2023.cs.upb.de/

Twitter: @ICALPconf

Early registration: May 15, 2023 by 23:59 CET

Conference: July 10-14, 2023 (Workshops on July 10, 2023)

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

Registration

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

Please register here: https://icalp2023.cs.upb.de/registration/

On-site child care:

Please contact noelle.maicher.hoff@upb.de <mailto:noelle.maicher.hoff@upb.de> of the Equality Office of Paderborn University as soon as possible.

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

Invited Speakers

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

Anna Karlin - University of Washington, USA

Rasmus Kyng - ETH Zurich, Switzerland

Rupak Majumdar - Max Planck Institute for Software Systems, Germany

Thomas Vidick - California Institute of Technology, USA, and Weizmann Institute

of Science, Israel

James Worrell - University of Oxford, UK

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

Awards

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

During the conference, the following awards will be given:

– the EATCS award (https://eatcs.org/index.php/eatcs-award),

- the Church award (https://eatcs.org/index.php/church-award)

– the Presburger award (https://eatcs.org/index.php/presburger),

– the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award),

– the best papers for Track A and Track B,

– the best student papers for Track A and Track B (see submission guidelines).

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

Special 50th ICALP session

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

Invited talks:

Kurt Mehlhorn (MPI für Informatik, Saarland Informatics Campus)

Thomas Henzinger (IST Austria)

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

Workshops

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

See https://icalp2023.cs.upb.de/workshops/ for more information.

- Combinatorial Reconfiguration

- Graph Width Parameters: from Structure to Algorithms (GWP 2023)

- Algorithmic Aspects of Temporal Graphs VI

- Adjoint Homomorphism Counting Workshop (ad hoc)

- Congestion Games

- Workshop On Reachability, Recurrences, and Loops '23 (WORReLL'23)

- Workshop on Recent Trends in Online Algorithms

- Quantum Computing with Qiskit, and why Classical Algorithms still matter!

- Algebraic Complexity Theory

- Computer Science for CONTINUOUS Data

============= Accepted papers =============

//////////////////////

TRACK A

//////////////////////

Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi and Kewen Wu. On Differentially Private Counting on Trees

Leslie Ann Goldberg and Marc Roth. Parameterised and Fine-grained Subgraph Counting, modulo 2

Michał Wlodarczyk. Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth

Laure Morelle, Ignasi Sau, Giannos Stamoulis and Dimitrios M. Thilikos. Faster parameterized algorithms for modification problems to minor-closed classes

Sanjeev Khanna, Yu Chen and Zihan Tan. Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics

Noam Touitou. Frameworks for Nonclairvoyant Network Design with Deadlines or Delay

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shunichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki. Rerouting Planar Curves and Disjoint Paths

Honghao Fu, Daochen Wang and Qi Zhao. Parallel self-testing of EPR pairs under computational assumptions

Shi Li. Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems

Shyan Akmal and Ce Jin. An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan and Laszlo Kozma. Fast approximation of search trees on trees with centroid trees

Ishan Bansal, Joe Cheriyan, Logan Grout and Sharat Ibrahimpur. Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Hadley Black, Iden Kalemaj and Sofya Raskhodnikova. Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing

Claire Mathieu and Hang Zhou. A Tight $(1.5+\epsilon)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

Sixue Liu, Zhao Song, Hengjie Zhang, Lichen Zhang and Tianyi Zhou. Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching

Yanlin Chen and Ronald de Wolf. Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints

Spencer Compton, Slobodan Mitrović and Ronitt Rubinfeld. New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

Tatsuya Terao. Faster Matroid Partition Algorithms

David Harris and Vladimir Kolmogorov. Parameter estimation for Gibbs distributions

Eric Rivals, Michelle Sweering and Pengfei Wang. Convergence of the number of period sets in strings

David E. Roberson and Tim Seppelt. Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann and Leon Schiller. Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs

Konstantina Mellou, Marco Molinaro and Rudy Zhou. Online Demand Scheduling with Failovers

David Eppstein and Daniel Frishberg. Improved mixing for the convex polygon triangulation flip walk

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-Ichi Maezawa, Yuta Nozaki and Yoshio Okamoto. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco and Archan Ray. Sublinear Time Eigenvalue Approximation via Random Sampling

Lijie Chen, Xin Lyu, Avishay Tal and Hongxun Wu. New PRGs for Unbounded-width/Adaptive-order Read-once Branching Programs

Petr Hlineny and Jan Jedelský. Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar

Yann Disser, Max Klimm, Kevin Schewior and David Weckbecker. Incremental Maximization via Continuization

Mohit Garg, Felix Hommelsheim and Nicole Megow. Matching Augmentation via Simultaneous Contractions

Manuel Cáceres. Minimum Chain Cover in Almost Linear Time

Zachary Friggstad and Ramin Mousavi. An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs

Shu Liu, Chaoping Xing and Chen Yuan. List Decoding of Rank-Metric Codes with Row-to-Column Ratio Bigger Than 1/2

Yossi Azar and Danny Vainstein. Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering

Daniel Hader and Matthew Patitz. The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly

Hans L. Bodlaender, Carla Groenland and Michał Pilipczuk. Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters

Ishan Agarwal and Richard Cole. Stable Matching: Choosing Which Proposals to Make

Ruizhe Zhang and Xinzhi Zhang. A Hyperbolic Extension of Kadison-Singer Type Results

Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov. Approximating Long Cycle Above Dirac's Guarantee

Michael Whitmeyer and Siddharth Iyer. Searching for Regularity in Bounded Functions

Vaishali Surianarayanan, Daniel Lokshtanov and Saket Saurabh. Breaking the All Subsets Barrier for Min $k$-Cut

Magdalen Dobson and Guy Blelloch. The Geometry of Tree-Based Sorting

Thiago Bergamaschi. Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians

Shaddin Dughmi, Yusuf Hakan Kalaycı and Neel Patel. On Sparsification of Stochastic Packing Problems

Siu-Wing Cheng and Haoqiang Huang. Approximate Nearest Neighbor for Polygonal Curves under Frechet Distance

Gramoz Goranci and Monika Henzinger. Efficient Data Structures for Incremental Exact and Approximate Maximum Flow

Shimon Kogan and Merav Parter. New Additive Emulators

Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann and Martin Schirneck. Fault-Tolerant ST-Diameter Oracles

Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras and Rebecca Reiffenhäuser. Truthful Matching with Online Items and Offline Agents

Ilan Cohen and Debmalya Panigrahi. A General Framework for Learning-Augmented Online Allocation

Fedor Fomin, Petr Golovach, Ignasi Sau, Giannos Stamoulis and Dimitrios M. Thilikos. Compound Logics for Modification Problems

Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter Rasmussen and Mikkel Thorup. Optimal Decremental Connectivity in Non-Sparse Graphs

Dana Ron and Omer Cohen Sidon. Sample-based distance-approximation for subsequence-freeness

Siddharth Barman and Pooja Kulkarni. Approximation Algorithms for Envy-Free Cake Division with Connected Pieces

Kazusato Oko, Shinsaku Sakaue and Shin-ichi Tanigawa. Nearly Tight Spectral Sparsification of Directed Hypergraphs

Daniel Agassy, Dani Dorfman and Haim Kaplan. Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player

Jakob Bæk Tejs Houen and Mikkel Thorup. A Sparse Johnson-Lindenstrauss Transform using Fast Hashing

Pan Peng and Yuyang Wang. An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs

Qin Minglong and Penghui Yao. Decidability of fully quantum nonlocal games with noisy maximally entangled states

Louis Esperet, Nathaniel Harms and Viktor Zamaraev. Optimal Adjacency Labels for Subgraphs of Cartesian Products

Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi and Jukka Suomela. Locality in online, dynamic, sequential, and distributed graph algorithms

Dmitry Paramonov, Gillat Kol, Klim Efremenko and Raghuvansh R. Saxena. Protecting Single-Hop Radio Networks from Message Drops

Alexandru Gheorghiu, Tony Metger and Alexander Poremba. Quantum cryptography with classical communication - Parallel remote state preparation for copy-protection, verification, and more

Andrzej Dorobisz and Jakub Kozik. Local Computation Algorithms for Hypergraph Coloring - following Beck's approach

Ishay Haviv. On Finding Constrained Independent Sets in Cycles

Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser and Malin Rau. Dynamic Averaging Load Balancing on Arbitrary Graphs

Ilan Doron, Ariel Kulik and Hadas Shachnai. An EPTAS for Budgeted Matching and Budgeted Matroid Intersection

Karthik Murali and Therese Biedl. On computing the vertex connectivity of 1-plane graphs

Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan and Shay Sapir. Lower Bounds for Pseudo-Deterministic Counting in a Stream

Charilaos Efthymiou and Weiming Feng. On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n)

Jun-Ting Hsieh and Pravesh K Kothari. Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

Or Zamir. The wrong direction of Jensen's inequality is algorithmically right

Talya Eden, Sofya Raskhodnikova, Quanquan C. Liu and Adam Smith. Triangle Counting with Local Edge Differential Privacy

Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt and Julian Wargalla. Connected k-Center and k-Diameter Clustering

Dylan Hyatt-Denesik, Afrouz Ameli and Laura Sanita. Finding Almost Tight Witness Trees

Adam Karczmarz and Piotr Sankowski. Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs

Xiantao Li and Chunhao Wang. Simulating Markovian open quantum systems using higher-order series expansion

Monika Henzinger, Paul Liu, Jan Vondrák and Da Wei Zheng. Faster submodular maximization for several classes of matroids

Miguel Bosch Calvo, Fabrizio Grandoni and Afrouz Jabal Ameli. A 4/3 Approximation for 2-Vertex-Connectivity

Paul Beame and Niels Kornerup. Cumulative Memory Lower Bounds for Randomized and Quantum Computation

Sudatta Bhattacharya and Michal Koucky. Streaming $k$-edit approximate pattern matching via string decomposition

Robert Ferens and Marek Szykuła. Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds

David Stalfa, Rajmohan Rajaraman and Sheng Yang. Scheduling under Non-Uniform Job and Machine Delays

Konstantinos Zampetakis and Charilaos Efthymiou. Broadcasting with Random Matrices

Chandra Chekuri and Rhea Jain. Approximation Algorithms for Network Design in Non-Uniform Fault Models

Jin-Yi Cai and Ben Young. Planar \#CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint

Andrej Bogdanov and Alon Rosen. Nondeterministic Refutations for Nearest Boolean Vector

Amir Azarmehr and Soheil Behnezhad. Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation

Timothy M. Chan, Qizheng He and Yuancheng Yu. On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete $k$-Center for Small $k$

Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami and Kaave Hosseini. Online Learning and Disambiguations of Partial Concept Classes

Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee and Joshua Wang. Efficient Caching with Reserves via Marking

Jun-Ting Hsieh, Pravesh Kothari, Aaron Potechin and Jeff Xu. Ellipsoid Fitting Up to a Constant

Ryu Hayakawa, Jordi Weggemans, Tomoyuki Morimae, Chris Cade, Marten Folkertsma, Sevag Gharibian and Francois Le Gall. Improved Hardness Results for the Guided Local Hamiltonian Problem

Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar and Ashish Goel. Low Sample Complexity Participatory Budgeting

Yi-Jun Chang. Ortho-radial Drawing in Near-linear Time

Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei and Yu Zheng. Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes

Rotem Oshman and Tal Roth. The Communication Complexity of Set Intersection under Product Distributions

Thomas Sauerwald, He Sun and Danny Vagnozzi. The Support of Open versus Closed Random Walks

Sam Coy, Artur Czumaj, Peter Davies and Gopinath Mishra. Optimal (degree+1)-Coloring in Congested Clique

Ittai Rubinstein. Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem

Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha and Bhargav Thankey. Low-depth arithmetic circuit lower bounds: Bypassing set-multilinearization

Nicolas Resch, Chen Yuan and Yihan Zhang. Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery

Peyman Afshani, Pingan Cheng, Aniket Basu Roy and Zhewei Wei. On Range Summary Queries

//////////////////////

TRACK B

//////////////////////

Frits Vaandrager and Thorsten Wißmann. Action Codes

Michael Lampis. First Order Logic on Pathwidth Revisited Again

Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour and Pierre Vandenhove. How to Play Optimally for Regular Objectives?

Bader Abu Radi and Orna Kupferman. On Semantically-Deterministic Automata

Manuel Bodirsky and Simon Knäuer. Network Satisfaction Problems Solved by k-Consistency

Ruiwen Dong. The Identity Problem in $\mathbb{Z} \wr \mathbb{Z}$ is decidable

Michael Blondin and François Ladouceur. Population Protocols with Unordered Data

Markus Lohrey and Andreas Rosowski. On the complexity of diameter and related problems in permutation groups

Moritz Lichter. Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid and Alexandra Silva. Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity

Bartosz Bednarczyk, Ian Pratt-Hartmann and Daumantas Kojelis. On the of Limits of Decision: the Adjacent Fragment of First-Order Logic

Mikołaj Bojańczyk and Lê Thành Dũng Nguyễn. Algebraic Recognition of Regular Functions

Jan Dreier, Nikolas Mählmann, Sebastian Siebertz and Szymon Toruńczyk. Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes

Antonio Casares and Pierre Ohlmann. Characterising memory in infinite games

Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski and Szymon Toruńczyk. Canonical decompositions in monadically stable and bounded shrubdepth graph classes

Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski and Szymon Toruńczyk. Flipper games for monadically stable graph classes

Titouan Carette, Etienne Moutot, Thomas Perez and Renaud Vilmart. Compositionality of planar perfect matchings, a universal and complete fragment of ZW-calculus

Harry Vinall-Smeeth and Christoph Berkholz. A dichotomy for succinct representations of homomorphisms

Javier Esparza and Vincent Grande. Black-box Testing Liveness Properties of Partially Observable Stochastic Systems

Thomas Henzinger, Pavol Kebis, Nicolas Mazzocchi and N. Ege Saraç. Regular Methods for Operator Precedence Languages

George Kenison, Joris Nieuwveld, Joël Ouaknine and James Worrell. Positivity Problems for Reversible Linear Recurrence Sequences

Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot and Sarah Winter. Deterministic regular functions of infinite words

Fabian Birkmann, Stefan Milius and Henning Urbat. Nominal Topology for Data Languages

Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks and Karol Węgrzycki. Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Austen Z. Fan, Paraschos Koutris and Hangdong Zhao. The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems

Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar and Kuldeep Meel. Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?

Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis and Aris Papadopoulos. Monadic NIP in monotone classes of relational structures

Michael Benedikt, Dmitry Chistikov and Alessio Mansutti. The complexity of Presburger arithmetic with power or powers

Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan Thinniyam Srinivasan and Georg Zetzsche. Checking Refinement of Asynchronous Programs against Context-Free Specifications

**********************************************************
*
* 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] FLTA 2023 CFP: The International Symposium on Federated Learning Technologies and Applications, Tartu, Estonia. September 18-20, 2023

[Apologies if you got multiple copies of this invitation]

The International Symposium on Federated Learning Technologies and
Applications (FLTA 2023)

https://emergingtechnet.org/FLTA2023/

In Conjunction with

The Eighth International Conference on Fog and Mobile Edge Computing (FMEC
2023)

emergingtechnet.org/FMEC2022/index.php

Tartu, Estonia. September 18-20, 2023

Technically Co-Sponsored by IEEE Estonia Section

*FLTA 2023 CFP:*

We live in a data-driven era where AI and ML are integrated into every
aspect of life and industry when making decisions. Recent AI/ML
applications, scenarios, and use cases data sources come from large-scale
distributed and diverse sources, i.e., in terms of capacity and data
heterogeneity. Such an approach empowers applications to discover unique
insights, which can be intelligently utilized to provide better services
and user experience. Yet it imposes serious debate on data and client
privacy, specifically on data protection regulations and restrictions such
as EU GDPR. Moreover, collecting, aggregating, and integrating
heterogeneous data dispersed over various data sources and securely
managing and processing the data are non-trivial tasks. The challenges are
not only due to transporting high-volume, high-velocity, high-veracity,
cybersecurity attacks, and heterogeneous data across organizations. There
is also a challenge with domain-specific language models to get enough
training data since it is usually private or sensitive, with complicated
administrative procedures surrounding it. Such private data include users'
financial transactions, patients' health data, or camera footage on the
street. In this context, Federated learning (FL) has emerged as a
prospective solution that facilitates distributed collaborative learning
without disclosing original training data. The idea behind FL is to train
the ML model collaboratively among distributed actors without sharing their
data and violating the privacy accord. FL locates ML services and
operations closer to the clients, facilitating leveraging available
resources on the network's edge. Hence, FL has become a critical enabling
technology for future intelligent applications in domains such as
autonomous driving, smart manufacturing, and healthcare. This development
will lead to an overall advancement of FL and its impact on the community,
noting that FL has gained significant attention within the machine learning
community in recent years.

The FLTA2023 aims to provide a global forum for disseminating the latest
scientific research and industry results in all aspects of federated
learning. FLTA2023 also aims to bring together researchers, practitioners,
and edge intelligence advocators in sharing and presenting their
perspectives on the effective management of FL deployment architectures.
The symposium will address the theoretical foundations of the field, as
well as applications, datasets, benchmarking, software, hardware, and
systems. Also, to create an annual forum for researchers and practitioners
who share an interest in FL. FLTA offers an opportunity to showcase the
latest advances in this area and discuss and identify future directions and
challenges in FL systems. FLCon2023 will also provide ample opportunities
for networking, sharing knowledge, and collaborating with others in the
metaverse community.

*Topics of interest:*

- Federated Learning frameworks
- Federated Learning Aggregation Algorithms
- Federated Learning Applications
- Federated Learning Deployment Architectures
- Privacy-Preserving FL Techniques
- Federated Learning Communication-efficiency
- Federated Learning modelling and simulation tools
- Federated Learning datasets and benchmarking
- Federated Learning Associated Technologies

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the FMEC Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers up to 8 pages and must follow the IEEE paper format. Please include
up to 7 keywords, complete postal and e-mail address, and fax and phone
numbers of the corresponding author. Authors of accepted papers are
expected to present their work at the conference. Submitted papers that are
deemed of good quality but that could not be accepted as regular papers
will be accepted as short papers. Length of short papers can be between 4
to 6 pages.

*Important Dates*

Full Paper Submission Date: 30 May 2023

Short paper/poster due: June 10, 2023
Notification to Authors: 30 July 2023
Camera Ready Submission: 15 August 2023

*Contact:*

Please send any inquiry on FLTA to Feras Awaysheh: feras.awaysheh@ut.ee

**********************************************************
*
* 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] 3rd International Workshop on Social Media Networks Analytics and Applications (SMA2)

*** 3rd International Workshop on Social Media Networks Analytics and
Applications (SMA2) ***

September 4, 2023 - Barcelona, Spain co-located with ADBIS 2023
https://sma2.inf.unibz.it

Nowadays, multimedia data allow fast and effective communication and
sharing of information about peoples' lives, their behaviors, work, and
interests, but they are also the digital testimony of facts, objects, and
locations. In such a context, Social Media Networks (SMNs) actually
represent a natural environment where users can create and share multimedia
content such as text, images, video, audio, and so on. Just as an example,
each minute thousands of tweets are sent on Twitter, several hundreds of
hours of videos are uploaded to YouTube, and a huge amount of photos are
shared on Instagram or uploaded to Flickr. Within these "interest-based"
networks, each user interacts with the others through multimedia content
(text, image, video, audio) and such interactions create "social links"
that well characterize the behaviors of the users. Here, in addition to
social information (e.g., tags, opinions, insights, evaluations,
perspectives, ratings, and user profiles) multimedia data can play a
"key-role" especially from the perspective of Social Network Analysis
(SNA): representing and understanding multimedia characteristics and
user-to-item interaction mechanisms can be useful to predict user behavior,
model the evolution of multimedia content and social graphs, design
human-centric multimedia applications and services, just to make a few
examples.

In particular, SMNs are becoming truly pervasive, encompassing every aspect
of our digital life. While the widespread adoption of SMNs by virtually all
small and large businesses, as well as many individual users, has enormous
benefits in terms of dissemination of and access to information, the
diverse nature of the content shared on SMNs (text, video, audio) poses new
and interesting challenges with respect to information reuse and
integration. The International Workshop on Social Media Networks Analytics
and Applications (SMA2) aims to address these critical challenges by
bringing together scientists, engineers, practitioners, and students in an
interdisciplinary forum where they can share experiences and ideas, discuss
the results of their research on models, methodologies and algorithms, and
forge new collaborations that will lead to the development of new
applications and tools to transform information extracted from SMNs into
actionable intelligence.

** Important dates **

Paper submission: May 8, 2023 (EXTENDED)
Paper notification: May 29, 2023
Camera ready: June 9, 2023

** Topics of interest **

Authors are invited to submit original contributions on the following
topics:

- Social Media Networks Modeling
- User-profiling in Social Media Networks
- Influence Analysis in Social Media Networks
- Community Detection in Social Media Networks
- Sentiment Analysis and Opinion Mining in Social Media Networks
- Multimedia Recommendation in Social Media Networks
- Multimedia Information Retrieval in Social Media Networks
- Multimedia Knowledge Representation and Management in Social Media
Networks
- Multimedia Content Sharing in Social Media Networks
- Multimedia Resources Distribution and Allocation in Social Media Networks
- Usage of Linked Data in Social Media Networks
- Big Data Analytics in Social Media Networks
- Applications of Social Media Networks (e.g., Cultural Heritage,
E-learning, Multimedia Editing)
- Mobile applications for Social Media Networks
- Event detection using social media
- Misinformation mining Social Media Networks
- Submission instructions

Submitted papers must be unpublished and not considered elsewhere for
publication. Submissions will undergo a rigorous review process handled by
the Technical Program Committee. Papers will be selected based on their
originality, significance, relevance, and clarity of presentation.

The page limit for long papers is 12 pages and 6 pages for short papers.
Papers should be prepared according to the LNCS format (templates are
available at
http://preview.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines).
Latex submissions are highly encouraged. Nonetheless, papers prepared in
other word processing software are also welcome.

Papers must be submitted in PDF format via EasyChair:
https://easychair.org/my/conference?conf=sma22023.

** Workshop chairs **

Vincenzo Moscato, University of Naples "Federico II", Italy
Giancarlo Sperlì, University of Naples "Federico II", Italy
Fabio Persia, University of L'Aquila, Italy
Anton Dignös, Free University of Bozen-Bolzano, Italy

** Proceedings **

Workshop papers will be published by Springer in the Communications in
Computer and Information Science (CCIS) book series. The Springer CCIS
volume with workshop papers will be published only as a DIGITAL volume,
available for downloading from the Springer portal.

Authors of the best workshop papers will be invited to submit an extended
version of their paper to the ComSIS Journal (http://comsis.org/ - 2-year
IF: 1.170) indexed by Science Citation Index (SCI) by Thomson Reuters,
SCOPUS (Elsevier), Summon (Serials Solutions).

** Diversity and Inclusion **

We kindly ask authors to adopt inclusive language in their papers and
presentations (https://dbdni.github.io/pages/inclusivewriting.html and
https://dbdni.github.io/pages/inclusivetalks.html), and all participants to
adopt a proper code on conduct (
https://dbdni.github.io/pages/codeofconduct.html)

--
-------------------------------
*Giancarlo Sperlì, Ph.D.*
Tenured Assistant Professor (RTD-B),
University of Naples "Federico II",
Room 3.21 Building 3/A,
Via Claudio 21,
80125 Napoli
Mail: giancarlo.sperli@unina.it
Mail: giancarlo.sperli@consorzio-cini.it
WWW: http://wpage.unina.it/giancarlo.sperli/
PICUSLab: https://picuslab.dieti.unina.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] DeepLearn 2023 Summer: early registration May 1st

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

10th INTERNATIONAL GRAN CANARIA SCHOOL ON DEEP LEARNING

DeepLearn 2023 Summer

Las Palmas de Gran Canaria, Spain

July 17-21, 2023

https://deeplearn.irdta.eu/2023su/

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

Co-organized by:

University of Las Palmas de Gran Canaria

Institute for Research Development, Training and Advice =E2=80=93 IRDTA
Brussels/London

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

Early registration: May 1st, 2023

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

FRAMEWORK:

DeepLearn 2023 Summer is part of a multi-event called Deep&Big 2023 consist=
ing also of BigDat 2023 Summer. DeepLearn 2023 Summer participants will hav=
e the opportunity to attend lectures in the program of BigDat 2023 Summer a=
s well if they are interested.

SCOPE:

DeepLearn 2023 Summer will be a research training event with a global scope=
aiming at updating participants on the most recent advances in the critica=
l and fast developing area of deep learning. Previous events were held in B=
ilbao, Genova, Warsaw, Las Palmas de Gran Canaria, Guimar=C3=A3es, Las Palm=
as de Gran Canaria, Lule=C3=A5, Bournemouth and Bari.

Deep learning is a branch of artificial intelligence covering a spectrum of=
current frontier research and industrial innovation that provides more eff=
icient algorithms to deal with large-scale data in a huge variety of enviro=
nments: computer vision, neurosciences, speech recognition, language proces=
sing, human-computer interaction, drug discovery, health informatics, medic=
al image analysis, recommender systems, advertising, fraud detection, robot=
ics, games, finance, biotechnology, physics experiments, biometrics, commun=
ications, climate sciences, geographic information systems, signal processi=
ng, genomics, etc. etc. Renowned academics and industry pioneers will lectu=
re and share their views with the audience.

Most deep learning subareas will be displayed, and main challenges identifi=
ed through 19 four-hour and a half courses and 2 keynote lectures, which wi=
ll tackle the most active and promising topics. The organizers are convince=
d that outstanding speakers will attract the brightest and most motivated s=
tudents. Face to face interaction and networking will be main ingredients o=
f the event. It will be also possible to fully participate in vivo remotely=
.

An open session will give participants the opportunity to present their own=
work in progress in 5 minutes. Moreover, there will be two special session=
s with industrial and employment profiles.

ADDRESSED TO:

Graduate students, postgraduate students and industry practitioners will be=
typical profiles of participants. However, there are no formal pre-requisi=
tes for attendance in terms of academic degrees, so people less or more adv=
anced in their career will be welcome as well. Since there will be a variet=
y of levels, specific knowledge background may be assumed for some of the c=
ourses. Overall, DeepLearn 2023 Summer is addressed to students, researcher=
s and practitioners who want to keep themselves updated about recent develo=
pments and future trends. All will surely find it fruitful to listen to and=
discuss with major researchers, industry leaders and innovators.

VENUE:

DeepLearn 2023 Summer will take place in Las Palmas de Gran Canaria, on the=
Atlantic Ocean, with a mild climate throughout the year, sandy beaches and=
a renowned carnival. The venue will be:

Instituci=C3=B3n Ferial de Canarias
Avenida de la Feria, 1
35012 Las Palmas de Gran Canaria

https://www.infecar.es/

STRUCTURE:

2 courses will run in parallel during the whole event. Participants will be=
able to freely choose the courses they wish to attend as well as to move f=
rom one to another.

Also, if interested, participants will be able to attend courses developed =
in BigDat 2023 Summer, which will be held in parallel and at the same venue=
.

Full live online participation will be possible. The organizers highlight, =
however, the importance of face to face interaction and networking in this =
kind of research training event.

KEYNOTE SPEAKERS:

Alex Voznyy (University of Toronto), Comparison of Graph Neural Network Arc=
hitectures for Predicting the Electronic Structure of Molecules and Solids

Aidong Zhang (University of Virginia), Concept-Based Explainable Deep Learn=
ing Models

PROFESSORS AND COURSES:

Eneko Agirre (University of the Basque Country), [introductory/intermediate=
] Natural Language Processing in the Large Language Model Era

Pierre Baldi (University of California Irvine), [intermediate/advanced] Dee=
p Learning in Science

Nat=C3=A1lia Cordeiro (University of Porto), [introductory/intermediate] Mu=
lti-Tasking Machine Learning in Drug and Materials Design

Daniel Cremers (Technical University of Munich), [intermediate] Deep Networ=
ks for 3D Computer Vision

Stefano Giagu (Sapienza University of Rome), [introductory/intermediate] Qu=
antum Machine Learning on Parameterized Quantum Circuits

Georgios Giannakis (University of Minnesota), [intermediate/advanced] Learn=
ing from Unreliable Labels via Crowdsourcing

Tae-Kyun Kim (Korea Advanced Institute of Science and Technology), [interme=
diate/advanced] Deep 3D Pose Estimation

Marcus Liwicki (Lule=C3=A5 University of Technology), [intermediate/advance=
d] Methods for Learning with Few Data

Chen Change Loy (Nanyang Technological University), [introductory/intermedi=
ate] Image and Video Restoration

Ivan Oseledets (Skolkovo Institute of Science and Technology), [introductor=
y/intermediate] Tensor Methods for Approximation of High-Dimensional Arrays=
and Their Applications in Machine Learning

Deepak Pathak (Carnegie Mellon University), [intermediate/advanced] Continu=
ally Improving Agents for Generalization in the Wild

Kaushik Roy (Purdue University), [introductory/advanced] Neuromorphic Compu=
ting

Bj=C3=B6rn Schuller (Imperial College London), [introductory/intermediate] =
Deep Multimedia Processing

Amos Storkey (University of Edinburgh), [intermediate] Meta-Learning and Co=
ntrastive Learning for Robust Representations

Ponnuthurai N. Suganthan (Qatar University), [introductory/intermediate] Ra=
ndomization-Based Deep and Shallow Learning Algorithms and Architectures

Jiliang Tang (Michigan State University), [introductory/advanced] Deep Lear=
ning on Graphs: Methods, Advances and Applications

Savannah Thais (Columbia University), [intermediate] Applications of Graph =
Neural Networks: Physical and Societal Systems

Li Xiong (Emory University), [introductory] Deep Learning and Privacy Enhan=
cing Technology

Lihi Zelnik-Manor (Technion - Israel Institute of Technology), [introductor=
y] Introduction to Computer Vision and the Ethical Questions It Raises

OPEN SESSION:

An open session will collect 5-minute voluntary presentations of work in pr=
ogress by participants. They should submit a half-page abstract containing =
the title, authors, and summary of the research to david@irdta.eu by July 9=
, 2023.

INDUSTRIAL SESSION:

A session will be devoted to 10-minute demonstrations of practical applicat=
ions of deep learning in industry. Companies interested in contributing are=
welcome to submit a 1-page abstract containing the program of the demonstr=
ation and the logistics needed. People in charge of the demonstration must =
register for the event. Expressions of interest have to be submitted to dav=
id@irdta.eu by July 9, 2023.

EMPLOYER SESSION:

Organizations searching for personnel well skilled in deep learning will ha=
ve a space reserved for one-to-one contacts. It is recommended to produce a=
1-page .pdf leaflet with a brief description of the organization and the p=
rofiles looked for to be circulated among the participants prior to the eve=
nt. People in charge of the search must register for the event. Expressions=
of interest have to be submitted to david@irdta.eu by July 9, 2023.

ORGANIZING COMMITTEE:

Aridane Gonz=C3=A1lez Gonz=C3=A1lez (Las Palmas de Gran Canaria)
Marisol Izquierdo (Las Palmas de Gran Canaria, local chair)
Carlos Mart=C3=ADn-Vide (Tarragona, program chair)
Sara Morales (Brussels)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://deeplearn.irdta.eu/2023su/registration/

The selection of 8 courses requested in the registration template is only t=
entative and non-binding. For logistical reasons, it will be helpful to hav=
e an estimation of the respective demand for each course. During the event,=
participants will be free to attend the courses they wish as well as event=
ually courses in BigDat 2023 Summer.

Since the capacity of the venue is limited, registration requests will be p=
rocessed on a first come first served basis. The registration period will b=
e closed and the on-line registration tool disabled when the capacity of th=
e venue will have got exhausted. It is highly recommended to register prior=
to the event.

FEES:

Fees comprise access to all courses and lunches. There are several early re=
gistration deadlines. Fees depend on the registration deadline.

The fees for on site and for online participation are the same.

ACCOMMODATION:

Accommodation suggestions are available at

https://deeplearn.irdta.eu/2023su/accommodation/

CERTIFICATE:

A certificate of successful participation in the event will be delivered in=
dicating the number of hours of lectures.

QUESTIONS AND FURTHER INFORMATION:

david@irdta.eu

ACKNOWLEDGMENTS:

Cabildo de Gran Canaria

Universidad de Las Palmas de Gran Canaria - Fundaci=C3=B3n Parque Cient=C3=
=ADfico Tecnol=C3=B3gico

Universitat Rovira i Virgili

Institute for Research Development, Training and Advice =E2=80=93 IRDTA, Br=
ussels/London
**********************************************************
*
* 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 PhD position in Optimization Research Group at RPTU in Kaiserslautern

Open PhD position in optimization of multimodal transport systems

The Optimization Research Group (https://math.rptu.de/en/wgs/opt) of
RPTU Kaiserslautern-Landau is offering a PhD position (3 years, 75%
employment) based in Kaiserslautern. The position is funded by the BMBF
project "SynphOnie – Synergies from physical and transport planning
models for multi-criteria optimization of multimodal demand-oriented
transport". The successful applicant will conduct research on the
development and analysis of algorithms for this challenging task under
the supervision of Anita Schöbel. Candidates should have or be close to
obtaining a master's degree in mathematics or a comparable qualification.

More information can be found here:
https://math.rptu.de/fileadmin/AG_Optimierung/Downloads/job_offers/job_description.pdf
(in English)
https://jobs.uni-kl.de/jobposting/64ed6d2d9a85725ee98f7cc9d934a2ada0e3a4dc0
(in German)

For questions, contact Anita Schöbel (schoebel@mathematik.uni-kl.de) or
Sven Jäger (jaeger@mathematik.uni-kl.de).

--
Dr. Sven Jäger
Optimization Research Group
Department of Mathematics
RPTU Kaiserslautern-Landau
Building 14, Room 424
Paul-Ehrlich-Straße,
67663 Kaiserslautern

**********************************************************
*
* 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] EGC 2023: Last Call for papers

Last Call for papers
XX Spanish Meeting on Computational Geometry
Santiago de Compostela, Spain, July 3-5, 2023

https://egc23.web.uah.es/

(Apologies for multiple copies)

Dear Colleague,

We cordially invite you to join the XX Spanish Meeting on Computational Geometry (EGC'23) which will take place from July 3 to 5, 2023, at Universidade de Santiago de Compostela, Santiago de Compostela, Spain. The core of this international conference is composed by the most current issues in the field of Discrete and Computational Geometry, both in its theoretical and applied aspects. The EGC began in 1990. The expected participation includes undergraduates, master students or doctoral students, researchers from the area or from closer disciplines, and professionals from companies and institutions whose work involves the use of geometric algorithms. Topics include, but are not limited to:

* geometric algorithms and data structures;
* discrete and combinatorial geometry and topology;
* theoretical foundations of computational geometry;
* questions of interest in the implementation of geometric algorithms and geometric software development;
* applications of computational geometry, and closely related areas, such as computer graphics, virtual reality, robotics, computer vision, simulation and visualization, solid modelling, computer aided design and manufacturing, pattern recognition, graph drawing and circuit layout, image processing, geographic information science, multimedia and animation, wireless communications, computer algebra, computational topology, statistical analysis, operations research, computational biology, etc.
The language of the conference is English, hence all international colleagues are welcome to join.

Important dates

The deadlines have been changed. The new dates for the submissions, notification of acceptance and final version due are as follows.

Paper/talk submission deadline: May 2nd, 2023

Minor updates possible until: May 4th, 2023

Notification of acceptance: June 5th, 2023

Final versions due: June 16th, 2023

Conference: July 3-5, 2023
All deadlines are 23:59 AoE

Invited speakers

- Ruy Fabila-Monroy<https://www.math.cinvestav.mx/rfabila>, Cinvestav

- Antonio Gómez Tato<https://www.usc.gal/en/department/mathematics/directory/antonio-gomez-tato-1899>, Universidade de Santiago de Compostela

- Christiane Schmidt<https://weber.itn.liu.se/~chrsc91/>, Linköping University

Submissions

1) Paper submissions

Each paper submission should consist of an extended abstract of up to 4 pages of original research. Authors are encouraged to add an appendix with additional details, or even a full version of the paper, which will be reviewed by the program committee at their discretion to verify claims whose proofs do not fit in the 4-page abstract.

Papers that have recently been submitted to journals or other conferences are eligible for submission to EGC, assuming that it is allowed by those venues and they have not been published by the time of the conference.

2) Talk submissions

Each talk submission should consist of an abstract of 1 page describing original research presented in the proposed talk. This may involve ongoing research or a result published recently (with the first publication dated in 2022 or later). If the work has appeared previously, please provide a reference to the publication.

Abstracts of accepted papers and talks will be collected in a booklet that will be accessible from the conference website. There will be a limited number
of printed booklets with ISBN. Presentations of accepted papers and talks will be allocated the same amount of time in the program (approximately 15-25 minutes).

All submissions (of both papers and talks) will be reviewed by the program committee in order to guarantee that they are in scope and meet quality standards.

Submission instructions will be available at the paper submission section on the conference website https://egc23.web.uah.es/ .

Authors of accepted submissions are expected to present their work at the conference. Failure to do so will result in removal of the contribution from the abstract booklet and conference website.

Program committee
Oswin Aichholzer (Graz University of Technology)
Carlos Alegría (Università degli Studi Roma Tre)
Jesús Antonio Álvarez López (Universidade de Santiago de Compostela)
Mónica Blanco Gómez (Universidad de Cantabria)
Maike Buchin (Ruhr-University Bochum)
Jean Cardinal (Université libre de Bruxelles)
Frank Duque (Universidad Nacional de Colombia)
David Flores Peñaloza (Universidad Nacional Autónoma de México)
Marta Fort (Universitat de Girona)
María A. Hernández Cifre (Universidad de Murcia)
Clemens Huemer – co-chair (Universitat Politècnica de Catalunya)
Fabian Klute (Utrecht University)
Dolores Lara (Cinvestav)
Enrique Macías (Universidade de Santiago de Compostela)
Joseph S. B. Mitchell (State University of New York at Stony Brook)
Mercè Mora (Universitat Politècnica de Catalunya)
Pablo Pérez Lantero – co-chair (Universidad de Santiago de Chile)
María Luz Puertas (Universidad de Almería)
Carlos Seara (Universitat Politècnica de Catalunya)
Ana Paula Tomás (Universidade do Porto)

Organizing committee

Guillermo Esteban (U. de Alcalá & Carleton U.)
Enrique Macías – co-chair (U. de Santiago de Compostela)
David Mosquera (U. de Santiago de Compostela)
David Orden – co-chair (U. de Alcalá)
Carlos Seara – co-chair (U. Politècnica de Catalunya)
Alba Sendón (U. de Santiago de Compostela)

We are looking forward to seeing you in Santiago de Compostela, and we hope that you will feel encouraged to participate.
Best regards
--
For the program committee and the organizing committee of XX Spanish Meeting on Computational Geometry:
Guillermo Esteban, Enrique Macías, David Orden, Carlos Seara,
Clemens Huemer, Pablo Pérez-Lantero

Enviado desde Correo<https://go.microsoft.com/fwlink/?LinkId=550986> para Windows

**********************************************************
*
* 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] Tenure-Track position in MIS, Ad Astra Fellowship, College of Business, UCD

Dear Colleagues

University College Dublin (UCD, Dublin, Ireland) has recently opened the
competitive Ad Astra Fellowship <https://www.ucd.ie/adastrafellows/en/>
positions.

These are tenure-track, highly competitive, faculty posts.

The Management Information Systems (MIS) subject area within the College of
Business at UCD is seeking applications from candidates with an interest
and track record in the *Business Analytics*, *Big data / AI*, and related
fields.

If interested, please visit this website here
<https://www.ucd.ie/adastrafellows/en/applyhere/> and then click on Apply
to the College of Business >> Management Information Systems.

The deadline for these applications is *May 26, 2023 at 5 PM* (Irish time).

Kind regards

Dr Annunziata Esposito Amideo

*Dr Annunziata Esposito Amideo (She/Her)*

Assistant Professor in Management Information Systems

Member of the UCD Earth Institute <https://www.ucd.ie/earth/>, UCD Energy
Institute <https://energyinstitute.ucd.ie/> and UCD Transport Research Hub
(TREAH) <https://transportresearchhub.ucd.ie/>

Secretary of the EURO WISDOM Forum
<https://www.euro-online.org/web/pages/1654/wisdom>

Member of The OR Society WORAN
<https://www.theorsociety.com/get-involved/society-groups/special-interest-groups-and-networks/women-in-or-analytics-network/>
(PR & Media Subcommittee)

Advisory Board Member of UCD Women at STEM <https://www.ucd.ie/wits/>

Room Q223 | UCD Quinn School of Business

Management Information Systems Subject Area

University College Dublin, Belfield, Dublin 4, Dublin, Ireland

https://people.ucd.ie/annunziata.espositoamideo

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

Re: [DMANET] OR65 Annual Conference "Sustainable Development Goals" Stream

** SECOND ANNOUNCEMENT **

Dear Colleagues

Apologies for any cross-posting that may occur.

I am currently organising the #SustainableDevelopmentGoals stream session
as part of The OR Society Annual Conference #OR65, which will be at
the University of Bath (UK) this year, September 12 - 14, 2023.

The Annual Conference
<https://www.theorsociety.com/events/annual-conference/> is The OR
Society flagship
event and is known to be a great opportunity to network with both academic
and practitioners actively working in operational research and the broader
analytics realm.

The #SustainableDevelopmentGoals stream welcomes a variety of #OR
applications to any of the 17 United Nations Sustainable Development Goals.
OR tools (e.g., optimization or simulation modelling, stakeholder
involvement) are paramount in offering a structured approach to tackle the
objectives and, in particular, the challenges arising in real-life
applications of such kind.

The call for papers and posters is now open and ends on *May 30, 2023*. If
you are interested, please submit a title and abstract here
<https://theorsociety.eventsair.com/PresentationPortal/Account/Login?ReturnUrl=%2FPresentationPortal%2For65-annual-conference%2For65abstractportal>.
When
you are requested to choose a theme for your abstract, please select the
option "Sustainable Development Goals" from the drop-down menu. Info on
conference rates and fees are here
<https://www.theorsociety.com/events/annual-conference/or65-rates-and-booking/>
.

For further information, feel free to email me.

Kind regards

Dr Annunziata Esposito Amideo

**********************************************************
*
* 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 and positions in Machine Learning algorithms and theory at University of Edinburgh

Dear All,

We have PhD positions at University of Edinburgh in the area of algorithms and theory of machine learning. The project will allows exploration of other areas of theory including privacy, cryptography, game theory and more. See more details at:

https://homepages.inf.ed.ac.uk/rsarkar/positions/ml-val.html

For questions, contact: Rik Sarkar rsarkar@inf.ed.ac.uk

--

Rik Sarkar

Deputy Director,
Laboratory for Foundations of Computer Science
Reader, School of Informatics
The University of Edinburgh
10 Crichton street, IF 3.45
Edinburgh EH8 9AB
Ph: +44 (0) 131 650 4444
rsarkar@inf.ed.ac.uk
http://homepages.inf.ed.ac.uk/rsarkar/

The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.

**********************************************************
*
* 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 scholarship (2 years) in design theory (mathematics)

The Department of Mathematics and Mathematical Statistics at Umea University (Sweden) is seeking a postdoc scholar in design theory (mathematics).
More information can be found here:

https://www.umu.se/en/work-with-us/postdoctoral-scholarships/6-848-23/

**********************************************************
*
* 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] Lecturer/Senior Lecturer position in Pure Mathematics at UNSW Sydney

A Lecturer/Senior Lecturer position in Pure Mathematics is available in the School of Mathematics and Statistics at UNSW Sydney. We are looking for candidates whose research aligns with the research strengths of the School, including Combinatorics.

The School of Mathematics and Statistics at UNSW Sydney currently has more than sixty continuing academic staff and more than thirty research staff as well as visiting academics. UNSW is the only university in Australia to be ranked in the top 100 in the world in Mathematics and Statistics by each of the four ranking bodies: CWTS Leiden, ARWU, USNews, QS.

For more information, and instructions on how to apply, see

https://external-careers.jobs.unsw.edu.au/cw/en/job/515532/lecturer-senior-lecturer-pure-mathematics

For informal enquiries contact Catherine Greenhill c.greenhill@unsw.edu.au

The closing date is 31 May 2023 (AEST).

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

[DMANET] CFP: ICIST2023, December 8-14, 2023, Cairo, Egypt

*Call for Papers*
*https://conference.cs.cityu.edu.hk/icist*

Sponsor: British University in Egypt
Co-Sponsors: City University of Hong Kong and Chongqing Three Gorges
University
Technical co-sponsor: IEEE Systems, Man and Cybernetics Society

The 13th International Conference on Information Science and Technology
(ICIST 2023) will be held in Cairo, Egypt during December 8-14, 2023. As a
cradle of civilization, the conference site features long historical and
rich cultural heritages. Following the successes of previous events, ICIST
2023 aims to provide a high-level international forum for scientists,
engineers, and educators to present the state of the art of research and
applications in related fields. The conference will feature preconference,
tutorials, plenary speeches given by world-renowned scholars, regular
sessions with broad coverage, and special sessions focusing on popular
topics and pre-conference tutorials/workshops to warm up the main event.

*Call for Papers and Special Sessions*
Prospective authors are invited to contribute high-quality papers to ICIST
2023. In addition, proposals for special sessions within the technical
scope of the conference are solicited. Special sessions, to be organized by
internationally recognized experts, aim to bring together researchers on
special focused topics. Papers submitted for special sessions are to be
peer-reviewed with the same criteria used for the contributed papers.
Researchers interested in organizing special sessions are invited to submit
formal proposals to ICIST 2023. A special session proposal should include
the session title, a brief description of the scope and motivation, names,
contact information, and brief biographical information on the organizers.

*Topic Areas*
Topics of contributing papers include, but are not limited to, the
following areas:
*Computer Science and Engineering*
Computer networks, computer vision, pattern recognition, virtual, reality,
parallel and distributed computing, high-performance computing, artificial
intelligence, computer graphics, big data, cloud computing, database
management systems, mobile agent computing, quality of services and
communication protocol, mobile computing for e-commerce, cryptography and
information security, scientific and engineering computing, hybrid
computational methods, data visualization and virtual reality, web- and
grid-based computing and simulation, possibility theory, Bayes network and
hidden Markov models, computational intelligence, granular computing
*Control and Automation*
Autonomous systems, linear and nonlinear control, robust control, learning
and adaptive control, intelligent control, optimization-based and optimal
control, model predictive control, fault detection and identification,
hybrid intelligent systems, neural control, fuzzy logic control, networked
control, industrial automation, process control, robot control, mechatronic
systems, vehicle control systems, intelligent transportation systems,
environmental monitoring and control, intelligent manufacturing systems,
microprocessor-based control, motor control, power control, vehicle
control, aerospace control applications.
*Signal Processing and Telecommunications*
Adaptive filtering & signal processing, audio/speech processing and coding,
compressive sensing and sparse representation, higher-order spectral
analysis, nonlinear & blind signal processing, neural signal processing,
component analysis, array signal processing, parallel and distributed
processing, time series analysis, multimedia signal processing, design and
implementation of signal processing systems, DSP Implementations and
embedded systems, image and multidimensional signal processing, image
processing & understanding, multimedia communications, next-generation
wireless/wireline communications, communication signal processing,
modulation and channel coding, network coding, sensor networks
*Bioinformatics and Biomedical Engineering*
Microarray data analysis, gene regulation, network, and pathway analysis,
identification and classification of genes, protein structure prediction,
next-generation sequencing and metagenomics, protein, DNA/RNA structure,
function, and interactions, functional genomics and proteomics, molecular
evolution and phylogeny, neuroinformatic, brain-computer interface,
clinical engineering, rehabilitation engineering, neural engineering,
biomedical signal analysis and modeling, bio-imaging, sensing, and data
fusion, biomarker discovery, health informatics, healthcare data
acquisition, analysis, and modeling, biomedical data knowledge extraction,
biomedical data integration, modeling, and preprocessing, biological data
mining, knowledge sharing, visualization, and knowledge utilization,
biomedical data mining systems and computing platforms, electronic health
record acquisition, analysis, and decision support, high performance
computing for biomedical data analysis, smart clinical diagnosis and
decision systems

*Paper Submission*
Authors are invited to submit full-length papers (the nominal number of
pages is 10) by the submission deadline through the online submission
system. Special session organizers are also invited to enlist six or more
papers with cohesive topics to form special sessions. The submission of a
paper implies that the paper is original and has not been submitted under
review or is not copyright-protected elsewhere and will be presented by an
author if accepted. All submitted papers will be refereed by experts in the
field based on the criteria of originality, significance, quality, and
clarity. The authors of accepted papers will have an opportunity to revise
their papers and take into consideration of the referees' comments and
suggestions. Accepted papers will be submitted for inclusion into IEEE
Xplore subject to meeting IEEE Xplore's scope and quality requirements.
Selected high-quality papers will be included in several journal special
issues.

*Important Dates*
Special session proposals deadline………………………………………………………………………….July 1, 2023
Paper submission deadline…………………………………………………………………...…………......... August
1, 2023
Notification of acceptance……………………….………………………………………...………………..September 1,
2023
Camera-ready copy and author
registration………………………………………………..………………..…October 1, 2023

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

[DMANET] PhD position at ENS Lyon - Efficient and environment-friendly scheduling and resource management algorithms at the edge

Dear all,

Applications for this PhD position at ENS Lyon must be submitted on the CNRS portal:
https://emploi.cnrs.fr/Offres/Doctorant/UMR5668-MARBOZ-006/Default.aspx?lang=EN

Please note that the new deadline is May 4.

Best regards,
Anne Benoit

> Le 6 mars 2023 à 14:23, Anne Benoit <Anne.Benoit@ens-lyon.fr> a écrit :
>
> Dear all,
>
> A PhD position is available at the LIP laboratory, ENS Lyon, France (http://www.ens-lyon.fr/LIP), in the Roma team (http://www.ens-lyon.fr/LIP/ROMA), on efficient and environment-friendly scheduling and resource management algorithms at the edge. The candidate will have a 3-year fully funded PhD scholarship by CNRS, starting in Fall 2023. This PhD scholarship is within the framework of a CNRS-U.Chicago project with Andrew A. Chien (http://people.cs.uchicago.edu/~aachien/), and will provide opportunities for collaborations with, and visits to, U. Chicago.
>
> Motivation -- Cloud computing has been very successful in providing on-demand computing resources for various compute-intensive applications. However, cloud data-centers have increased in size to become large facilities with a huge environmental overhead and high carbon emissions. While the world is focusing on slowing climate change, computer scientists have been searching for solutions to reduce their impact by optimizing the energy consumption and carbon emissions of the applications.
>
> We are looking for a PhD student to work for three years on a project aiming at optimizing the scheduling of large-scale distributed applications that require a lot of computing resources, with the aim to decrease power usage and carbon emissions. Two main directions are considered to achieve these objectives:
>
> (1) Focus on the locality of computations. Rather than being executed in a large cloud environment, several applications could indeed benefit from a local processing, coordinated across several geographically neighboring devices, from sensors to phones and laptops. The idea is to execute some parts of the application directly on the edge server where they originate from, hence reducing the volume of data transfers and the corresponding energy consumption. The PhD candidate will define a formal model, analyze the problem complexity, and propose algorithmic solutions.
>
> (2) Consider varying power supply. Since the amount and nature of the power supplied to each edge device evolves over time, it may add uncertainties to the execution times depending on the devices. The ambitious goal of the PhD is then to design clever scheduling algorithms that will dynamically account for all of these changes, when deciding on which device to execute each part of the application.
>
> Collaborations -- The student will be mainly located at ENS Lyon, working under the supervision of Anne Benoit (http://bit.ly/abenoit) and Frédéric Vivien (http://perso.ens-lyon.fr/frederic.vivien/). Several long-stay trips at U. Chicago will be organized during the PhD in order to collaborate with Andrew A. Chien (http://people.cs.uchicago.edu/~aachien/).
>
> Prerequisites -- The position requires a Research Master's degree in Computer Science, a solid knowledge on algorithm design and complexity study, programming skills, and excellent writing, communication and presentation skills in English.
>
> How to apply -- Interested applicants must send the following documents, in a single pdf file, to Anne.Benoit@ens-lyon.fr : (a) motivation letter; (b) detailed CV; (c) academic transcripts (bachelor/master); (d) one-page summary of the research work conducted so far, and list of publications (if any); (e) at least two recommendation letters. The application deadline is April 24.
>
> Best regards,
>
> Anne Benoit
> Anne.Benoit@ens-lyon.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] PhD opening in TCS and/or combinatorial optimization in Lund

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Groebner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.

Our most recent new line of research is on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our work on designing a new generation of certifying combinatorial solvers, which output not only a solution but also a machine-verifiable mathematical proof that this solution is correct, has already led to prestigious AAAI '22 distinguished paper and SAT '22 best paper awards, but many more exciting problems are still waiting to be solved!

With this call, we are mainly looking for a mathematically gifted PhD student with excellent programming skills to continue our ground-breaking work on certifying algorithms. There is some flexibility as to what kind of research PhD students in the group pursue, though, and all candidates are welcome, both those who want to go deep into either theory or practice and those who are inspired by the challenge of bridging the gap between the two.

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting date is negotiable, but should ideally be during the autumn of 2023. All positions in the research group are fully funded, employed positions (including travel money) that come with an internationally competitive salary.

The application deadline is June 1. Early applications are welcome, since this will help speed up the recruitment process, but all applications submitted before the deadline will be given equal consideration. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-230601.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.

**********************************************************
*
* 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] IEEE Communications Magazine Call for Papers - Special Issue on Social-aware Communication Networks and Systems and Innovative Social Network Applications and Services

*IEEE Communications Magazine Call for Papers*
*Special Issue on Social-aware Communication Networks and Systems and
Innovative Social Network Applications and Services*

*Call for Papers*
Social network analysis has been an active area of research for several
decades. Ιt has recently though gained a big momentum with the booming
popularity of social media, the proliferation of mobile devices and
advancement of their capabilities and the semantically enriched user
interactions that have exponentially grown, especially during the
long-lasting COVID-19 pandemic. In general, social entities with close
relationships (family, friends), sharing similar interests or belonging
within the same community, tend to interact more often, more regularly and
for longer periods than others, carrying with them an inherent concept of
trust. Representing social interactions using directed or undirected graphs
with nodes and edges carrying weight and different types of information,
researchers have been able to identify users within certain circles of
trust / distrust (friends, friends of friends, distrusted entities, friends
of distrusted entities, etc.), communities of users sharing similar
interests, the most influential users and information / influence flows,
and to develop recommender system for users and content. The social
dimension, however, cannot be separated from the spatial one: physical
proximity affects relations between users, making social ties establishment
more likely to succeed. Thus, online social networks and offline social
interactions (mostly following users' mobility patterns) in the physical
world can play a crucial role in a multitude of areas.

As a result of the aforementioned considerations, social networks have
attracted interest from researchers across multiple disciplines and for a
wide range of challenges. Without being exhaustive: developing social-aware
networking algorithms for improving various networking operations (most
notably routing and information forwarding, resource allocation, content
placement/caching/sharing etc.), identifying graph topology structure as
well as its evolution, along with information / influence paths for
maximizing the impact of information dissemination (with advertisements for
new products and services in marketing being a direct application area) and
exploring decision making process in a social psychology context (with the
Internet of Behaviors forming a new concept to be explored), designing
incentive mechanisms for promoting cooperation and establishing trust in
order to address security concerns (mostly concerning open, uncertain,
highly dynamic and potentially competitive environments, such as Internet
of Things). These challenges have often been addressed with the help of
emerging informatics and communication technologies such as artificial
intelligence (AI), big data analysis, and blockchain.

The aim of this Feature Topic (FT) is to attract original works discussing
the state-of-the-art and setting future directions in the area of
social-aware networks and advanced applications in the following topical
areas.

Prospective authors are invited to submit articles on topics including, but
not limited to:

- Graph modeling, learning/prediction, social network evolution with
application in social-aware networks / systems and advanced applications;
simulations, experiments
- Recommender systems, community detection with application in
social-aware networks / systems and advanced applications
- Influence, trust, information propagation & evolution with application
in social-aware networks / systems and advanced applications
- Detection and mitigation of echo chambers, polarization,
radicalization and other societal challenges exacerbated by social media
platforms with application in social-aware networks / systems and advanced
applications
- Platforms, algorithms, systems and techniques integrating
AI/blockchain/big data with social networking
- Social-aware traffic management
- Social-aware network infrastructure
- Social-by-engineering design in 6G
- Social-aware networking algorithms, techniques and social-aware
communication systems
- Internet of Things (IoT), Social-IoT, Internet of Behavior (IoB),
Social Cyber-Physical Systems, Internet of People
- Social sensing
- Location-based social networks, user activity modeling and
exploitation, mobility and behavior data mining
- Advanced Innovative social network related applications and services
- Multidisciplinary and interdisciplinary research on social networks
for social-aware networking and advanced applications

*Submission Guidelines*
Manuscripts should conform to the standard format as indicated in the
Information for Authors section of the Manuscript Submission Guidelines
<https://www.comsoc.org/publications/magazines/ieee-communications-magazine/author-guidelines/manuscript-submission>.
Please, check these guidelines carefully before submitting since
submissions not complying with them will be administratively rejected
without review.

All manuscripts to be considered for publication must be submitted by the
deadline through Author Portal
<https://ieee.atyponrex.com/journal/COMMAG-IEEE>. Select the "FT-2227 /
Social-aware communication networks and systems" topic from the drop-down
menu of Topic/Series titles. Please observe the dates specified here below
noting that there will be no extension of submission deadline.

*Important Dates*
Manuscript Submission Deadline: 30 April 2023
Decision Notification: 30 July 2023
Final Manuscript: 30 September 2023
Publication: Fourth Quarter 2023

**********************************************************
*
* 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] LICS 2023 Workshop on Combinatorial Games in Finite Model Theory

LICS 2023 Workshop on Combinatorial Games in Finite Model Theory
June 24-25, 2023, Boston, USA
https://gamesandfmt.org/workshop2023/<https://gamesandfmt.org/workshop2023/>

Updated Call for Contributions and Participation

The goal of this workshop is to promote work at the interface of complexity and logic. The workshop has two main foci: the first is recent progress in using combinatorial games to prove logical (in)expressiblity results, the second is limitations in the method of combinatorial games as a tool for establishing lower bounds in computational complexity.

Invited Speakers:

Yijia Chen (Shanghai Jiao Tong University)

Erich Grädel (RWTH Aachen)

Neil Immerman (University of Massachusetts Amherst)

Antonina Kolokolova (Memorial University of Newfoundland)

Submission Guidelines:

Those wishing to speak at the workshop on any topic related to combinatorial games in finite model theory are invited to submit an Extended Abstract of up to three pages (including references) describing the content of the contributed presentation. At least one author from each accepted abstract must register for the workshop. Presenters at the workshop are expected to be in person. For additional information, please visit the workshop webpage https://gamesandfmt.org/workshop2023/<https://gamesandfmt.org/workshop2023/>
Important Dates (Updated):
Abstract Submission: May 5, 2023
Author Notification: May 11, 2023
Early Registration Deadline: May 12, 2023
Regular Registration Deadline: June 9, 2023
Participation:
Participation in person is strongly encouraged. However, the LICS 2023 conference also offers a basic virtual attendance option for all the workshops and the main conference (video broadcasting + chat for questions) for people that are not presenting and who will not be able to attend in person. For details, see the main LICS Registration Page<https://lics.siglog.org/lics23/registration.php>.
Organizing and Program Committee:
Marco Carmosino (IBM Research), Ronald Fagin (IBM Research), Phokion Kolaitis (UC Santa Cruz and IBM Research), Jonathan Lenchner (IBM Research), Ryan Williams (MIT)

***

Jonathan Lenchner
https://researcher.watson.ibm.com/researcher/view.php?person=us-lenchner

**********************************************************
*
* 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 in Combinatorial Optimisation (TU Delft, Netherlands)

We have a PhD vacancy on combinatorial optimisation at TU Delft (Netherlands), in particular scheduling and constraint programming. We are looking for a motivated individual with a strong algorithmic and programming background. The candidate will join the team of Dr Emir Demirović (TU Delft), consisting of four PhD students working in the area of combinatorial optimisation.

Deadline for applying is May 5. Please see the official ad for more details and application procedure: https://www.academictransfer.com/en/325825/phd-position-in-combinatorial-optimisation/

Best,
Emir

--

Dr Emir Demirović

Assistant Professor

Delft AI XAIT Lab Co-Director<https://www.tudelft.nl/en/ai/xait-lab?languageSelect=UK&searchCriteria[0][key]=keywords&searchCriteria[0][values][]=XAITLab&searchCriteria[1][key]=Resultsperpage&searchCriteria[1][values][]=50>

Algorithmics group<https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/>, TU Delft

emirdemirovic.com<http://www.emirdemirovic.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] IEEE DASC 2023: The 21st IEEE International Conference on Dependable, Autonomic & Secure Computing

*The 21st IEEE International Conference on Dependable, Autonomic & Secure
Computing (DASC 2023)*

*https://icnetlab.org/cyber-science2023/dasc/index.html*

*Joint conference IEEE DASC/PICom/CBDCom/CyberSciTech 2023*

*13-17 Nov, 2023** || Abu Dhabi, UAE*

As computer and communication systems as well as other systems such as
Cyber-Physical Systems (CPS), Internet of Things (IoT), Autonomous Robotic
Systems become increasingly large and complex, their Dependability and
Security play critical role at supporting next-generation science,
engineering, and commercial applications. It remains a challenge to design,
analyze, evaluate, and improve the dependability and security for a trusted
computing environment. Trusted computing targets computing systems as well
as services that are dependable, secure, protectable, predictable,
traceable, controllable, autonomous, and sustainable.

At the same time, the increasing scale and complexity of systems call for
the autonomic computing paradigm, which meets the requirements of
self-management, and autonomous systems. Trusted and autonomic
computing/autonomous systems need synergistic research efforts covering
many disciplines, ranging from natural sciences to social sciences. It
requires scientific and technological advances in a wide variety of fields,
as well as new software, architectures, and communication technology that
support the integration of the constituent technologies.

IEEE DASC 2023 will be held during November 13-17, 2023, in Abu Dhabi, UAE.
It aims to bring together computer scientists, industrial engineers, and
researchers to discuss and exchange theoretical and implementation results,
novel designs, work-in-progress, experience, case studies, and
trend-setting ideas in the areas of dependability, security, trust and/or
autonomic computing, and autonomous systems.

*Tracks*

*Track 1. Dependable and Fault-tolerant Computing*

*Track 2. Network and System Security and Privacy*

*Track 3. Autonomic Computing and Autonomous Systems*

*Track 4. Industrial Applications and Emerging Techniques*

* Submission Link*:
https://easychair.org/conferences/?conf=dascpicomcbdcomcyber0

*Important dates*

*Main Conference Papers*
Paper Submission Due: 1 July, 2023
Authors Notification: 15 September, 2023
Camera-ready Submission: 30 September, 2023

*General Chair*

Moayad Aloqaily, MBZUAI, UAE

*Program Co-Chairs*

Franco Zambonelli, Universita' degli Studi di Modena e Reggio Emilia, Italy
Selcuk Uluagac, Florida International University, USA

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