Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2016

2016

We study a single-commodity robust network design problem (sRND) defined on an undirected graph. Our goal is to determine minimum… Expand

2014

2014

Canonical orderings [STOC’88, FOCS’92] have been used as a key tool in graph drawing, graph encoding and visibility… Expand

2012

2012

Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension… Expand

Highly Cited

2009

Highly Cited

2009

In continuation of previous work, we analyze the properties of spectral minimal partitions and focus in this paper our analysis… Expand

2009

2009

The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis… Expand

2007

2007

A 3-uniform hypergraph (3-graph) is said to be tight, if for any 3-partition of its vertex set there is a transversal triple. We… Expand

2006

2006

We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times… Expand

Highly Cited

2001

Highly Cited

2001

Thresholding is a commonly used technique in image segmentation. Selecting the correct thresholds is a critical issue. In this… Expand

1994

1994

Let G = (U, V, E) be an undirected bipartite graph. We specify some procedures that allow us to make efficiently the following 3… Expand

Highly Cited

1985

Highly Cited

1985

For any positive integer s, an s-partition of a graph G = (V, E) is a partition of E into E1 ∪ E2 ∪… ∪ Ek, where ∣Ei∣ = s for 1… Expand