Ladislav Stacho

2009
41	EE	Ján Manuch, Ladislav Stacho, Christine Stoll: Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809
2008
40	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298
39	EE	Jurek Czyzowicz, Stefan Dobrev, H. González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181
38	EE	Evangelos Kranakis, Tim Mott, Ladislav Stacho: Constant memory routing in quasi-planar and quasi-polyhedral graphs. Discrete Applied Mathematics 156(18): 3430-3442 (2008)
37	EE	Daniel Král, Ladislav Stacho: Hamiltonian threshold for strong products of graphs. Journal of Graph Theory 58(4): 314-328 (2008)
36	EE	Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete Math. 22(2): 832-847 (2008)
2007
35	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132
34	EE	Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho: Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model. Discrete Applied Mathematics 155(6-7): 759-787 (2007)
33	EE	Daniel Král, Ladislav Stacho: Closure for the property of having a hamiltonian prism. Journal of Graph Theory 54(3): 209-220 (2007)
32	EE	Tomás Kaiser, Daniel Král, Ladislav Stacho: Tough spiders. Journal of Graph Theory 56(1): 23-40 (2007)
2006
31	EE	Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
30	EE	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN 2006: 286-297
29	EE	Evangelos Kranakis, Tim Mott, Ladislav Stacho: Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. PerCom Workshops 2006: 426-430
28	EE	Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho: Characterization of the Existence of Galled-tree Networks. J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006)
27	EE	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006)
2005
26	EE	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia: Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245
25	EE	Ladislav Stacho, Dávid Szeszlér: On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discrete Mathematics 292(1-3): 159-165 (2005)
24	EE	Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics 296(2-3): 167-186 (2005)
23	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)
22	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. Journal of Computational Biology 12(10): 1328-1345 (2005)
21	EE	Luis A. Goddyn, Ladislav Stacho: Edge disjoint cycles through specified vertices. Journal of Graph Theory 50(3): 246-260 (2005)
20	EE	Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho: (quasi) Spanners for Mobile Ad Hoc Networks. Journal of Interconnection Networks 6(2): 63-84 (2005)
2004
19	EE	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156
18	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
17	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
16	EE	Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia: Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004
15	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
14	EE	Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning spiders and light-splitting switches. Discrete Mathematics 285(1-3): 83-95 (2004)
13	EE	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Traversal of a quasi-planar subdivision without using mark bits. Journal of Interconnection Networks 5(4): 395-407 (2004)
12	EE	Ladislav Stacho, Jozef Sirán, Sanming Zhou: Routing balanced communications on hamilton decomposable networks. Parallel Processing Letters 14(3-4): 377-385 (2004)
2003
11	EE	Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Factor d-domatic colorings of graphs. Discrete Mathematics 262(1-3): 17-25 (2003)
10	EE	Ján Manuch, Ladislav Stacho: On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. ITA 37(3): 255-270 (2003)
2002
9	EE	Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365
2000
8		Ladislav Stacho: Cycles through specified vertices in 1-tough graphs. Ars Comb. 56: (2000)
7	EE	Peter Horák, Ladislav Stacho: A lower bound on the number of hamiltonian cycles. Discrete Mathematics 222(1-3): 275-280 (2000)
6		Ladislav Stacho, Imrich Vrto: Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29(5): 1621-1629 (2000)
1999
5	EE	Ladislav Stacho: Locally Pancyclic Graphs. J. Comb. Theory, Ser. B 76(1): 22-40 (1999)
1998
4		Ladislav Stacho: Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. Ars Comb. 48: (1998)
3	EE	Ladislav Stacho, Imrich Vrto: Bisection Width of Transposition Graphs. Discrete Applied Mathematics 84(1-3): 221-235 (1998)
1997
2	EE	Ladislav Stacho: A sufficient condition guaranteeing large cycles in graphs. Discrete Mathematics 169(1-3): 273-277 (1997)
1996
1		Ladislav Stacho, Imrich Vrto: Virtual Path Layout for Some Bounded Degree Networks. SIROCCO 1996: 269-178

Coauthor Index

1	Noga Alon	[11]
2	Petra Berenbrink	[20]
3	Edgar Chávez	[13] [16] [19] [26] [27] [30]
4	Peter Clote	[34]
5	Jurek Czyzowicz	[39]
6	Stefan Dobrev	[13] [16] [19] [26] [27] [30] [39]
7	Guillaume Fertin	[11] [24]
8	Tom Friedetzky	[20]
9	Luisa Gargano	[9] [14]
10	Luis A. Goddyn	[21]
11	H. González-Aguilar	[39]
12	Arvind Gupta	[15] [17] [18] [22] [23] [28] [31] [35] [36] [40]
13	Mikael Hammar	[14]
14	Pavol Hell	[9] [14]
15	Jan van den Heuvel	[36]
16	Peter Horák	[7]
17	Tomás Kaiser	[32]
18	Daniel Král	[32] [33] [37]
19	Rastislav Kralovic	[39]
20	Evangelos Kranakis	[13] [16] [19] [26] [27] [29] [30] [34] [38] [39]
21	Danny Krizanc	[34]
22	Arthur L. Liestman	[11] [24]
23	Ján Manuch	[10] [15] [17] [18] [20] [22] [23] [28] [31] [35] [36] [40] [41]
24	Tim Mott	[29] [38]
25	Jaroslav Opatrny	[13] [16] [19] [26] [27] [30] [39]
26	Thomas C. Shermer	[11] [24]
27	Jozef Sirán	[12]
28	Christine Stoll	[41]
29	Dávid Szeszlér	[25]
30	Héctor Tejeda	[26]
31	Jorge Urrutia	[13] [16] [19] [26] [27] [30] [39]
32	Ugo Vaccaro	[9] [14]
33	Imrich Vrto	[1] [3] [6]
34	Xiaohong Zhao	[23] [28] [31] [35] [36] [40]
35	Sanming Zhou	[12]
36	Chenchen Zhu	[18]

Colors in the list of coauthors