Pinar Heggernes

According to our database1, Pinar Heggernes authored at least 133 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Finding connected secluded subgraphs.
J. Comput. Syst. Sci., 2020

Partitioning a graph into degenerate subgraphs.
Eur. J. Comb., 2020

Enumeration of minimal connected dominating sets for chordal graphs.
Discret. Appl. Math., 2020

Parameterized Aspects of Strong Subgraph Closure.
Algorithmica, 2020

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

2018
Enumeration and maximum number of minimal connected vertex covers in graphs.
Eur. J. Comb., 2018

Generation of random chordal graphs using subtrees of a tree.
CoRR, 2018

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

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.
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.
Eur. J. Comb., 2017

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

On recognition of threshold tolerance graphs and their complements.
Discret. Appl. Math., 2017

Minimal dominating sets in interval graphs and trees.
Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.
Discret. Appl. Math., 2017

Linear-Time Generation of Random Chordal Graphs.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Enumerating minimal connected dominating sets in graphs of bounded chordality.
Theor. Comput. Sci., 2016

The Firefighter problem on graph classes.
Theor. Comput. Sci., 2016

Maximal Induced Matchings in Triangle-Free Graphs.
J. Graph Theory, 2016

Enumerating minimal dominating sets in chordal graphs.
Inf. Process. Lett., 2016

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

Clique-width of path powers.
Discret. Appl. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.
Discret. Appl. Math., 2016

Erratum to: Foreword: Special Issue on IPEC 2014.
Algorithmica, 2016

Foreword: Special Issue on IPEC 2014.
Algorithmica, 2016

2015
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.
Theor. Comput. Sci., 2015

Hadwiger Number of Graphs with Small Chordality.
SIAM J. Discret. Math., 2015

Finding Disjoint Paths in Split Graphs.
Theory Comput. Syst., 2015

A multi-parameter analysis of hard problems on deterministic finite automata.
J. Comput. Syst. Sci., 2015

Computing the metric dimension for chain graphs.
Inf. Process. Lett., 2015

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality.
Electron. Notes Discret. Math., 2015

A characterisation of clique-width through nested partitions.
Discret. Appl. Math., 2015

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

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

Modifying a Graph Using Vertex Elimination.
Algorithmica, 2015

2014
Scheduling unit-length jobs with precedence constraints of small height.
Oper. Res. Lett., 2014

Vector connectivity in graphs.
Networks, 2014

Subset feedback vertex sets in chordal graphs.
J. Discrete Algorithms, 2014

Guest editors' foreword.
Discret. Appl. Math., 2014

Finding clubs in graph classes.
Discret. Appl. Math., 2014

Graph classes and Ramsey numbers.
Discret. Appl. Math., 2014

Graph Modification Problems (Dagstuhl Seminar 14071).
Dagstuhl Reports, 2014

Contracting Graphs to Paths and Trees.
Algorithmica, 2014

Enumerating Minimal Subset Feedback Vertex Sets.
Algorithmica, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.
Algorithmica, 2014

Recognizing Threshold Tolerance Graphs in O(n<sup>2</sup>) Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
Parameterized complexity of vertex deletion into perfect graph classes.
Theor. Comput. Sci., 2013

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.
Theor. Comput. Sci., 2013

Obtaining a Bipartite Graph by Contracting Few Edges.
SIAM J. Discret. Math., 2013

Choosability on H-free graphs.
Inf. Process. Lett., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.
Inf. Comput., 2013

Polar permutation graphs are polynomial-time recognisable.
Eur. J. Comb., 2013

A Multivariate Analysis of Some DFA Problems.
Proceedings of the Language and Automata Theory and Applications, 2013

Induced Subtrees in Interval Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

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

2012
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
SIAM J. Discret. Math., 2012

Computing role assignments of proper interval graphs in polynomial time.
J. Discrete Algorithms, 2012

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.
Discret. Appl. Math., 2012

Edge search number of cographs.
Discret. Appl. Math., 2012

Edge contractions in subclasses of chordal graphs.
Discret. Appl. Math., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
CoRR, 2012

How to Eliminate a Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Making Life Easier for Firefighters.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Broadcast Domination on Block Graphs in Linear Time.
Proceedings of the Computer Science - Theory and Applications, 2012

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Ramsey Numbers for Line Graphs and Perfect Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Graphs of linear clique-width at most 3.
Theor. Comput. Sci., 2011

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.
Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.
Theor. Comput. Sci., 2011

Cutwidth of Split Graphs and Threshold Graphs.
SIAM J. Discret. Math., 2011

Strongly chordal and chordal bipartite graphs are sandwich monotone.
J. Comb. Optim., 2011

Contracting chordal graphs and bipartite graphs to paths and trees.
Electron. Notes Discret. Math., 2011

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

Faster Parameterized Algorithms for Minimum Fill-in.
Algorithmica, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
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.
Proceedings of the Computer Science - Theory and Applications, 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Clustering with partial information.
Theor. Comput. Sci., 2010

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

Hardness and approximation of minimum distortion embeddings.
Inf. Process. Lett., 2010

Guest Editors' Foreword.
Discret. Appl. Math., 2010

Generalized Graph Clustering: Recognizing (<i>p</i>, <i>q</i>)-Cluster Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.
Proceedings of the Algorithm Theory, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.
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.
Theor. Comput. Sci., 2009

Interval Completion Is Fixed Parameter Tractable.
SIAM J. Comput., 2009

Bandwidth of bipartite permutation graphs in polynomial time.
J. Discrete Algorithms, 2009

A new representation of proper interval graphs with an application to clique-width.
Electron. Notes Discret. Math., 2009

Minimal split completions.
Discret. Appl. Math., 2009

Dynamically maintaining split graphs.
Discret. Appl. Math., 2009

A Complete Characterisation of the Linear Clique-Width of Path Powers.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Choosability of P5-Free Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Polar Permutation Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Edge Search Number of Cographs in Linear Time.
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.
Theor. Comput. Sci., 2008

Fast Computation of Minimal Fill Inside A Given Elimination Ordering.
SIAM J. Matrix Anal. Appl., 2008

Minimal comparability completions of arbitrary graphs.
Discret. Appl. Math., 2008

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.
Proceedings of the Algorithm Theory, 2008

Mixed Search Number of Permutation Graphs.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
Linear-time certifying recognition algorithms and forbidden induced subgraphs.
Nord. J. Comput., 2007

Exact Algorithms for Graph Homomorphisms.
Theory Comput. Syst., 2007

Interval completion with few edges.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Characterizing Minimal Interval Completions.
Proceedings of the STACS 2007, 2007

2006
A wide-range algorithm for minimal triangulation from an arbitrary ordering.
J. Algorithms, 2006

A completely dynamic algorithm for split graphs.
Electron. Notes Discret. Math., 2006

Optimal broadcast domination in polynomial time.
Discret. Math., 2006

Minimal triangulations of graphs: A survey.
Discret. Math., 2006

A vertex incremental approach for maintaining chordality.
Discret. Math., 2006

Optimal Linear Arrangement of Interval Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Minimal Split Completions of Graphs.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
Computing Minimal Triangulations in Time <i>O</i>(<i>n</i><sup>alpha</sup> <i>log n</i>) = <i>o</i>(<i>n</i> <sup>2.376</sup>).
SIAM J. Discret. Math., 2005

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

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Computing minimal triangulations in time O(n<sup>alpha</sup> log n) = o(n<sup>2.376</sup>).
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Minimal Interval Completions.
Proceedings of the Algorithms, 2005

2004
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.
Algorithmica, 2004

Finding k Disjoint Triangles in an Arbitrary Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Simple and Efficient Modifications of Elimination Orderings.
Proceedings of the Applied Parallel Computing, 2004

2003
Generalized H-coloring and H-covering of Trees.
Nord. J. Comput., 2003

The Minimum Degree Heuristic and the Minimal Triangulation Process.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Maximum Cardinality Search for Computing Minimal Triangulations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Efficient Implementation of a Minimal Triangulation Algorithm.
Proceedings of the Algorithms, 2002

2001
A practical algorithm for making filled graphs minimal.
Theor. Comput. Sci., 2001

2000
Methods for Large Scale Total Least Squares Problems.
SIAM J. Matrix Anal. Appl., 2000

Recognizing Weakly Triangulated Graphs by Edge Separability.
Nord. J. Comput., 2000

1998
Partitioning Graphs into Generalized Dominating Sets.
Nord. J. Comput., 1998

1996
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.
Proceedings of the Algorithm Theory, 1996


  Loading...