The Library
Browse by Warwick Author
Up a level |
Jump to: DIMAP | DIMAP - Center for Discrete Mathematics and its Applications at the University of Warwick | Engineering and Physical Sciences Research Council (EPSRC) | European Community | FAP | Gosudarstvennyĭ universitet Vysshai︠a︡ shkola ėkonomiki (Russia) (GU VShĖ) | Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFFI) | University of Warwick | University of Warwick. Centre for Discrete Mathematics and Its Applications (DIMAP)
Number of items: 9.
DIMAP
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
DIMAP - Center for Discrete Mathematics and its Applications at the University of Warwick
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.
Engineering and Physical Sciences Research Council (EPSRC)
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
European Community
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.
FAP
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.
Gosudarstvennyĭ universitet Vysshai︠a︡ shkola ėkonomiki (Russia) (GU VShĖ)
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.
Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFFI)
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.
University of Warwick
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.
University of Warwick. Centre for Discrete Mathematics and Its Applications (DIMAP)
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.
This list was generated on Tue Apr 23 18:27:42 2024 BST.