163. The role of computer experiments in the theory of word-representable graphs, Algorithms and Complexity Seminar, Durham University, Durham, UK, October 25, 2018

162. Encoding graphs by Words and Patterns, Invited talk at the 2nd IMA Conference on Theoretical and Computational Discrete Mathematics, University of Derby, Derby, UK, September 14, 2018

161. Equidistributions on planar maps via involutions on description trees, Colloquium talk, Yokohama City University, Japan, August 7, 2018

160. New directions of research on Riordan graphs and Riordan matrices, Invited talk at the 5th International Conference on Riordan Arrays and Related Topics (5RART), Busan, Korea, June 29, 2018

159. To the Memory of Jeff Remmel, my Collaborator and Friend, Discrete Analysis Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, June 22, 2018

154. Counting independent sets in graphs, Applied Algebra & Optimization Research Center seminar, Sungkyunkwan University, Korea, November 28, 2017

153. Encoding independent sets of Ferrers graphs by 1s in binary matrices, Applied Algebra & Optimization Research Center seminar, Sungkyunkwan University, Korea, November 28, 2017

151. Interval orders and a hierarchy of combinatorial structures related to them, Invited talk, Applied Algebra & Optimization Research Center seminar, Sungkyunkwan University, Korea, September 15, 2017

150. Introduction to the theory of word-representable graphs, Invited lecture, One-Day Meeting in Combinatorics, Sungkyunkwan University, Korea, September 13, 2017

149. What is a good bijection? A case study on pattern-avoiding permutations, Department of Mathematics Colloquium, Sungkyunkwan University, Korea, September 7, 2017

148. Word-representability of split graphs, Special Lecture, Applied Algebra \& Optimization Research Center seminar, Sungkyunkwan University, Korea, September 4, 2017

147. A comprehensive introduction to the theory of word-representable graphs, Invited Speaker at the 21st International Conference on Developments in Language Theory (DLT 2017), University of Liege, Liege, Belgium, August 7, 2017

146. Word-representable graphs, Discrete Analysis Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, August 4, 2017

145. On a greedy algorithm to construct universal cycles for permutations, joint Algebraic Combinatorics and Coding Theory Seminars, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 18, 2017

144. Crown graphs and their representation numbers, 26th British Combinatorial Conference, Glasgow, UK, July 3, 2017

143. Universal partial words, DIMAP Seminar, Centre for Discrete Mathematics and its Applications, University of Warwick, Coventry, UK, June 13, 2017

142. Semi-transitive orientations as the main tool in the theory of word-representable graphs discovered so far, Shanghai Center for Mathematical Sciences, Fudan University, Shanghai, China, April 25, 2017

141. Word-representable graphs. The basics, Shanghai Center for Mathematical Sciences, Fudan University, Shanghai, China, April 24, 2017

140. Semi-transitive orientations as the main tool in the theory of word-representable graphs discovered so far, Shanghai Jiao Tong University, Shanghai, China, April 21, 2017

139. Word-representable graphs. The basics, Shanghai Jiao Tong University, Shanghai, China, April 21, 2017

138. Universal partial words, Centre for Combinatorics Seminar, Nankai University, Tianjin, China, April 17, 2017

137. Universal partial words, Invited talk at the 2017 AORC Open School on Combinatorial Methods in the Analysis of Algorithm and Data Structures, Sungkyunkwan University, Korea, February 22, 2017

136. Universal cycles and universal words as a generalization of de Bruijn sequences, Invited talk at the 2017 AORC Open School on Combinatorial Methods in the Analysis of Algorithm and Data Structures, Sungkyunkwan University, Korea, February 22, 2017

135. A far-reaching generalization of word-representable graphs: The theory of graphs representable by pattern avoiding words, Invited talk at the 2017 AORC Open School on Combinatorial Methods in the Analysis of Algorithm and Data Structures, Sungkyunkwan University, Korea, February 21, 2017

134. Semi-transitive orientations as the main tool in the theory of word-representable graphs discovered so far, Invited talk at the 2017 AORC Open School on Combinatorial Methods in the Analysis of Algorithm and Data Structures, Sungkyunkwan University, Korea, February 20, 2017

133. Word-representable graphs. The basics, Invited talk at the 2017 AORC Open School on Combinatorial Methods in the Analysis of Algorithm and Data Structures, Sungkyunkwan University, Korea, February 20, 2017

132. On universal partial words, Combinatorics seminar, University of Strathclyde, Glasgow, UK, February 1, 2017

131. On a hierarchy of combinatorial structures related to interval orders, Combinatorics seminar, University of Bourgogne, Dijon, France, November 8, 2016

130. On universal partial words, Combinatorics seminar, University of Bourgogne, Dijon, France, November 7, 2016

129. What is a good bijection? A case study on pattern-avoiding permutations, Computer and Information Sciences Departmental Seminar, University of Strathclyde, Glasgow, UK, October 12, 2016

128. Universal partial words for de Bruijn sequences, Coding Theory Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 5, 2016

127. On a hierarchy related to interval orders, Centre for Combinatorics Seminar, Nankai University, Tianjin, China, November 27, 2015

126. Equidistributions on planar maps and description trees, Centre for Combinatorics Seminar, Nankai University, Tianjin, China, July 10, 2015

125. Representing Graphs via Pattern-Avoiding Words, Quasi-Groups and Related Topics Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, June 26, 2015

124. Encoding graphs via pattern-avoiding words, Combinatorics seminar, University of Bourgogne, Dijon, France, June 8, 2015

123. Equidistributions on planar maps via involutions on description trees, Combinatorics seminar, University of Bourgogne, Dijon, France, June 8, 2015

122. Encoding graphs via pattern-avoiding words, Invited talk at Scottish Combinatorics Meeting, University of Glasgow, Glasgow, UK, April 29, 2015

121. Representing graphs via pattern avoiding words, Centre for Combinatorics Seminar, Nankai University, Tianjin, China, November 26, 2014

120. New results and research directions in the theory of word-representable graphs, University of California, San Diego, USA, July 16, 2014

119. Word-representable graphs and permutation patterns, Plenary talk at Permutation Patterns Conference 2014, East Tennessee State University, Johnson City, TN, USA, July 8, 2014.

118. Word-representability of triangulations of polyominoes, Quasi-Groups and Related Topics Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 4, 2014

117. On fixed points of an automorphism on bicubic maps, Factorial Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 2, 2014

116. Word-representable graphs, Mathematically Structured Programming Group's Seminar, University of Strathclyde, UK, January 15, 2014

115. Equidistributions on planar maps via involutions on description trees, DIMAP Seminar, Centre for Discrete Mathematics and its Applications, University of Warwick, Coventry, UK, November 19, 2013

114.
On a hierarchy related to interval orders, CIRCA seminar, University of St Andrews, St Andrews, UK, May 15, 2013

113.
A hierarchy related to interval orders, Formal Analysis, Theory and Algorithms, University of Glasgow, Glasgow, UK, April 16, 2013

112.
Two involutions on description trees and their applications, Colloquium talk, University of California, San Diego, January 17, 2013

111. Harmonic numbers, Catalan's triangle and mesh patterns, Combinatorics Seminar, University of California, San Diego, January 15, 2013

110. Crucial and bicrucial permutations with respect to arithmetic monotone patterns, Invited talk at the AMS Special Session on
Patterns in Permutations and Words, at San Diego AMS-MAA Joint Meetings, San Diego, January 12, 2013

109. Interval orders and related structures, Applied Analysis Seminar, University of Strathclyde, November 20, 2012

108. Harmonic numbers, Catalan's triangle and mesh patterns, Factorial Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, August 13, 2012

107. An involution on planar maps and beta(0,1)-trees, Discrete Analysis Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, August 9, 2012

105. Graphs representable by words, DIMAP Seminar, Centre for Discrete Mathematics and its Applications, University of Warwick, Coventry, UK, May 1, 2012

104. On interval orders and related objects, Colloquium talk, Department of Mathematics, California Polytechnic State University, San Luis Obispo, February 17, 2012

103. Interval orders and related combinatorial objects, Colloquium talk, University of California, San Diego, February 16, 2012

102. On permutation boxed mesh patterns, Combinatorics Seminar, University of California, San Diego, February 14, 2012

101. (2+2)-free posets and related objects, Statistics Seminar, Lancaster University, Lancaster, UK, December 8, 2011

100. On graphs representable by words, Pure Maths Colloquia, University of St Andrews, St Andrews, UK, November 24, 2011

99. Word-representation of graphs, Formal Analysis, Theory and Algorithms Seminar, University of Glasgow, Glasgow, UK, November 22, 2011

98. On graphs representable by words, Algorithms and Complexity Seminar, Durham University, Durham, UK, October 20, 2011

97. On word-representable graphs, Mathematical Models of Decision Making Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, August 15, 2011

96. Graphs representable by words, Discrete Analysis Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 7, 2011

95. Planar maps, Coding Theory Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 5, 2011

94. On (2+2)-free posets and equinumerous objects, DIMAP Workshop on Combinatorics and Graph Theory, University of Warwick, UK, April 4, 2011

93. Graphs representable by words, Colloquium talk, Department of Mathematics, California Polytechnic State University, San Luis Obispo, February 18, 2011

92. Planar maps and description trees, Combinatorics Seminar, University of California, San Diego, February 16, 2011

91. On graphs representable by words, Combinatorics, Graph Theory and Applications Seminar, Universitat Politecnica de Catalunya, Barcelona, Spain, November 25, 2010

90. Interval orders and equinumerous objects, Combinatorics, Graph Theory and Applications Seminar, Universitat Politecnica de Catalunya, Barcelona, Spain, October 7, 2010

89. On representable graphs, University of Strathclyde, Glasgow, Scotland, September 9, 2010

88. Enumerating (2+2)-free posets by the number of minimal elements and other statistics, Poster at the 22nd International Conference on Formal Power Series \& Algebraic
Combinatorics, San Francisco State University, San Francisco, USA, August 2-6, 2010

87. On (2+2)-free posets, Factorial Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 13, 2010

86. Counting (2+2)-free posets by indistinguishable elements and a conjecture of Jovovic, ICE-TCS Theory Day 2010, Reykjavik University, Reykjavik, Iceland, April 30, 2010

85. Snake-in-the-box problem, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, March 25, 2010

84. Finally, we can count 2+2!, Reykjavik University Lecture Marathon 2010, Reykjavik University, Reykjavik, March 19, 2010

83. Binary uniform distributions on graphs, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, February 25, 2010

82. On (2+2)-free posets, Jagiellonian University in Krakow, Krakow, Poland, February 5, 2010

81. Combinatorial methods, Nowy Sacz School of Business, Teaching Staff Mobility Programme, Nowy Sacz, Poland, February 3, 2010

80. Enumerating (2+2)-free posets by the number of minimal elements and other statistics, Nowy Sacz School of Business, Nowy Sacz, Poland, February 3, 2010

75. Enumeration of (2+2)-free posets by the number of minimal elements and other statistics, ICE-TCS Lectures Series, Reykjavik University, Reykjavik, Iceland, October 16, 2009

73.Crucial words for abelian powers, 13th International Conference on Developments in Language Theory (DLT 09), Universitat Stuttgart, Germany, July 2, 2009

72. A lower bound for the shortest length of a crucial word avoiding abelian powers, Factor Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 27, 2009

71. (2+2)-free posets and equinumerous objects, Factor Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 27, 2009

70. Crucial words for abelian k-th powers, Factor Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 20, 2009

69. (2+2)-free posets and related objects, Combinatorics and Sequences Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 15, 2009

68. (2+2)-free posets, ascent sequences, regular linearized chord diagrams, and pattern avoiding permutations, Special Discrete Mathematics Seminar, University of California, Berkeley, March 18, 2009

65. Interval orders, pattern avoiding permutations, and involutions with no neighbour nesting, Discrete Math Seminar, Arizona State University, Tempe, March 2, 2009

64. Unlabeled (2+2)-free posets, ascent sequences, regular linearized chord diagrams, and pattern avoiding permutations, Mathematics Department Colloquium, California State University, Los Angeles, February 25, 2009

35. Introduction to partially ordered patterns, The Combinatorics Seminar, University of California, San Diego, April 26, 2005

34. Independent sets in graphs: Enumeration and connections to other combinatorics, The Combinatorics Seminar at Chalmers/GU, Göteborg, Sweden, February 3, 2005

33. Partially ordered patterns, Institut Mittag-Leffler, Stockholm, Sweden, February 1, 2005

32. Partially ordered patterns and their relations to other combinatorial objects, The Combinatorics Seminar, University of Louisville, Louisville, November 23, 2004

31. Walks in the positive quadrant and pattern avoidance in permutations, The Combinatorics Seminar, University of Kentucky, Lexington, October 18, 2004

30. Independent sets on path-schemes, Conference on Discrete Analysis and Operations Research (DAOR'2004), Sobolev Institute of Mathematics, Novosibirsk, Russia, July 1, 2004

29.Combinatorics on words and graphs, Rocky Mountain Algebraic Combinatorics Seminar, Colorado State University, Fort Collins, May 7, 2004

28. Sequences and iterations of morphisms, The Combinatorics Seminar, University of Louisville, Louisville, March 23, 2004

27. Non-overlapping patterns in permutations and words, The Combinatorics Seminar, University of California, San Diego, March 5, 2004

26. Numerical characteristics of unavoidable sets, The Combinatorics Seminar at California Institute of Technology, Pasadena, March 4, 2004

25. The Dragon curve, the Peano curve, and combinatorics on words, PIC Special Research Seminar at University of California, Los Angeles, March 3, 2004

17. Symbolic sequences, crucial words and iterations of a morphism, The Combinatorics Seminar, University of Kentucky, Lexington, September 12, 2003

16.Partially Ordered Generalized Patterns, Poster at the 14th International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC'02) at University of Melbourne, Melbourne, Australia, July 8-12, 2002

13. On non-existence of an iterative morphism which defines an Arshon sequence, Swedish-Russian conference "Combinatorics, Dynamics, Probabilities" at Royal Institute of Technology, Stockholm, Sweden, October 3-7, 2000

12. On Non-Existence of Morphisms that Define the Symbolic Sequences, The XXXVII International Scientific Conference "Student and Scientific-Technical Progress" at Novosibirsk State University, Novosibirsk, Russia, 1999 (A Diploma)

11. On a Property of the Arshon Sequence, Problems of Theoretical Cybernetics, The XII International Conference at , Nizhni Novgorod State University, Nignii Novgorod, Russia, 1998

10. Crucial Words for the Sets of Words Avoiding Abelian Squares, The First Youth Scientific School in Discrete Mathematics and its Applications at Moscow State University, Moscow, Russia, 1997

9. Crucial Words for the Sets of Non-Repetitive Words, The XXXIV International Scientific Conference "Student and Scientific-Technical Progress" at Novosibirsk State University, Novosibirsk, Russia, 1996 (A Diploma)

8. Colouring beads, The XXIV Conference of Omsk Scientific-Oriented Student Society "Search" (section of algebra), Omsk, Russia, 1992

7. Arithmetical progressions and colouring beads, The XXX International Scientific Conference "Student and Scientific-Technical Progress" at Novosibirsk State University, Novosibirsk, Russia, 1992 (A Diploma)