Juraj Stacho Department of Computer Science University of Toronto Room SF3301D 10 King’s College Road, Toronto, Ontario M5S 3G4 Canada E-mail: stacho[at]cs.toronto.edu Welcome to my webpage. My name is Juraj Stacho (read [yuraɪ stɑko] similar to you right start coal) and I am currently (2009) a post-doctoral fellow at Department of Computer Science of University of Toronto in Toronto, Canada. In 2008-2009, I spent one year as a post-doc at LIAFA laboratory of Université Paris Diderot in Paris. In 2008, I obtained a PhD. degree in Computing Science at Simon Fraser University (SFU) in Burnaby, British Columbia (BC), Canada. In 2005, I finished Master's studies in Informatics at Department of Computing Science at Faculty of Mathematics, Physics and Infomatics (FMFI) of Comenius University in Bratislava, Slovakia. My academic interests are: Algorithmic and Structural Graph Theory, Combinatorics and Discrete Optimization, and Complexity Theory. In particular, I am interested in efficient algorithms for combinatorial and optimization problems on structured classes of graphs.

Research:

Publications:

• M. Habib, J. Stacho: Polynomial-time Algorithm for the Leafage of Chordal Graphs, In: Algorithms - ESA 2009, Lecture Notes in Computer Science 5757/2009, pp. 290-300.
• M. Habib, J. Stacho: A Decomposition Theorem for Chordal Graphs and its Applications, In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes in Discrete Mathematics 34 (2009), pp. 561-565.
• T. Feder, P. Hell, D.G. Schell, J. Stacho: Dichotomy for tree-structured trigraph list homomorphism problems, submitted to Discrete Applied Mathematics.
• M. Habib, J. Stacho: Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage, In: DIMAP Workshop on Algorithmic Graph Theory, Electronic Notes in Discrete Mathematics 32 (2009), pp. 99-108.
• J. Stacho: Complexity of Generalized Colourings of Chordal Graphs, PhD thesis, Simon Fraser University, 2008, pages 168.
• J. Stacho: Ph.D. Depth Examination Report
• P. Hell, A. Raspaud, J. Stacho: On Injective Colourings of Chordal Graphs, In: LATIN 2008: Theoretical Informatics, Lecture Notes in Computer Science 4957/2008, pp. 520-530.
• J. Stacho: On 2-Subcolourings of Chordal Graphs, In: LATIN 2008: Theoretical Informatics, Lecture Notes in Computer Science 4957/2008, pp. 544-554.
• J. Stacho: On P₄-transversals of Chordal Graphs, Discrete Mathematics 308 (2008), pp. 5548-5554.
• T. Ekim, P. Hell, J. Stacho, D. de Werra: Polarity of Chordal Graphs, Discrete Applied Mathematics 156 (2008), pp. 2469-2479.

Teaching:

• Fall 2005

  CMTP 120 Surrey Labs
  We 9:30-1:20, Surrey 305a
  Th 9:30-1:20, Surrey 650
  Labs webpage
  
  

• Spring 2006

  MACM 101
  
  • Tutorials:
    Tue 9:30-10:30 AQ5118
         10:30-11:30 AQ2120
         11:20-12:30 WMC2503
    Th 10:30-11:30 AQ5008
         11:30-12:30 AQ5008
    
  • Office hours:
    Wed 3:30-4:30 L9014
    Thu 3:30-4:30 L9014
  Course webpage

• Fall 2006

  MACM 101
  
  • Tutorials:
    Mon 10:30-11:20 AQ5037
           11:30-12:20 WMC2503
           12:30-13:20 AQ5049
    Wed 9:30-10:20 ASB9705
           11:30-12:20 AQ5016
           12:30-13:20 AQ4120
    Fri 11:30-12:20 AQ5030
         12:30-13:20 WMC2503
    
  • No Office hours
    
  Course webpage

• Fall 2007

  MACM 101
  
  • Lecture Oct. 30 - slides
    • Cartesian product, Relation
    • Function, one-to-one, onto
  • Lecture Nov. 1 - slides
    • Stirling numbers