Eva Jelínková - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2016

On the Hardness of Switching to a Small Number of EdgesVít Jelínek, Eva Jelínková, Jan Kratochvíl. cocoon 2016: 159-170 [doi]

2014

H-Free GraphsEva Jelínková, Jan Kratochvíl. jgt, 75(4):387-405, 2014. [doi]

2013

The Planar Slope Number of Planar Partial 3-Trees of Bounded DegreeVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil. gc, 29(4):981-1005, 2013. [doi]

2011

The Möbius function of separable and decomposable permutationsAlexander Burstein, Vít Jelínek, Eva Jelínková, Einar Steingrímsson. JCT, 118(8):2346-2364, 2011. [doi]

An efficient implementation of the equilibrium algorithm for housing markets with duplicate housesKatarína Cechlárová, Eva Jelínková. ipl, 111(13):667-670, 2011. [doi]

Approximability of Economic Equilibrium for Housing Markets with Duplicate HousesKatarína Cechlárová, Eva Jelínková. wg 2011: 95-106 [doi]

Pattern Avoidance in Partial PermutationsAnders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev. combinatorics, 18(1), 2011. [doi]

Switching to Hedgehog-Free Graphs Is NP-CompleteEva Jelínková. tamc 2011: 463-470 [doi]

Parameterized Problems Related to Seidel s SwitchingEva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl. dmtcs, 13(2):19-44, 2011. [doi]

2009

The Planar Slope Number of Planar Partial 3-Trees of Bounded DegreeVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil. gd 2010: 304-315 [doi]

2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component ClustersVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický. gd 2009: 121-132 [doi]

On Switching to H-Free GraphsEva Jelínková, Jan Kratochvíl. gg 2008: 379-395 [doi]

2007

Clustered Planarity: Small Clusters in Eulerian GraphsEva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil. gd 2008: 303-314 [doi]

Sign in or sign up to see more results.

runs on WebDSL