The Library
Browse by Warwick Author
Up a level |
Number of items: 102.
Journal Article
Alecu, Bogdan, Lozin, Vadim V., Quiroz, Daniel A., Rabinovich, Roman, Razgon, Igor and Zamaraev, Viktor (2024) The treewidth and pathwidth of graph unions. SIAM Journal on Discrete Mathematics, 38 (1). pp. 261-276. doi:10.1137/22M1524047 ISSN 0895-4801.
Lozin, Vadim V. (2024) Ramsey numbers and graph parameters. Graphs and Combinatorics, 40 (2). 29. doi:10.1007/s00373-024-02755-y ISSN 1435-5914.
Lozin, Vadim V. and Zamaraev, Viktor (2024) Union-closed sets and Horn Boolean functions. Journal of Combinatorial Theory, Series A, 202 . 105818. doi:10.1016/j.jcta.2023.105818 ISSN 0097-3165.
Dallard, ClΓ©ment, Lozin, Vadim V., MilaniΔ, Martin, Ε torgel, Kenny and Zamaraev, Viktor (2024) Functionality of box intersection graphs. Results in Mathematics, 79 . 48. doi:10.1007/s00025-023-02075-2 ISSN 1422-6383 .
Alecu, Bogdan, Lozin, Vadim V. and Malyshev, Dmitriy (2024) Critical properties of bipartite permutation graphs. Journal of Graph Theory, 105 (1). pp. 34-60. doi:10.1002/jgt.23011 ISSN 0364-9024.
Alecu, B., Alekseev, V.E., Atminas, A., Lozin, Vadim V. and Zamaraev, V. (2023) Graph parameters, implicit representations and factorial properties. Discrete Mathematics, 346 (10). 113573. doi:10.1016/j.disc.2023.113573 ISSN 0012-365X.
Alecu, Bogdan, Atminas, Aistis, Lozin, Vadim V. and Malyshev, Dmitriy (2023) Combinatorics and algorithms for quasi-chain graphs. Algorithmica, 85 . 642-664 . doi:10.1007/s00453-022-01019-6 ISSN 0178-4617.
Lozin, Vadim (2023) Hereditary classes of graphs : a parametric approach. Discrete Applied Mathematics, 325 . pp. 134-151. doi:10.1016/j.dam.2022.10.016 ISSN 0166-218X.
Alecu, Bogdan, Ferguson, Robert, KantΓ©, Mamadou Moustapha, Lozin, Vadim V., Vatter, Vincent and Zamaraev, Viktor (2022) Letter graphs and geometric grid classes of permutations. SIAM Journal on Discrete Mathematics, 36 (4). pp. 2774-2797. doi:10.1137/21M1449646 ISSN 0895-4801.
Lozin, Vadim V., Zamaraev, Viktor, Zamaraeva, Elena and Zolotykh, Nikolai Yu (2022) On Boolean threshold functions with minimum specification number. Information and Computation, 289 (Part A). 104926. doi:10.1016/j.ic.2022.104926 ISSN 0890-5401.
Lozin, Vadim V. and Razgon, Igor (2022) Tree-width dichotomy. European Journal of Combinatorics, 103 . p. 103517. doi:10.1016/j.ejc.2022.103517 ISSN 0195-6698.
Alecu, Bogdan, Lozin, Vadim V. and de Werra, Dominique (2022) The micro-world of cographs. Discrete Applied Mathematics, 312 . pp. 3-14. doi:10.1016/j.dam.2021.11.004 ISSN 0166-218X.
Lozin, Vadim V. and Moshkov, Mikhail (2021) Critical properties and complexity measures of read-once Boolean functions. Annals of Mathematics and Artificial Intelligence, 89 . 595-614 . doi:10.1007/s10472-021-09734-6 ISSN 1012-2443.
Atminas, A., Brignall, R., Lozin, Vadim V. and Stacho, J. (2021) Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discrete Applied Mathematics, 295 . pp. 57-69. doi:10.1016/j.dam.2021.02.007 ISSN 0166-218X.
Alecu, Bogdan, Atminas, Aistis, Lozin, Vadim V. and Zamaraev, Viktor (2021) Graph classes with linear Ramsey numbers. Discrete Mathematics, 344 (4). 112307. doi:10.1016/j.disc.2021.112307 ISSN 0012-365X.
Alecu, Bogdan, Atminas, Aistis and Lozin, Vadim V. (2021) Graph functionality. Journal of Combinatorial Theory, Series B, 147 . pp. 139-158. doi:10.1016/j.jctb.2020.11.002 ISSN 0095-8956.
Harutyunyan, A., Lampis, M., Lozin, Vadim V. and Monnot, J. (2020) Maximum independent sets in subcubic graphs : new results. Theoretical Computer Science, 846 . pp. 14-26. doi:10.1016/j.tcs.2020.09.010 ISSN 0304-3975.
Alecu, Bogdan, Lozin, Vadim V., Werra, Dominique de and Zamaraev, Viktor (2020) Letter graphs and geometric grid classes of permutations : characterization and recognition. Discrete Applied Mathematics, 283 . pp. 482-494. doi:10.1016/j.dam.2020.01.038 ISSN 0166-218X.
Alecu, Bogdan, KantΓ©, Mamadou Moustapha, Lozin, Vadim V. and Zamaraev, Viktor (2020) Between clique-width and linear clique-width of bipartite graphs. Discrete Mathematics, 343 (8). 111926. doi:10.1016/j.disc.2020.111926 ISSN 0012-365X.
BlanchΓ©, Alexandre, Dabrowski, Konrad, Johnson, Matthew, Lozin, Vadim V., Paulusma, DaniΓ«l and Zamaraev, Viktor (2020) Clique-width for graph classes closed under complementation. SIAM Journal on Discrete Mathematics, 34 (2). pp. 1107-1147. doi:10.1137/18M1235016 ISSN 0895-4801.
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor (2020) Independent domination versus weighted independent domination. Information Processing Letters, 156 . 105914. doi:10.1016/j.ipl.2020.105914 ISSN 0020-0190.
Dabrowski, Konrad K., Lozin, Vadim V. and Paulusma, DaniΓ«l (2020) Clique-width and Well-Quasi-Ordering of Triangle-Free graph classes. Journal of Computer and System Sciences, 108 . pp. 64-91. doi:10.1016/j.jcss.2019.09.001 ISSN 0022-0000.
Lejeune, Miguel, Lozin, Vadim V., Lozina, Irina, Ragab, Ahmed and Yacout, Soumaya (2019) Recent advances in the theory and practice of logical analysis of data. European Journal of Operational Research, 275 (1). pp. 1-15. doi:10.1016/j.ejor.2018.06.011 ISSN 0377-2217.
Atminas, Aistis, Lozin, Vadim V. and Razgon, Igor (2019) Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation. Journal of Combinatorics, 10 (2). pp. 327-337. doi:10.4310/JOC.2019.v10.n2.a8 ISSN 1942-5600.
Lozin, Vadim V., Razgon, Igor, Zamaraev, Victor, Zamaraeva, Elena and Zolotykh, Nikolai (2018) Linear read-once and related Boolean functions. Discrete Applied Mathematics, 250 . pp. 16-27. doi:10.1016/j.dam.2018.05.001 ISSN 0166-218X.
Lozin, Vadim V., Razgon, Igor, Zamaraev, Viktor, Zamaraeva, Elena and Zolotykh, Nikolai (2018) Linear read-once and related Boolean functions. Discrete Applied Mathematics, 250 . pp. 16-27. doi:10.1016/j.dam.2018.05.001 ISSN 0166-218X.
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.
AbouEisha, Hassan, Hussain, Shahid, Lozin, Vadim V., Monnot, JΓ©rΓ΄me, Ries, Bernard and Zamaraev, Victor (2018) Upper domination : towards a dichotomy through boundary properties. Algorithmica, 80 (10). pp. 2799-2817. doi:10.1007/s00453-017-0346-9 ISSN 0178-4617.
Dabrowski, Konrad K., Lozin, Vadim V. and Paulusma, Daniel (2018) Well-quasi-ordering versus clique-width : new results on bigenic classes. Order, 35 . pp. 253-274. doi:10.1007/s11083-017-9430-7 ISSN 0167-8094.
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.
Lin, Min Chih, Lozin, Vadim V., Moyano, Veronica and Szwarcfiter, Jayme (2018) Perfect edge domination : hard and solvable cases. Annals of Operations Research , 264 (1-2). pp. 287-305. doi:10.1007/s10479-017-2664-3 ISSN 0254-5330.
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.
Atminas, Aistis, Lozin, Vadim V. and Moshkov, M. (2017) WQO is decidable for factorial languages. Information and Computation, 256 . pp. 321-333. doi:10.1016/j.ic.2017.08.001 ISSN 0890-5401.
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.
Collins, Andrew, Kitaev, Sergey and Lozin, Vadim V. (2017) New results on word-representable graphs. Discrete Applied Mathematics, 216 . pp. 136-141. doi:10.1016/j.dam.2014.10.024 ISSN 0166-218X.
Lozin, Vadim V. and Malyshev, D. S. (2017) Vertex coloring of graphs with few obstructions. Discrete Applied Mathematics, 216 . pp. 273-280. doi:10.1016/j.dam.2015.02.015 ISSN 0166-218X.
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 K., Lozin, Vadim V., de Werra, Dominique and Zamaraev, Viktor (2016) Combinatorics and algorithms for augmenting graphs. Graphs and Combinatorics, 32 (4). pp. 1339-1352. doi:10.1007/s00373-015-1660-0 ISSN 0911-0119.
Brignall, Robert, Lozin, Vadim V. and Stacho, Juraj (2016) Bichain graphs : Geometric model and universal graphs. Discrete Applied Mathematics, 199 . pp. 16-29. doi:10.1016/j.dam.2014.08.031 ISSN 0166-218X.
Atminas, Aistis, Collins, Andrew, Foniok, J. and Lozin, Vadim V. (2016) Deciding the Bell number for hereditary graph properties. SIAM Journal on Discrete Mathematics, 30 (2). pp. 1015-1031. doi:10.1137/15M1024214 ISSN 0895-4801.
Lozin, Vadim V. and Zamaraev, Victor (2015) Boundary properties of factorial classes of graphs. Journal of Graph Theory, Volume 78 (Number 3). pp. 207-218. doi:10.1002/jgt.21799 ISSN 0364-9024.
Lozin, Vadim V. and Purcell, Christopher (2014) Coloring vertices of claw-free graphs in three colors. Journal of Combinatorial Optimization, Volume 28 (Number 2). pp. 462-479. doi:10.1007/s10878-012-9577-5 ISSN 1382-6905.
Korpelainen, Nicholas, Lozin, Vadim V. and Purcell, Christopher (2014) Dominating induced matchings in graphs without a skew star. Journal of Discrete Algorithms, Volume 26 . pp. 45-55. doi:10.1016/j.jda.2013.11.002 ISSN 1570-8667.
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, Lozin, Vadim V. and Razgon, Igor (2013) Boundary properties of well-quasi-ordered sets of graphs. Order, Volume 30 (Number 3). pp. 723-735. doi:10.1007/s11083-012-9272-2 ISSN 0167-8094.
Lozin, Vadim V. and Purcell, Christopher (2013) Boundary properties of the satisfiability problems. Information Processing Letters, Volume 113 (Number 9). pp. 313-317. doi:10.1016/j.ipl.2013.01.022 ISSN 0020-0190.
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.
Dabrowski, Konrad K., Lozin, Vadim V. and Stacho, Juraj (2013) Stable-Ξ partitions of graphs. Discrete Applied Mathematics, Volume 182 (Number 1). pp. 104-114. doi:10.1016/j.dam.2013.07.001 ISSN 0166-218X.
Lozin, Vadim V. and Milanic, Martin (2013) Critical properties of graphs of bounded clique-width. Discrete Mathematics, Volume 313 (Number 9). pp. 1035-1044. doi:10.1016/j.disc.2013.01.008 ISSN 0012-365X.
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.
Dabrowski, Konrad, Lozin, Vadim V. and Zamaraev, Victor (2012) On factorial properties of chordal bipartite graphs. Discrete Mathematics, Vol.312 (No.16). pp. 2457-2465. doi:10.1016/j.disc.2012.04.010 ISSN 0012-365X.
Dabrowski, Konrad K., Lozin, Vadim V., Raman, Rajiv and Ries, Bernard (2012) Colouring vertices of triangle-free grapshs without forest. Discrete Mathematics, Vol. 312 (No. 7). pp. 1372-1385. doi:10.1016/j.disc.2011.12.012 ISSN 0012365X.
Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor (2012) Locally bounded coverings and factorial properties of graphs. European Journal of Combinatorics, Vol.33 (No.4). pp. 534-543. doi:10.1016/j.ejc.2011.10.006 ISSN 0195-6698.
Lozin, Vadim V. and Mosca, Raffaele (2012) Maximum regular induced subgraphs in -free graphs. Theoretical Computer Science, Vol. 460 . pp. 26-33. doi:10.1016/j.tcs.2012.06.014 ISSN 03043975.
Cardoso, D. M. and Lozin, Vadim V. (2012) On hereditary properties of the class of graphs with convex quadratic stability number. Journal of Mathematical Sciences, Vol.182 (No.2). pp. 227-232. doi:10.1007/s10958-012-0743-1 ISSN 1072-3374.
Dabrowski, Konrad, Lozin, Vadim V., MΓΌller, Haiko and Rautenbach, Dieter (2012) Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Journal of Discrete Algorithms, Vol.14 . pp. 207-213. doi:10.1016/j.jda.2011.12.012 ISSN 1570-8667.
Lozin, Vadim V. (2011) Minimal classes of graphs of unbounded clique-width. Annals of Combinatorics, Vol.15 (No.4). pp. 707-722. doi:10.1007/s00026-011-0117-2 ISSN 0218-0006.
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.
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.
Lozin, Vadim V. and Mayhill, Colin (2011) Canonical antichains of unit interval and bipartite permutation graphs. Order, Vol. 28 (No. 3). pp. 513-522. doi:10.1007/s11083-010-9188-7 ISSN 0167-8094.
Lozin, Vadim V. (2011) Stability preserving transformations of graphs. Annals of Operations Research , vol.188 (No.1). pp. 331-341. doi:10.1007/s10479-008-0395-1 ISSN 0254-5330.
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.
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.
Lozin, Vadim V. and Milanic, Martin (2010) On the maximum independent set problem in subclasses of planar graphs. Journal of Graph Algorithms and Applications, Vol.14 (No.2). pp. 269-286. ISSN 1526-1719.
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.
Brandstaedt, Andreas, Klembt, Tilo, Lozin, Vadim V. and Mosca, Raffaele (2010) On independent vertex sets in subclasses of apple-free graphs. Algorithmica, Vol.56 (No.4). pp. 383-393. doi:10.1007/s00453-008-9176-0 ISSN 0178-4617.
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. (2009) Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 127-131. doi:10.1016/j.endm.2009.07.021 ISSN 1571-0653.
Allen, Peter, Lozin, Vadim V. and Rao, Michael (2009) Clique-width and the speed of hereditary properties. Electronic Journal of Combinatorics, Vol.16 (No.1). Article no. R35. ISSN 1077-8926.
Lozin, Vadim V. and Mosca, Raffaele (2009) Maximum independent sets in subclasses of P-5-free graphs. Information Processing Letters, Vol.109 (No.6). pp. 319-324. doi:10.1016/j.ipl.2008.11.005 ISSN 0020-0190.
Cardoso, Domingos M. and Lozin, Vadim V. (2009) Dominating induced matchings. Lecture Notes in Computer Science, Vol.5420 . pp. 77-86. doi:10.1007/978-3-642-02029-2_8 ISSN 0302-9743.
Lozin, Vadim V. and Milanic, Martin (2008) A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Journal of Discrete Algorithms, Vol.6 (No.4). pp. 595-604. doi:10.1016/j.jda.2008.04.001 ISSN 1570-8667.
Lozin, Vadim V. (2008) Gearing optimization. Optimization and Engineering, Vol.9 (No.2). pp. 201-211. doi:10.1007/s11081-007-9028-9 ISSN 1389-4420.
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.
Lozin, Vadim V. (2008) Boundary classes of planar graphs. Combinatorics, Probability & Computing, Vol.17 (No.2). pp. 287-295. doi:10.1017/S0963548307008814 ISSN 0963-5483.
Lozin, Vadim V. (2008) Graph representation functions computable by finite automata. Journal of Automata, Languages and Combinatorics, Vol.13 (No.1). pp. 73-90. ISSN 1430-189X.
Alekseev, Vladimir E., Lozin, Vadim V., Malyshev, Dmitriy and MilaniΔ, Martin (2008) The maximum independent set problem in planar graphs. Lecture Notes in Computer Science, Vol.5162 . pp. 96-107. doi:10.1007/978-3-540-85238-4_7 ISSN 0302-9743.
HoΓ ng, ChΓnh T., KamiΕski, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao (2008) A note on k-colorability of P 5-free graphs. Lecture Notes in Computer Science, Vol.5162 . pp. 387-394. doi:10.1007/978-3-540-85238-4_31 ISSN 0302-9743.
Alekseev, V. E., Boliac, R., Korobitsyn, D. V. and Lozin, Vadim V. (2007) NP-hard graph problems and boundary classes of graphs. Theoretical Computer Science, Vol.389 (No.1-2). pp. 219-236. doi:10.1016/j.tcs.2007.09.013 ISSN 0304-3975.
Book Item
Lozin, Vadim V., Monnot, JΓ©rΓ΄me and Ries, Bernard (2013) On the maximum independent set problem in subclasses of subcubic graphs. In: Lecroq , Thierry and Mouchard, Laurent , (eds.) Combinatorial Algorithms. Lecture Notes in Computer Science, Volume 8288 . Berlin Heidelberg: Springer, pp. 314-326. ISBN 9783642452789
Atminas, Aistis, Lozin, Vadim V. and Razgon, Igor (2012) Linear time algorithm for computing a small biclique in graphs without long induced paths. In: Algorithm Theory β SWAT 2012. Algorithm Theory β SWAT 2012 Book Subtitle 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings, Vol.7357 . London : Springer, pp. 142-152.
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
Lozin, Vadim V. and Milanic, Martin (2007) Tree-width and optimization in bounded degree graphs. In: Brandstadt, A. and Kratsch, D. and Muller, H., (eds.) Graph-Theoretic Concepts in Computer Science :33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Lecture Notes in Computer Science, Volume 4769 . Berlin Heidelberg: Springer Verlag, pp. 45-54. ISBN 9783540748380
Conference Item
Alecu, Bogdan, Alekseev, Vladimir E., Atminas, Aistis, Lozin, Vadim V. and Zamaraev, Viktor (2022) Graph parameters, implicit representations and factorial properties. In: IWOCA 2022 : 33rd International Workshop on Combinatorial Algorithms, Trier, Germany, 7-9 Jun 2022. Published in: IWOCA 2022: Combinatorial Algorithms, 13270 pp. 60-72. ISBN 9783031066771. doi:10.1007/978-3-031-06678-8_5 ISSN 0302-9743.
Atminas, Aistis and Lozin, Vadim V. (2022) Deciding atomicity of subword-closed languages. In: International Conference on Developments in Language Theory, Tampa, FL, USA, 09-13 May 2022. Published in: Developments in Language Theory, 13257 pp. 69-77. ISBN 9783031055775. doi:10.1007/978-3-031-05578-2_5 ISSN 0302-9743.
Lozin, Vadim V. (2018) Graph Parameters and Ramsey Theory. In: International Workshop on Combinatorial Algorithms , 10765 pp. 185-194. doi:10.1007/978-3-319-78825-8_15 ISSN 0302-9743.
Dabrowski, Konrad K., Lozin, Vadim V. and Paulusma, DaniΓ«l (2017) Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. In: International Workshop on Graph-Theoretic Concepts in Computer Science , Eindhoven, The Netherlands , 21-23 June . Published in: Graph-Theoretic Concepts In Computer Science, 10520 pp. 220-233. doi:10.1007/978-3-319-68705-6_17 ISSN 0302-9743.
Lozin, Vadim V., Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor (2017) New Results on Weighted Independent Domination. In: International Workshop on Graph-Theoretic Concepts in Computer Science , Eindhoven, The Netherlands , 21-23 June . Published in: Graph-Theoretic Concepts In Computer Science, 10520 pp. 399-411. doi:10.1007/978-3-319-68705-6_30 ISSN 0302-9743.
Lozin, Vadim V., Razgon, Igor and Zamaraev, Viktor (2016) Well-quasi-ordering does not imply bounded clique-width. In: WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science , Garching, 17 - 19 Jun 2015. Published in: Proceeding WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9224, 9224 pp. 351-359. ISBN 9783662531730 . doi:10.1007/978-3-662-53174-7_25 ISSN 0302-9743.
AbouEisha, Hassan, Hussain, Shahid, Lozin, Vadim V., Monnot, JΓ©rΓ΄me, Ries, Bernard and Zamaraev, Viktor (2016) A boundary property for upper domination. In: UNSPECIFIED. Published in: IWOCA 2016: Combinatorial Algorithms, 9843 pp. 229-240. doi:10.1007/978-3-319-44543-4_18 ISSN 0302-9743.
Dabrowski, Konrad, Lozin, Vadim V., Muller, H. and Rautenbach, Dieter (2011) Parameterized algorithms for the independent set problem in some hereditary graph classes. In: 21st International Workshop on Combinatorial Algorithms, KCL Dept Informat, London, England, 26-28 Jul 2010 . Published in: Lecture Notes in Computer Science, Vol.6460 pp. 1-9. doi:10.1007/978-3-642-19222-7_1 ISSN 0302-9743.
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.
Kaminski, Marcin, Lozin, Vadim V. and Milanic, Martin (2009) Recent developments on graphs of bounded clique-width. In: 2nd Workshop on Graph Classes, Optimization and Width Parameters, Prague, Czech Republic, October, 2005. Published in: Discrete Applied Mathematics, Vol.157 (No.12 Sp. Iss. SI). pp. 2747-2761. doi:10.1016/j.dam.2008.08.022 ISSN 0166-218X.
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.
Lozin, Vadim V. and Milanic, Martin (2008) On finding augmenting graphs. In: 5th International Conference on Graphs and Optimization, Leukerbad, Switzerland , Aug, 2006. Published in: Discrete Applied Mathematics, Volume 156 (Number 13). pp. 2517-2529. doi:10.1016/j.dam.2008.03.008 ISSN 0166-218X.
Lozin, Vadim V. (2008) From tree-width to clique-width : excluding a unit interval graph. In: 19th International Symposium on Algorithms and Computations (ISAAC 2008), Gold Coast, Australia, Dec 15-17, 2008. Published in: Lecture Notes in Computer Science, Vol.5369 pp. 871-882. ISBN 978-3-540-92181-3. doi:10.1007/978-3-540-92182-0 ISSN 0302-9743.
BrandstΓ€dt, Andreas, Klembt, Tilo, Lozin, Vadim V. and Mosca, Raffaele (2008) Independent sets of maximum weight in apple-free graphs. In: 19th international symposium, ISAAC 2008, Gold Coast, Australia, 15-17 Dec 2008. Published in: Lecture Notes in Computer Science, Vol.5369 pp. 848-858. doi:10.1007/978-3-540-92182-0_74 ISSN 0302-9743.
Book
Chikalov, I., Lozin, Vadim V., Lozina, I., Moshkov, M., Nguyen, H. S., Slowron, A. and Zielosko, B. (2013) Three approaches to data analysis. Intelligent Systems Reference Library . London : Springer. ISBN 9783642286667
This list was generated on Fri Apr 19 20:04:57 2024 BST.