
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
We give lower bounds on the communication complexity of graph problems i...
read it

Sharp Thresholds in Random Simple Temporal Graphs
A graph whose edges only appear at certain points in time is called a te...
read it

Succinct Permutation Graphs
We present a succinct, i.e., asymptotically spaceoptimal, data structur...
read it

Matching in Stochastically Evolving Graphs
This paper studies the maximum cardinality matching problem in stochasti...
read it

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
In this paper we consider the following total functional problem: Given ...
read it

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...
read it

Linear Programming complementation and its application to fractional graph theory
In this paper, we introduce a new kind of duality for Linear Programming...
read it

Computing Maximum Matchings in Temporal Graphs
We study the computational complexity of finding maximumcardinality tem...
read it

How fast can we reach a target vertex in stochastic temporal graphs?
Temporal graphs are used to abstractly model reallife networks that are...
read it

Sliding Window Temporal Graph Coloring
Graph coloring is one of the most famous computational problems with app...
read it

Linear readonce and related Boolean functions
It is known that a positive Boolean function f depending on n variables ...
read it

Deleting edges to restrict the size of an epidemic in temporal networks
A variety of potentially diseasespreading contact networks can be natur...
read it

Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
We give deterministic distributed (1+ϵ)approximation algorithms for Min...
read it

Letter graphs and geometric grid classes of permutations: characterization and recognition
In this paper, we reveal an intriguing relationship between two seemingl...
read it

Temporal Vertex Cover with a Sliding Time Window
Modern, inherently dynamic systems are usually characterized by a networ...
read it
Viktor Zamaraev
is this you? claim profile