Pinar Heggernes

According to our database, Pinar Heggernes authored at least 134 papers between 1996 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Generation of random chordal graphs using subtrees of a tree.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

RAIRO Oper. Res., 2022

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number.

Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov

Algorithmica, 2022

2020

Finding connected secluded subgraphs.

Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre

J. Comput. Syst. Sci., 2020

Partitioning a graph into degenerate subgraphs.

Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes

Eur. J. Comb., 2020

Enumeration of minimal connected dominating sets for chordal graphs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei

Discret. Appl. Math., 2020

Parameterized Aspects of Strong Subgraph Closure.

Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos

Algorithmica, 2020

2019

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma

Algorithmica, 2019

2018

Enumeration and maximum number of minimal connected vertex covers in graphs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch

Eur. J. Comb., 2018

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger

Algorithmica, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees.

Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle

Eur. J. Comb., 2017

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded.

Cemil Dibek, Tínaz Ekim, Pinar Heggernes

Discret. Math., 2017

On recognition of threshold tolerance graphs and their complements.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

Minimal dominating sets in interval graphs and trees.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger

Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.

Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon

Discret. Appl. Math., 2017

Linear-Time Generation of Random Chordal Graphs.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Enumerating minimal connected dominating sets in graphs of bounded chordality.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch

Theor. Comput. Sci., 2016

The Firefighter problem on graph classes.

Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen

Theor. Comput. Sci., 2016

Maximal Induced Matchings in Triangle-Free Graphs.

Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger

J. Graph Theory, 2016

Enumerating minimal dominating sets in chordal graphs.

Faisal N. Abu-Khzam, Pinar Heggernes

Inf. Process. Lett., 2016

Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013.

Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos

Discret. Appl. Math., 2016

Clique-width of path powers.

Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics

Discret. Appl. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger

Discret. Appl. Math., 2016

Erratum to: Foreword: Special Issue on IPEC 2014.

Marek Cygan, Pinar Heggernes

Algorithmica, 2016

Foreword: Special Issue on IPEC 2014.

Marek Cygan, Pinar Heggernes

Algorithmica, 2016

2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.

Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger

Theor. Comput. Sci., 2015

Hadwiger Number of Graphs with Small Chordality.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul

SIAM J. Discret. Math., 2015

Finding Disjoint Paths in Split Graphs.

Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei

Theory Comput. Syst., 2015

A multi-parameter analysis of hard problems on deterministic finite automata.

Henning Fernau, Pinar Heggernes, Yngve Villanger

J. Comput. Syst. Sci., 2015

Computing the metric dimension for chain graphs.

Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei

Inf. Process. Lett., 2015

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality.

Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle

Electron. Notes Discret. Math., 2015

A characterisation of clique-width through nested partitions.

Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics

Discret. Appl. Math., 2015

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger

Algorithmica, 2015

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger

Algorithmica, 2015

Modifying a Graph Using Vertex Elimination.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Algorithmica, 2015

2014

Scheduling unit-length jobs with precedence constraints of small height.

André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan

Oper. Res. Lett., 2014

Vector connectivity in graphs.

Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic

Networks, 2014

Subset feedback vertex sets in chordal graphs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei

J. Discrete Algorithms, 2014

Guest editors' foreword.

Pinar Heggernes, Jan Kratochvíl, Sang-il Oum

Discret. Appl. Math., 2014

Finding clubs in graph classes.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey

Discret. Appl. Math., 2014

Graph classes and Ramsey numbers.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei

Discret. Appl. Math., 2014

Graph Modification Problems (Dagstuhl Seminar 14071).

Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov

Dagstuhl Reports, 2014

Contracting Graphs to Paths and Trees.

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul

Algorithmica, 2014

Enumerating Minimal Subset Feedback Vertex Sets.

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger

Algorithmica, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Algorithmica, 2014

Recognizing Threshold Tolerance Graphs in O(n²) Time.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Parameterized complexity of vertex deletion into perfect graph classes.

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Theor. Comput. Sci., 2013

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch

Theor. Comput. Sci., 2013

Obtaining a Bipartite Graph by Contracting Few Edges.

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul

SIAM J. Discret. Math., 2013

Choosability on H-free graphs.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

Inf. Process. Lett., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.

Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Inf. Comput., 2013

Polar permutation graphs are polynomial-time recognisable.

Tínaz Ekim, Pinar Heggernes, Daniel Meister

Eur. J. Comb., 2013

A Multivariate Analysis of Some DFA Problems.

Henning Fernau, Pinar Heggernes, Yngve Villanger

Proceedings of the Language and Automata Theory and Applications, 2013

Induced Subtrees in Interval Graphs.

Pinar Heggernes, Pim van 't Hof, Martin Milanic

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Cliques and Clubs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof

SIAM J. Discret. Math., 2012

Computing role assignments of proper interval graphs in polynomial time.

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

J. Discrete Algorithms, 2012

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Discret. Appl. Math., 2012

Edge search number of cographs.

Petr A. Golovach, Pinar Heggernes, Rodica Mihai

Discret. Appl. Math., 2012

Edge contractions in subclasses of chordal graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof

Discret. Appl. Math., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger

CoRR, 2012

How to Eliminate a Graph.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Making Life Easier for Firefighters.

Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Broadcast Domination on Block Graphs in Linear Time.

Pinar Heggernes, Sigve Hortemo Sæther

Proceedings of the Computer Science - Theory and Applications, 2012

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Ramsey Numbers for Line Graphs and Perfect Graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Graphs of linear clique-width at most 3.

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Theor. Comput. Sci., 2011

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh

Theor. Comput. Sci., 2011

Cutwidth of Split Graphs and Threshold Graphs.

Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos

SIAM J. Discret. Math., 2011

Strongly chordal and chordal bipartite graphs are sandwich monotone.

Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan

J. Comb. Optim., 2011

Contracting chordal graphs and bipartite graphs to paths and trees.

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul

Electron. Notes Discret. Math., 2011

Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182).

Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell

Dagstuhl Reports, 2011

Faster Parameterized Algorithms for Minimum Fill-in.

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger

Algorithmica, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.

Pinar Heggernes, Daniel Meister, Udi Rotics

Proceedings of the Computer Science - Theory and Applications, 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.

Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Clustering with partial information.

Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond

Theor. Comput. Sci., 2010

Mixed search number and linear-width of interval and split graphs.

Fedor V. Fomin, Pinar Heggernes, Rodica Mihai

Networks, 2010

Hardness and approximation of minimum distortion embeddings.

Pinar Heggernes, Daniel Meister

Inf. Process. Lett., 2010

Guest Editors' Foreword.

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski

Discret. Appl. Math., 2010

Generalized Graph Clustering: Recognizing (<i>p</i>, <i>q</i>)-Cluster Graphs.

Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.

Pinar Heggernes, Daniel Meister, Udi Rotics

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.

Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Proceedings of the Algorithm Theory, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.

Pinar Heggernes, Daniel Meister, Yngve Villanger

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.

Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.

Pinar Heggernes, Charis Papadopoulos

Theor. Comput. Sci., 2009

Interval Completion Is Fixed Parameter Tractable.

Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle

SIAM J. Comput., 2009

Bandwidth of bipartite permutation graphs in polynomial time.

Pinar Heggernes, Dieter Kratsch, Daniel Meister

J. Discrete Algorithms, 2009

A new representation of proper interval graphs with an application to clique-width.

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Electron. Notes Discret. Math., 2009

Minimal split completions.

Pinar Heggernes, Federico Mancini

Discret. Appl. Math., 2009

Dynamically maintaining split graphs.

Pinar Heggernes, Federico Mancini

Discret. Appl. Math., 2009

A Complete Characterisation of the Linear Clique-Width of Path Powers.

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Choosability of P5-Free Graphs.

Petr A. Golovach, Pinar Heggernes

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Polar Permutation Graphs.

Tínaz Ekim, Pinar Heggernes, Daniel Meister

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Edge Search Number of Cographs in Linear Time.

Pinar Heggernes, Rodica Mihai

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree.

Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet

Theor. Comput. Sci., 2008

Fast Computation of Minimal Fill Inside A Given Elimination Ordering.

Pinar Heggernes, Barry W. Peyton

SIAM J. Matrix Anal. Appl., 2008

Minimal comparability completions of arbitrary graphs.

Pinar Heggernes, Federico Mancini, Charis Papadopoulos

Discret. Appl. Math., 2008

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.

Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Proceedings of the Algorithm Theory, 2008

Mixed Search Number of Permutation Graphs.

Pinar Heggernes, Rodica Mihai

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Linear-time certifying recognition algorithms and forbidden induced subgraphs.

Pinar Heggernes, Dieter Kratsch

Nord. J. Comput., 2007

Exact Algorithms for Graph Homomorphisms.

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch

Theory Comput. Syst., 2007

Interval completion with few edges.

Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Characterizing Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the STACS 2007, 2007

2006

A wide-range algorithm for minimal triangulation from an arbitrary ordering.

Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger

J. Algorithms, 2006

A completely dynamic algorithm for split graphs.

Federico Mancini, Pinar Heggernes

Electron. Notes Discret. Math., 2006

Optimal broadcast domination in polynomial time.

Pinar Heggernes, Daniel Lokshtanov

Discret. Math., 2006

Minimal triangulations of graphs: A survey.

Pinar Heggernes

Discret. Math., 2006

A vertex incremental approach for maintaining chordality.

Anne Berry, Pinar Heggernes, Yngve Villanger

Discret. Math., 2006

Optimal Linear Arrangement of Interval Graphs.

Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Minimal Split Completions of Graphs.

Pinar Heggernes, Federico Mancini

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.

Pinar Heggernes, Federico Mancini, Charis Papadopoulos

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Computing Minimal Triangulations in Time <i>O</i>(<i>n</i>^alpha <i>log n</i>) = <i>o</i>(<i>n</i> ^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

SIAM J. Discret. Math., 2005

Graph Searching, Elimination Trees, and a Generalization of Bandwidth.

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle

Algorithmica, 2005

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.

Pinar Heggernes, Daniel Lokshtanov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms, 2005

2004

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.

Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton

Algorithmica, 2004

Finding k Disjoint Triangles in an Arbitrary Graph.

Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Simple and Efficient Modifications of Elimination Orderings.

Pinar Heggernes, Yngve Villanger

Proceedings of the Applied Parallel Computing, 2004

2003

Generalized H-coloring and H-covering of Trees.

Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle

Nord. J. Comput., 2003

The Minimum Degree Heuristic and the Minimal Triangulation Process.

Anne Berry, Pinar Heggernes, Geneviève Simonet

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.

Anne Berry, Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Maximum Cardinality Search for Computing Minimal Triangulations.

Anne Berry, Jean R. S. Blair, Pinar Heggernes

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Efficient Implementation of a Minimal Triangulation Algorithm.

Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms, 2002

2001

A practical algorithm for making filled graphs minimal.

Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle

Theor. Comput. Sci., 2001

2000

Methods for Large Scale Total Least Squares Problems.

Åke Björck, Pinar Heggernes, P. Matstoms

SIAM J. Matrix Anal. Appl., 2000

Recognizing Weakly Triangulated Graphs by Edge Separability.

Anne Berry, Jean Paul Bordat, Pinar Heggernes

Nord. J. Comput., 2000

1998

Partitioning Graphs into Generalized Dominating Sets.

Pinar Heggernes, Jan Arne Telle

Nord. J. Comput., 1998

1996

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.

Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle

Proceedings of the Algorithm Theory, 1996