| 2007 | ||
|---|---|---|
| j17 | Peter Kleinschmidt, Stephen P. Giblin, Vladimir Antonov, Hideomi Hashiba, Leonid Kulik, Alexander Tzalenchuk, Susumu Komiyama: A Highly Sensitive Detector for Radiation in the Terahertz Region. IEEE T. Instrumentation and Measurement 56(2): 463-467 (2007) | |
| 2003 | ||
| j16 | Ralf Behr, Johannes Kohlmann, Theodoor J. B. M. Janssen, Peter Kleinschmidt, Jonathan M. Williams, Sophie Djordjevic, Jean-Pierre Lo-Hive, François P. M. Piquemal, Per-Otto Hetland, Dominique Reymann, Gunnar Eklund, Christian Hof, Blaise Jeanneret, Oleg A. Chevtchenko, Ernest Houtzager, Helko E. van den Brom, Andrea Sosso, Domenico Andreone, Jaani Nissilä, Panu Helistö: Analysis of different measurement setups for a programmable Josephson voltage standard. IEEE T. Instrumentation and Measurement 52(2): 524-528 (2003) | |
| j15 | Helko E. van den Brom, Oswin Kerkhof, Sergey V. Lotkhov, Sergey. A. Bogoslovsky, Gerd-Dietmar Willenberg, Hansjörg Scherer, Alexander B. Zorin, S. Pedersen, C. Kristoffersson, A. Aassime, Per Delsing, Marian A. Taslakov, Z. Ivanov, Håkan Nilsson, Stephen P. Giblin, Peter Kleinschmidt, Christian Hof, Ali L. Eichenberger, Frédéric Overney, Blaise Jeanneret, Gérard Genevès, Nicolas Feltin, Laurent Devoille, Frederic Gay, François P. M. Piquemal: Counting electrons one by one-overview of a joint European research project. IEEE T. Instrumentation and Measurement 52(2): 584-589 (2003) | |
| 2000 | ||
| j14 | G. Meisinger, Peter Kleinschmidt, Gil Kalai: Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes. Discrete & Computational Geometry 24(2-3): 413-420 (2000) | |
| 1999 | ||
| j13 | Peter Kleinschmidt, Christian Rank: New Heuristics for the Multidimensional Vote Assignment Problem. Computing 63(4): 405-417 (1999) | |
| 1997 | ||
| b1 | Peter Kleinschmidt, Christian Rank: Relationale Datenbanksysteme - eine praktische Einführung. Springer 1997, isbn 978-3-540-62447-9, pp. I-X, 1-218 | |
| j12 | Andreas Hefner, Peter Kleinschmidt: A Polyhedral Approach for a Constrained Matching Problem. Discrete & Computational Geometry 17(4): 429-437 (1997) | |
| 1996 | ||
| j11 | Peter Kleinschmidt, Shmuel Onn: Signable Posets and Partitionable Simplicial Complexes. Discrete & Computational Geometry 15(4): 443-466 (1996) | |
| 1995 | ||
| j10 | Peter Kleinschmidt, Heinz Schannath: A strongly polynomial algorithm for the transportation problem. Math. Program. 68: 1-13 (1995) | |
| c1 | Peter Kleinschmidt, Shmuel Onn: Oriented Matroid Polytopes and Polyhedral Fans are Signable. IPCO 1995: 198-211 | |
| 1994 | ||
| j9 | Peter Kleinschmidt, Ilse Mitterreiter, Jim Piper: Improved chromosome classification using monotonic functions of mahalanobis distance and the transportation method. Math. Meth. of OR 40(3): 305-323 (1994) | |
| j8 | Peter Kleinschmidt, Ilse Mitterreiter, Christian Rank: A hybrid method for automatic chromosome karyotyping. Pattern Recognition Letters 15(1): 87-96 (1994) | |
| 1992 | ||
| j7 | Peter Kleinschmidt, Shmuel Onn: On the diameter of convex polytopes. Discrete Mathematics 102(1): 75-77 (1992) | |
| 1991 | ||
| j6 | Michael Tso, Peter Kleinschmidt, Ilse Mitterreiter, Jim Graham: An efficient transportation algorithm for automatic chromosome karyotyping. Pattern Recognition Letters 12(2): 117-126 (1991) | |
| 1990 | ||
| j5 | Victor Klee, Peter Kleinschmidt: Geometry of the Gass-Saaty Parametric Cost LP Algorithm. Discrete & Computational Geometry 5: 13-26 (1990) | |
| j4 | Jörg Gretenkort, Peter Kleinschmidt, Bernd Sturmfels: On the Existence of Certain Smooth Toric Varieties. Discrete & Computational Geometry 5: 255-262 (1990) | |
| 1984 | ||
| j3 | ||
| 1980 | ||
| j2 | Peter Kleinschmidt: A steinitz-type theorem for the projective plane. Discrete Mathematics 32(1): 53-57 (1980) | |
| 1976 | ||
| j1 | Bernd Kind, Peter Kleinschmidt: On the Maximal Volume of Convex Bodies with Few Vertices. J. Comb. Theory, Ser. A 21(1): 124-128 (1976) | |
Colors in the list of coauthors
Last update Fri May 24 02:43:32 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page