11 citations · 15 across the 14 of their papers we have counts for
4 papers · 1 filter
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani +2
Let , and , respectively, denote the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph . One can a…
Graph classes with linear Ramsey numbers
Bogdan Alecu, Aistis Atminas, Vadim Lozin +1
The Ramsey number for a class of graphs is the minimum such that every graph in with at least vertices has either a clique of size or an independent…
Computing Maximum Matchings in Temporal Graphs
George B. Mertzios, Hendrik Molter, Rolf Niedermeier +2
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph , a temporal graph is represented by assigning a set of integ…
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3
Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph , a temporal graph on is a seque…