Pinar Heggernes

Eur. J. Comb., 2020

Enumeration of minimal connected dominating sets for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2018

Parameterized Aspects of Strong Subgraph Closure.

[BibT_eX]

[DOI]

Athanasios L. Konstantinidis

Paloma T. Lima

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

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

[BibT_eX]

[DOI]

Cemil Dibek

Tínaz Ekim

Vinícius Fernandes dos Santos

Discret. Math., 2017

On recognition of threshold tolerance graphs and their complements.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

Minimal dominating sets in interval graphs and trees.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.

[BibT_eX]

[DOI]

Bostjan Bresar

Marcin Jakub Kaminski

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

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

Finding Connected Secluded Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Linear-Time Generation of Random Chordal Graphs.

[BibT_eX]

[DOI]

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

2016

The Firefighter problem on graph classes.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Theor. Comput. Sci., 2016

Enumerating minimal dominating sets in chordal graphs.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Inf. Process. Lett., 2016

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

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Discret. Appl. Math., 2016

Clique-width of path powers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Appl. Math., 2016

Erratum to: Foreword: Special Issue on IPEC 2014.

[BibT_eX]

[DOI]

Marek Cygan

Algorithmica, 2016

Foreword: Special Issue on IPEC 2014.

[BibT_eX]

[DOI]

Marek Cygan

Algorithmica, 2016

2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Henning Fernau

J. Comput. Syst. Sci., 2015

Computing the metric dimension for chain graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

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

[BibT_eX]

[DOI]

Hans L. Bodlaender

Electron. Notes Discret. Math., 2015

A characterisation of clique-width through nested partitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Modifying a Graph Using Vertex Elimination.

[BibT_eX]

[DOI]

Algorithmica, 2015

Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

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

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Sigve Hortemo Sæther

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Subset feedback vertex sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Guest editors' foreword.

[BibT_eX]

[DOI]

Jan Kratochvíl

Sang-il Oum

Discret. Appl. Math., 2014

Finding clubs in graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Graph classes and Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Graph Modification Problems (Dagstuhl Seminar 14071).

[BibT_eX]

[DOI]

Hans L. Bodlaender

Vinícius Fernandes dos Santos

Daniel Lokshtanov

Dagstuhl Reports, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2014

Recognizing Threshold Tolerance Graphs in O(n2) Time.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

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

Hadwiger Number of Graphs with Small Chordality.

[BibT_eX]

[DOI]

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

Maximal Induced Matchings in Triangle-Free Graphs.

[BibT_eX]

[DOI]

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

Finding Disjoint Paths in Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013

Choosability on H-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

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

[BibT_eX]

[DOI]

Inf. Comput., 2013

Polar permutation graphs are polynomial-time recognisable.

[BibT_eX]

[DOI]

Tínaz Ekim

Eur. J. Comb., 2013

Vector Connectivity in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

A Multivariate Analysis of Some DFA Problems.

[BibT_eX]

[DOI]

Henning Fernau

Proceedings of the Language and Automata Theory and Applications, 2013

Induced Subtrees in Interval Graphs.

[BibT_eX]

[DOI]

Martin Milanic

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

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Cliques and Clubs.

[BibT_eX]

[DOI]

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

2012

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Edge search number of cographs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

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

How to Eliminate a Graph.

[BibT_eX]

[DOI]

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

Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration.

[BibT_eX]

[DOI]

Jean-François Couturier

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

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

[BibT_eX]

[DOI]

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

Making Life Easier for Firefighters.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

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

Broadcast Domination on Block Graphs in Linear Time.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jean-François Couturier

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

Ramsey Numbers for Line Graphs and Perfect Graphs.

[BibT_eX]

[DOI]

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

2011

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Cutwidth of Split Graphs and Threshold Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Contracting chordal graphs and bipartite graphs to paths and trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

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

[BibT_eX]

[DOI]

Andreas Brandstädt

Martin Charles Golumbic

Ross M. McConnell

Dagstuhl Reports, 2011

Enumerating Minimal Subset Feedback Vertex Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Edge Contractions in Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Rémy Belmonte

Proceedings of the Theory and Applications of Models of Computation, 2011

Contracting Graphs to Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

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

[BibT_eX]

[DOI]

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

Obtaining a Bipartite Graph by Contracting Few Edges.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

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

[BibT_eX]

[DOI]

Udi Rotics

Proceedings of the Computer Science - Theory and Applications, 2011

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

[BibT_eX]

[DOI]

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

2010

Hardness and approximation of minimum distortion embeddings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Appl. Math., 2010

Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Computing Role Assignments of Proper Interval Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.

[BibT_eX]

[DOI]

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

A Parameterized Algorithm for Chordal Sandwich.

[BibT_eX]

[DOI]

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

2009

Interval Completion Is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Minimal split completions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Dynamically maintaining split graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

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

[BibT_eX]

[DOI]

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

Choosability of P5-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Polar Permutation Graphs.

[BibT_eX]

[DOI]

Tínaz Ekim

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

Bandwidth on AT-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Edge Search Number of Cographs in Linear Time.

[BibT_eX]

[DOI]

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

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Fast Computation of Minimal Fill Inside A Given Elimination Ordering.

[BibT_eX]

[DOI]

Barry W. Peyton

SIAM J. Matrix Anal. Appl., 2008

Minimal comparability completions of arbitrary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

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

[BibT_eX]

[DOI]

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

Graphs of Linear Clique-Width at Most 3.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

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

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

Clustering with Partial Information.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Bandwidth of Bipartite Permutation Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Faster Parameterized Algorithms for Minimum Fill-In.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Mixed Search Number of Permutation Graphs.

[BibT_eX]

[DOI]

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

2007

Linear-time certifying recognition algorithms and forbidden induced subgraphs.

[BibT_eX]

Nord. J. Comput., 2007

Mixed Search Number and Linear-Width of Interval and Split Graphs.

[BibT_eX]

[DOI]

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

Interval completion with few edges.

[BibT_eX]

[DOI]

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

Characterizing Minimal Interval Completions.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

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

[BibT_eX]

[DOI]

J. Algorithms, 2006

A completely dynamic algorithm for split graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Optimal broadcast domination in polynomial time.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Discret. Math., 2006

Minimal triangulations of graphs: A survey.

[BibT_eX]

[DOI]

Discret. Math., 2006

A vertex incremental approach for maintaining chordality.

[BibT_eX]

[DOI]

Discret. Math., 2006

Optimal Linear Arrangement of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Minimal Split Completions of Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.

[BibT_eX]

[DOI]

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

2005

Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376).

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Daniel Lokshtanov

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

Computing minimal triangulations in time O(nalpha log n) = o(n2.376).

[BibT_eX]

[DOI]

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

Exact Algorithms for Graph Homomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Minimal Interval Completions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2004

Finding k Disjoint Triangles in an Arbitrary Graph.

[BibT_eX]

[DOI]

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

Simple and Efficient Modifications of Elimination Orderings.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing, 2004

2003

The Minimum Degree Heuristic and the Minimal Triangulation Process.

[BibT_eX]

[DOI]

Geneviève Simonet

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

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Generalized H-Coloring and H-Covering of Trees.

[BibT_eX]

[DOI]

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

Maximum Cardinality Search for Computing Minimal Triangulations.

[BibT_eX]

[DOI]

Jean R. S. Blair

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

Efficient Implementation of a Minimal Triangulation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

A practical algorithm for making filled graphs minimal.

[BibT_eX]

[DOI]

Jean R. S. Blair

Theor. Comput. Sci., 2001

2000

Methods for Large Scale Total Least Squares Problems.

[BibT_eX]

[DOI]

Åke Björck

P. Matstoms

SIAM J. Matrix Anal. Appl., 2000

Recognizing Weakly Triangulated Graphs by Edge Separability.

[BibT_eX]

[DOI]

Jean Paul Bordat

Proceedings of the Algorithm Theory, 2000

1998

Partitioning Graphs into Generalized Dominating Sets.

[BibT_eX]

Nord. J. Comput., 1998

1996

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.

[BibT_eX]

[DOI]

Jean R. S. Blair