Nicholas Korpelainen

Available identifiers

Publication	Date of Publication	Type
An inescapable region for the chessboard pebbling problem on four quadrants	2019-04-29	Paper
A boundary class for the \(k\)-path partition problem	2018-10-11	Paper
Infinitely many minimal classes of graphs of unbounded clique-width	2018-09-17	Paper
Linear Clique‐Width for Hereditary Classes of Cographs	2017-04-21	Paper
A new graph construction of unbounded clique-width	2017-02-09	Paper
Well-quasi-order for permutation graphs omitting a path and a clique	2015-05-18	Paper
Split permutation graphs	2014-06-16	Paper
Dominating induced matchings in graphs without a skew star	2014-04-28	Paper
Boundary properties of well-quasi-ordered sets of graphs	2013-11-22	Paper
A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs	2013-07-04	Paper
Two forbidden induced subgraphs and well-quasi-ordering	2011-08-08	Paper
Bipartite induced subgraphs and well-quasi-ordering	2011-07-21	Paper
Boundary properties of graphs for algorithmic graph problems	2011-07-14	Paper
On the complexity of the dominating induced matching problem in hereditary classes of graphs	2011-04-19	Paper
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult	2010-06-17	Paper
Bipartite graphs of large clique-width	2009-12-11	Paper

This page was built for person: Nicholas Korpelainen