We show that for any natural number s, there is a constant γ and a
subgr...
We prove a characterization of the structural conditions on matrices of
...
How to efficiently represent a graph in computer memory is a fundamental...
The domatic number of a graph is the maximum number of vertex disjoint
d...
Functionality is a graph complexity measure that extends a variety of
pa...
Use of graphs to represent molecular crystals has become popular in rece...
For any hereditary graph class ℱ, we construct optimal adjacency
labelin...
A temporal graph is a graph whose edges appear only at certain points in...
For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …,
n}, and ...
The most basic lower-bound question in randomized communication complexi...
We give lower bounds on the communication complexity of graph problems i...
A graph whose edges only appear at certain points in time is called a
te...
We present a succinct, i.e., asymptotically space-optimal, data structur...
This paper studies the maximum cardinality matching problem in stochasti...
In this paper we consider the following total functional problem: Given ...
Let vc(G), fvs(G) and oct(G), respectively, denote the size of a
minimum...
In this paper, we introduce a new kind of duality for Linear Programming...
We study the computational complexity of finding maximum-cardinality tem...
Temporal graphs are used to abstractly model real-life networks that are...
Graph coloring is one of the most famous computational problems with
app...
It is known that a positive Boolean function f depending on n variables ...
A variety of potentially disease-spreading contact networks can be natur...
We give deterministic distributed (1+ϵ)-approximation algorithms for
Min...
In this paper, we reveal an intriguing relationship between two seemingl...
Modern, inherently dynamic systems are usually characterized by a networ...