Nicholas Korpelainen

18 papers C 2Journal 16
YearRankTypeTitle / Venue / Authors
2019 J jnl
Preface.
Electron. Notes Discret. Math.
Nicholas Korpelainen, Ovidiu Bagdasar, Peter J. Larcombe
2018 J jnl
A Boundary Class for the k-Path Partition Problem.
Electron. Notes Discret. Math.
Nicholas Korpelainen
2018 J jnl
An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants.
Electron. Notes Discret. Math.
Nicholas Korpelainen, Mathew Stubley
2018 J jnl
Infinitely many minimal classes of graphs of unbounded clique-width.
Discret. Appl. Math.
Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
2017 J jnl
Infinitely many minimal classes of graphs of unbounded clique-width.
CoRR
Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
2017 J jnl
Linear Clique-Width for Hereditary Classes of Cographs.
J. Graph Theory
Robert Brignall, Nicholas Korpelainen, Vincent Vatter
2016 J jnl
A New Graph Construction of Unbounded Clique-width.
Electron. Notes Discret. Math.
Nicholas Korpelainen
2015 J jnl
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.
Electron. J. Comb.
Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter
2014 J jnl
Dominating induced matchings in graphs without a skew star.
J. Discrete Algorithms
Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell
2014 J jnl
Split Permutation Graphs.
Graphs Comb.
Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill
2013 J jnl
Boundary Properties of Well-Quasi-Ordered Sets of Graphs.
Order
Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon
2011 J jnl
Bipartite induced subgraphs and well-quasi-ordering.
J. Graph Theory
Nicholas Korpelainen, Vadim V. Lozin
2011 J jnl
Boundary properties of graphs for algorithmic graph problems.
Theor. Comput. Sci.
Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin
2011 J jnl
On the complexity of the dominating induced matching problem in hereditary classes of graphs.
Discret. Appl. Math.
Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin
2011 J jnl
Two forbidden induced subgraphs and well-quasi-ordering.
Discret. Math.
Nicholas Korpelainen, Vadim V. Lozin
2010 C conf
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.
TAMC
Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin
2009 J jnl
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs.
Electron. Notes Discret. Math.
Nicholas Korpelainen
2009 C conf
Bipartite Graphs of Large Clique-Width.
IWOCA
Nicholas Korpelainen, Vadim V. Lozin