Searching for authors named Pinar Heggernes – sorted by Relevance.
-
Finding Minimum Height Elimination Trees For Interval Graphs In Polynomial Time
- TIME BENGT ASPVALL AND PINAR HEGGERNES y Department of Informatics, University of Bergen N--5020
- Cited by 11 (1 self) – Add To MetaCart
-
Optimal broadcast domination in polynomial time
- Optimal broadcast domination in polynomial time ∗ Pinar Heggernes † Daniel Lokshtanov † Abstract
- Cited by 1 (0 self) – Add To MetaCart
-
Combining visual layout and lexical cohesion features for text segmentation
- Optimal broadcast domination of arbitrary graphs in polynomial time ⋆ Pinar Heggernes and Daniel
- Cited by 2 (2 self) – Add To MetaCart
-
Minimal split completions of graphs
- REPORTS IN INFORMATICS ISSN 0333-3590 Minimal split completions of graphs Pinar Heggernes Federico
- Cited by 9 (8 self) – Add To MetaCart
-
Dynamically maintaining split graphs \Lambda
- Dynamically maintaining split graphs \Lambda Pinar Heggernes y Federico Mancini y August 9
- Add To MetaCart
-
Minimal
- Minimal split completions ∗ Pinar Heggernes † Federico Mancini † Abstract We study the problem
- Add To MetaCart
-
Finding Good Column Orderings for Sparse QR Factorization
- Finding Good Column Orderings for Sparse QR Factorization Pinar Heggernes University of Bergen
- Cited by 11 (0 self) – Add To MetaCart
-
unknown title
- Minimal split completions* Pinar Heggernes# Federico Mancini# Abstract We study the problem
- Add To MetaCart
-
The Minimum Degree Heuristic and the Minimal
- The Minimum Degree Heuristic and the Minimal Triangulation Process Anne Berry Pinar Heggernes
- Add To MetaCart
-
An on-Line Incremental Approach for Dynamically Maintaining Chordal Graphs
- An on-line incremental approach for dynamically maintaining chordal graphs Anne Berry 1 Pinar
- Add To MetaCart

