Daniel Turzík

14 papers B 1Journal 13
YearRankTypeTitle / Venue / Authors
2014 J jnl
Which k-trees are cover-incomparability graphs?
Discret. Appl. Math.
Jana Maxová, Miroslava Dubcová, Pavla Pavlíková, Daniel Turzík
2013 J jnl
Which distance-hereditary graphs are cover-incomparability graphs?
Discret. Appl. Math.
Jana Maxová, Daniel Turzík
2009 J jnl
On the Complexity of Cover-Incomparability Graphs of Posets.
Order
Jana Maxová, Pavla Pavlíková, Daniel Turzík
2008 J jnl
Stability of Steady State and Traveling Waves Solutions in Coupled Map Lattices.
Int. J. Bifurc. Chaos
Daniel Turzík, Miroslava Dubcová
2004 J jnl
Stability of Steady-State Solutions in Multidimensional Coupled Map Lattices.
Int. J. Bifurc. Chaos
Miroslava Dubcová, Daniel Turzík, Alois Klíc
2003 J jnl
Stability of Spatially Periodic Solutions in Coupled Map Lattices.
Int. J. Bifurc. Chaos
Miroslava Dubcová, Alois Klíc, P. Pokorný, Daniel Turzík
1997 B conf
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP).
SOFSEM
Jaroslav Nesetril, Daniel Turzík
1992 J jnl
Max-cut in circulant graphs.
Discret. Math.
Svatopluk Poljak, Daniel Turzík
1986 J jnl
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Discret. Math.
Svatopluk Poljak, Daniel Turzík
1986 J jnl
On an application of convexity to discrete systems.
Discret. Appl. Math.
Svatopluk Poljak, Daniel Turzík
1986 J jnl
On pre-periods of discrete influence systems.
Discret. Appl. Math.
Svatopluk Poljak, Daniel Turzík
1982 J jnl
A note on sticky matroids.
Discret. Math.
Svatopluk Poljak, Daniel Turzík
1981 J jnl
Amalgamation of matroids and its applications.
J. Comb. Theory B
Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík
1981 J jnl
Complexity of representation of graphs by set systems.
Discret. Appl. Math.
Svatopluk Poljak, Vojtech Rödl, Daniel Turzík