HOME	RESEARCH	TEACHING	PERSONAL
Presentations On (2+2)-free posets and equinumerous objects, DIMAP Workshop on Combinatorics and Graph Theory, University of Warwick, UK, April 4, 2011 Graphs representable by words, Colloquium talk, Department of Mathematics, California Polytechnic State University, San Luis Obispo, February 18, 2011 Planar maps and description trees, Combinatorics Seminar, University of California, San Diego, February 16, 2011 On graphs representable by words, Combinatorics, Graph Theory and Applications Seminar, Universitat Politecnica de Catalunya, Barcelona, Spain, November 25, 2010 Interval orders and equinumerous objects, Combinatorics, Graph Theory and Applications Seminar, Universitat Politecnica de Catalunya, Barcelona, Spain, October 7, 2010 On representable graphs, University of Strathclyde, Glasgow, Scotland, September 9, 2010 On (2+2)-free posets, Factorial Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 13, 2010 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 Snake-in-the-box problem, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, March 25, 2010 Finally, we can count 2+2!, Reykjavik University Lecture Marathon 2010, Reykjavik University, Reykjavik, March 19, 2010 Binary uniform distributions on graphs, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, February 25, 2010 On (2+2)-free posets, Jagiellonian University in Krakow, Krakow, Poland, February 5, 2010 Combinatorial methods, Nowy Sacz School of Business, Teaching Staff Mobility Programme, Nowy Sacz, Poland, February 3, 2010 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 Pattern avoidance in permutations and beta(1,0)-trees, Mathematics Department Colloquium, California State University, Los Angeles, January 20, 2010 Pattern avoidance on partial permutations, Combinatorics Seminar, University of California, San Diego, January 19, 2010 Enumerating (2+2)-free posets by the number of minimal elements and other statistics, Invited talk at the AMS Special Session on Enumerative Combinatorics at San Francisco AMS-MAA Joint Meetings, San Francisco, January 15, 2010 Decompositions and statistics for beta(1,0)-trees and nonseparable permutations, Colloquium talk, Department of Mathematics, California Polytechnic State University, San Luis Obispo, January 12, 2010 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 From squares in words to squares in permutations, Conference "Mathematics in Iceland 2009", Leirubakki, Iceland, September 19, 2009 Crucial words for abelian powers, 13th International Conference on Developments in Language Theory (DLT 09), Universitat Stuttgart, Germany, July 2, 2009 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 (2+2)-free posets and equinumerous objects, Factor Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 27, 2009 Crucial words for abelian k-th powers, Factor Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 20, 2009 (2+2)-free posets and related objects, Combinatorics and Sequences Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, April 15, 2009 (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 Graphs represented by words, Combinatorics Seminar, University of California, San Diego, March 17, 2009 Crucial words for abelian powers, Combinatorics Seminar, University of California, San Diego, March 3, 2009 Interval orders, pattern avoiding permutations, and involutions with no neighbour nesting, Discrete Math Seminar, Arizona State University, Tempe, March 2, 2009 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 Permutations, sequences, and partially ordered sets, Combinatorics Seminar, University of California, San Diego, February 10, 2009 Restricted permutations and beta(1,0)-trees, Combinatorics Seminar, California Institute of Technology, Pasadena, February 5, 2009 Generalized pattern avoidance, beta(1,0)-trees, and 2-stack sortable permutations, Combinatorics Seminar, University of California, San Diego, January 27, 2009 On Generalized Factor Order on Words, ICE-TCS Theory Day, Reykjavik University, Reykjavik, Iceland, May 30, 2008 Enumerating independent sets in path-schemes and grid graphs, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, May 21, 2008 Cutting cycles in de Bruijn graphs, Graph and Algorithms Seminar, Reykjavik University, Reykjavik, Iceland, April 9, 2008 Counting ordered patterns in words generated by morphisms, 2nd International Conference on Language and Automata Theory and Applications (LATA 2008), Tarragona, Spain, March 18, 2008 Ordered patterns in words generated by morphisms, ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, February 15, 2008 Bijections between 321- and 132-avoiding permutations, ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, December 19, 2007 Sequences and morphisms, Pure Mathematics Colloquium, University of St Andrews, St Andrews, Scotland, October 25, 2007 Generalized pattern avoidance and two-stack sortable permutations, Sobolev Institute of Mathematics, Novosibirsk, Russia, July 12, 2007 Generalized pattern avoidance, beta(1,0)-trees, and two-stack sortable permutations, Permutation Patterns Conference 2007, University of St Andrews, St Andrews, Scotland, UK, June 12, 2007 Non-attacking placements on chessboards, University of Iceland, Reykjavik, Iceland, February 22, 2007 On universal cycles and combinatorial objects, ICE-TCS colloquium talk, Reykjavik University, Reykjavik, Iceland, February 2, 2007 On representable graphs, ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, January 12, 2007 Representable graphs, Combinatorics Seminar, University of California, San Diego, November 14, 2006 Differential equations and permutation patterns, Special PDE and Combinatorics Seminar, University of Kentucky, Lexington, November 10, 2006 Universal cycles and combinatorial objects, Colloquium Lecture, University of Kentucky, Lexington, November 9, 2006 Uniquely k-determined permutations, the ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, September 20, 2006 Combinatorial patterns, Factorial Languages Seminar, Sobolev Institute of Mathematics, Novosibirsk, Russia, August 7, 2006 Classifying descents according to equivalence mod k, Permutation Patterns Conference 2006, Reykjavik University, Reykjavik, Iceland, June 12, 2006 An introduction to permutation patterns, The second ICE-TCS Symposium, University of Iceland, Reykjavik, Iceland, May 31, 2006 Patterns and their generalizations, Department of Informatics Seminar, University of Bergen, Bergen, Norway, March 2, 2006 Enumerating patterns in compositions, the ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, February 10, 2006 Introduction to partially ordered patterns , University of Iceland, Reykjavik, Iceland, October 20, 2005 Patterns and their generalizations, University of Iceland, Reykjavik, Iceland, October 13, 2005 Sets of prohibitions and some problems related to them, the ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, October 7, 2005 On a common feature in three famous sequences, the ICE-TCS seminar, Reykjavik University, Reykjavik, Iceland, September 1, 2005 Introduction to partially ordered patterns, The Combinatorics Seminar, University of California, San Diego, April 26, 2005 Independent sets in graphs: Enumeration and connections to other combinatorics, The Combinatorics Seminar at Chalmers/GU, Göteborg, Sweden, February 3, 2005 Partially ordered patterns, Institut Mittag-Leffler, Stockholm, Sweden, February 1, 2005 Partially ordered patterns and their relations to other combinatorial objects, The Combinatorics Seminar, University of Louisville, Louisville, November 23, 2004 Walks in the positive quadrant and pattern avoidance in permutations, The Combinatorics Seminar, University of Kentucky, Lexington, October 18, 2004 Independent sets on path-schemes, Conference on Discrete Analysis and Operations Research (DAOR'2004), Sobolev Institute of Mathematics, Novosibirsk, Russia, July 1, 2004 Combinatorics on words and graphs, Rocky Mountain Algebraic Combinatorics Seminar, Colorado State University, Fort Collins, May 7, 2004 Sequences and iterations of morphisms, The Combinatorics Seminar, University of Louisville, Louisville, March 23, 2004 Non-overlapping patterns in permutations and words, The Combinatorics Seminar, University of California, San Diego, March 5, 2004 Numerical characteristics of unavoidable sets, The Combinatorics Seminar at California Institute of Technology, Pasadena, March 4, 2004 The Dragon curve, the Peano curve, and combinatorics on words, PIC Special Research Seminar at University of California, Los Angeles, March 3, 2004 Unavoidable sets and their numerical characteristics, The Combinatorics Seminar at University of Illinois at Chicago, Chicago, February 25, 2004 On a common feature in certain sequences, The Combinatorics Seminar, University of Illinois at Urbana-Champaign, Urbana, February 24, 2004 On some famous sequences, The Combinatorics Seminar at Massachusetts Institute of Technology, Cambridge, February 20, 2004 Non-overlapping patterns in permutations, The Combinatorics Seminar, University of Pennsylvania, Philadelphia, February 19, 2004 A survey of certain pattern problems, The Discrete Analysis Seminar at Sobolev Institute of Mathematics, Novosibirsk, Russia, December 25, 2003 On unavoidable sets, universal cycles and word patterns, The Combinatorics Seminar at Chalmers/GU, Göteborg, Sweden, December 9, 2003 On Some of Aspects of Combinatorics on Words, Colloquia Lecture at Iowa State University, Ames, October 21, 2003 Symbolic sequences, crucial words and iterations of a morphism, The Combinatorics Seminar, University of Kentucky, Lexington, September 12, 2003 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 Simultaneous Avoidance of Generalized Patterns, Workshop "Algebraic Combinatorics" at Royal Institute of Technology, Stockholm, Sweden, May 21-22, 2002 Multi-Avoidance of Generalized Patterns, The 48th Seminaire Lotharingien de Combinatoire at Domaine Saint-Jacques, France, 2002 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 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) On a Property of the Arshon Sequence, Problems of Theoretical Cybernetics, The XII International Conference at , Nizhni Novgorod State University, Nignii Novgorod, Russia, 1998 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 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) Colouring beads, The XXIV Conference of Omsk Scientific-Oriented Student Society "Search" (section of algebra), Omsk, Russia, 1992 Arithmetical progressions and colouring beads, The XXX International Scientific Conference "Student and Scientific-Technical Progress" at Novosibirsk State University, Novosibirsk, Russia, 1992 (A Diploma) Defenses Thesis for the Degree of Doctor of Philosophy Thesis for the Degree of Licentiate of Philosophy Some other talks given The Involution Principle and the Rogers-Ramanujan identities On Pattern Avoidance in Permutations Completeness and Complexity of Some Extremal Problems for Sets of Prohibited Words Partially Ordered Generalized Patterns
Copyright © 2004-2006 Sergey Kitaev