Pinar Heggernes
Pinar Heggernes
Professor of computer science, University of Bergen
E-mail confirmado em ii.uib.no - Página inicial
TítuloCitado porAno
Minimal triangulations of graphs: A survey
P Heggernes
Discrete Mathematics 306 (3), 297-317, 2006
1662006
Maximum cardinality search for computing minimal triangulations of graphs
A Berry, JRS Blair, P Heggernes, BW Peyton
Algorithmica 39 (4), 287-298, 2004
1152004
Partitioning graphs into generalized dominating sets
P Heggernes, JA Telle
Nord. J. Comput. 5 (2), 128-142, 1998
1041998
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
792004
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
782001
A practical algorithm for making filled graphs minimal
JRS Blair, P Heggernes, JA Telle
Theoretical Computer Science 250 (1-2), 125-141, 2001
772001
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
752006
Linear-time certifying recognition algorithms and forbidden induced subgraphs.
P Heggernes, D Kratsch
Nord. J. Comput. 14 (1-2), 87-108, 2007
642007
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
542009
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
542003
Recognizing weakly triangulated graphs by edge separability
A Berry, JP Bordat, P Heggernes
Scandinavian Workshop on Algorithm Theory, 139-149, 2000
532000
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
512000
Finding good column orderings for sparse QR factorization
P Heggernes, P Matstoms
Department of Mathematics, Linköping University, 1996
481996
Optimal broadcast domination in polynomial time
P Heggernes, D Lokshtanov
Discrete mathematics 306 (24), 3267-3280, 2006
472006
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
442013
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
442007
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
422011
A vertex incremental approach for maintaining chordality
A Berry, P Heggernes, Y Villanger
Discrete Mathematics 306 (3), 318-336, 2006
422006
Finding minimum height elimination trees for interval graphs in polynomial time
B Aspvall, P Heggernes
BIT Numerical Mathematics 34 (4), 484-509, 1994
401994
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20