Dieter Kratsch

Christian Komusiewicz

J. Comput. Syst. Sci., 2022

2020

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms.

[BibT_eX]

[DOI]

Christian Komusiewicz

Discret. Appl. Math., 2020

Enumeration of minimal connected dominating sets for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Enumeration of maximal irredundant sets for claw-free graphs.

[BibT_eX]

[DOI]

Mohamed Yosri Sayadi

Theor. Comput. Sci., 2019

Enumeration and maximum number of minimal dominating sets for chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Enumeration and maximum number of maximal irredundant sets for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs.

[BibT_eX]

[DOI]

Frank Kammer

Moritz Laudahn

Algorithmica, 2019

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

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Finding Cactus Roots in Polynomial Time.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Computing square roots of graphs with low maximum degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Exact algorithms for weak Roman domination.

[BibT_eX]

[DOI]

Mathieu Chapelle

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Sigve Hortemo Sæther

Yngve Villanger

Algorithmica, 2018

2017

A linear kernel for finding square roots of almost planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Exact exponential algorithms to find tropical connected sets of minimum size.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Minimal dominating sets in interval graphs and trees.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Yngve Villanger

Discret. Appl. Math., 2017

Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday.

[BibT_eX]

[DOI]

Feodor F. Dragan

Discret. Appl. Math., 2017

Enumerating Minimal Tropical Connected Sets.

[BibT_eX]

[DOI]

Mohamed Yosri Sayadi

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

2016

Exact Algorithms for Dominating Set.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Algorithms solving the Matching Cut problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Enumerating minimal connected dominating sets in graphs of bounded chordality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Squares of Low Clique Number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Yngve Villanger

Discret. Appl. Math., 2016

Squares of Low Maximum Degree.

[BibT_eX]

[DOI]

CoRR, 2016

Guest Editorial: Selected Papers from WG 2014.

[BibT_eX]

[DOI]

Algorithmica, 2016

Parameterized Algorithms for Finding Square Roots.

[BibT_eX]

[DOI]

Algorithmica, 2016

Finding Shortest Paths Between Graph Colourings.

[BibT_eX]

[DOI]

Algorithmica, 2016

Faster Algorithms to Enumerate Hypergraph Transversals.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Exact algorithms for Kayles.

[BibT_eX]

[DOI]

Sjoerd T. Timmer

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Algorithmica, 2015

List Coloring in the Absence of a Linear Forest.

[BibT_eX]

[DOI]

Algorithmica, 2015

End-Vertices of Graph Search Algorithms.

[BibT_eX]

[DOI]

Daniel Meister

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Subset feedback vertex sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Finding clubs in graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Colouring Reconfiguration Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2014

Enumerating Minimal Subset Feedback Vertex Sets.

[BibT_eX]

[DOI]

Algorithmica, 2014

Exact Algorithms to Clique-Colour Graphs.

[BibT_eX]

[DOI]

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

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Detecting induced minors in AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

Pim van 't Hof

Theor. Comput. Sci., 2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

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

[BibT_eX]

[DOI]

Inf. Comput., 2013

Fully decomposable split graphs.

[BibT_eX]

[DOI]

Hajo Broersma

Gerhard J. Woeginger

Eur. J. Comb., 2013

Computing Optimal Steiner Trees in Polynomial Space.

[BibT_eX]

[DOI]

Algorithmica, 2013

Sparse Square Roots.

[BibT_eX]

[DOI]

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

The Jump Number Problem: Exact and Parameterized.

[BibT_eX]

[DOI]

Stefan Kratsch

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Exact Algorithms for Weak Roman Domination.

[BibT_eX]

[DOI]

Mathieu Chapelle

Anthony Perez

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

Cliques and Clubs.

[BibT_eX]

[DOI]

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

2012

On exact algorithms for treewidth.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

ACM Trans. Algorithms, 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Theory Comput. Syst., 2012

On the parameterized complexity of coloring graphs in the absence of a linear forest.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Bicolored independent sets and bicliques.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

[BibT_eX]

[DOI]

CoRR, 2012

On Independent Sets and Bicliques in Graphs.

[BibT_eX]

[DOI]

Serge Gaspers

Algorithmica, 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

Colouring AT-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Bandwidth on AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

An exact algorithm for the Maximum Leaf Spanning Tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Breaking the 2n-barrier for Irredundance: Two lines of attack.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

Jakub Onufry Wojtaszczyk

J. Discrete Algorithms, 2011

Exact Algorithms for L(2, 1)-Labeling of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

Branch and Recharge: Exact Algorithms for Generalized Domination.

[BibT_eX]

[DOI]

Algorithmica, 2011

Exact Algorithms for Kayles.

[BibT_eX]

[DOI]

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

2010

Exact Exponential Algorithms

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-16533-7, 2010

Iterative compression and exact algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Parameterized algorithm for eternal vertex cover.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

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

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

10441 Abstracts Collection - Exact Complexity of NP-hard Problems.

[BibT_eX]

[DOI]

Proceedings of the Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010, 2010

A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

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

2009

Exponential time algorithms for the minimum dominating set problem on some graph classes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Bandwidth of bipartite permutation graphs in polynomial time.

[BibT_eX]

[DOI]

Daniel Meister

J. Discrete Algorithms, 2009

A measure & conquer approach for the analysis of exact algorithms.

[BibT_eX]

[DOI]

J. ACM, 2009

Sort and Search: Exact algorithms for generalized domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On a property of minimal triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles

[BibT_eX]

[DOI]

CoRR, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Convex Recoloring Revisited: Complexity and Exact Algorithms.

[BibT_eX]

[DOI]

Iyad A. Kanj

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

2008

Exact Algorithms for Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Exact Algorithms for Treewidth and Minimum Fill-In.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

A new characterization of HH-free graphs.

[BibT_eX]

[DOI]

R. Sritharan

Discret. Math., 2008

Feedback vertex set on AT-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Solving Connected Dominating Set Faster than 2 n .

[BibT_eX]

[DOI]

Algorithmica, 2008

Faster Steiner Tree Computation in Polynomial-Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Johan M. M. van Rooij

Ryan Williams

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Executive Summary - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Kazuo Iwama

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Abstracts Collection - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Kazuo Iwama

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

2007

An exact algorithm for the minimum dominating clique problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Linear-time certifying recognition algorithms and forbidden induced subgraphs.

[BibT_eX]

Nord. J. Comput., 2007

Exact Algorithms for Graph Homomorphisms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Exact Algorithms for L (2, 1)-Labeling of Graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05., 2007

2006

Between O(nm) and O(nalpha).

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Minimal fill in O(n2.69) time.

[BibT_eX]

[DOI]

Discret. Math., 2006

Improved bottleneck domination algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the Algorithm Theory, 2006

Measure and conquer: a simple O(20.288n) independent set algorithm.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimal Linear Arrangement of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

On algorithms for (P5, gem)-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms.

[BibT_eX]

Bull. EATCS, 2005

On the structure of (P5, gem)-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Measure and Conquer: Domination - A Case Study.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Algorithms for graphs with small octopus.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Exact (Exponential) Algorithms for the Dominating Set Problem.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

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

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On the Domination Search Number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.

[BibT_eX]

[DOI]

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

Between O(nm) and O(n alpha).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs.

[BibT_eX]

[DOI]

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

2002

Dominating Pair Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Kayles and Nimbers.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Approximating minimum cocolorings.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Inf. Process. Lett., 2002

On claw-free asteroidal triple-free graphs.

[BibT_eX]

[DOI]

Harald Hempel

Discret. Appl. Math., 2002

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2002

2001

On treewidth approximations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Efficient algorithms for graphs with few P4's.

[BibT_eX]

[DOI]

Discret. Math., 2001

Approximating Minimum Cocolourings.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Degree-preserving trees.

[BibT_eX]

[DOI]

Networks, 2000

Finding and counting small induced subgraphs efficiently.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Domination and Total Domination on Asteroidal Triple-free Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Chordality and 2-factors in Tough Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Bandwidth of Split and Circular Permutation Graphs.

[BibT_eX]

[DOI]

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

1999

Independent Sets in Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Approximating the Bandwidth for Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Approximating Bandwidth by Mixing Layouts of Interval Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

On the structure of graphs with bounded asteroidal number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Rankings of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Listing All Minimal Separators of a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Treewidth and Minimum Fill-in on d-Trapezoid Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Minimum Fill-in on Circle and Circular-Arc Graphs.

[BibT_eX]

[DOI]

C. K. Wong

J. Algorithms, 1998

Bandwidth of Chain Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Tree-visibility orders.

[BibT_eX]

[DOI]

Jean-Xavier Rampon

Discret. Math., 1998

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.

[BibT_eX]

[DOI]

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

Degree-Preserving Forests.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Total Domination and Transformation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path.

[BibT_eX]

[DOI]

George Steiner

Inf. Process. Lett., 1997

1-Tough cocomparability graphs are hamiltonian.

[BibT_eX]

[DOI]

George Steiner

Discret. Math., 1997

Measuring the Vulnerability for Classes of Intersection Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Asteroidal Sets in Graphs.

[BibT_eX]

[DOI]

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

1996

Minimal non-neighborhood-perfect graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Width two posets are reconstructible.

[BibT_eX]

[DOI]

Jean-Xavier Rampon

Discret. Math., 1996

Toughness, hamiltonicity and split graphs.

[BibT_eX]

[DOI]

Jenö Lehel

Discret. Math., 1996

1995

Treewidth and Pathwidth of Permutation Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

Treewidth of Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Diametral Path Graphs.

[BibT_eX]

[DOI]

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

1994

On the Complexity of Graph Reconstruction.

[BibT_eX]

[DOI]

Lane A. Hemaspaandra

Math. Syst. Theory, 1994

Book reviews.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1994

Dominating cliques in chordal graphs.

[BibT_eX]

[DOI]

Peter Damaschke

Anna Lubiw

Discret. Math., 1994

On Cocolourings and Cochromatic Numbers of Graphs.

[BibT_eX]

[DOI]

John G. Gimbel

Discret. Appl. Math., 1994

Dominoes.

[BibT_eX]

[DOI]

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

Ranking of Graphs.

[BibT_eX]

[DOI]

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

Finding All Minimal Separators of a Graph.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

On Vertex Ranking for Permutations and Other Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Domination on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

Treewidth of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

The Complexity of Coloring Games on Perfect Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

Some extremal results in cochromatic and dichromatic theory.

[BibT_eX]

[DOI]

Paul Erdös

John G. Gimbel

J. Graph Theory, 1991

1990

Domination in Convex and Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Peter Damaschke

Inf. Process. Lett., 1990

Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs.

[BibT_eX]

[DOI]

Discret. Math., 1990

1987

Finding the Minimum Bandwidth of an Interval Graphs

[BibT_eX]

[DOI]

Inf. Comput., August, 1987

On Domination Problems for Permutation and Other Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1986

On Partitions of Permutations into Increasing and Decreasing Subsequences.

[BibT_eX]

J. Inf. Process. Cybern., 1986

1985

On the restriction of some NP-complete graph problems to permutation graphs.

[BibT_eX]

[DOI]