Marios Mavronicolas

	2011
119		Vittorio Bilò, Marios Mavronicolas: Complexity of Rational and Irrational Nash Equilibria. SAGT 2011: 200-211
118		Marios Mavronicolas: Preface: Algorithmic Game Theory. Theory Comput. Syst. 49(1): 1-2 (2011)
	2010
117		Marios Mavronicolas: Some Algorithmic Questions About Nash Equilibria. Bulletin of the EATCS 100: 35-51 (2010)
116		Marios Mavronicolas, Thomas Sauerwald: The impact of randomization in smoothing networks. Distributed Computing 22(5-6): 381-411 (2010)
115		Costas Busch, Marios Mavronicolas: An efficient counting network. Theor. Comput. Sci. 411(34-36): 3001-3030 (2010)
114		Rainer Feldmann, Marios Mavronicolas, Andreas Pieris: Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory Comput. Syst. 47(1): 60-112 (2010)
113		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010)
	2009
112		Marios Mavronicolas, Vicky G. Papadopoulou: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings Springer 2009
111		Marios Mavronicolas, Thomas Sauerwald: A randomized, o(log w)-depth 2 smoothing network. SPAA 2009: 178-187
110		Rainer Feldmann, Marios Mavronicolas, Burkhard Monien: Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009: 280-291
109		Marios Mavronicolas, Paul G. Spirakis: A glimpse at Christos H. Papadimitriou. Computer Science Review 3(2): 55-63 (2009)
108		Marios Mavronicolas, Loizos Michael: A substitution theorem for graceful trees and its applications. Discrete Mathematics 309(12): 3757-3766 (2009)
107		Marios Mavronicolas: Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer). SIGACT News 40(2): 25-27 (2009)
106		Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis: Preface. Theor. Comput. Sci. 410(17): 1551 (2009)
105		Marios Mavronicolas: Preface. Theor. Comput. Sci. 410(36): 3303-3304 (2009)
104		Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009)
103		Marios Mavronicolas, Loizos Michael, Paul G. Spirakis: Computing on a partially eponymous ring. Theor. Comput. Sci. 410(6-7): 595-613 (2009)
	2008
102		Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou: How Many Attackers Can Selfish Defenders Catch? HICSS 2008: 470
101		Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann: Voronoi Games on Cycle Graphs. MFCS 2008: 503-514
100		Marios Mavronicolas, Thomas Sauerwald: The impact of randomization in smoothing networks. PODC 2008: 345-354
99		Rainer Feldmann, Marios Mavronicolas, Andreas Pieris: Facets of the Fully Mixed Nash Equilibrium Conjecture. SAGT 2008: 145-157
98		Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis: A Network Game with Attackers and a Defender. Algorithmica 51(3): 315-341 (2008)
97		Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis: Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52(1): 19-43 (2008)
96		Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou: How Many Attackers Can Selfish Defenders Catch? CoRR abs/0812.4206: (2008)
95		Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld: Sequentially consistent versus linearizable counting networks. Distributed Computing 21(4): 249-269 (2008)
94		Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis: A graph-theoretic network security game. IJAACS 1(4): 390-410 (2008)
93		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74(7): 1199-1225 (2008)
92		Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: A new model for selfish routing. Theor. Comput. Sci. 406(3): 187-206 (2008)
	2007
91		Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann: Congestion Games with Player-Specific Constants. MFCS 2007: 633-644
90		Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner: Weighted Boolean Formula Games. WINE 2007: 469-481
89		Marios Mavronicolas, Paul G. Spirakis: The Price of Selfish Routing. Algorithmica 48(1): 91-126 (2007)
88		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distrib. Comput. 67(11): 1168-1186 (2007)
87		Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis: Performance and stability bounds for dynamic networks. J. Parallel Distrib. Comput. 67(4): 386-399 (2007)
86		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007)
85		Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis: The increase of the instability of networks due to Quasi-Static link capacities. Theor. Comput. Sci. 381(1-3): 44-56 (2007)
	2006
84		Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings Springer 2006
83		Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis: The Price of Defense and Fractional Matchings. ICDCN 2006: 115-126
82		Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis: The Power of the Defender. ICDCS Workshops 2006: 37
81		Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis: The Price of Defense. MFCS 2006: 717-728
80		Marios Mavronicolas, Loizos Michael, Paul G. Spirakis: Computing on a Partially Eponymous Ring. OPODIS 2006: 380-394
79		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006)
78		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Restricted Parallel Links. Parallel Processing Letters 16(1): 117-132 (2006)
77		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006)
	2005
76		Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis: A Cost Mechanism for Fair Pricing of Resource Usage. Algorithmic Aspects of Large and Complex Networks 2005
75		Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis: Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Algorithmic Aspects of Large and Complex Networks 2005
74		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005
73		Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis: Network Game with Attacker and Protector Entities. ISAAC 2005: 288-297
72		Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209
71		Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis: A Cost Mechanism for Fair Pricing of Resource Usage. WINE 2005: 210-224
70		Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis: A Graph-Theoretic Network Security Game. WINE 2005: 969-978
69		Costas Busch, Marios Mavronicolas, Paul G. Spirakis: An Application of the Monotone Linearizability Lemma. Bulletin of the EATCS 85: 70-80 (2005)
68		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: Max-min Fair Flow Control Sensitive to Priorities. Journal of Interconnection Networks 6(2): 85-114 (2005)
67		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34(5): 1216-1252 (2005)
66		Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005)
65		Samson Abramsky, Marios Mavronicolas: Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. 343(1-2): 1-3 (2005)
64		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343(1-2): 133-157 (2005)
63		Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis: The Impact of Network Structure on the Stability of Greedy Protocols. Theory Comput. Syst. 38(4): 425-460 (2005)
	2004
62		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. ESA 2004: 134-145
61		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer: Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827
60		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657
59		Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis: Performance and Stability Bounds for Dynamic Networks. ISPAN 2004: 239-246
58		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585
57		Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: A New Model for Selfish Routing. STACS 2004: 547-558
56		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622
55		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Routing. WAOA 2004: 239-252
	2003
54		Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis: The Impact of Network Structure on the Stability of Greedy Protocols. CIAC 2003: 251-263
53		Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis: A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. Euro-Par 2003: 1003-1016
52		Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Extreme Nash Equilibria. ICTCS 2003: 1-20
51		Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto: Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561
50		Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis: Instability of Networks with Quasi-Static Link Capacities. SIROCCO 2003: 179-194
49		Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72
48		Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis: FIFO is Unstable at Arbitrarily Low Rates Electronic Colloquium on Computational Complexity (ECCC) 10(016): (2003)
47		Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis: A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. Parallel Processing Letters 13(4): 615-627 (2003)
46		Marios Mavronicolas, Nikos Papadakis: Trade-off results for connection management. Theor. Comput. Sci. 290(1): 1-57 (2003)
45		Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003)
	2002
44		Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis: On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. DISC 2002: 88-102
43		Marios Mavronicolas, André Schiper: Distributed Systems and Algorithms. Euro-Par 2002: 551-552
42		Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134
41		Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235
40		Marios Mavronicolas: Review of Introduction to Distributed Algorithms. SIGACT News 33(2): 16-18 (2002)
39		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002)
	2001
38		Marios Mavronicolas, Paul G. Spirakis: The price of selfish routing. STOC 2001: 510-519
37		Marios Mavronicolas: The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example). Bulletin of the EATCS 73: 99-106 (2001)
36		Marios Mavronicolas: Stability in Routing: Networks and Protocols. Bulletin of the EATCS 74: 119-134 (2001)
	2000
35		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582
34		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the EATCS 71: 114-132 (2000)
33		Marios Mavronicolas: Annotated Bibliography on Counting Networks. Bulletin of the EATCS 72: 123-132 (2000)
32		William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. Chicago J. Theor. Comput. Sci. 2000: (2000)
	1999
31		Maria Eleftheriou, Marios Mavronicolas: Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. DISC 1999: 327-341
30		Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis: Optimal, Distributed Decision-Making: The Case of No Communication. FCT 1999: 293-303
29		Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld: Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142
28		Marios Mavronicolas, Paul G. Spirakis: Optimal, Distributed Decision-Making: The Case of no Communication. PODC 1999: 279
27		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61
26		William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403
25		Marios Mavronicolas, Dan Roth: Linearizable Read/Write Objects. Theor. Comput. Sci. 220(1): 267-319 (1999)
	1998
24		Costas Busch, Marios Mavronicolas: An Efficient Counting Network. IPPS/SPDP 1998: 380-384
23		Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis: MaxMin Fair Flow Control Sensitive to Priorities. OPODIS 1998: 45-60
22		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. PODC 1998: 311
21		Leonidas Hadjimitsis, Marios Mavronicolas: Contention in Balancing Networks Resolved (Extended Abstract). PODC 1998: 41-50
20		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. SIROCCO 1998: 244-258
	1997
19		Marios Mavronicolas, Philippas Tsigas: Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings Springer 1997
18		Marios Mavronicolas, Nikos Papadakis: Trade-Off Results for Connection Management. FCT 1997: 340-351
17		Marios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas: The Impact of Timing on Linearizability in Counting Networks. IPPS 1997: 684-688
16		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). PODC 1997: 139-148
15		Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: Advances in Rate-Based Flow Control. SIROCCO 1997: 266-281
14		Costas Busch, Marios Mavronicolas: Impossibility Results for Weak Threshold Networks. Inf. Process. Lett. 63(2): 85-90 (1997)
13		Marios Mavronicolas: Balancing Networks: State of the Art. Inf. Sci. 97(1&2): 125-157 (1997)
	1996
12		Marios Mavronicolas: Wait-Free Solvability Via Combinatorial Topology (Abstract). PODC 1996: 277
11		Costas Busch, Marios Mavronicolas: The Strength of Counting Networks (Abstract). PODC 1996: 311
10		Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. J. ACM 43(5): 794-839 (1996)
	1995
9		Costas Busch, Marios Mavronicolas: A Logarithmic Depth Counting Network (Abstract). PODC 1995: 274
8		Sarantos Kapidakis, Marios Mavronicolas: Load Balancing Networks (Abstract). PODC 1995: 275
	1994
7		Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. PODC 1994: 206-215
6		Marios Mavronicolas: The Impact of Synchronization on the Session Problem. PODC 1994: 379
5		Costas Busch, Nikos Hardavellas, Marios Mavronicolas: Contention in Counting Networks. PODC 1994: 404
4		Hagit Attiya, Marios Mavronicolas: Efficiency of Semisynchronous Versus. Mathematical Systems Theory 27(6): 547-571 (1994)
	1993
3		Nikos Hardavellas, Damianos Karakos, Marios Mavronicolas: Notes on Sorting and Counting Networks (Extended Abstract). WDAG 1993: 234-248
	1992
2		Marios Mavronicolas: An upper and a lower bound for tick synchronization. IEEE Real-Time Systems Symposium 1992: 246-255
1		Marios Mavronicolas, Dan Roth: Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract). WDAG 1992: 346-361

Coauthor Index

1	Samson Abramsky	[65]
2	William Aiello	[26] [32]
3	Hagit Attiya (Chagit Attiya)	[4]
4	Vittorio Bilò	[119]
5	Costas Busch	[5] [7] [9] [10] [11] [14] [24] [26] [27] [32] [34] [35] [39] [49] [55] [61] [62] [66] [69] [79] [86] [88] [115]
6	Ioannis Chatzigiannakis	[47] [53]
7	Neophytos Demetriou	[27] [34] [35] [39]
8	Tassos Dimitriou	[47] [53]
9	Maria Eleftheriou	[31]
10	Robert Elsässer	[72]
11	Panagiota Fatourou	[15] [16] [20] [22] [67] [68]
12	Pimitris Fatourou	[23]
13	Rainer Feldmann	[99] [110] [114]
14	Dimitris Fotakis	[42] [104]
15	Martin Gairing	[52] [56] [58] [60] [64] [72] [74] [77] [78] [93] [113]
16	Marina Gelastou	[82]
17	Stavros Georgiades	[30]
18	Leonidas Hadjimitsis	[21]
19	Nikolaos Hardavellas (Nikos Hardavellas)	[3] [5]
20	Maurice Herlihy	[26] [27] [32] [34] [35] [39]
21	Sarantos Kapidakis	[8]
22	Damianos Karakos	[3]
23	Spyros C. Kontogiannis	[42] [84] [104] [106]
24	Dimitrios Koukopoulos	[44] [48] [50] [54] [59] [63] [85] [87]
25	Elias Koutsoupias	[41] [42] [45] [104]
26	Vicky Papadopoulou Lesta (Vicky G. Papadopoulou, Vicky Papadopoulou)	[70] [73] [81] [82] [83] [94] [96] [98] [101] [102] [112]
27	Thomas Lücking	[51] [52] [56] [57] [58] [60] [64] [72] [74] [77] [78] [92] [93] [113]
28	Malik Magdon-Ismail	[55] [61] [62] [79] [86] [88]
29	Michael Merritt	[29] [95]
30	Loizos Michael	[80] [81] [103] [108]
31	Igal Milchtaich	[91]
32	Burkhard Monien	[51] [52] [56] [57] [58] [60] [64] [72] [74] [77] [78] [90] [91] [92] [93] [96] [101] [102] [110] [113]
33	Sotiris E. Nikoletseas	[44] [47] [53] [54] [63]
34	Panagiota N. Panagopoulou	[71] [75] [76] [97]
35	Nikos Papadakis	[18] [46]
36	Marina Papatriantafilou	[17]
37	Giuseppe Persiano (Pino Persiano)	[83]
38	Anna Philippou	[70] [73] [81] [82] [83] [94] [98]
39	Andreas Pieris	[99] [114]
40	Manuel Rode	[51] [57] [60] [92] [93]
41	Dan Roth	[1] [25]
42	Thomas Sauerwald	[100] [111] [116]
43	André Schiper	[43]
44	Florian Schoppmann	[101]
45	Nir Shavit	[26] [32]
46	Paul G. Spirakis	[15] [16] [20] [22] [23] [28] [30] [38] [41] [42] [44] [45] [47] [48] [49] [50] [51] [52] [53] [54] [59] [62] [63] [64] [66] [67] [68] [69] [70] [71] [73] [75] [76] [79] [80] [81] [82] [83] [84] [85] [87] [89] [94] [97] [98] [103] [104] [106] [109]
47	Gadi Taubenfeld	[29] [95]
48	Karsten Tiemann	[91]
49	Dan Touitou	[26] [32]
50	Philippas Tsigas	[17] [19]
51	Imrich Vrto (Imrich Vrt'o)	[51]
52	Klaus W. Wagner	[90]
53	Roger Wattenhofer	[61]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page