4 citations · 6 across the 8 of their papers we have counts for
11 papers
Domination and Coverage Problems under Vulnerability Constraints
Ioannis Sigalas, Nikolaos Lazaropoulos, Ioannis Lamprou +2
In various domination and coverage problems, certain vertices or edges should not be dominated/covered and are designated as vulnerable. Motivated by this, we define the -Vertex…
LVSA: Training-Free Sparse Attention for Long Video Diffusion
Gael Glorian, Ioannis Lamprou, Zhen Zhang +2
Dense self-attention is the compute and quality bottleneck of long-video diffusion inference: cost grows quadratically with the sequence length, and beyond the training horizon the…
White-Basilisk: A Hybrid Model for Code Vulnerability Detection
Ioannis Lamprou, Alexander Shevtsov, Ioannis Arapakis +1
The proliferation of software vulnerabilities presents a significant challenge to cybersecurity, necessitating more effective detection methodologies. We introduce White-Basilisk,…
Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis +1
In , given a graph , we seek a minimum-size set of nodes , such that every node in has at least one neighbor in . We define…
Russo-Ukrainian War: Prediction and explanation of Twitter suspension
Alexander Shevtsov, Despoina Antonakaki, Ioannis Lamprou +3
On 24 February 2022, Russia invaded Ukraine, starting what is now known as the Russo-Ukrainian War, initiating an online discourse on social media. Twitter as one of the most popul…
BotArtist: Generic approach for bot detection in Twitter via semi-automatic machine learning pipeline
Alexander Shevtsov, Despoina Antonakaki, Ioannis Lamprou +2
Twitter, as one of the most popular social networks, provides a platform for communication and online discourse. Unfortunately, it has also become a target for bots and fake accoun…
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos
We consider the \emph{Budgeted} version of the classical \emph{Connected Dominating Set} problem (BCDS). Given a graph and a budget , we seek a connected subset of at most $…
Maximum Rooted Connected Expansion
Ioannis Lamprou, Russell Martin, Sven Schewe +2
Prefetching constitutes a valuable tool toward efficient Web surfing. As a result, estimating the amount of resources that need to be preloaded during a surfer's browsing becomes a…
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Ioannis Lamprou, Russell Martin, Paul Spirakis
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying gener…
Perpetually Dominating Large Grids
Ioannis Lamprou, Russell Martin, Sven Schewe
In the m-\emph{Eternal Domination} game, a team of guard tokens initially occupies a dominating set on a graph . An attacker then picks a vertex without a guard on it and attack…
Fast Two-Robot Disk Evacuation with Wireless Communication
Ioannis Lamprou, Russell Martin, Sven Schewe
In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially pla…