The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ján Plesník: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edy Tri Baskoro, Mirka Miller, Ján Plesník
    Further results on almost Moore digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  2. 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. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Ján Plesník
    Towards minimum k-geodetically connected graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:2, pp:73-82 [Journal]
  9. Ján Plesník
    Minimum k-geodetically connected digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:243-253 [Journal]
  10. 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]
  11. 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.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002