The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gábor Rétvári: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gábor Rétvári, József Bíró, Tibor Cinkler, Tamás Henk
    A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:260-268 [Conf]
  2. Gábor Rétvári, József Bíró, Tibor Cinkler
    A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. [Citation Graph (0, 0)][DBLP]
    ISCC, 2004, pp:957-962 [Conf]
  3. Gábor Rétvári
    Minimum Interference Routing: The Precomputation Perspective. [Citation Graph (0, 0)][DBLP]
    MMNS, 2003, pp:246-258 [Conf]
  4. Gábor Rétvári, József Bíró, Tibor Cinkler
    On Improving the Accuracy of OSPF Traffic Engineering. [Citation Graph (0, 0)][DBLP]
    Networking, 2006, pp:51-62 [Conf]
  5. Gábor Rétvári, Róbert Szabó, József Bíró
    On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:1180-1191 [Conf]
  6. János Levendovszky, Alpár Fancsali, Csaba Végsö, Gábor Rétvári
    QoS Routing with Incomplete Information by Analog Computing Algorithms. [Citation Graph (0, 0)][DBLP]
    QofIS, 2001, pp:127-137 [Conf]
  7. Gábor Rétvári, József Bíró, Tibor Cinkler
    Fairness in Capacitated Networks: A Polyhedral Approach. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1604-1612 [Conf]
  8. Gábor Enyedi, Gábor Rétvári, Tibor Cinkler
    A Novel Loop-Free IP Fast Reroute Algorithm. [Citation Graph (0, 0)][DBLP]
    EUNICE, 2007, pp:111-119 [Conf]

  9. Routing-Independent Fairness in Capacitated Networks. [Citation Graph (, )][DBLP]


  10. IP Fast ReRoute: Lightweight Not-Via without Additional Addresses. [Citation Graph (, )][DBLP]


  11. Demand-Oblivious Routing: Distributed vs. Centralized Approaches. [Citation Graph (, )][DBLP]


  12. On Finding maximally redundant trees in strictly linear time. [Citation Graph (, )][DBLP]


  13. IP Fast ReRoute: Lightweight Not-Via. [Citation Graph (, )][DBLP]


  14. OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. [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