The Library
Browse by Warwick Author
Up a level |
Number of items: 10.
Collins, A., Foniok, J., Korpelainen, Nicholas, Lozin, Vadim V. and Zamaraev, Victor (2018) Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Applied Mathematics, 248 . pp. 145-152. doi:10.1016/j.dam.2017.02.012 ISSN 0166-218X.
Korpelainen, Nicholas, Lozin, Vadim V. and Mayhill, Colin (2014) Split permutation graphs. Graphs and Combinatorics, Volume 30 (Number 3). pp. 633-646. doi:10.1007/s00373-013-1290-3 ISSN 0911-0119.
Korpelainen, Nicholas (2012) Boundary properties of graphs. PhD thesis, University of Warwick.
Korpelainen, Nicholas, Lozin, Vadim V., Malyshev, Dmitriy S. and Tiskin, Alexander (2011) Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, Vol.412 (No.29). pp. 3545-3554. doi:10.1016/j.tcs.2011.03.001 ISSN 0304-3975.
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, Vol.159 (No.7). pp. 521-531. doi:10.1016/j.dam.2010.03.011 ISSN 0166-218X.
Korpelainen, Nicholas and Lozin, Vadim V. (2011) Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory, Volume 67 (Number 3). pp. 235-249. doi:10.1002/jgt.20528 ISSN 0364-9024.
Korpelainen, Nicholas and Lozin, Vadim V. (2011) Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics & Theoretical Computer Science, Vol.311 (No.16). pp. 1813-1822. doi:10.1016/j.disc.2011.04.023 ISSN 1365-8050.
Korpelainen, Nicholas, Lozin, Vadim V. and Tiskin, Alexander (2010) Hamiltonian cycles in subcubic graphs : what makes the problem difficult. In: Kratochvil, J and Li, A and Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation. Lecture Notes in Computer Science, Vol.6108 . Springer, pp. 320-327. ISBN 9783642135613
Korpelainen, Nicholas and Lozin, Vadim V. (2009) Bipartite graphs of large clique-width. In: 20th International Workshop on Combinatorial Algorithms, Hradec nad Moravici, Czech Republic, June 28-JUL 02, 2009. Published in: Lecture Notes in Computer Science, Vol.5874 pp. 385-395. ISBN 978-3-642-10216-5. doi:10.1007/978-3-642-10217-2_38 ISSN 0302-9743.
Korpelainen, Nicholas (2009) A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs. Electronic Notes in Discrete Mathematics, Vol.32 . pp. 133-140. doi:10.1016/j.endm.2009.02.018 ISSN 1571-0653.
This list was generated on Fri Apr 19 14:27:16 2024 BST.