Ladislav Stacho
Ladislav Stacho
Bestätigte E-Mail-Adresse bei sfu.ca
Titel
Zitiert von
Zitiert von
Jahr
On minimizing the sum of sensor movements for barrier coverage of a line segment
J Czyzowicz, E Kranakis, D Krizanc, I Lambadaris, L Narayanan, ...
International Conference on Ad-Hoc Networks and Wireless, 29-42, 2010
792010
On minimizing the maximum sensor movement for barrier coverage of a line segment
J Czyzowicz, E Kranakis, D Krizanc, I Lambadaris, L Narayanan, ...
International Conference on Ad-Hoc Networks and Wireless, 194-212, 2009
752009
Spanning trees with bounded number of branch vertices
L Gargano, P Hell, L Stacho, U Vaccaro
International Colloquium on Automata, Languages, and Programming, 355-365, 2002
692002
Prediction of 492 human protein kinase substrate specificities
J Safaei, J Maňuch, A Gupta, L Stacho, S Pelech
Proteome science 9 (1), 1-13, 2011
672011
Spanning spiders and light-splitting switches
L Gargano, M Hammar, P Hell, L Stacho, U Vaccaro
Discrete mathematics 285 (1-3), 83-95, 2004
442004
Two lower bounds for self-assemblies at temperature 1
J Maňuch, L Stacho, C Stoll
Journal of Computational Biology 17 (6), 841-852, 2010
402010
Coloring plane graphs with independent crossings
D Král', L Stacho
Journal of Graph Theory 64 (3), 184-205, 2010
382010
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
E Chávez, S Dobrev, E Kranakis, J Opatrny, L Stacho, J Urrutia
Latin American Symposium on Theoretical Informatics, 286-297, 2006
362006
Structure-approximating inverse protein folding problem in the 2D HP model
A Gupta, J Maňuch, L Stacho
Journal of Computational Biology 12 (10), 1328-1345, 2005
332005
Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph
E Chavez, S Dobrev, E Kranakis, J Opatrny, L Stacho, H Tejeda, J Urrutia
International Conference On Principles Of Distributed Systems, 235-245, 2005
322005
New upper bounds for the chromatic number of a graph
L Stacho
Journal of graph theory 36 (2), 117-120, 2001
292001
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
J Maňuch, C Thachuk, L Stacho, A Condon
Natural Computing 10 (1), 391-405, 2011
28*2011
Strong connectivity in sensor networks with given number of directional antennae of bounded angle
S Dobrev, E Kranakis, D Krizanc, J Opatrny, OM Ponce, L Stacho
International Conference on Combinatorial Optimization and Applications, 72-86, 2010
272010
An algorithm for the energy barrier problem without pseudoknots and temporary arcs
C Thachuk, J Maňuch, A Rafiey, LA Mathieson, L Stacho, A Condon
Biocomputing 2010, 108-119, 2010
252010
Virtual Path Layout for Some Bounded Degree Networks.
L Stacho, I Vrto
SIROCCO, 269-178, 1996
191996
Route discovery with constant memory in oriented planar geometric networks
E Chávez, S Dobrev, E Kranakis, J Opatrny, L Stacho, J Urrutia
Networks: An International Journal 48 (1), 7-15, 2006
182006
Bisection width of transposition graphs
L Stacho, I Vrt'o
Discrete Applied Mathematics 84 (1-3), 221-235, 1998
181998
NP-completeness of the direct energy barrier problem without pseudoknots
J Maňuch, C Thachuk, L Stacho, A Condon
International Workshop on DNA-Based Computers, 106-115, 2009
172009
The odd-distance plane graph
H Ardal, J Maňuch, M Rosenfeld, S Shelah, L Stacho
Discrete & Computational Geometry 42 (2), 132-141, 2009
162009
Tough spiders
T Kaiser, D Král, L Stacho
Journal of Graph Theory 56 (1), 23-40, 2007
162007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20