Gábor Rétvári Vis

*	2009
14	EE	Gábor Enyedi, Gábor Rétvári, András Császár: On Finding maximally redundant trees in strictly linear time. ISCC 2009: 206-211
13	EE	Gábor Rétvári, Felician Németh, Ranganai Chaparadza, Róbert Szabó: OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. MACE 2009: 72-85
12	EE	Gábor Enyedi, Gábor Rétvári, Péter Szilágyi, András Császár: IP Fast ReRoute: Lightweight Not-Via. Networking 2009: 157-168
	2007
11	EE	Gábor Enyedi, Gábor Rétvári, Tibor Cinkler: A Novel Loop-Free IP Fast Reroute Algorithm. EUNICE 2007: 111-119
10	EE	Gábor Rétvári, József Bíró, Tibor Cinkler: Routing-Independent Fairness in Capacitated Networks. ICC 2007: 6344-6349
9	EE	Gábor Rétvári, József Bíró, Tibor Cinkler: Fairness in Capacitated Networks: A Polyhedral Approach. INFOCOM 2007: 1604-1612
8	EE	András Császár, Gábor Enyedi, Gábor Rétvári, Markus Hidell, Peter Sjödin: Converging the Evolution of Router Architectures and IP Networks. IEEE Network 21(4): 8-14 (2007)
7	EE	Gábor Rétvári, József Bíró, Tibor Cinkler: On shortest path representation. IEEE/ACM Trans. Netw. 15(6): 1293-1306 (2007)
	2006
6	EE	Gábor Rétvári, József Bíró, Tibor Cinkler: On Improving the Accuracy of OSPF Traffic Engineering. Networking 2006: 51-62
	2005
5	EE	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. INFOCOM 2005: 260-268
	2004
4	EE	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. ISCC 2004: 957-962
3	EE	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. NETWORKING 2004: 1180-1191
	2003
2	EE	Gábor Rétvári: Minimum Interference Routing: The Precomputation Perspective. MMNS 2003: 246-258
	2001
1	EE	János Levendovszky, Alpár Fancsali, Csaba Végsö, Gábor Rétvári: QoS Routing with Incomplete Information by Analog Computing Algorithms. QofIS 2001: 127-137

Coauthor Index

1	József Bíró	[3] [4] [5] [6] [7] [9] [10]
2	Ranganai Chaparadza	[13]
3	Tibor Cinkler	[4] [5] [6] [7] [9] [10] [11]
4	András Császár	[8] [12] [14]
5	Gábor Enyedi	[8] [11] [12] [14]
6	Alpár Fancsali	[1]
7	Tamás Henk	[5]
8	Markus Hidell	[8]
9	János Levendovszky	[1]
10	Felician Németh	[13]
11	Peter Sjödin	[8]
12	Róbert Szabó	[3] [13]
13	Péter Szilágyi	[12]
14	Csaba Végsö	[1]

Colors in the list of coauthors