Daniel Turzík

According to our database1, Daniel Turzík authored at least 13 papers between 1981 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Which k-trees are cover-incomparability graphs?
Discrete Applied Mathematics, 2014

2013
Which distance-hereditary graphs are cover-incomparability graphs?
Discrete Applied Mathematics, 2013

2009
On the Complexity of Cover-Incomparability Graphs of Posets.
Order, 2009

2008
Stability of Steady State and Traveling Waves Solutions in Coupled Map Lattices.
I. J. Bifurcation and Chaos, 2008

2004
Stability of Steady-State Solutions in Multidimensional Coupled Map Lattices.
I. J. Bifurcation and Chaos, 2004

2003
Stability of Spatially Periodic Solutions in Coupled Map Lattices.
I. J. Bifurcation and Chaos, 2003

1997
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP).
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1992
Max-cut in circulant graphs.
Discrete Mathematics, 1992

1986
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Discrete Mathematics, 1986

On pre-periods of discrete influence systems.
Discrete Applied Mathematics, 1986

On an application of convexity to discrete systems.
Discrete Applied Mathematics, 1986

1982
A note on sticky matroids.
Discrete Mathematics, 1982

1981
Complexity of representation of graphs by set systems.
Discrete Applied Mathematics, 1981


  Loading...