Pinar Heggernes

Cited by

	All	Since 2018
Citations	3615	1346
h-index	32	19
i10-index	96	47

260

130

195

20002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202321 14 25 35 41 96 153 86 120 107 153 126 174 193 211 208 209 220 188 217 254 231 242 210

Public access

View all

29 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Yngve VillangerUniversity of BergenVerified email at uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Pim van 't HofUniversity of TwenteVerified email at utwente.nl
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Reza SaeiNord UniversityVerified email at nord.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Tınaz EkimEndüstri Mühendisliği, Boğaziçi ÜniversitesiVerified email at boun.edu.tr
Rémy BelmonteUniversité Gustave EiffelVerified email at univ-eiffel.fr
Arash RafieySimon Fraser UniversityVerified email at sfu.ca
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Alex PothenProfessor of Computer Science, Purdue UniversityVerified email at purdue.edu
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
Marcin Kamiński4colors ResearchVerified email at mimuw.edu.pl
Fredrik ManneDepartment of Informatics, University of BergenVerified email at ii.uib.no
Ross M. McConnellAssociate Professor of Computer Science, Colorado State UniversityVerified email at cs.colostate.edu
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Sigve Hortemo SætherPhD Research Fellow, University of BergenVerified email at ii.uib.no

Pinar Heggernes

Professor of computer science, University of Bergen

Verified email at ii.uib.no - Homepage

Graph algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Minimal triangulations of graphs: A survey P Heggernes Discrete Mathematics 306 (3), 297-317, 2006	217	2006
Maximum cardinality search for computing minimal triangulations of graphs A Berry, JRS Blair, P Heggernes, BW Peyton Algorithmica 39, 287-298, 2004	162	2004
Partitioning graphs into generalized dominating sets P Heggernes, JA Telle Nord. J. Comput. 5 (2), 128-142, 1998	135	1998
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	98	2002
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	96	2007
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	85	2006
A practical algorithm for making filled graphs minimal JRS Blair, P Heggernes, JA Telle Theoretical Computer Science 250 (1-2), 125-141, 2001	84	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	82	2005
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	74	2003
Optimal broadcast domination in polynomial time P Heggernes, D Lokshtanov Discrete Mathematics 306 (24), 3267-3280, 2006	72	2006
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	71	2013
Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009	65	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	65	2005
Recognizing weakly triangulated graphs by edge separability A Berry, JP Bordat, P Heggernes Scandinavian Workshop on Algorithm Theory, 139-149, 2000	63	2000
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	60	2011
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	59	2000
Finding good column orderings for sparse QR factorization P Heggernes, P Matstoms Department of Mathematics, Linköping University, 1996	59	1996
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	55	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	55	2013
Maximum cardinality search for computing minimal triangulations A Berry, JRS Blair, P Heggernes Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002	50	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors