At least one author of each accepted paper must be registered by the author registration deadline in order for that contribution to appear in the proceedings and to be scheduled for presentation.

Registration deadline: October 15, 2026

At least one author of each Extended Abstract must be registered by the author registration deadlinein order for that contribution to appear in the book of abstract and to be scheduled for presentation.

Submissio Registration deadline: October 15, 2026

The Extra Paper registration rate applies only once per full registration.
Authors with 3 accepted submissions must register twice
1 registration for one submission and one extra submission
1 registration for the third submission

Extra abstract registration rate is applicable only once for each full registration. Authors with 3 accepted submissions must register two times
1 registration for one submission and one extra submission
1 registration for the third submission

Extra Page Fee (max 2 pages over the 12 pages limit)

Other Author of a contribution or attendee with no contribution.

Student fee is for non-author attendees. It is not available for authors of papers and abstract

Abstract
Are social networks fair playgrounds? What are the roles of structural features like homophily, group size imbalance, and degree of connectivity on access to information, visibility, and ranking systems? This tutorial addresses these questions and more. Drawing on network science, computational social science, and fairness research, we cover core concepts such as network mechanisms shaping inequalities, metrics for measuring representation and visibility of minorities, and methods for auditing bias in ranking and recommender algorithms built on network data. We discuss generative network models that reproduce real-world inequalities and learn practical approaches for evaluating fairness in empirical and synthetic networks.

Abstract
Human social interactions or contacts usually occur at specific times rather than continuously. They can be represented as temporal networks or as temporal hypergraphs when an interaction involves a group of individuals. Such networks facilitate the spread of information, opinions and epidemics. In this talk, we study these spreading processes on temporal networks and temporal hypergraphs. We address problems regarding influence estimation, spreading trajectories, and network robustness with the objective of identifying the relation between a node’s or link’s properties in the network and its role in the dynamic process. Specifically, how can we utilize the partially observed temporal network around each node to estimate the ranking of nodes by spreading influence? The average number of nodes infected over a given period starting from a single seed node is called the influence of that node. Which types of hyperlinks contribute more to a spreading process, i.e., lead to more nodes being infected directly via their activation? Which types of links, when removed, most strongly degrade the efficiency of information transport? To this end, we introduce theoretically grounded centrality metrics specially designed for addressing these problems.

Refer to the website for content

One Dinner Banquet ticket is included in the registration. Extra tickets are requested for guests.