Pinar Heggernes

Cited by

	All	Since 2016
Citations	3008	1169
h-index	28	17
i10-index	87	44

300

150

225

200020012002200320042005200620072008200920102011201220132014201520162017201820192020202112 8 16 34 43 101 147 85 124 117 162 135 168 199 204 220 209 203 193 240 282 36

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 LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht University and Technical University EindhovenVerified email at uu.nl
Reza SaeiNord UniversityVerified email at nord.no
Tınaz EkimEndüstri Mühendisliği, Boğaziçi ÜniversitesiVerified email at boun.edu.tr
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Arash RafieySimon Fraser UniversityVerified email at sfu.ca
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
Marcin KamińskiVerified email at mimuw.edu.pl
Alex PothenProfessor of Computer Science, Purdue UniversityVerified email at purdue.edu
Fredrik ManneDepartment of Informatics, University of BergenVerified email at ii.uib.no
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyVerified email at tue.nl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si

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	178	2006
Maximum cardinality search for computing minimal triangulations of graphs A Berry, JRS Blair, P Heggernes, BW Peyton Algorithmica 39 (4), 287-298, 2004	126	2004
Partitioning graphs into generalized dominating sets P Heggernes, JA Telle Nord. J. Comput. 5 (2), 128-142, 1998	112	1998
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	82	2004
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	81	2001
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	79	2006
A practical algorithm for making filled graphs minimal JRS Blair, P Heggernes, JA Telle Theoretical Computer Science 250 (1-2), 125-141, 2001	78	2001
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	71	2007
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	61	2005
Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009	60	2009
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	60	2003
Recognizing weakly triangulated graphs by edge separability A Berry, JP Bordat, P Heggernes Scandinavian Workshop on Algorithm Theory, 139-149, 2000	59	2000
Optimal broadcast domination in polynomial time P Heggernes, D Lokshtanov Discrete Mathematics 306 (24), 3267-3280, 2006	56	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	55	2013
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	50	2011
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	46	2014
Finding good column orderings for sparse QR factorization P Heggernes, P Matstoms Department of Mathematics, Linköping University, 1996	45	1996
A vertex incremental approach for maintaining chordality A Berry, P Heggernes, Y Villanger Discrete Mathematics 306 (3), 318-336, 2006	44	2006
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	43	2007
Maximum cardinality search for computing minimal triangulations A Berry, JRS Blair, P Heggernes International Workshop on Graph-Theoretic Concepts in Computer Science, 1-12, 2002	43	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

Upload PDF

Follow this author

Cited by

Co-authors