Pinar Heggernes
Pinar Heggernes
Professor of computer science, University of Bergen
Verified email at - Homepage
Cited by
Cited by
Minimal triangulations of graphs: A survey
P Heggernes
Discrete Mathematics 306 (3), 297-317, 2006
Maximum cardinality search for computing minimal triangulations of graphs
A Berry, JRS Blair, P Heggernes, BW Peyton
Algorithmica 39, 287-298, 2004
Partitioning graphs into generalized dominating sets
P Heggernes, JA Telle
Nord. J. Comput. 5 (2), 128-142, 1998
Linear-time certifying recognition algorithms and forbidden induced subgraphs.
P Heggernes, D Kratsch
Nord. J. Comput. 14 (1-2), 87-108, 2007
The computational complexity of the minimum degree algorithm
P Heggernes, SC Eisenstat, G Kumfert, A Pothen
Lawrence Livermore National Lab.(LLNL), Livermore, CA (United States), 2002
A wide-range algorithm for minimal triangulation from an arbitrary ordering
A Berry, JP Bordat, P Heggernes, G Simonet, Y Villanger
Journal of Algorithms 58 (1), 33-66, 2006
A practical algorithm for making filled graphs minimal
JRS Blair, P Heggernes, JA Telle
Theoretical Computer Science 250 (1-2), 125-141, 2001
Finding k Disjoint Triangles in an Arbitrary Graph
M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle
Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005
Optimal broadcast domination in polynomial time
P Heggernes, D Lokshtanov
Discrete Mathematics 306 (24), 3267-3280, 2006
The minimum degree heuristic and the minimal triangulation process
A Berry, P Heggernes, G Simonet
Graph-Theoretic Concepts in Computer Science: 29th International Workshop …, 2003
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
JF Couturier, P Heggernes, P Van’t Hof, D Kratsch
Theoretical Computer Science 487, 82-94, 2013
Interval completion is fixed parameter tractable
Y Villanger, P Heggernes, C Paul, JA Telle
SIAM Journal on Computing 38 (5), 2007-2020, 2009
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
P Heggernes, JA Telle, Y Villanger
SIAM Journal on Discrete Mathematics 19 (4), 900-913, 2005
Recognizing weakly triangulated graphs by edge separability
A Berry, JP Bordat, P Heggernes
Scandinavian Workshop on Algorithm Theory, 139-149, 2000
Methods for large scale total least squares problems
Å Björck, P Heggernes, P Matstoms
SIAM journal on matrix analysis and applications 22 (2), 413-429, 2000
Finding good column orderings for sparse QR factorization
P Heggernes, P Matstoms
Department of Mathematics, Linköping University, 1996
Obtaining a bipartite graph by contracting few edges
P Heggernes, P van't Hof, D Lokshtanov, C Paul
Foundations of Software Technology and Theoretical Computer Science, 2011
Contracting graphs to paths and trees
P Heggernes, P Van’t Hof, B Lévêque, D Lokshtanov, C Paul
Algorithmica 68, 109-132, 2014
Parameterized complexity of vertex deletion into perfect graph classes
P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger
Theoretical Computer Science 511, 172-180, 2013
Finding minimum height elimination trees for interval graphs in polynomial time
B Aspvall, P Heggernes
BIT Numerical Mathematics 34 (4), 484-509, 1994
The system can't perform the operation now. Try again later.
Articles 1–20