Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Given a squarefree monomial ideal $$I \subseteq R =k[x_1,\ldots ,x_n]$$I⊆R=k[x1,…,xn], we show that $$\widehat{\alpha }(I)$$α^(I… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local… Expand

Is this relevant?

2009

2009

Let @g"f denote the fractional chromatic number and @r the Hall ratio, and let the lexicographic product of G and H be denoted… Expand

Is this relevant?

2007

2007

We compute the exact fractional chromatic number for several classes of monotone self-dual Boolean functions. We characterize… Expand

Is this relevant?

2004

2004

We study the problem of scheduling independent multiprocessor tasks, where for each task in addition to the processing time(s… Expand

Is this relevant?

2003

2003

In this paper we show that approximation algorithms for the weighted independent set and s-dimensional knapsack problem with… Expand

Is this relevant?

1999

1999

We give a simple polynomial time algorithm to compute the chromatic index of graphs which can be made bipartite by deleting a… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum… Expand

Is this relevant?

1995

1995

The m-chromatic number χm(G) of a graph G is the fewest colors needed so each node has m colors and no color appears on adjacent… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering… Expand

Is this relevant?