The Library
Browse by Warwick Author
Up a level |
Jump to: Centre for Discrete Mathematics and its Applications (DIMAP) | DIMAP | DIMAP (the Centre for Discrete Mathematics and its Applications at the University of Warwick) | DIMAP - Center for Discrete Mathematics and its Applications at the University of Warwick | Engineering and Physical Sciences Research Council (EPSRC) | European Community | FAP | French Agency for Research under the DEFIS program TODO | Gosudarstvennyĭ universitet Vysshai︠a︡ shkola ėkonomiki (Russia) (GU VShĖ) | NSERC | Portugal. Fundação para a Ciência e a tecnologia [Foundation for Science and Technology] (FCT) | Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFBR) | Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFFI) | Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFFI) | Russia (Federation). President's grant (RFPG) | Russia. Национальный исследовательский университет [Higher School of Economics] | University of Warwick | University of Warwick. Centre for Discrete Mathematics and Its Applications | University of Warwick. Centre for Discrete Mathematics and Its Applications (DIMAP)
Number of items: 32.
Centre for Discrete Mathematics and its Applications (DIMAP)
Dabrowski, Konrad, Demange, Marc and Lozin, Vadim V. (2013) New results on maximum induced matchings in bipartite graphs and beyond. Theoretical Computer Science, Volume 478 . pp. 33-40. doi:10.1016/j.tcs.2013.01.027 ISSN 0304-3975.
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 (the Centre for Discrete Mathematics and its Applications at the University of Warwick)
Lozin, Vadim V. (2010) A decidability result for the dominating set problem. Theoretical Computer Science, Vol.411 (No.44-46). pp. 4023-4027. doi:10.1016/j.tcs.2010.08.027 ISSN 0304-3975.
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)
Hertz, Alain, Lozin, Vadim V., Ries, Bernard, Zamaraev, Victor and de Werra, Dominique (2018) Dominating induced matchings in graphs containing no long claw. Journal of Graph Theory, 88 (1). pp. 18-39. doi:10.1002/jgt.22182 ISSN 0364-9024.
Lozin, Vadim V., Razgon, Igor and Zamaraev, Viktor (2018) Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory, Series B, 130 . pp. 1-18. doi:10.1016/j.jctb.2017.09.012 ISSN 0095-8956.
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Victor (2017) More results on weighted independent domination. Theoretical Computer Science, 700 . pp. 63-74. doi:10.1016/j.tcs.2017.08.007 ISSN 0304-3975.
Lozin, Vadim V. and Zamaraev, Victor (2017) The structure and the number of $P_7$-free bipartite graphs. European Journal of Combinatorics, 65 . pp. 143-153. doi:10.1016/j.ejc.2017.05.008 ISSN 0195-6698.
Cardoso, Domingos M., Lozin, Vadim V., Luz, Carlos J. and Pacheco, Maria F. (2016) Efficient domination through eigenvalues. Discrete Applied Mathematics, 214 . pp. 54-62. doi:10.1016/j.dam.2016.06.014 ISSN 0166-218X.
Lozin, Vadim V. (2016) From matchings to independent sets. Discrete Applied Mathematics, 231 . pp. 4-14. doi:10.1016/j.dam.2016.04.012 ISSN 0166-218X.
Dabrowski, Konrad, Demange, Marc and Lozin, Vadim V. (2013) New results on maximum induced matchings in bipartite graphs and beyond. Theoretical Computer Science, Volume 478 . pp. 33-40. doi:10.1016/j.tcs.2013.01.027 ISSN 0304-3975.
Lozin, Vadim V., Mosca, Raffaele and Purcell, Christopher (2013) Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optimization, Volume 10 (Number 4). pp. 304-309. doi:10.1016/j.disopt.2013.08.001 ISSN 1572-5286.
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
Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor (2011) A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, Vol.18 (No.1). p. 157. ISSN 2150-959X.
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.
French Agency for Research under the DEFIS program TODO
Dabrowski, Konrad, Demange, Marc and Lozin, Vadim V. (2013) New results on maximum induced matchings in bipartite graphs and beyond. Theoretical Computer Science, Volume 478 . pp. 33-40. doi:10.1016/j.tcs.2013.01.027 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.
NSERC
Hoang, Chinh T., Kaminski, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao (2010) Deciding k-colorability of P5-free graphs in polynomial time. Algorithmica, Vol.57 (No.1). pp. 74-81. doi:10.1007/s00453-008-9197-8 ISSN 0178-4617.
Portugal. Fundação para a Ciência e a tecnologia [Foundation for Science and Technology] (FCT)
Cardoso, Domingos M., Lozin, Vadim V., Luz, Carlos J. and Pacheco, Maria F. (2016) Efficient domination through eigenvalues. Discrete Applied Mathematics, 214 . pp. 54-62. doi:10.1016/j.dam.2016.06.014 ISSN 0166-218X.
Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFBR)
Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor (2011) A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, Vol.18 (No.1). p. 157. ISSN 2150-959X.
Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFFI)
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Victor (2017) More results on weighted independent domination. Theoretical Computer Science, 700 . pp. 63-74. doi:10.1016/j.tcs.2017.08.007 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.
Russia (Federation). President's grant (RFPG)
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Victor (2017) More results on weighted independent domination. Theoretical Computer Science, 700 . pp. 63-74. doi:10.1016/j.tcs.2017.08.007 ISSN 0304-3975.
Russia. Национальный исследовательский университет [Higher School of Economics]
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Victor (2017) More results on weighted independent domination. Theoretical Computer Science, 700 . pp. 63-74. doi:10.1016/j.tcs.2017.08.007 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
Lozin, Vadim V., Mosca, Raffaele and Purcell, Christopher (2013) Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optimization, Volume 10 (Number 4). pp. 304-309. doi:10.1016/j.disopt.2013.08.001 ISSN 1572-5286.
Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor (2011) A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, Vol.18 (No.1). p. 157. ISSN 2150-959X.
Dabrowski, Konrad, Lozin, Vadim V., Raman, Rajiv and Ries, Bernard (2010) Colouring vertices of triangle-free graphs. In: 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Zaros, Greece, 28-30 Jun 2010. Published in: Lecture Notes in Computer Science, Volume 6410 pp. 184-195. doi:10.1007/978-3-642-16926-7_18 ISSN 0302-9743.
Brandstädt, Andreas, Lozin, Vadim V. and Mosca, Raffaele (2010) Independent sets of maximum weight in apple-free graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.1). pp. 239-254. doi:10.1137/090750822 ISSN 0895-4801.
Lozin, Vadim V. and Volz, Jordan (2008) The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Science, Volume 19 (Number 2). pp. 477-494. doi:10.1142/S0129054108005772 ISSN 0129-0541.
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 Thu Mar 28 18:06:49 2024 GMT.