Pinar Heggernes
Pinar Heggernes
Professor of computer science, University of Bergen
Verified email at ii.uib.no - Homepage
Title
Cited by
Cited by
Year
Minimal triangulations of graphs: A survey
P Heggernes
Discrete Mathematics 306 (3), 297-317, 2006
1792006
Maximum cardinality search for computing minimal triangulations of graphs
A Berry, JRS Blair, P Heggernes, BW Peyton
Algorithmica 39 (4), 287-298, 2004
1262004
Partitioning graphs into generalized dominating sets
P Heggernes, JA Telle
Nord. J. Comput. 5 (2), 128-142, 1998
1091998
The computational complexity of the minimum degree algorithm
P Heggernes, SC Eisestat, G Kumfert, A Pothen
INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA, 2001
822001
Finding k disjoint triangles in an arbitrary graph
M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle
International Workshop on Graph-Theoretic Concepts in Computer Science, 235-244, 2004
812004
A practical algorithm for making filled graphs minimal
JRS Blair, P Heggernes, JA Telle
Theoretical Computer Science 250 (1-2), 125-141, 2001
792001
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
782006
Linear-time certifying recognition algorithms and forbidden induced subgraphs.
P Heggernes, D Kratsch
Nord. J. Comput. 14 (1-2), 87-108, 2007
712007
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
622005
Interval completion is fixed parameter tractable
Y Villanger, P Heggernes, C Paul, JA Telle
SIAM Journal on Computing 38 (5), 2007-2020, 2009
592009
The minimum degree heuristic and the minimal triangulation process
A Berry, P Heggernes, G Simonet
International Workshop on Graph-Theoretic Concepts in Computer Science, 58-70, 2003
592003
Recognizing weakly triangulated graphs by edge separability
A Berry, JP Bordat, P Heggernes
Scandinavian Workshop on Algorithm Theory, 139-149, 2000
592000
Optimal broadcast domination in polynomial time
P Heggernes, D Lokshtanov
Discrete mathematics 306 (24), 3267-3280, 2006
552006
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
532013
Finding good column orderings for sparse QR factorization
P Heggernes, P Matstoms
Department of Mathematics, Linköping University, 1996
521996
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
502000
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
482011
Interval completion with few edges
P Heggernes, C Paul, JA Telle, Y Villanger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
452007
A vertex incremental approach for maintaining chordality
A Berry, P Heggernes, Y Villanger
Discrete Mathematics 306 (3), 318-336, 2006
452006
Contracting graphs to paths and trees
P Heggernes, P Van’t Hof, B Lévêque, D Lokshtanov, C Paul
Algorithmica 68 (1), 109-132, 2014
442014
The system can't perform the operation now. Try again later.
Articles 1–20