Complexity of representation of graphs by set systems. - Svatopluk Poljak; Vojtech Rödl; Daniel Turzík (Discret. Appl. Math., 1981)

Amalgamation of matroids and its applications. - Jaroslav Nesetril; Svatopluk Poljak; Daniel Turzík (J. Comb. Theory B, 1981)

A note on sticky matroids. - Svatopluk Poljak; Daniel Turzík (Discret. Math., 1982)

On an application of convexity to discrete systems. - Svatopluk Poljak; Daniel Turzík (Discret. Appl. Math., 1986)

On pre-periods of discrete influence systems. - Svatopluk Poljak; Daniel Turzík (Discret. Appl. Math., 1986)

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. - Svatopluk Poljak; Daniel Turzík (Discret. Math., 1986)

Max-cut in circulant graphs. - Svatopluk Poljak; Daniel Turzík (Discret. Math., 1992)

Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). - Jaroslav Nesetril; Daniel Turzík (SOFSEM, 1997)

Stability of Spatially Periodic Solutions in Coupled Map Lattices. - Miroslava Dubcová; Alois Klíc; P. Pokorný; Daniel Turzík (Int. J. Bifurc. Chaos, 2003)

Stability of Steady-State Solutions in Multidimensional Coupled Map Lattices. - Miroslava Dubcová; Daniel Turzík; Alois Klíc (Int. J. Bifurc. Chaos, 2004)

Stability of Steady State and Traveling Waves Solutions in Coupled Map Lattices. - Daniel Turzík; Miroslava Dubcová (Int. J. Bifurc. Chaos, 2008)

On the Complexity of Cover-Incomparability Graphs of Posets. - Jana Maxová; Pavla Pavlíková; Daniel Turzík (Order, 2009)

Which distance-hereditary graphs are cover-incomparability graphs? - Jana Maxová; Daniel Turzík (Discret. Appl. Math., 2013)

Which k-trees are cover-incomparability graphs? - Jana Maxová; Miroslava Dubcová; Pavla Pavlíková; Daniel Turzík (Discret. Appl. Math., 2014)