Nicholas Korpelainen

Publication Activity (10 Years)

Years Active: 2009-2019
Publications (10 Years): 7

Top Topics

Graph Construction

Top Venues

Electron. Notes Discret. Math.

Electron. J. Comb.

Publications

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