Dieter Rautenbach

	2012
131		Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman: On the Radon Number for P 3-Convexity. LATIN 2012: 267-278
130		Dieter Rautenbach, Jayme Luiz Szwarcfiter: Unit and single point interval graphs. Discrete Applied Mathematics 160(10-11): 1601-1609 (2012)
129		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Independent sets and matchings in subcubic graphs. Discrete Mathematics 312(11): 1900-1910 (2012)
128		Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter: On the Convexity Number of Graphs. Graphs and Combinatorics 28(3): 333-345 (2012)
127		Christian Löwenstein, Dieter Rautenbach: Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. Graphs and Combinatorics 28(3): 407-421 (2012)
	2011
126		Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192
125		Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen: Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96
124		Christian Löwenstein, Dieter Rautenbach, Friedrich Regen: On Hamiltonian paths in distance graphs. Appl. Math. Lett. 24(7): 1075-1079 (2011)
123		Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter: On subbetweennesses of trees: Hardness, algorithms, and characterizations. Computers & Mathematics with Applications 62(12): 4674-4681 (2011)
122		Jochen Harant, Dieter Rautenbach: Independence in connected graphs. Discrete Applied Mathematics 159(1): 79-86 (2011)
121		Anders Sune Pedersen, Dieter Rautenbach: Recolouring-resistant colourings. Discrete Applied Mathematics 159(10): 1013-1021 (2011)
120		Dieter Rautenbach: Average distance and domination number revisited. Discrete Applied Mathematics 159(11): 1180-1182 (2011)
119		Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen: Lower bounds on the independence number of certain graphs of odd girth at least seven. Discrete Applied Mathematics 159(2-3): 143-151 (2011)
118		Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter: Characterization and representation problems for intersection betweennesses. Discrete Applied Mathematics 159(5): 389-395 (2011)
117		Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter: Powers of cycles, powers of paths, and distance graphs. Discrete Applied Mathematics 159(7): 621-627 (2011)
116		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Dominating sets, packings, and the maximum degree. Discrete Mathematics 311(18-19): 2031-2036 (2011)
115		Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer: Finite Sholander trees, trees, and their betweenness. Discrete Mathematics 311(20): 2143-2147 (2011)
114		Mitre Costa Dourado, Dieter Rautenbach, Philipp Matthias Schäfer: On finite convexity spaces induced by sets of paths in graphs. Discrete Mathematics 311(8-9): 616-619 (2011)
113		Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter: On the Carathéodory Number for the Convexity of Paths of Order Three. Electronic Notes in Discrete Mathematics 38: 105-110 (2011)
112		Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen: Independence, odd girth, and average degree. Journal of Graph Theory 67(2): 96-111 (2011)
111		Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Connectivity and diameter in distance graphs. Networks 57(4): 310-315 (2011)
110		Dieter Rautenbach, Philipp Matthias Schäfer: Strict Betweennesses Induced by Posets as well as by Graphs. Order 28(1): 89-97 (2011)
109		Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Irreversible conversion of graphs. Theor. Comput. Sci. 412(29): 3693-3700 (2011)
	2010
108		Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Brief Announcement: On Reversible and Irreversible Conversions. DISC 2010: 395-397
107		Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA 2010: 1-9
106		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: An independent dominating set in the complement of a minimum dominating set of a tree. Appl. Math. Lett. 23(1): 79-81 (2010)
105		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey: Disjoint dominating and total dominating sets in graphs. Discrete Applied Mathematics 158(15): 1615-1623 (2010)
104		Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel: Packing disjoint cycles over vertex cuts. Discrete Mathematics 310(13-14): 1974-1978 (2010)
103		Anett Boßecker, Dieter Rautenbach: Interpolating between bounds on the independence number. Discrete Mathematics 310(17-18): 2398-2403 (2010)
102		Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz: Edge colouring by total labellings. Discrete Mathematics 310(2): 199-205 (2010)
101		Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Long cycles and paths in distance graphs. Discrete Mathematics 310(23): 3417-3420 (2010)
100		Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Some remarks on the geodetic number of a graph. Discrete Mathematics 310(4): 832-837 (2010)
99		Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen: Packing edge-disjoint cycles in graphs and the cyclomatic number. Discrete Mathematics 310(9): 1456-1462 (2010)
98		Carmen C. Centeno, S. Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Convex Partitions of Graphs induced by Paths of Order Three. Discrete Mathematics & Theoretical Computer Science 12(5): 175-184 (2010)
97		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Partitioning a graph into a dominating set, a total dominating set, and something else. Discussiones Mathematicae Graph Theory 30(4): 563-574 (2010)
96		Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer: Random Procedures for Dominating Sets in Graphs. Electr. J. Comb. 17(1): (2010)
95		Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen: Minimum degree and density of binary sequences. Eur. J. Comb. 31(7): 1936-1945 (2010)
94		Christian Löwenstein, Dieter Rautenbach: Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs. Graphs and Combinatorics 26(3): 407-424 (2010)
93		Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen: The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010)
92		Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer: Cycle length parities and the chromatic number. Journal of Graph Theory 64(3): 210-218 (2010)
91		Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter: On the Hull Number of Triangle-Free Graphs. SIAM J. Discrete Math. 23(4): 2163-2172 (2010)
90		Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa: Edge-Injective and Edge-Surjective Vertex Labellings. SIAM J. Discrete Math. 24(2): 666-683 (2010)
89		Andreas Brandstädt, Van Bang Le, Dieter Rautenbach: Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010)
	2009
88		Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen: Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50
87		Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328
86		Jochen Harant, Dieter Rautenbach: Domination in bipartite graphs. Discrete Mathematics 309(1): 113-122 (2009)
85		Stephan Brandt, Jozef Miskuf, Dieter Rautenbach: Edge irregular total labellings for graphs of linear size. Discrete Mathematics 309(12): 3786-3792 (2009)
84		Andreas Brandstädt, Van Bang Le, Dieter Rautenbach: A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discrete Mathematics 309(12): 3843-3852 (2009)
83		Christian Löwenstein, Dieter Rautenbach, Friedrich Regen: On spanning tree congestion. Discrete Mathematics 309(13): 4653-4655 (2009)
82		Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Remarks about disjoint dominating sets. Discrete Mathematics 309(23-24): 6451-6458 (2009)
81		Klaus Meer, Dieter Rautenbach: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics 309(4): 843-851 (2009)
80		Dieter Rautenbach, Lutz Volkmann: On the existence of edge cuts leaving several large components. Discrete Mathematics 309(6): 1703-1707 (2009)
79		Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer: On F-independence in graphs. Discussiones Mathematicae Graph Theory 29(2): 377-383 (2009)
78		Dieter Rautenbach, Friedrich Regen: On packing shortest cycles in graphs. Inf. Process. Lett. 109(14): 816-821 (2009)
77		Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch: An Omega(nlogn) lower bound for computing the sum of even-ranked elements. Inf. Process. Lett. 109(16): 955-956 (2009)
76		Jens Maßberg, Dieter Rautenbach: Binary trees with choosable edge lengths. Inf. Process. Lett. 109(18): 1087-1092 (2009)
75		Sven Peyer, Dieter Rautenbach, Jens Vygen: A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms 7(4): 377-390 (2009)
	2008
74		Dieter Rautenbach: A note on domination, girth and minimum degree. Discrete Mathematics 308(11): 2325-2329 (2008)
73		F. Dahme, Dieter Rautenbach, Lutz Volkmann: alpha-Domination perfect trees. Discrete Mathematics 308(15): 3187-3198 (2008)
72		Dieter Rautenbach, Lutz Volkmann: Some remarks on lambdap, q-connectedness. Discrete Mathematics 308(23): 5562-5569 (2008)
71		Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer: The independence number in graphs of maximum degree three. Discrete Mathematics 308(23): 5829-5833 (2008)
70		Dieter Rautenbach, Christian Szegedy, Jürgen Werber: On the cost of optimal alphabetic code trees with unequal letter costs. Eur. J. Comb. 29(2): 386-394 (2008)
69		Christian Löwenstein, Dieter Rautenbach: Domination in Graphs of Minimum Degree at least Two and Large Girth. Graphs and Combinatorics 24(1): 37-46 (2008)
68		Stephan Brandt, Jozef Miskuf, Dieter Rautenbach: On a conjecture about edge irregular total labelings. Journal of Graph Theory 57(4): 333-343 (2008)
67		Dieter Rautenbach: A conjecture of Borodin and a coloring of Grünbaum. Journal of Graph Theory 58(2): 139-147 (2008)
66		Dieter Rautenbach, Lutz Volkmann: Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008)
	2007
65		Jürgen Werber, Dieter Rautenbach, Christian Szegedy: Timing optimization by restructuring long combinatorial paths. ICCAD 2007: 536-543
64		Dieter Rautenbach, Bruce Reed: Domination in Cubic Graphs of Large Girth. KyotoCGGT 2007: 186-190
63		Dieter Rautenbach, Lutz Volkmann: New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett. 20(1): 98-102 (2007)
62		Dieter Rautenbach: Regular Weighted Graphs Without Positive Cuts. Ars Comb. 84: (2007)
61		Dieter Rautenbach, Christian Szegedy, Jürgen Werber: The delay of circuits whose inputs have specified arrival times. Discrete Applied Mathematics 155(10): 1233-1243 (2007)
60		Michael A. Henning, Dieter Rautenbach: On the irregularity of bipartite graphs. Discrete Mathematics 307(11-12): 1467-1472 (2007)
59		Dieter Rautenbach: Dominating and large induced trees in regular graphs. Discrete Mathematics 307(24): 3177-3186 (2007)
58		Yair Caro, Dieter Rautenbach: Reconstructing graphs from size and degree properties of their induced k-subgraphs. Discrete Mathematics 307(6): 694-703 (2007)
57		Frédéric Maffray, Dieter Rautenbach: Small step-dominating sets in trees. Discrete Mathematics 307(9-10): 1212-1215 (2007)
56		Vadim V. Lozin, Dieter Rautenbach: The relative clique-width of a graph. J. Comb. Theory, Ser. B 97(5): 846-858 (2007)
	2006
55		Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Dieter Rautenbach: Fundamental Limits on the Anonymity Provided by the MIX Technique. IEEE Symposium on Security and Privacy 2006: 86-99
54		Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen: Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127
53		Klaus Meer, Dieter Rautenbach: On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC 2006: 72-83
52		Dieter Rautenbach: Some remarks about leaf roots. Discrete Mathematics 306(13): 1456-1461 (2006)
51		Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discrete Mathematics 306(7): 670-672 (2006)
50		Dieter Rautenbach: A Conjecture of Borodin and a Coloring of Grünbaum. Electronic Notes in Discrete Mathematics 24: 187-194 (2006)
49		Dieter Rautenbach, Andreas Brandstädt, Van Bang Le: Distance-Hereditary 5-Leaf Powers. Electronic Notes in Discrete Mathematics 27: 85-86 (2006)
48		Dieter Rautenbach, Ingo Schiermeyer: Extremal Problems for Imbalanced Edges. Graphs and Combinatorics 22(1): 103-111 (2006)
47		Dieter Rautenbach, Christian Szegedy, Jürgen Werber: Delay optimization of linear depth boolean circuits with prescribed input arrival times. J. Discrete Algorithms 4(4): 526-537 (2006)
	2005
46		Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Extremal Trees with Respect to Dominance Order. Ars Comb. 76: (2005)
45		Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach: A note on the number of matchings and independent sets in trees. Discrete Applied Mathematics 145(3): 483-489 (2005)
44		Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Cuts leaving components of given minimum order. Discrete Mathematics 292(1-3): 55-65 (2005)
43		Dieter Rautenbach, Irene Stella: On the maximum number of cycles in a Hamiltonian graph. Discrete Mathematics 304(1-3): 101-107 (2005)
42		Dieter Rautenbach: Lower bounds on treespan. Inf. Process. Lett. 96(2): 67-70 (2005)
	2004
41		Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach: Competition polysemy. Discrete Mathematics 282(1-3): 251-255 (2004)
40		Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach: The solution of two problems on bound polysemy. Discrete Mathematics 282(1-3): 257-261 (2004)
39		Vadim V. Lozin, Dieter Rautenbach: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics 283(1-3): 151-158 (2004)
38		Dieter Rautenbach: Propagation of Mean Degrees. Electr. J. Comb. 11(1): (2004)
37		Dieter Rautenbach: Rectilinear Spanning Trees Versus Bounding Boxes. Electr. J. Comb. 11(1): (2004)
36		Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004)
35		Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach: The Numbers of Shared Upper Bounds Determine a Poset. Order 21(2): 131-135 (2004)
34		Vadim V. Lozin, Dieter Rautenbach: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM J. Discrete Math. 18(1): 195-206 (2004)
	2003
33		Dieter Rautenbach: Four traps are almost always enough to catch a square-celled animal. Ars Comb. 66: (2003)
32		Dieter Rautenbach: Finite sets in Rn given up to translation have reconstruction number three. Ars Comb. 68: (2003)
31		Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann: A Linear-programming Approach to the Generalized Randic Index. Discrete Applied Mathematics 128(2-3): 375-385 (2003)
30		Charles Delorme, Odile Favaron, Dieter Rautenbach: Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discrete Applied Mathematics 130(3): 503-512 (2003)
29		Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Maximum graphs with a unique minimum dominating set. Discrete Mathematics 260(1-3): 197-203 (2003)
28		Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Remarks on the bondage number of planar graphs. Discrete Mathematics 260(1-3): 57-67 (2003)
27		Dieter Rautenbach, Lutz Volkmann: Extremal subgraphs with respect to vertex degree bounds. Discrete Mathematics 263(1-3): 297-303 (2003)
26		Dieter Rautenbach, Lutz Volkmann: On alphargammas(k)-perfect graphs. Discrete Mathematics 270(1-3): 240-249 (2003)
25		Dieter Rautenbach: A note on trees of maximum weight and restricted degrees. Discrete Mathematics 271(1-3): 335-342 (2003)
24		Vadim V. Lozin, Dieter Rautenbach: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003)
	2002
23		Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann: Wiener index versus maximum degree in trees. Discrete Applied Mathematics 122(1-3): 127-137 (2002)
22		Dieter Rautenbach: On Kelly's lemma for infinite sets of integers. Discrete Mathematics 245(1-3): 279-282 (2002)
21		Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Weighted domination in triangle-free graphs. Discrete Mathematics 250(1-3): 233-239 (2002)
20		Dieter Rautenbach: Reconstructing infinite objects. Discrete Mathematics 250(1-3): 273-279 (2002)
19		Charles Delorme, Odile Favaron, Dieter Rautenbach: On the Randic Image index. Discrete Mathematics 257(1): 29-38 (2002)
18		Charles Delorme, Odile Favaron, Dieter Rautenbach: On the reconstruction of the degree sequence. Discrete Mathematics 259(1-3): 293-300 (2002)
17		Dieter Rautenbach, Lutz Volkmann: Independent domination and matchings in graphs. Discrete Mathematics 259(1-3): 325-330 (2002)
16		Dieter Rautenbach, Eberhard Triesch: Reconstruction up to isometries. Discrete Mathematics 259(1-3): 331-336 (2002)
15		Dieter Rautenbach: On a Reconstruction Problem of Harary and Manvel. J. Comb. Theory, Ser. A 99(1): 32-39 (2002)
14		Dieter Rautenbach, Eberhard Triesch: Reconstructing Infinite Sets of Integers. J. Comb. Theory, Ser. A 99(2): 297-306 (2002)
	2001
13		Dieter Rautenbach, Bruce A. Reed: Approximately covering by cycles in planar graphs. SODA 2001: 402-406
12		Dieter Rautenbach, Bruce A. Reed: The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Combinatorica 21(2): 267-278 (2001)
11		Dieter Rautenbach, Vadim E. Zverovich: Perfect graphs of strong domination and independent strong domination. Discrete Mathematics 226(1-3): 297-311 (2001)
10		Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach: On domination and annihilation in graphs with claw-free blocks. Discrete Mathematics 231(1-3): 143-151 (2001)
9		Dieter Rautenbach: On vertex orderings and the stability number in triangle-free graphs. Discrete Mathematics 231(1-3): 411-420 (2001)
8		Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann: i gamma(1)-perfect graphs. Discrete Mathematics 234(1-3): 133-138 (2001)
7		Dieter Rautenbach: Reconstructing Finite Sets of Points in Rnup to Groups of Isometries. Eur. J. Comb. 22(8): 1139-1147 (2001)
	2000
6		Dieter Rautenbach: Bounds on the strong domination number. Discrete Mathematics 215: 201-212 (2000)
5		Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann: A characterization of rho alpha(k)-perfect graphs. Discrete Mathematics 224(1-3): 265-271 (2000)
4		Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Some results on graph parameters in weighted graphs. Electronic Notes in Discrete Mathematics 5: 85-88 (2000)
	1999
3		Dieter Rautenbach: The influence of special vertices on strong domination. Discrete Mathematics 197-198: 683-690 (1999)
2		Dieter Rautenbach: On the differences between the upper irredundance, upper domination and independence numbers of a graph. Discrete Mathematics 203(1-3): 239-252 (1999)
	1998
1		Dieter Rautenbach, Lutz Volkmann: The domatic number of block-cactus graphs. Discrete Mathematics 187(1-3): 185-193 (1998)

Coauthor Index

1	Dakshi Agrawal	[55]
2	Sarah Artmann	[96]
3	Rommel M. Barbosa	[113]
4	Christoph Bartoschek	[54] [88] [93]
5	Anett Boßecker	[103]
6	Andreas Brandstädt	[49] [84] [89]
7	Stephan Brandt	[68] [85] [90] [95] [102]
8	Kristína Budajová	[102]
9	Yair Caro	[58]
10	Carmen C. Centeno	[98] [109]
11	Vasek Chvátal	[115]
12	Erika M. M. Coelho	[113]
13	Konrad Dabrowski	[107]
14	F. Dahme	[73]
15	Peter Dankelmann	[4] [21]
16	S. Dantas	[98]
17	Charles Delorme	[18] [19] [30]
18	Kefeng Diao	[51]
19	Lothar Dohmen	[5] [8]
20	Mitre Costa Dourado	[91] [98] [100] [108] [109] [113] [114] [126] [128] [131]
21	Odile Favaron	[10] [18] [19] [30]
22	Miranca Fischermann	[23] [28] [29] [31] [35] [40] [41] [45] [46]
23	Frank Göring	[79] [96]
24	Jochen Harant	[71] [79] [86] [96] [99] [104] [122]
25	Stephan Held	[54] [88] [93] [125]
26	Angelika Hellwig	[36] [44]
27	Michael A. Henning	[10] [60] [71] [82] [97] [105] [106] [116] [129]
28	Arne Hoffmann	[23] [31]
29	Dogan Kesdogan	[55]
30	Werner Knoben	[35] [40] [41]
31	Bernhard Korte	[125]
32	Dirk Kremer	[35] [40] [41]
33	Van Bang Le	[49] [84] [89]
34	Min Chih Lin	[117]
35	Guizhen Liu	[51]
36	Christian Löwenstein	[69] [82] [83] [92] [94] [97] [105] [106] [112] [116] [124] [127] [129]
37	Vadim V. Lozin	[24] [34] [39] [56] [107]
38	Frédéric Maffray	[57]
39	Jens Maßberg	[76] [93]
40	Klaus Meer	[53] [81]
41	Jozef Miskuf	[68] [85] [90]
42	Marc Mörig	[77]
43	Haiko Müller	[107]
44	Janina Müttel	[95]
45	Anders Sune Pedersen	[112] [119] [121]
46	Lucia Draque Penso (Lucia Draque Penso Rautenbach)	[87] [101] [108] [109] [111] [126]
47	Sven Peyer	[75]
48	Dang Vinh Pham	[55]
49	Fábio Protti	[91] [100] [128]
50	Joël Puech	[10]
51	Peter Recht	[99] [104]
52	Bruce Reed	[64]
53	Bruce A. Reed	[12] [13]
54	Friedrich Regen	[78] [83] [90] [95] [99] [112] [119] [124]
55	Imre Z. Ruzsa	[90]
56	Vinícius Fernandes dos Santos	[118] [123] [131]
57	Philipp Matthias Schäfer	[110] [114] [115] [118] [123] [131]
58	Ingo Schiermeyer	[48] [71] [79] [92] [96] [104]
59	Michiel H. M. Smid	[77]
60	Francisco J. Soulignac	[117]
61	Justin Southey	[105]
62	Eva-Maria Sprengel	[104]
63	Irene Stella	[43]
64	Michael Stiebitz	[102]
65	Christian Szegedy	[47] [61] [65] [70]
66	László A. Székely	[23]
67	Jayme Luiz Szwarcfiter	[87] [91] [98] [100] [101] [108] [109] [111] [113] [117] [118] [123] [126] [128] [130] [131]
68	Alexandre Toman	[131]
69	Eberhard Triesch	[14] [16]
70	Jan Tusch	[77]
71	Lutz Volkmann	[1] [4] [5] [8] [17] [21] [23] [26] [27] [28] [29] [31] [36] [44] [45] [46] [63] [66] [72] [73] [80]
72	Jens Vygen	[54] [75] [88] [93] [125]
73	Jürgen Werber	[47] [61] [65] [70]
74	Ping Zhao	[51]
75	Vadim E. Zverovich	[11]

Colors in the list of coauthors

Last update Sat May 26 02:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page