#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1992

2019

- This year (7)
- Last 5 years (56)
- Last 10 years (129)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
- Algorithmica
- 2004

Abstract
We present a new algorithm,
called MCS-M,
for computing minimal triangulations of graphs.
Lex-BFS, a seminal algorithm for recognizing chordal graphs,
was the genesis for two other… (More)

- Anne Berry, Jean Paul Bordat, Pinar Heggernes
- SWAT
- 2000

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical… (More)

- Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
- J. Algorithms
- 2006

We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm) time implementation and a more involved O(nm) time implementation, thus… (More)

- Pinar Heggernes
- Discrete Mathematics
- 2006

Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal triangulations, which… (More)

- Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
- Theor. Comput. Sci.
- 2001

For an arbitrary lled graph G + of a given original graph G, we consider the problem of removing ll edges from G + in order to obtain a graph M that is both a minimal lled graph of G and a subgraph… (More)

The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every… (More)

- Åke Björck, Pinar Heggernes, P. Matstoms
- SIAM J. Matrix Analysis Applications
- 2000

For solving the total least squares problems, min E;f k(E; f)k F subject to (A+E)x = b+f, where A is large and sparse or structured Bjj orck suggested a method based on Rayleigh quotient iteration.… (More)

We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We… (More)

- Pinar Heggernes, Daniel Meister, Charis Papadopoulos
- Theor. Comput. Sci.
- 2011