Seznam publikací Ondry Suchého

• J. Guo, R. Niedermeier, and O. Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems.
  Proceedings of The 20^th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS vol. 5878, pp. 544-553, 2009.
  
  
• R. Enciso, M. R. Fellows, J. Guo, I. Kanj, F. Rosamond and O. Suchý: What Makes Equitable Connected Partition Easy.
  Proceedings of The 4^th International Workshop on Parameterized and Exact Computation (IWPEC 2009), LNCS vol. 5917, pp. 122-133, 2010.
  
  
• P. Golovach, J. Kratochvíl and O. Suchý: Parameterized Complexity of Generalized Domination Problems.
  Proceedings of The 35^th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), LNCS vol. 5911, pp. 133-142, 2010.
  
  
• O. Suchý: Some Parameterized Problems Related to Seidel's Switching.
  Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA) 2007, pp. 148-157, 2008.
  
  
• E. Jelínková, J. Kára, J. Kratochvíl, M. Pergel, O. Suchý, and T. Vyskočil: Clustered Planarity: Small Clusters in Eulerian Graphs.
  Proceedings of the Fifteenth International Symposium on Graph Drawing (GD 2007), LNCS, vol. 4875, pp. 303-314, 2008.
  
  
• V. Jelínek, O. Suchý, M. Tesař and T. Vyskočil: Clustered Planarity: Clusters with Few Outgoing Edges.
  Proceedings of the Sixteenth International Symposium on Graph Drawing (GD 2008), LNCS, vol. 5417, pp. 102-113, 2009.
  
  
• E. Jelínková, J. Kára, J. Kratochvíl, M. Pergel, O. Suchý, and T. Vyskočil: Clustered Planarity: Small Clusters in Eulerian Graphs.
  JGAA, Special Issue on Selected Papers from GD 2007, Vol. 13, no. 3, pp. 379-422, 2009.