LHLászló Hajdu

László Hajdu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


László Hajdu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Data-Driven Approach for the Analysis of Ridership Fluctuations in Transit Systems

    by Jovan Pavlović, Miklós Krész, László Hajdu, András Bóta

    This study focuses on identifying critical components within urban public transportation networks, particularly in the context of fluc-tuating demand and potential pandemic scenarios. By employing advanced agent-based simulations, we analyzed passenger interac-tions and ridership patterns across the San Francisco Bay Area’s transit system. Key findings reveal specific transit stops and routes that are highly sensitive to changes in demand, often serving as bottlenecks or high-risk areas for the spread of infectious diseases.

  • Network based data oriented methods for application driven problems

    by László Hajdu

    Networks are amazing. If you think about it, some of them can be found in almost every single aspect of our life from sociological, financial and biological processes to the human body. Even considering entities that are not necessarily connected to each other in a natural sense, can be connected based on real life properties, creating a whole new aspect to express knowledge. A network as a structure implies not only interesting and complex mathematical questions, but the possibility to extract hidden and additional information from real life data. The data that is one of the most valuable resources of this century. The different activities of the society and the underlying processes produces a huge amount of data, which can be available for us due to the technological knowledge and tools we have nowadays. Nevertheless, the data without the contained knowledge does not represent value, thus the main focus in the last decade is to generate or extract information and knowledge from the data. Consequently, data analytics and science, as well as data-driven methodologies have become leading research fields both in scientific and industrial areas. In this dissertation, the author introduces efficient algorithms to solve application oriented optimization and data analysis tasks built on network science based models. The main idea is to connect these problems along graph based approaches, from virus modelling on an existing system through understanding the spreading mechanism of an infection/influence and maximize or minimize the effect, to financial applications, such as fraud detection or cost optimization in a case of employee rostering.

  • Open Access

    Privacy-Aware and Secure Decentralized Air Quality Monitoring

    by Michael Mrissa, Aleksandar Tošić, Niki Hrovatin, Sidra Aslam, Balázs Dávid, László Hajdu, Miklós Krész, Andrej Brodnik, Branko Kavšek

    Indoor Air Quality monitoring is a major asset to improving quality of life and building management. Today, the evolution of embedded technologies allows the implementation of such monitoring on the edge of the network. However, several concerns need to be addressed related to data security and privacy, routing and sink placement optimization, protection from external monitoring, and distributed data mining. In this paper, we describe an integrated framework that features distributed storage, blockchain-based Role-based Access Control, onion routing, routing and sink placement optimization, and distributed data mining to answer these concerns. We describe the organization of our contribution and show its relevance with simulations and experiments over a set of use cases.


  • Open Access

    Evaluating the role of community detection in improving influence maximization heuristics

    by László Hajdu, Miklós Krész, András Bóta

    Both community detection and influence maximization are well-researched fields of network science. Here, we investigate how several popular community detection algorithms can be used as part of a heuristic approach to influence maximization. The heuristic is based on the community value, a node-based metric defined on the outputs of overlapping community detection algorithms. This metric is used to select nodes as high influence candidates for expanding the set of influential nodes. Our aim in this paper is twofold. First, we evaluate the performance of eight frequently used overlapping community detection algorithms on this specific task to show how much improvement can be gained compared to the originally proposed method of Kempe et al. Second, selecting the community detection algorithm(s) with the best performance, we propose a variant of the influence maximization heuristic with significantly reduced runtime, at the cost of slightly reduced quality of the output. We use both artificial benchmarks and real-life networks to evaluate the performance of our approach.


  • Open Access

    Improving Mental Wellbeing in Organizations with Targeted Psychosocial Interventions

    by Dean Lipovac, László Hajdu, Sølvi Wie, Anders Q. Nyrud

    Background: Mental wellbeing of employees is crucial for successful organizations. Psychosocial interventions that target highly contagious individuals (i.e., individuals that can ‘transmit’ their wellbeing to others) could efficiently improve overall wellbeing in the workplace. Objectives: Using the magnitudes of effects observed in existing studies on psychosocial interventions and the contagion of mental wellbeing, we aimed to examine how the wellbeing of a group (based on WHO-5 Well-Being Index scores) changes if interventions are provided to highly contagious people instead of randomly selected individuals. Methods/Approach: Based on the data on mental wellbeing of 414 nursing home employees, we created a social network that includes individual levels of wellbeing and the strength of the connection between people. Simulation-based influence-maximization was used on the network and interventions were interventions were provided to either contagious or randomly selected individuals. Results: Overall, mental wellbeing of the group increased slightly more when individuals had received a simulated psychosocial intervention in order of contagiousness compared to the cases in which interventions were provided to randomly selected individuals. Conclusions: Selectively targeting highly contagious individuals could be an efficient approach to improving wellbeing in organizations, especially in social contexts, where the contagion of mental wellbeing is likelier.


  • Graph Coloring based Heuristic for Crew Rostering

    by László Hajdu, Attila Tóth, Miklós Krész

    In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.


  • Open Access

    Discovering the Hidden Community Structure of Public Transportation Networks

    by László Hajdu, András Bóta, Miklós Krész, Alireza Khani, Lauren M. Gardner


  • Open Access

    Discovering the hidden community structure of public transportation networks

    by Laszlo Hajdu, Andras Bota, Miklos Kresz, Alireza Khani, Lauren M. Gardner

    Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form of networks. In this paper we utilize known contact patterns from a public transit assignment model in a major metropolitan city, and propose the development of two novel network structures, each of which elucidate certain aspects of passenger travel behavior. We first propose the development of a transfer network, which can reveal passenger groups that travel together on a given day. Second, we propose the development of a community network, which is derived from the transfer network, and captures the similarity of travel patterns among passengers. We then explore the application of each of these network structures to identify the most frequently used travel paths, i.e., routes and transfers, in the public transit system, and model epidemic spreading risk among passengers of a public transit network, respectively. In the latter our conclusions reinforce previous observations, that routes crossing or connecting to the city center in the morning and afternoon peak hours are the most "dangerous" during an outbreak.