dblp.uni-trier.dewww.uni-trier.de

Michael Kaufmann

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
126EEEvmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. Graph Drawing 2008: 336-347
125EEMichael Kaufmann, Marc J. van Kreveld, Bettina Speckmann: Subdivision Drawings of Hypergraphs. Graph Drawing 2008: 396-407
124EEPhilip Effinger, Michael Kaufmann, Martin Siebenhaller: Enhancing Visualizations of Business Processes. Graph Drawing 2008: 437-438
123EEStephan Kottler, Michael Kaufmann, Carsten Sinz: Computation of Renameable Horn Backdoors. SAT 2008: 154-160
122EEStephan Kottler, Michael Kaufmann, Carsten Sinz: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. SAT 2008: 161-167
121EEMichael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245
120EEVida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008)
119EEMichael Kaufmann, Dorothea Wagner: Guest Editor's Foreword. J. Graph Algorithms Appl. 12(1): 3-4 (2008)
118EEMichael A. Bekos, Michael Kaufmann, Antonios Symvonis: Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008)
2007
117 Michael Kaufmann, Dorothea Wagner: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers Springer 2007
116EEDennis Goehlsdorf, Michael Kaufmann, Martin Siebenhaller: Placing connected components of disconnected graphs. APVIS 2007: 101-108
115EEMichael A. Bekos, Michael Kaufmann, Antonios Symvonis: Labeling collinear sites. APVIS 2007: 45-51
114EEUlrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263
113EEMichael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Line Crossing Minimization on Metro Maps. Graph Drawing 2007: 231-242
112EEFabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. Graph Drawing 2007: 268-279
111EEMichael Kaufmann: Polynomial Area Bounds for MST Embeddings of Trees. Graph Drawing 2007: 88-100
110EEFabrizio Frati, Markus Geyer, Michael Kaufmann: Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405
109EEUlrike von Luxburg, Sébastien Bubeck, Stefanie Jegelka, Michael Kaufmann: Consistent Minimization of Clustering Objective Functions. NIPS 2007
108EEMichael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007)
2006
107EEMichael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Polygon labelling of minimum leader length. APVIS 2006: 15-21
106EEDanny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis: Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2006: 799
105EEMichael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92
104EEMichael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841
103EEMartin Siebenhaller, Michael Kaufmann: Drawing activity diagrams. SOFTVIS 2006: 159-160
102EEWolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller: Visualization aided performance tuning of irregular task-parallel computations. Information Visualization 5(2): 81-94 (2006)
101EEJan Küntzer, Torsten Blum, Andreas Gerasch, Christina Backes, Andreas Hildebrandt, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof: BN++ - A Biological Information System. J. Integrative Bioinformatics 3(2): (2006)
2005
100EESándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann: A New Approach for Boundary Recognition in Geometric Sensor Networks. CCCG 2005: 84-87
99EEHenning Fernau, Michael Kaufmann, Mathias Poths: Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469
98EEKatharina Anna Lehmann, Michael Kaufmann: Evolutionary algorithms for the self-organized evolution of networks. GECCO 2005: 563-570
97EEMarkus Geyer, Michael Kaufmann, Imrich Vrto: Two Trees Which Are Self-intersecting When Drawn Simultaneously. Graph Drawing 2005: 201-210
96EEMartin Siebenhaller, Michael Kaufmann: Mixed Upward Planarization - Fast and Robust. Graph Drawing 2005: 522-523
95EEMichael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89
94EEKatharina Anna Lehmann, Michael Kaufmann: Random Graphs, Small-Worlds and Scale-Free Networks. Peer-to-Peer Systems and Applications 2005: 57-76
93EEWolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller: Visualizing structural properties of irregular parallel computations. SOFTVIS 2005: 125-134
92EEAmarendran R. Subramanian, Jan Weyer-Menkhoff, Michael Kaufmann, Burkhard Morgenstern: DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinformatics 6: 66 (2005)
91EESándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann: A New Approach for Boundary Recognition in Geometric Sensor Networks CoRR abs/cs/0508006: (2005)
2004
90EEMarkus Eiglsperger, Martin Siebenhaller, Michael Kaufmann: An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. Graph Drawing 2004: 155-166
89EEMichael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Graph Drawing 2004: 49-59
88EEMartin Schmollinger, Kay Nieselt, Michael Kaufmann, Burkhard Morgenstern: DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors. BMC Bioinformatics 5: 128 (2004)
87EEFlorian Meereis, Michael Kaufmann: PCOGR: Phylogenetic COG ranking as an online tool to judge the specificity of COGs with respect to freely definable groups of organisms. BMC Bioinformatics 5: 150 (2004)
86EEMarkus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller: Automatic layout of UML class diagrams in orthogonal style. Information Visualization 3(3): 189-208 (2004)
2003
85EEChristos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann: Topic Introduction. Euro-Par 2003: 884
84EEVida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed Parameter Algorithms for one-sided crossing minimization Revisited. Graph Drawing 2003: 332-344
83 Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller: A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram. SOFTVIS 2003: 189-198
82 Klaus Reichard, Michael Kaufmann: EPPS: mining the COG database by an extended phylogenetic patterns search. Bioinformatics 19(6): 784-785 (2003)
81EEMartin Schmollinger, Michael Kaufmann: Designing Parallel Algorithms for Hierarchical SMP Clusters. Int. J. Found. Comput. Sci. 14(1): 59-78 (2003)
80EEMarkus Eiglsperger, Michael Kaufmann, Frank Eppinger: An Approach for Mixed Upward Planarization. J. Graph Algorithms Appl. 7(2): 203-220 (2003)
2002
79 Marite Sirava, T. Schäfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof: BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks. ECCB 2002: 219-230
78EEThomas Krätschmer, Michael Kaufmann: Electronic brainstorming with graphical structures of ideas. ECIS 2002
77 Michael Kaufmann: Graph Drawing Algorithms for Bioinformatics. GI Jahrestagung (Ergänzungsband) 2002: 65-65
76EEUlrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner: Sketch-Driven Orthogonal Graph Drawing. Graph Drawing 2002: 1-11
75EEMichael Kaufmann, Roland Wiese: Maintaining the Mental Map for Circular Drawings. Graph Drawing 2002: 12-22
74EEMartin Schmollinger, Michael Kaufmann: Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication. IPDPS 2002
73EEEzekiel F. Adebiyi, Michael Kaufmann: Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. WABI 2002: 140-156
72EEMichael Kaufmann, Roland Wiese: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. J. Graph Algorithms Appl. 6(1): 115-129 (2002)
71EEMichael Kaufmann: Guest Editor's Foreword. J. Graph Algorithms Appl. 6(3): 177-178 (2002)
2001
70 Michael Kaufmann, Dorothea Wagner: Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999). Springer 2001
69EEMarkus Eiglsperger, Michael Kaufmann: Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. Graph Drawing 2001: 124-138
68EERoland Wiese, Markus Eiglsperger, Michael Kaufmann: yFiles: Visualization and Automatic Layout of Graphs. Graph Drawing 2001: 453-454
67 Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann: An efficient algorithm for finding short approximate non-tandem repeats. ISMB (Supplement of Bioinformatics) 2001: 5-12
66EEBoris Diebold, Michael Kaufmann: Usage-based Visualization of Web Locations. InVis.au 2001: 159-164
65EEMartin Schmollinger, Michael Kaufmann: kappa NUMA: A Model for Clusters of SMP-Machines. PPAM 2001: 42-50
64EEMarkus Eiglsperger, Michael Kaufmann: An Approach for Mixed Upward Planarization. WADS 2001: 352-364
2000
63EEMarkus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann: Orthogonal graph drawing with constraints. SODA 2000: 3-11
62EEUlrich Fößmeier, Michael Kaufmann: On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. Algorithmica 26(1): 68-99 (2000)
1999
61EEMichael Kaufmann, Roland Wiese: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. Graph Drawing 1999: 165-174
1998
60EEUlrich Fößmeier, Carsten Heß, Michael Kaufmann: On Improving Orthogonal Drawings: The 4M-Algorithm. Graph Drawing 1998: 125-137
59EEBjörn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel: Visualization of Parallel Execution Graphs. Graph Drawing 1998: 403-412
58EERoland Wiese, Michael Kaufmann: Adding Constraints to an Algorithm for Orthogonal Graph Drawing. Graph Drawing 1998: 462-463
57 Therese C. Biedl, Michael Kaufmann, Petra Mutzel: Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136
1997
56 Ulrich Fößmeier, Michael Kaufmann: Nice Drawings for Planar Bipartite Graphs. CIAC 1997: 122-134
55 Jop F. Sibeyn, Michael Kaufmann: BSP-Like External-Memory Computation. CIAC 1997: 229-240
54 Ulrich Fößmeier, Michael Kaufmann: Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. ESA 1997: 171-185
53 Therese C. Biedl, Michael Kaufmann: Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52
52 Ulrich Fößmeier, Michael Kaufmann: Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. Graph Drawing 1997: 134-145
51EEMichael Kaufmann, Ulrich Meyer, Jop F. Sibeyn: Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319
50EEUlrich Fößmeier, Michael Kaufmann: On Exact Solutions for the Rectilinear Steiner Tree Problem. Symposium on Computational Geometry 1997: 436-438
49 Michael Kaufmann, Jop F. Sibeyn: Randomized Multipacket Routing and Sorting on Meshes. Algorithmica 17(3): 224-244 (1997)
48 Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn: Routing on Meshes with Buses. Algorithmica 18(3): 417-444 (1997)
47 Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997)
46 Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn: Matrix Transpose on Meshes: Theory and Practice. Computers and Artificial Intelligence 16(2): (1997)
45EEUlrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky: Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Discrete & Computational Geometry 18(1): 93-109 (1997)
44 Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann: Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997)
1996
43 Ulrich Fößmeier, Goos Kant, Michael Kaufmann: 2-Visibility Drawings of Planar Graphs. Graph Drawing 1996: 155-168
1995
42 Michael Kaufmann, Jop F. Sibeyn, Torsten Suel: Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. ESA 1995: 75-88
41 Ulrich Fößmeier, Michael Kaufmann: Drawing High Degree Graphs with Low Bend Numbers. Graph Drawing 1995: 254-266
40 Jop F. Sibeyn, Michael Kaufmann: Solving Cheap Graph Problems an Meshes. MFCS 1995: 412-422
39 Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn: Routing and Sorting on Reconfigurable Meshes. Parallel Processing Letters 5: 81-95 (1995)
1994
38 Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky: Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71
37 Ulrich Fößmeier, Michael Kaufmann: On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. Graph Drawing 1994: 52-63
36 Michael Kaufmann, Harald Lauer, Heiko Schröder: Fast Deterministic Hot-Potato Routing on Processor Arrays. ISAAC 1994: 333-341
35 Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman: On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. ISAAC 1994: 351-359
34 Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann: Shorter Queues for Permutation Routing on Meshes. MFCS 1994: 597-607
33 Michael Kaufmann, Jop F. Sibeyn, Torsten Suel: Derandomizing Algorithms for Routing and Sorting on Meshes. SODA 1994: 669-679
32 Jop F. Sibeyn, Michael Kaufmann: Deterministic 1-k Routing on Meshes. STACS 1994: 237-248
31 Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94
30EEShaodi Gao, Michael Kaufmann: Channel Routing of Multiterminal Nets. J. ACM 41(4): 791-818 (1994)
29 Michael Kaufmann, Kurt Mehlhorn: A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. 23(2): 227-246 (1994)
1993
28 Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman: Randomized Routing on Meshes with Buses. ESA 1993: 333-344
27 Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky: Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. ISAAC 1993: 533-542
26 Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn: Deterministic Permutation Routing on Meshes. SPDP 1993: 284
25 Michael Kaufmann, F. Miller Maley: Parity Conditions in Homotopic Knock-Knee Routing. Algorithmica 9(1): 47-63 (1993)
24 Michael Kaufmann, Gerhard Klär: Routing in Polygons without Rectilinear Visible Corners Inf. Comput. 102(2): 218-262 (1993)
23 Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger: Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22(5): 1035-1052 (1993)
1992
22EEMichael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn: Matching the Bisection Bound for Routing and Sorting on the Mesh. SPAA 1992: 31-40
21 Michael Kaufmann, Jop F. Sibeyn: Deterministic Routing on Circular Arrays. SPDP 1992: 376-383
20 Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang: Performance Driven k-Layer Wiring. STACS 1992: 489-500
19 Michael Kaufmann, Jop F. Sibeyn: Optimal Multi-Packet Routing on the Torus. SWAT 1992: 118-129
18 Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992)
17EEMichael Kaufmann, Kurt Mehlhorn: On local routing of two-terminal nets. J. Comb. Theory, Ser. B 55(1): 33-72 (1992)
1991
16 Frank Hoffmann, Michael Kaufmann, Klaus Kriegel: The Art Gallery Theorem for Polygons With Holes FOCS 1991: 39-48
15 Michael Kaufmann, Gerhard Klär: A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. ISA 1991: 336-348
1990
14 Patrik Eklund, Michael Kaufmann: Hierarchical Wiring in Multigrids. CONPAR 1990: 423-434
13 Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger: Drawing Graphs in the Plane with High Resolution FOCS 1990: 86-95
12 Michael Kaufmann: Zur Physik des Fusionsreaktions. Neue Ergebnisse. Forum Wissenschaft und Technik 1990: 482-499
11EEHelmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Symposium on Computational Geometry 1990: 281-289
10 Frank Hoffmann, Michael Kaufmann: On the Rectilinear Art Gallery Problem - Algorithmic Aspects. WG 1990: 239-250
9EEMichael Kaufmann: A linear-time algorithm for routing in a convex grid. IEEE Trans. on CAD of Integrated Circuits and Systems 9(2): 180-184 (1990)
1989
8EEShaodi Gao, Michael Kaufmann, F. Miller Maley: Advances in Homotopic Layout Compaction. SPAA 1989: 273-282
1988
7 Michael Kaufmann, Ioannis G. Tollis: Channel Routing with Short Wires. AWOC 1988: 226-236
6EEShaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling: On Continuous Homotopic One Layer Routing. Symposium on Computational Geometry 1988: 392-402
5 Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum: On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70
1987
4 Shaodi Gao, Michael Kaufmann: Channel Routing of Multiterminal Nets FOCS 1987: 316-325
3 Michael Kaufmann, Kurt Mehlhorn: On Local Routing of Two-Terminal Nets. STACS 1987: 40-52
1986
2 Michael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. J. Algorithms 7(4): 510-531 (1986)
1985
1 Michael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. ICALP 1985: 328-337

Coauthor Index

1Ezekiel F. Adebiyi [67] [73]
2Helmut Alt [11] [18]
3Evmorfia Argyriou [126]
4Christina Backes [101]
5Michael A. Bekos [89] [95] [105] [107] [108] [113] [115] [118] [121] [126]
6Piotr Berman [38]
7Therese C. Biedl [31] [47] [53] [57]
8Wolfgang Blochinger [93] [102]
9Torsten Blum [101]
10Erich Bornberg-Bauer [79]
11Ulrik Brandes [76] [114]
12Sébastien Bubeck [109]
13Till Bubeck [59]
14Bogdan S. Chlebus [26] [34] [44]
15Boris Diebold [66]
16Vida Dujmovic [84] [120]
17Philip Effinger [124]
18Markus Eiglsperger [63] [64] [68] [69] [76] [79] [80] [83] [86] [90]
19Patrik Eklund [14]
20Frank Eppinger [80]
21Cesim Erten [114]
22Sándor P. Fekete [91] [100]
23Henning Fernau [84] [99] [120]
24Rudolf Fleischer [11] [18]
25Michael Formann [13] [23]
26Ulrich Fößmeier [27] [37] [38] [41] [43] [45] [50] [52] [54] [56] [59] [60] [62] [63]
27J. Joseph Fowler [114]
28Pierre Fraigniaud [85] [106]
29Fabrizio Frati [110] [112] [114]
30Shaodi Gao [4] [5] [6] [8] [30] [35]
31Andreas Gerasch [101]
32Markus Geyer [97] [110] [114]
33Dennis Goehlsdorf [116]
34Carsten Gutwenger [86] [114]
35Torben Hagerup [13] [23]
36James Haralambides [13] [23]
37Carsten Heß [60]
38Andreas Hildebrandt [101]
39Frank Hoffmann [10] [16]
40Seok-Hee Hong [114]
41Stefanie Jegelka [109]
42Mark Jerrum [5] [6]
43Tao Jiang [67]
44Michael Jünger [86]
45Christos Kaklamanis [85]
46Goos Kant [31] [43] [47]
47Marek Karpinski [38]
48Gerhard Klär [15] [24]
49Karsten Klein [86]
50Stephen G. Kobourov [112] [114]
51Oliver Kohlbacher [79] [101]
52Stephan Kottler [122] [123]
53Jan Kratochvíl [104]
54Thomas Krätschmer [78]
55Marc J. van Kreveld [125]
56Klaus Kriegel [16]
57Danny Krizanc [85] [106]
58Alexander Kröller (Alexander Kroeller) [91] [100]
59Jan Küntzer [101]
60Joachim Kupke [86]
61Harald Lauer [36]
62Katharina Anna Lehmann [91] [94] [98] [100] [104]
63Frank Thomson Leighton (Tom Leighton) [13] [23]
64Sebastian Leipert [86]
65Hans-Peter Lenhof [79] [101]
66Giuseppe Liotta [114]
67Ulrike von Luxburg [109]
68F. Miller Maley [8] [25]
69Florian Meereis [87]
70Kurt Mehlhorn [1] [2] [3] [5] [6] [11] [17] [18] [29]
71Ulrich Meyer [46] [51]
72Paul Molitor [20]
73Burkhard Morgenstern [88] [92]
74Petra Mutzel [57] [86] [114]
75Stefan Näher [11] [18]
76Kay Nieselt [88]
77Martin Nöllenburg [121]
78Mathias Poths [99]
79Katerina Potika [95] [105] [107] [113]
80Sanguthevar Rajasekaran [22]
81Rajeev Raman [28] [48]
82Klaus Reichard [82]
83Marcus Ritt [59]
84Wolfgang Rosenstiel [59]
85Wolfgang Rülling [5] [6]
86T. Schäfer [79]
87Stefan Schirra [11] [18]
88Martin Schmollinger [65] [74] [81] [88]
89Heiko Schröder [36] [39]
90Jop F. Sibeyn [19] [21] [22] [26] [28] [32] [33] [34] [39] [40] [42] [44] [46] [48] [49] [51] [55]
91Martin Siebenhaller [83] [86] [90] [93] [96] [102] [103] [116] [124]
92Carsten Sinz [122] [123]
93Marite Sirava [79]
94Bettina Speckmann [125]
95Björn Steckelbach [59]
96Christoph Storb [5]
97Amarendran R. Subramanian [92] [104]
98Torsten Suel [33] [42]
99Antonios Symvonis [13] [23] [89] [95] [105] [107] [108] [113] [114] [115] [118] [121] [126]
100Krishnaiyan Thulasiraman [35]
101Ioannis G. Tollis [7]
102Christian Uhrig [11] [18]
103Wolfgang Vogelgesang [20]
104Imrich Vrto [97]
105Dorothea Wagner [70] [76] [117] [119]
106Emo Welzl [13] [23]
107Jan Weyer-Menkhoff [92]
108Roland Wiese [58] [61] [68] [72] [75]
109Gerhard J. Woeginger [13] [23]
110Alexander Wolff [89] [108]
111Christos D. Zaroliagis [106]
112Alexander Zelikovsky [27] [38] [45]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)