Clustered Planarity: Small Clusters in Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (GD, 2007)

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl; Bernard Lidický (GD, 2008)

On Switching to H-Free Graphs. - Eva Jelínková; Jan Kratochvíl (ICGT, 2008)

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (J. Graph Algorithms Appl., 2009)

Switching to Hedgehog-Free Graphs Is NP-Complete. - Eva Jelínková (TAMC, 2011)

Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. - Katarína Cechlárová; Eva Jelínková (WG, 2011)

Pattern Avoidance in Partial Permutations. - Anders Claesson; Vít Jelínek; Eva Jelínková; Sergey Kitaev (Electron. J. Comb., 2011)

Parameterized Problems Related to Seidel's Switching. - Eva Jelínková; Ondrej Suchý 001; Petr Hlinený; Jan Kratochvíl (Discret. Math. Theor. Comput. Sci., 2011)

An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. - Katarína Cechlárová; Eva Jelínková (Inf. Process. Lett., 2011)

The Möbius function of separable and decomposable permutations. - Alexander Burstein; Vít Jelínek; Eva Jelínková; Einar Steingrímsson (J. Comb. Theory A, 2011)

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl; Bernard Lidický; Marek Tesar 001; Tomás Vyskocil (Graphs Comb., 2013)

On Switching to H-Free Graphs. - Eva Jelínková; Jan Kratochvíl (J. Graph Theory, 2014)

On the Hardness of Switching to a Small Number of Edges. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl (COCOON, 2016)