University of Haifa

output

20022015

most citedAlgorithms for the Split Variational Inequality Problem

616 citations

Showing 2012 · math.COShow all

3 papers · 2 filters

math.CO2012★ 4 cited

New approach to the $k$ -independence number of a graph

Yair Caro, Adriana Hansberg

Let $G = (V, E)$ be a graph and $k \geq 0$ an integer. A $k$ -independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most…

math.CO2012★ 2 cited

Some enumerative results related to ascent sequences

Toufik Mansour, Mark Shattuck

An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences…

math.CO2012★ 4 cited

Partitions of graphs into small and large sets

Asen Bojilov, Yair Caro, Adriana Hansberg +1

Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V (G)$ \emph{ $k$ -small} if, for every vertex $v \in A$ , $° (v) \leq n - ∣ A ∣ + k$ . A subset $B \subseteq V(G…

New approach to the k-independence number of a graph

Some enumerative results related to ascent sequences

Partitions of graphs into small and large sets

New approach to the $k$ -independence number of a graph