How fast can we reach a target vertex in stochastic temporal graphs?

Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3

Combinatorics and algorithms for augmenting graphs

Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin +1

Sliding Window Temporal Graph Coloring

George B. Mertzios, Hendrik Molter, Viktor Zamaraev

Clique-Width for Graph Classes Closed under Complementation

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +3

Upper Domination: towards a dichotomy through boundary properties

Hassan AbouEisha, Shahid Hussain, Vadim Lozin +3

The structure and the number of $P_7$-free bipartite graphs

Vadim Lozin, Viktor Zamaraev

Temporal Vertex Cover with a Sliding Time Window

Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis +1

The paper studies two temporal extensions of the classic Vertex Cover problem, focusing on covering edges over time and within sliding windows, and analyzes their computational har…

Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

Christian Konrad, Viktor Zamaraev

More results on weighted independent domination

Vadim Lozin, Dmitriy Malyshev, Raffaele Mosca +1

Letter graphs and geometric grid classes of permutations: characterization and recognition

Bogdan Alecu, Vadim Lozin, Dominique de Werra +1

Specifying a positive threshold function via extremal points

Vadim Lozin, Igor Razgon, Viktor Zamaraev +2

Linear read-once and related Boolean functions

Vadim Lozin, Igor Razgon, Viktor Zamaraev +2

On forbidden induced subgraphs for unit disk graphs

Aistis Atminas, Viktor Zamaraev

Well-quasi-ordering does not imply bounded clique-width

Vadim Lozin, Igor Razgon, Viktor Zamaraev