Nicholas Korpelainen

According to our database, Nicholas Korpelainen authored at least 17 papers between 2009 and 2019.

Collaborative distances:

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

2019

Preface.

Nicholas Korpelainen, Ovidiu Bagdasar, Peter J. Larcombe

Electron. Notes Discret. Math., 2019

2018

An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants.

Nicholas Korpelainen, Mathew Stubley

Electron. Notes Discret. Math., 2018

A Boundary Class for the k-Path Partition Problem.

Nicholas Korpelainen

Electron. Notes Discret. Math., 2018

Infinitely many minimal classes of graphs of unbounded clique-width.

Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev

Discret. Appl. Math., 2018

2017

Linear Clique-Width for Hereditary Classes of Cographs.

Robert Brignall, Nicholas Korpelainen, Vincent Vatter

J. Graph Theory, 2017

2016

A New Graph Construction of Unbounded Clique-width.

Nicholas Korpelainen

Electron. Notes Discret. Math., 2016

2015

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.

Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter

Electron. J. Comb., 2015

2014

Dominating induced matchings in graphs without a skew star.

Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell

J. Discrete Algorithms, 2014

Split Permutation Graphs.

Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill

Graphs Comb., 2014

2013

Boundary Properties of Well-Quasi-Ordered Sets of Graphs.

Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon

Order, 2013

2011

Boundary properties of graphs for algorithmic graph problems.

Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin

Theor. Comput. Sci., 2011

Bipartite induced subgraphs and well-quasi-ordering.

Nicholas Korpelainen, Vadim V. Lozin

J. Graph Theory, 2011

Two forbidden induced subgraphs and well-quasi-ordering.

Nicholas Korpelainen, Vadim V. Lozin

Discret. Math., 2011

On the complexity of the dominating induced matching problem in hereditary classes of graphs.

Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin

Discret. Appl. Math., 2011

2010

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.

Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin

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

2009

A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs.

Nicholas Korpelainen

Electron. Notes Discret. Math., 2009

Bipartite Graphs of Large Clique-Width.

Nicholas Korpelainen, Vadim V. Lozin

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