Martin Gairing

2008
28	EE	Martin Gairing: Malicious Bayesian Congestion Games. WAOA 2008: 119-132
27	EE	Martin Gairing: Malicious Bayesian Congestion Games CoRR abs/0805.2421: (2008)
26	EE	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)
25	EE	Martin Gairing, Burkhard Monien, Karsten Tiemann: Selfish Routing with Incomplete Information. Theory Comput. Syst. 42(1): 91-130 (2008)
2007
24	EE	Martin Gairing, Florian Schoppmann: Total Latency in Singleton Congestion Games. WINE 2007: 381-387
23	EE	Martin Gairing, Burkhard Monien, Andreas Woclaw: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2): 87-99 (2007)
2006
22	EE	Martin Gairing, Burkhard Monien, Karsten Tiemann: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) 2006: 501-512
21	EE	Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229
20	EE	Dominic Dumrauf, Martin Gairing: Price of Anarchy for Polynomial Wardrop Games. WINE 2006: 319-330
19	EE	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)
18	EE	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
17	EE	Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005
16	EE	Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65
15	EE	Martin Gairing, Burkhard Monien, Andreas Woclaw: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839
14	EE	Martin Gairing, Burkhard Monien, Karsten Tiemann: Selfish routing with incomplete information. SPAA 2005: 203-212
13	EE	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
12	EE	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)
2004
11	EE	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
10	EE	Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585
9	EE	Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622
8		Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen: A Self-stabilizing Algorithm for Maximal 2-packing. Nord. J. Comput. 11(1): 1-11 (2004)
7	EE	Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 14(1): 75-82 (2004)
6	EE	Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4): 387-398 (2004)
2003
5	EE	Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526
4	EE	Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Extreme Nash Equilibria. ICTCS 2003: 1-20
3	EE	Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45
2	EE	Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60
1		Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-Cooperative Networks: A Survey. Bulletin of the EATCS 81: 137-164 (2003)

Coauthor Index

1	Sebastian Aland	[21]
2	Dominic Dumrauf	[20] [21]
3	Robert Elsässer	[13]
4	Rainer Feldmann	[1] [3] [5]
5	Robert Geist	[8]
6	Wayne Goddard	[6] [7]
7	Stephen T. Hedetniemi	[2] [6] [7] [8]
8	David Pokrass Jacobs	[7]
9	Petter Kristiansen	[2] [6] [8]
10	Thomas Lücking	[1] [3] [4] [5] [9] [10] [11] [12] [13] [16] [17] [18] [19] [26]
11	Marios Mavronicolas	[4] [9] [10] [11] [12] [13] [17] [18] [19] [26]
12	Alice A. McRae	[2] [6]
13	Burkhard Monien	[1] [3] [4] [5] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [21] [22] [23] [25] [26]
14	Manuel Rode	[1] [3] [5] [11] [26]
15	Florian Schoppmann	[21] [24]
16	Paul G. Spirakis	[4] [12]
17	Karsten Tiemann	[14] [16] [22] [25]
18	Andreas Woclaw	[15] [23]

Colors in the list of coauthors