Nicholas Korpelainen

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Preface.
Electron. Notes Discret. Math., 2019

2018
An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants.
Electron. Notes Discret. Math., 2018

A Boundary Class for the k-Path Partition Problem.
Electron. Notes Discret. Math., 2018

Infinitely many minimal classes of graphs of unbounded clique-width.
Discret. Appl. Math., 2018

2017
Linear Clique-Width for Hereditary Classes of Cographs.
J. Graph Theory, 2017

2016
A New Graph Construction of Unbounded Clique-width.
Electron. Notes Discret. Math., 2016

2015
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.
Electron. J. Comb., 2015

2014
Dominating induced matchings in graphs without a skew star.
J. Discrete Algorithms, 2014

Split Permutation Graphs.
Graphs Comb., 2014

2013
Boundary Properties of Well-Quasi-Ordered Sets of Graphs.
Order, 2013

2011
Boundary properties of graphs for algorithmic graph problems.
Theor. Comput. Sci., 2011

Bipartite induced subgraphs and well-quasi-ordering.
J. Graph Theory, 2011

Two forbidden induced subgraphs and well-quasi-ordering.
Discret. Math., 2011

On the complexity of the dominating induced matching problem in hereditary classes of graphs.
Discret. Appl. Math., 2011

2010
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.
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.
Electron. Notes Discret. Math., 2009

Bipartite Graphs of Large Clique-Width.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009


  Loading...