Eva Jelínková

According to our database, Eva Jelínková authored at least 13 papers between 2007 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

On the Hardness of Switching to a Small Number of Edges.

Vít Jelínek, Eva Jelínková, Jan Kratochvíl

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2014

On Switching to <i>H</i>-Free Graphs.

Eva Jelínková, Jan Kratochvíl

J. Graph Theory, 2014

2013

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, Tomás Vyskocil

Graphs Comb., 2013

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, Ser. A, 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

Parameterized Problems Related to Seidel's Switching.

Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl

Discret. Math. Theor. Comput. Sci., 2011

Pattern Avoidance in Partial Permutations.

Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev

Electron. J. Comb., 2011

Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses.

Katarína Cechlárová, Eva Jelínková

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Switching to Hedgehog-Free Graphs Is NP-Complete.

Eva Jelínková

Proceedings of the Theory and Applications of Models of Computation, 2011

2009

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

J. Graph Algorithms Appl., 2009

2008

On Switching to H-Free Graphs.

Eva Jelínková, Jan Kratochvíl

Proceedings of the Graph Transformations, 4th International Conference, 2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.

Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Clustered Planarity: Small Clusters in Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

Proceedings of the Graph Drawing, 15th International Symposium, 2007