Eva Jelínková

Orcid: 0000-0001-8410-8008

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
On the Hardness of Switching to a Small Number of Edges.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2014
On Switching to <i>H</i>-Free Graphs.
J. Graph Theory, 2014

2013
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Graphs Comb., 2013

2011
The Möbius function of separable and decomposable permutations.
J. Comb. Theory A, 2011

An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses.
Inf. Process. Lett., 2011

Parameterized Problems Related to Seidel's Switching.
Discret. Math. Theor. Comput. Sci., 2011

Pattern Avoidance in Partial Permutations.
Electron. J. Comb., 2011

Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Switching to Hedgehog-Free Graphs Is NP-Complete.
Proceedings of the Theory and Applications of Models of Computation, 2011

2009
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.
J. Graph Algorithms Appl., 2009

2008
On Switching to H-Free Graphs.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Clustered Planarity: Small Clusters in Eulerian Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007


  Loading...