Ján Plesník Heuristics for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:451-463 [Journal]

Ján Plesník Constrained Weighted Matchings and Edge Coverings in Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:229-241 [Journal]

Ján Plesník The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:4, pp:199-201 [Journal]

Ján Plesník Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2001, v:5, n:3, pp:275-286 [Journal]

Ján Plesník A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:284-297 [Journal]

Ján Plesník A note on the complexity of finding regular subgraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:49, n:2, pp:161-167 [Journal]

Ján Plesník Equivalence between the minimum covering problem and the maximum matching problem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:49, n:3, pp:315-317 [Journal]

Search in 0.014secs, Finished in 0.015secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP