The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gábor Rudolf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nilay Noyan, Gábor Rudolf, Andrzej Ruszczynski
    Relaxations of linear programming problems with first order stochastic dominance constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:6, pp:653-659 [Journal]
  2. Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
    Generating Minimal k-Vertex Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:222-231 [Conf]

  3. Minimal Universal Bipartite Graphs. [Citation Graph (, )][DBLP]


  4. Generating 3-vertex connected spanning subgraphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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