Pinar Heggernes

Pinar Heggernes's AcademicInfluence.com Rankings

Pinar Heggernes

Computer Science

#7411

World Rank

#7805

Historical Rank

Database

#8894

World Rank

#9348

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Pinar Heggernes Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Pinar Heggernes is a Turkish-born Norwegian computer scientist known for her research on graph algorithms, sparse matrix computations, and parameterized complexity. She is the deputy rector of the University of Bergen, elected together with rector Margareth Hagen for the period 2021 - 2025. Until August 2021, she was the head of the Department of Informatics at the University of Bergen. She is also a member of the board of directors of the Research Council of Norway, appointed for the period 2019–2022.

(See a Problem?)

Pinar Heggernes's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Minimal triangulations of graphs: A survey (2006) (180)
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs (2004) (125)
Graph-Theoretic Concepts in Computer Science (2016) (112)
Partitioning Graphs into Generalized Dominating Sets (1998) (100)
Linear-time certifying recognition algorithms and forbidden induced subgraphs (2007) (79)
A practical algorithm for making filled graphs minimal (2001) (70)
Finding k Disjoint Triangles in an Arbitrary Graph (2004) (64)
The Computational Complexity of the Minimum Degree Algorithm (2001) (63)
Interval Completion Is Fixed Parameter Tractable (2008) (60)
Optimal broadcast domination in polynomial time (2006) (58)
A wide-range algorithm for minimal triangulation from an arbitrary ordering (2006) (57)
The Minimum Degree Heuristic and the Minimal Triangulation Process (2003) (55)
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration (2012) (54)
Obtaining a Bipartite Graph by Contracting Few Edges (2011) (47)
Recognizing Weakly Triangulated Graphs by Edge Separability (2000) (46)
Finding minimum height elimination trees for interval graphs in polynomial time (1994) (44)
Methods for Large Scale Total Least Squares Problems (2000) (43)
Contracting Graphs to Paths and Trees (2011) (43)
Computing minimal triangulations in time O(nα log n) = o(n2.376) (2005) (43)
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization (2013) (41)
Maximum Cardinality Search for Computing Minimal Triangulations (2002) (39)
Enumerating Minimal Subset Feedback Vertex Sets (2011) (35)
Parameterized complexity of vertex deletion into perfect graph classes (2011) (35)
A vertex incremental approach for maintaining chordality (2006) (35)
Exact Algorithms for Graph Homomorphisms (2005) (34)
Interval completion with few edges (2007) (32)
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376) (2005) (31)
Finding Good Column Orderings for Sparse QR Factorization (1996) (31)
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs (2003) (31)
Optimal Linear Arrangement of Interval Graphs (2006) (30)
Graphs of linear clique-width at most 3 (2008) (28)
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (2013) (28)
Computing Minimum Geodetic Sets of Proper Interval Graphs (2012) (26)
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width (2015) (26)
Enumerating minimal dominating sets in chordal bipartite graphs (2016) (25)
Broadcast Domination Algorithms for Interval Graphs , Series-Parallel Graphs , and Trees (2003) (25)
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (2012) (24)
Minimal Interval Completions (2005) (24)
Computing the metric dimension for chain graphs (2015) (24)
A new representation of proper interval graphs with an application to clique-width (2009) (24)
Graph Searching, Elimination Trees, and a Generalization of Bandwidth (2003) (24)
Bandwidth of bipartite permutation graphs in polynomial time (2008) (23)
Clustering with partial information (2008) (23)
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality (2016) (22)
A multi-parameter analysis of hard problems on deterministic finite automata (2015) (22)
Efficient Implementation of a Minimal Triangulation Algorithm (2002) (21)
Computing Minimal Triangulations in Time (2005) (20)
The Firefighter problem on graph classes (2016) (20)
Minimal Split Completions of Graphs (2006) (20)
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time (2013) (19)
Faster Parameterized Algorithms for Minimum Fill-in (2008) (19)
Edge contractions in subclasses of chordal graphs (2011) (19)
Minimal split completions (2009) (18)
Contracting chordal graphs and bipartite graphs to paths and trees (2011) (18)
Graph classes and Ramsey numbers (2014) (18)
Minimal comparability completions of arbitrary graphs (2008) (17)
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (2007) (17)
Graph Modification Problems (Dagstuhl Seminar 14071) (2014) (17)
Finding clubs in graph classes (2014) (17)
Polar Permutation Graphs (2009) (17)
Treewidth , partial k-trees , and chordal graphs (16)
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs (2015) (16)
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths (2011) (16)
A characterisation of clique-width through nested partitions (2015) (15)
Bandwidth on AT-Free Graphs (2009) (14)
Subset feedback vertex sets in chordal graphs (2014) (14)
Choosability of P5-Free Graphs (2009) (14)
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs (2010) (13)
Characterizing Minimal Interval Completions (2007) (13)
Characterizing minimal interval completions towards better understanding of profile and pathwidth (2007) (13)
Minimal dominating sets in interval graphs and trees (2017) (13)
Mixed search number and linear‐width of interval and split graphs (2007) (13)
Generalized H-coloring and H-covering of Trees (2003) (13)
Enumerating minimal dominating sets in chordal graphs (2016) (13)
Making Life Easier for Firefighters (2012) (13)
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs (2015) (11)
Broadcast Domination on Block Graphs in Linear Time (2012) (11)
A Complete Characterisation of the Linear Clique-Width of Path Powers (2009) (11)
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (2010) (11)
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (2012) (10)
Cutwidth of Split Graphs and Threshold Graphs (2011) (10)
Hadwiger Number of Graphs with Small Chordality (2014) (10)
Finding Disjoint Paths in Split Graphs (2014) (10)
Linear-time certifying algorithms for recognizing split graphs and related graph classes ∗ (2006) (10)
Computing role assignments of proper interval graphs in polynomial time (2010) (10)
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree (2008) (10)
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (2011) (9)
A Multivariate Analysis of Some DFA Problems (2013) (9)
Dynamically maintaining split graphs (2009) (9)
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing (2010) (9)
Parameterized Aspects of Strong Subgraph Closure (2018) (9)
On recognition of threshold tolerance graphs and their complements (2017) (9)
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs (2010) (9)
Maximal Induced Matchings in Triangle‐Free Graphs (2013) (9)
Polar permutation graphs are polynomial-time recognisable (2013) (8)
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions (2006) (8)
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 (2017) (8)
Finding Connected Secluded Subgraphs (2017) (8)
A Parameterized Algorithm for Chordal Sandwich (2010) (8)
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (2008) (7)
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure" (2015) (7)
Mixed Search Number of Permutation Graphs (2008) (7)
Edge search number of cographs (2012) (7)
Linear-Time Generation of Random Chordal Graphs (2017) (7)
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs (2012) (6)
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges (1996) (6)
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality (2015) (6)
Enumeration of minimal connected dominating sets for chordal graphs (2020) (6)
Fast Computation of Minimal Fill Inside A Given Elimination Ordering (2008) (6)
Edge Search Number of Cographs in Linear Time (2009) (5)
Ramsey Numbers for Line Graphs and Perfect Graphs (2012) (5)
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time (2005) (5)
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (2017) (5)
Hardness and approximation of minimum distortion embeddings (2010) (5)
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (2008) (5)
Linear-time certifying algorithms for recognizing trivially perfect graphs (2006) (5)
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (2018) (4)
A completely dynamic algorithm for split graphs (2006) (4)
Partitioning a graph into degenerate subgraphs (2018) (4)
Clique-width of path powers (2016) (4)
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (2011) (4)
Vector connectivity in graphs (2013) (4)
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties (2012) (3)
BIT Numerical Mathematics: Editorial (2005) (3)
Graphs of small bounded linear clique-width ∗ (2007) (3)
Strongly chordal and chordal bipartite graphs are sandwich monotone (2011) (3)
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number (2022) (3)
Choosability on H-free graphs (2013) (3)
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (2010) (3)
Minimizing Fill-in Size and Elimination Tree Height in Parallel Cholesky Factorization (1992) (3)
Cliques and Clubs (2013) (3)
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay (2012) (3)
Parameterized and Exact Computation (2014) (2)
Minimal comparability completions ∗ (2006) (2)
Simple and Efficient Modifications of Elimination Orderings (2004) (2)
Graph-Theoretic Concepts in Computer Science 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers (2016) (2)
Choosability of P 5-free graphs ∗ (2009) (2)
Induced Subtrees in Interval Graphs (2013) (2)
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (2014) (2)
How to Eliminate a Graph (2012) (2)
Finding Disjoint Paths in Split Graphs (2014) (2)
Contracting Graphs to Paths and Trees (2012) (2)
Scheduling unit-length jobs with precedence constraints of small height (2014) (1)
Reducing the ll-in size for an elimination tree (2003) (1)
Preface: Algorithmic Graph Theory on the Adriatic Coast (2017) (1)
PARTITIONING A SET OF FUNCTIONS INTO CORRELATED SUBSETS. (1998) (1)
Generation of random chordal graphs using subtrees of a tree (2018) (1)
Enumerating Minimal Subset Feedback Vertex Sets (2012) (1)
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties (2014) (1)
Parameterized Aspects of Strong Subgraph Closure (2020) (1)
Computing minimal triangulation in Time o(n^2.376) (2005) (1)
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition (2011) (1)
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 (2019) (1)
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees (2017) (1)
Minimal Triangulations in Time O ( n α log n ) = o ( n 2 . 376 ) ∗ (2005) (1)
Ramsey numbers for graph classes ? (2013) (0)
Erratum to: Foreword: Special Issue on IPEC 2014 (2016) (0)
Foreword: Special Issue on IPEC 2014 (2016) (0)
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (2009) (0)
Foreword: Special Issue on IPEC 2014 (2016) (0)
ParComb Parallel Algorithms for Combinatorial Scientific Computing (0)
Graph sear hing , elimination trees , and ageneralization of bandwidthFedor (2004) (0)
Maximum Number of Edges in Graphs Under Various Constraints Student : H̊avard Stuberg (2019) (0)
Nordic Journal of Computing Partitioning Graphs into Generalized Dominating Sets (1998) (0)
Deposited in DRO : 06 January 2015 Version of attached le : Accepted Version Peer-review status of attached (2015) (0)
Computing Minimal Triangulations in O ( n log n ) Time Pinar (2004) (0)
Erratum to: Foreword: Special Issue on IPEC 2014 (2016) (0)
Modifying a Graph Using Vertex Elimination (2013) (0)
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013 (2016) (0)
Parameterized and exact computation: 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (2014) (0)
Guest editors' foreword (2012) (0)
2 A Vertex Incremental Approach for Maintaining Chordality graph (2006) (0)
D M ] 1 2 M ar 2 01 8 Partitioning a graph into degenerate subgraphs (2018) (0)
Modifying a Graph Using Vertex Elimination (2015) (0)
A Simple Cubic Algorithm for ComputingMinimum Height Elimination Trees forInterval (1995) (0)
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time (2013) (0)
Guest Editors' Foreword (2010) (0)
Guest editors' foreword (2014) (0)
40 14071 – Graph Modification Problems 2 Table of Contents (2014) (0)
Recognizing Threshold Tolerance Graphs in O(n2) Time (2014) (0)
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182) (2011) (0)
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width (2017) (0)
Minimal Triangulations of Graphs (2004) (0)

This paper list is powered by the following services:

Other Resources About Pinar Heggernes

What Schools Are Affiliated With Pinar Heggernes?

Pinar Heggernes is affiliated with the following schools:

University of Bergen