| |
| 2004 | ||
|---|---|---|
| 11 | EE | Ján Plesník: Minimum k-geodetically connected digraphs. Networks 44(4): 243-253 (2004) |
| 2003 | ||
| 10 | EE | Ján Plesník: Towards minimum k-geodetically connected graphs. Networks 41(2): 73-82 (2003) |
| 2001 | ||
| 9 | Ján Plesník: Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. J. Comb. Optim. 5(3): 275-286 (2001) | |
| 2000 | ||
| 8 | Edy Tri Baskoro, Mirka Miller, Ján Plesník: Further results on almost Moore digraphs. Ars Comb. 56: (2000) | |
| 1999 | ||
| 7 | EE | Ján Plesník: Constrained Weighted Matchings and Edge Coverings in Graphs. Discrete Applied Mathematics 92(2-3): 229-241 (1999) |
| 1998 | ||
| 6 | EE | Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán: A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments. Electr. J. Comb. 5: (1998) |
| 1992 | ||
| 5 | EE | Ján Plesník: Heuristics for the Steiner Problem in Graphs. Discrete Applied Mathematics 37/38: 451-463 (1992) |
| 1984 | ||
| 4 | EE | Ján Plesník: A note on the complexity of finding regular subgraphs. Discrete Mathematics 49(2): 161-167 (1984) |
| 3 | EE | Ján Plesník: Equivalence between the minimum covering problem and the maximum matching problem. Discrete Mathematics 49(3): 315-317 (1984) |
| 2 | EE | Ján Plesník: A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. J. Comb. Theory, Ser. B 36(3): 284-297 (1984) |
| 1979 | ||
| 1 | Ján Plesník: The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. Inf. Process. Lett. 8(4): 199-201 (1979) | |
| 1 | Edy Tri Baskoro | [8] |
| 2 | Ljiljana Brankovic | [6] |
| 3 | Mirka Miller | [6] [8] |
| 4 | Joseph F. Ryan | [6] |
| 5 | Jozef Sirán | [6] |