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

Naoki Katoh Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
103EENaoki Katoh, Shin-ichi Tanigawa: A proof of the molecular conjecture. Symposium on Computational Geometry 2009: 296-305
102EENaoki Katoh: Combinatorial Optimization Algorithms in Resource Allocation Problems. Encyclopedia of Optimization 2009: 382-387
2008
101EEYongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa: Geometric Spanner of Objects under L1 Distance. COCOON 2008: 395-404
100EENaoyuki Kamiyama, Naoki Katoh: Covering Directed Graphs by In-Trees. COCOON 2008: 444-457
99EENaoyuki Kamiyama, Naoki Katoh: The Minimum Weight In-Tree Cover Problem. MCO 2008: 155-164
98EENaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa: Arc-disjoint in-trees in directed graphs. SODA 2008: 518-526
97EENaoki Katoh, Shin-ichi Tanigawa: Fast enumeration algorithms for non-crossing geometric graphs. Symposium on Computational Geometry 2008: 328-337
96EENaoyuki Kamiyama, Naoki Katoh: Covering Directed Graphs by In-trees CoRR abs/0802.2755: (2008)
95EEDavid Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa: Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discrete & Computational Geometry 40(1): 31-46 (2008)
2007
94EENaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa: An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM 2007: 178-190
93EENaoki Katoh, Shin-ichi Tanigawa: Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON 2007: 243-253
92EEYang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh: Geometric Spanner of Segments. ISAAC 2007: 75-87
91EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32
90EEAtsushi Takizawa, Kazuma Yoshida, Naoki Katoh: Applying graph mining to discover substructures of room layouts which affect the rent of apartments. SMC 2007: 3512-3518
89EEKatsutoshi Yada, Edward Ip, Naoki Katoh: Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability. Decision Support Systems 44(1): 223-234 (2007)
88EEAtsushi Takizawa, Fumie Kawaguchi, Naoki Katoh, Kenji Mori, Kazuo Yoshida: Risk discovery of car-related crimes from urban spatial attributes using emerging patterns. KES Journal 11(5): 301-311 (2007)
87EEYinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki: Triangulating a convex polygon with fewer number of non-standard bars. Theor. Comput. Sci. 389(1-2): 143-151 (2007)
2006
86EEShin-ichi Tanigawa, Naoki Katoh: Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. AAIM 2006: 161-172
85EENaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa: An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM 2006: 231-242
84EEDavid Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa: Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215
83EENaoki Katoh: Foreword. Algorithmica 44(2): 101-101 (2006)
82EENaoki Katoh, Hiro Ito: Preface. Discrete Applied Mathematics 154(16): 2239-2240 (2006)
81EENaoki Katoh, Taihei Yano: An approximation algorithm for the pickup and delivery vehicle routing problem on trees. Discrete Applied Mathematics 154(16): 2335-2349 (2006)
80EESachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr: Inserting Points Uniformly at Every Instance. IEICE Transactions 89-D(8): 2348-2356 (2006)
79EEShin-ichi Tanigawa, Naoki Katoh: Finding a Triangular Mesh with a Constant Number of Different Edge Lengths. IEICE Transactions 89-D(8): 2364-2371 (2006)
78EENaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa: An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Transactions 89-D(8): 2372-2379 (2006)
77EEBoris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006)
2005
76EEShin-ichi Tanigawa, Naoki Katoh: Finding a triangular mesh with a constant number of different edge lengths. CCCG 2005: 274-277
75EEYin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki: Triangulating a Convex Polygon with Small Number of Non-standard Bars. COCOON 2005: 481-489
74EEKatsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Kazuhiro Kishiya: The Future Direction of New Computing Environment for Exabyte Data in the Business World. SAINT Workshops 2005: 316-319
73EETetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005)
72EEDanny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu: Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. J. Comb. Optim. 9(1): 69-90 (2005)
2004
71EEDanny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama: Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. COCOON 2004: 238-248
70EEBoris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88
69EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467
68EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The structure and number of global roundings of a graph. Theor. Comput. Sci. 325(3): 425-437 (2004)
2003
67 Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings Springer 2003
66EEKatsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Takashi Washio, Issey Fusamoto, Daisuke Fujishima, Takaya Ikeda: Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI. Active Mining 2003: 152-173
65EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138
64EENaoki Katoh, Katsutoshi Yada, Yukinobu Hamuro: Business Application for Sales Transaction Data by Using Genome Analysis Technology. Discovery Science 2003: 208-219
63EEXavier Gandibleux, Hiroyuki Morita, Naoki Katoh: Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. EMO 2003: 43-57
62EETetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput. 32(6): 1423-1435 (2003)
2002
61EEYukinobu Hamuro, Hideki Kawata, Naoki Katoh, Katsutoshi Yada: A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History. Progress in Discovery Science 2002: 565-575
60EETetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA 2002: 896-904
59EETetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71
58EENaoki Katoh, Takeshi Tokuyama: K-Levels of Concave Surfaces. Discrete & Computational Geometry 27(4): 567-584 (2002)
57EENaoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geometry Appl. 12(5): 429- (2002)
56 Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu: Approximating uniform triangular meshes in polygons. Theor. Comput. Sci. 289(2): 879-895 (2002)
2001
55EEXavier Gandibleux, Hiroyuki Morita, Naoki Katoh: The Supported Solutions Used as a Genetic Information in a Population Heuristics. EMO 2001: 429-442
54EENaoki Katoh, Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees. Symposium on Computational Geometry 2001: 241-248
53EENaoki Katoh, Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees CoRR cs.CG/0103024: (2001)
52 Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001)
51 Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geometry Appl. 11(2): 145-166 (2001)
50 Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5(2): 213-231 (2001)
2000
49EEFranz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu: Approximating Uniform Triangular Meshes in Polygons. COCOON 2000: 23-33
48EEYukinobu Hamuro, Naoki Katoh, Katsutoshi Yada: Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior. Discovery Science 2000: 263-267
47EENaoki Katoh, Hiromichi Kojima, Ryo Taniguchi: Approximating Uniform Triangular Meshes for Spheres. JCDCG 2000: 192-204
46EEDanny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu: Optimizing the sum of linear fractional functions and applications. SODA 2000: 707-716
45 Yang Dai, Naoki Katoh, Siu-Wing Cheng: LMT-skeleton heuristics for several new classes of optimal triangulations. Comput. Geom. 17(1-2): 51-68 (2000)
1999
44EEKatsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada: Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. Discovery Science 1999: 148-159
43EENaoki Katoh, Takeshi Tokuyama: Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999: 389-398
42EETetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326
41EENaoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526
40EEMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SIAM J. Discrete Math. 12(3): 342-359 (1999)
1998
39EEYang Dai, Naoki Katoh: On Computing New Classes of Optimal Trangulations with Angular Constraints. COCOON 1998: 15-24
38EEYukinobu Hamuro, Naoki Katoh, Katsutoshi Yada: Data Mining Oriented System for Business Applications. Discovery Science 1998: 441-442
37EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Convertibility among Grid Filling Curves. ISAAC 1998: 307-316
36EEShin-ya Hamaguchi, Naoki Katoh: A Capacitated Vehicle Routing Problem on a Tree. ISAAC 1998: 397-406
35 Yukinobu Hamuro, Naoki Katoh, Yasuyuki Matsuda, Katsutoshi Yada: Mining Pharmacy Data Helps to Make Profits. Data Min. Knowl. Discov. 2(4): 391-398 (1998)
1997
34EETetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. STOC 1997: 275-283
33EEYang Dai, Kazuo Iwano, Naoki Katoh: A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. Inf. Process. Lett. 64(5): 255-261 (1997)
1996
32EESiu-Wing Cheng, Naoki Katoh, Manabu Sugai: A Study of the LMT-Skeleton. ISAAC 1996: 256-265
31 Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113
30EEMary Inaba, Hiroshi Imai, Naoki Katoh: Experimental Results of Randomized Clustering Algorithm. Symposium on Computational Geometry 1996: C-1-C-2
29 Tetsuo Asano, Naoki Katoh: Variants for the Hough Transform for Line Detection. Comput. Geom. 6: 231-252 (1996)
28EEOswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu: Triangulations Intersect Nicely. Discrete & Computational Geometry 16(4): 339-359 (1996)
27EEYang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura: A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discrete Applied Mathematics 65(1-3): 167-190 (1996)
1995
26 John Staples, Peter Eades, Naoki Katoh, Alistair Moffat: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings Springer 1995
25 Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159
24 Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano: On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discrete & Computational Geometry 13: 161-176 (1995)
23 Naoki Katoh, Kazuo Iwano: Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. Int. J. Comput. Geometry Appl. 5: 37-51 (1995)
1994
22EETetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226
21EEMary Inaba, Naoki Katoh, Hiroshi Imai: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). Symposium on Computational Geometry 1994: 332-339
1993
20EETetsuo Asano, Naoki Katoh: Number Theory Helps Line Detection in Digital Images. ISAAC 1993: 313-322
19EEYang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh: How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993: 48-57
18 Kazuo Iwano, Naoki Katoh: Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. Inf. Process. Lett. 48(5): 211-213 (1993)
1992
17 Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano: On Minimum and Maximum Spanning Trees of Linearly Moving Points FOCS 1992: 396-405
16EENaoki Katoh, Kazuo Iwano: Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. Symposium on Computational Geometry 1992: 320-329
15EENaoki Katoh: An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. Discrete Applied Mathematics 35(2): 131-141 (1992)
14EENaoki Katoh: A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. Discrete Applied Mathematics 35(2): 143-155 (1992)
13EENaoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki: Optimal strategies for some team games. Discrete Applied Mathematics 35(3): 275-291 (1992)
12 Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discrete Applied Mathematics 40(4): 379-395 (1992)
1991
11 Naoki Katoh, Kazuo Iwano: Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). WADS 1991: 80-91
10 Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991)
1990
9 Toshihide Ibaraki, Naoki Katoh: Searching Minimax Game Trees under Memory Space Constraint. Ann. Math. Artif. Intell. 1: (1990)
8EEToshihide Ibaraki, Tiko Kameda, Naoki Katoh: Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16(3): 302-315 (1990)
1989
7EEAlok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Fining k Points with Minimum Spanning Trees and Related Problems. Symposium on Computational Geometry 1989: 283-291
1988
6EEToshihide Ibaraki, Tiko Kameda, Naoki Katoh: Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988)
1987
5 Naoki Katoh, Tiko Kameda, Toshihide Ibaraki: A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987)
1985
4EENaoki Katoh, Toshihide Ibaraki, Tiko Kameda: Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10(2): 205-229 (1985)
1983
3 Toshihide Ibaraki, Naoki Katoh: On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. 16(2): 95-97 (1983)
1981
2EENaoki Katoh, Toshihide Ibaraki, H. Mine: An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM 28(4): 752-764 (1981)
1 Naoki Katoh, Toshihide Ibaraki, H. Mine: An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981)

Coauthor Index

1Alok Aggarwal [7] [10]
2Oswin Aichholzer [28]
3Boris Aronov [70] [77]
4Tetsuo Asano [20] [22] [29] [31] [34] [37] [42] [50] [51] [52] [59] [60] [62] [65] [68] [69] [70] [73] [77] [80] [91]
5Franz Aurenhammer [28] [49] [56]
6David Avis [84] [95]
7Mark de Berg [73]
8Danny Z. Chen [31] [46] [51] [71] [72]
9Siu-Wing Cheng [28] [32] [45]
10Otfried Cheong (Otfried Schwarzkopf) [73]
11Jinhee Chun [71]
12Ovidiu Daescu [46] [72]
13Wenqiang Dai [75] [87]
14Yang Dai [19] [27] [33] [39] [45] [46] [72]
15Benjamin Doerr [80]
16Peter Eades [26]
17Hazel Everett [73]
18Katsuki Fujisawa [44]
19Daisuke Fujishima [66]
20Issey Fusamoto [66]
21Xavier Gandibleux [55] [63]
22Magnús M. Halldórsson [25] [40]
23Shin-ya Hamaguchi [36]
24Yukinobu Hamuro [35] [38] [44] [48] [61] [64] [66] [74]
25Herman J. Haverkort [73]
26Toshihide Ibaraki [1] [2] [3] [4] [5] [6] [8] [9] [12] [13] [67]
27Takaya Ikeda [66]
28Hiroshi Imai [7] [10] [19] [21] [27] [30]
29Mary Inaba [21] [30]
30Edward Ip [89]
31Hiro Ito [82]
32Kazuo Iwano [11] [16] [17] [18] [19] [23] [24] [25] [27] [33] [40]
33Tiko Kameda [4] [5] [6] [8] [12]
34Naoyuki Kamiyama [78] [85] [94] [96] [98] [99] [100]
35Fumie Kawaguchi [88]
36Kazuhiro Kawashima [42] [50]
37Hideki Kawata [61]
38Kazuhiro Kishiya [74]
39Hiromichi Kojima [47] [49] [56]
40Junji Koyanagi [13]
41Yasuyuki Matsuda [35]
42Kurt Mehlhorn [70] [77]
43H. Mine [1] [2]
44Alistair Moffat [26]
45Kenji Mori [88]
46Hiroyuki Morita [55] [63]
47Koji Obokata [59] [60] [62]
48Masamitsu Ohnishi [13]
49Makoto Ohsaki [49] [56] [75] [84] [87] [95]
50Keiji Ohtsuka [27]
51Hirotaka Ono [67]
52Günter Rote [28]
53John Staples [26]
54Ileana Streinu [84] [95]
55Manabu Sugai [32]
56Subhash Suri [7] [10]
57Atsushi Takizawa [78] [85] [88] [90] [94] [98]
58Hisao Tamaki [34] [37] [41] [57] [65] [68] [69] [91]
59Shin-ichi Tanigawa [76] [79] [84] [86] [93] [95] [97] [101] [103]
60Ryo Taniguchi [47]
61Michael Taschwer [28]
62Sachio Teramoto [80]
63Takeshi Tokuyama [17] [22] [24] [25] [31] [34] [37] [40] [41] [43] [44] [51] [52] [53] [54] [57] [58] [59] [60] [62] [65] [68] [69] [70] [71] [77] [91]
64Takashi Washio [66]
65Alexander Wolff [73]
66Xiaodong Wu [46] [72]
67Jinhui Xu [46] [72] [92] [101]
68Yin-Feng Xu [28] [56] [75]
69Yinfeng Xu [49] [87]
70Katsutoshi Yada [35] [38] [44] [48] [61] [64] [66] [74] [89]
71Yang Yang [92] [101]
72Taihei Yano [81]
73Kazuma Yoshida [90]
74Kazuo Yoshida [88]
75Nobuhiko Yoshimura [27]
76Yongding Zhu [92] [101]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)