prof. RNDr. Ján Plesník, DrSc.

miestnosť (room): M 230
telefón (phone): (02/602 95) 620
e-mail: Jan.Plesnik@fmph.uniba.sk

Naposledy uverejnené články (Recently published papers)
  • Baskoro E. T., Miller M., Plesník J.: On the structure of digraphs with order close to the Moore bound. Graphs and Combinatorics 14(1998), 109-119.
  • Plesník J.: Constrained weighted matchings and edge coverings in graphs. Discrete Appl. Math. 92(1999), 229-241.
  • Plesník J.: The Steiner tree problem in graphs: worst case examples for insertion heuristics. IJMA (Intern. J. Math. Algorithms) 1(1999), 21-34.
  • Baskoro E.T., Miller M., Plesník J.: Further results on almost Moore digraphs. Ars Combinatoria 56(2000), 43-63.
  • Plesník J.: Minimum cost edge subset covering exactly k vertices of a graph. J. Comb. Optim. 5(2001), 275-286.
  • Plesník J.: Towards minimum k-geodetically connected graphs. Networks 41(2003), 73--82.
  • Plesník J.: Minimum k-geodetically connected digraphs.
    • Networks 44(2004), 243--253.