- Treewidth, partial k-trees, and chordal graphs Delpensum INF 334 -Institutt for informatikk
- Optimal broadcast domination in polynomial time # Pinar Heggernes + Daniel Lokshtanov +
- Reducing the fillin size for an elimination tree
- The Minimum Degree Heuristic and the Minimal Triangulation Process
- Treewidth, partial ktrees, and chordal graphs Delpensum INF 334 Institutt for informatikk
- A Vertex Incremental Approach for Maintaining Chordality Pinar Heggernes
- Advanced Graph Theoretical Topics Delpensum I238 Institutt for informatikk
- Contracting chordal graphs and bipartite graphs to paths and trees 1
- Edge search number of cographs Petr A. Golovach
- Minimal comparability completions of arbitrary graphs Pinar Heggernes
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
- A Practical Algorithm for Making Filled Graphs Minimal \Lambda
- Advanced Graph Theoretical Topics Delpensum I238 -Institutt for informatikk
- Minimizing fillin size and elimination tree height in parallel
- A Vertex Incremental Approach for Maintaining Chordality Anne Berry # Pinar Heggernes + Yngve Villanger +
- Graph searching, elimination trees, and a generalization of bandwidth
- Interval Completion is Fixed Parameter Tractable Yngve Villanger
- Choosability of P5-free graphs Petr A. Golovach
- Nordic Journal of Computing RECOGNIZING WEAKLY TRIANGULATED GRAPHS
- Minimal triangulations of graphs: A survey Pinar Heggernes
- Exact Algorithms for Graph Homomorphisms # Fedor V. Fomin + Pinar Heggernes + Dieter Kratsch #
- Minimal interval completions Pinar Heggernes 1 , Karol Suchan 2 , Ioan Todinca 2 , and Yngve Villanger 1
- Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
- FAST COMPUTATION OF MINIMAL FILL INSIDE A GIVEN ELIMINATION ORDERING
- Induced Subgraph Isomorphism on interval and proper interval graphs
- Exact Algorithms for Graph Homomorphisms Fedor V. Fomin
- Partitioning and Ordering Graphs for Sparse Matrix Computations
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Efficient Implementation of a Minimal Triangulation Algorithm
- Edge search number of cographs in linear time Pinar Heggernes
- METHODS FOR LARGE SCALE TOTAL LEAST SQUARES PROBLEMS \Lambda
- Minimal triangulations of graphs: A survey Pinar Heggernes
- Graph searching, elimination trees, and a generalization of bandwidth
- Reducing the ll-in size for an elimination tree
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Exploiting restricted linear structure to cope with the hardness of clique-width
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Clustering with partial information Hans L. Bodlaender
- Minimal split completions Pinar Heggernes
- Sequential and parallel triangulating algorithms for Elimination Game and new insights on
- Computing Minimal Triangulations in Time log n) = o(n2.376
- Edge Contractions in Subclasses of Chordal Remy Belmonte, Pinar Heggernes, and Pim van 't Hof
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Mixed search number and linear-width of interval and split graphs
- Hardness and approximation of minimum distortion embeddings Pinar Heggernes
- Computing role assignments of proper interval graphs in polynomial time
- Bandwidth of bipartite permutation graphs in polynomial time Pinar Heggernes
- Polar permutation graphs Pinar Heggernes
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- A generic approach to decomposition algorithms, with an application to digraph decomposition
- Enumerating Minimal Subset Feedback Vertex Fedor V. Fomin1
- Optimal broadcast domination in polynomial time Pinar Heggernes
- Generalized Hcoloring and Hcovering of Trees Jir Fiala 1,# , Pinar Heggernes 2 , Petter Kristiansen 2 , and Jan Arne Telle 2
- The Computational Complexity of the Minimum Degree Algorithm #
- Characterizing minimal interval completions
- Computing Minimal Triangulations in Time O(n # log n) = o(n 2.376 ) #
- A new representation of proper interval graphs with an application to clique-width1
- Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender
- Generalized H-coloring and H-covering of Trees Jiri Fiala1,
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
- Graphs of linear clique-width at most 3 Pinar Heggernes
- Computing minimum geodetic sets in proper interval graphs
- Computing role assignments of proper interval graphs in polynomial time
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Broadcast Domination on block graphs in linear time
- CCCaaallllll fffooorrr PPPaaapppeeerrrsss Discrete Applied Mathematics
