Publications

Eva Jelínková

Journal and conference papers

• Vít Jelínek, Eva Jelínková, Jan Kratochvíl: On the hardness of switching to a small number of edges.
  In: Dinh T., Thai M. (eds) Computing and Combinatorics. COCOON 2016. Lecture Notes in Computer Science, vol 9797, pp. 159 - 170. Springer, Cham.
• Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesař, Tomáš Vyskočil: The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
  Graphs and Combinatorics, volume 29, issue 4, pp. 981-1005, 2013.
• E. Jelínková, J. Kratochvíl: On Switching to H-Free Graphs.
  Journal of Graph Theory, volume 75, issue 4, pp. 387-405, 2014.
• K. Cechlárová, E. Jelínková: Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses.
  Proceedings of Graph-Theoretic Concepts in Computer Science 2011, Lecture Notes in Computer Science, 2011, Volume 6986/2011, pp. 95-106.
• A. Burstein, V. Jelínek, E. Jelínková, E. Steingrímsson: The Möbius function of separable and decomposable permutations.
  Journal of Combinatorial Theory, Series A, volume 118, issue 8, 2011, pp. 2346-2364.
• E. Jelínková, O. Suchý, P. Hliněný, J. Kratochvíl: Parameterized Problems Related to Seidel's Switching.
  Discrete Mathematics and Theoretical Computer Science 13 (2), pp. 19 - 42, 2011.
• K. Cechlárová, E. Jelínková: An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. Information Processing Letters 111 (2011), pp. 667-670.
  Also available as preprint: IM Preprint series A, No. 2/2010.
• E. Jelínková: Switching to Hedgehog-Free Graphs is NP-Complete. In: M. Ogihara and J. Tarui (Eds.): TAMC 2011, LNCS 6648, pp. 463-470. Springer, Heidelberg (2011).
• A. Claesson, V. Jelínek, E. Jelínková, S. Kitaev: Pattern avoidance in partial permutations.
  The Electronic Journal of Combinatorics 18(1), #P25 (2011).
  arXiv:1005.2216v1
• A. Claesson, V. Jelínek, E. Jelínková, S. Kitaev: Pattern avoidance in partial permutations (extended abstract).
  DMTCS Proceedings, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), pp. 625-636 (2010).
• V. Jelínek, E. Jelínková, E. Steingrímsson: The Möbius function of separable permutations (extended abstract).
  DMTCS Proceedings, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), pp. 773-784 (2010).
• V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický, M. Tesař, T. Vyskočil: The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
  In: Eppstein, D., Gansner, E. R., (eds.) GD 2009. LNCS, vol. 5849, pp. 304-315. Springer, Heidelberg (2010).
  arXiv:1012.4137v1
• V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
  In: Tollis, I.G., Patrignani, M., (eds.) GD 2008. LNCS, vol. 5417, pp. 121-132. Springer, Heidelberg (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 the Fifteenth International Symposium on Graph Drawing, GD 2007, vol. 13(3), pp. 379-422 (2009).
• E. Jelínková, J. Kratochvíl: On Switching to H-Free Graphs.
  In: H. Ehrig et al. (Eds.): ICGT 2008, LNCS 5214, pp. 379 - 395. Springer, Heidelberg (2008).
• E. Jelínková: Three NP-Complete Optimization Problems in Seidel's Switching.
  In: L. Brankovich, Y. Lin and W. F. Smyth (eds.): Proceedings of the International Workshop on Combinatorial Algorithms 2007, pp. 121-135. College Publications (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.
  In: Hong S., Nishizeki T., Quan W. (eds.) GD 2007. LNCS, vol. 4875, pp. 303-314. Springer, Heidelberg (2008)

Other

• K. Cechlárová, E. Jelínková: Approximability of economic equilibrium for housing markets with duplicate houses.
  IM Preprint series A, No. 3/2011. Institute of Mathematics, Faculty of Science, P. J. Šafárik University, Košice. 2011.
• A. Burstein, V. Jelínek, E. Jelínková, E. Steingrímsson: The Möbius function of separable and decomposable permutations.
  arXiv:1102.1611v1