From One to Many Rainbow Hamiltonian Cycles von Bradshaw, Peter, Halasz, Kevin, Stacho, Ladislav

Volltext

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson–Crick and Nussinov–Jacobson Energy Models von Haleš, Jozef, Héliou, Alice, Maňuch, Ján, Ponty, Yann, Stacho, Ladislav

Volltext

Weak Coverage of a Rectangular Barrier von Dobrev, Stefan, Kranakis, Evangelos, Krizanc, Danny, Lafond, Manuel, Maňuch, Ján, Narayanan, Lata, Opatrny, Jaroslav, Stacho, Ladislav

Volltext

Cops and robbers on graphs with a set of forbidden induced subgraphs von Masjoody, Masood, Stacho, Ladislav

Volltext

Hamiltonicity of covering graphs of trees von Bradshaw, Peter, Ge, Zhilin, Stacho, Ladislav

Volltext

Hamiltonian cycles in covering graphs of trees von Hell, Pavol, Nishiyama, Hiroshi, Stacho, Ladislav

Volltext

On the cop number of graphs of high girth von Bradshaw, Peter, Hosseini, Seyyed Aliasghar, Mohar, Bojan, Stacho, Ladislav

Volltext

Flexible list colorings in graphs with special degeneracy conditions von Bradshaw, Peter, Masařík, Tomáš, Stacho, Ladislav

Volltext

Robust Connectivity of Graphs on Surfaces von Bradshaw, Peter, Masařík, Tomáš, Novotná, Jana, Stacho, Ladislav

Volltext

NP-completeness of the energy barrier problem without pseudoknots and temporary arcs von Maňuch, Ján, Thachuk, Chris, Stacho, Ladislav, Condon, Anne

Volltext

Prediction of 492 human protein kinase substrate specificities von Safaei, Javad, Maňuch, Ján, Gupta, Arvind, Stacho, Ladislav, Pelech, Steven

Volltext

Strongly connected orientations of plane graphs von Kranakis, Evangelos, Morales, Oscar, Stacho, Ladislav

Volltext

Coloring plane graphs with independent crossings von Král', Daniel, Stacho, Ladislav

Volltext

Oriented Colouring Graphs of Bounded Degree and Degeneracy von Clow, Alexander, Stacho, Ladislav

Volltext bestellen

Preface von Horak, Peter, Stacho, Ladislav

Volltext

Two lower bounds for self-assemblies at temperature 1 von Manuch, Ján, Stacho, Ladislav, Stoll, Christine

Volltext

Robust Connectivity of Graphs on Surfaces von Bradshaw, Peter, Masařík, Tomáš, Novotná, Jana, Stacho, Ladislav

Volltext

Combinatorics 2006, A Meeting in Celebration of Pavol Hell's 60th Birthday (May 1-5, 2006) von HORAK, Peter, STACHO, Ladislav

Volltext

Algorithm for haplotype inference via galled-tree networks with simple galls von Gupta, Arvind, Maňuch, Ján, Stacho, Ladislav, Zhao, Xiaohong

Volltext

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \frac{\Delta}{\log \Delta}$-choosable von Bradshaw, Peter, Mohar, Bojan, Stacho, Ladislav

Volltext bestellen