Currently browsing: Items authored or edited by Nicholas Korpelainen

Cardoso, Domingos M.; Korpelainen, Nicholas and Lozin, Vadim V. (2011). On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Applied Mathematics, 159(7) pp. 521–531.

Korpelainen, Nicholas; Lozin, Vadim V. and Mayhill, Colin (2014). Split permutation graphs. Graphs and Combinatorics, 30(3) pp. 633–646.

Korpelainen, Nicholas; Lozin, Vadim V. and Purcell, Christopher (2014). Dominating induced matchings in graphs without a skew star. Journal of Discrete Algorithms, 26 pp. 45–55.

Korpelainen, Nicholas; Lozin, Vadim V. and Razgon, Igor (2013). Boundary properties of well-quasi-ordered sets of graphs. Order, 30(3) pp. 723–735.

Korpelainen, Nicholas and Lozin, Vadim (2011). Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics, 311(16) pp. 1813–1822.

Korpelainen, Nicholas and Lozin, Vadim V. (2011). Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory, 67(3) pp. 235–249.

Korpelainen, Nicholas; Lozin, Vadim V.; Malyshev, Dmitriy S. and Tiskin, Alexander (2011). Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, 412(29) pp. 3545–3554.

Korpelainen, Nicholas; Lozin, Vadim V. and Tiskin, Alexander (2010). Hamiltonian cycles in subcubic graphs: what makes the problem difficult. In: Theory and Applications of Models of Computation, Springer, pp. 320–327.

Korpelainen, Nicholas (2009). A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs. In: Electronic Notes in Discrete Mathematics, Elsevier, 32 pp. 133–140.

Korpelainen, Nicholas and Lozin, Vadim V. (2009). Bipartite Graphs of Large Clique-Width. In: Combinatorial Algorithms, Springer-Verlag, pp. 385–395.