default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kleinschmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c7]Peter L. T. Hoonakker
, Pascale Carayon, Megan E. Salwei, Ann Schoofs Hundt, Douglas A. Wiegmann, Peter Kleinschmidt, Michael S. Pulia, Yudi Wang, Clair Novak, Brian W. Patterson:
The Design of PE Dx, a CDS to Support Pulmonary Embolism Diagnosis in the ED. CSHI 2019: 134-140- 2018
- [p1]Bernhard Schindlbeck, Peter Kleinschmidt:
Integrate Your Partners into Your Business Processes Using Interactive Forms: The Case of Automotive Industry Company HEYCO. Business Process Management Cases 2018: 485-501 - 2015
- [c6]Bernhard Schindlbeck, Peter Kleinschmidt:
Integrate your partners with interactive forms - automated processing of purchase order confirmations using SAP Interactive Forms by Adobe. BPM (Industry Track) 2015: 137-151 - 2013
- [c5]Hans Achatz, Peter Kleinschmidt:
Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution. OR 2013: 1-6
2000 – 2009
- 2007
- [j23]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 Trans. Instrum. Meas. 56(2): 463-467 (2007) - 2003
- [j22]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 Trans. Instrum. Meas. 52(2): 524-528 (2003) - [j21]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 Trans. Instrum. Meas. 52(2): 584-589 (2003) - 2000
- [j20]Günter Meisinger, Peter Kleinschmidt, Gil Kalai:
Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes. Discret. Comput. Geom. 24(2-3): 413-420 (2000)
1990 – 1999
- 1999
- [j19]Peter Kleinschmidt, Christian Rank:
New Heuristics for the Multidimensional Vote Assignment Problem. Computing 63(4): 405-417 (1999) - [j18]Jonathan M. Williams, Peter Kleinschmidt:
A cryogenic current comparator bridge for resistance measurements at currents of up to 100 A. IEEE Trans. Instrum. Meas. 48(2): 375-378 (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 - [j17]Andreas Hefner, Peter Kleinschmidt:
A Polyhedral Approach for a Constrained Matching Problem. Discret. Comput. Geom. 17(4): 429-437 (1997) - 1996
- [j16]Peter Kleinschmidt, Shmuel Onn:
Signable Posets and Partitionable Simplicial Complexes. Discret. Comput. Geom. 15(4): 443-466 (1996) - 1995
- [j15]Andreas Hefner, Peter Kleinschmidt:
A constrained matching problem. Ann. Oper. Res. 57(1): 135-145 (1995) - [j14]Peter Kleinschmidt, Heinz Schannath:
A strongly polynomial algorithm for the transportation problem. Math. Program. 68: 1-13 (1995) - [c4]Peter Kleinschmidt, Shmuel Onn:
Oriented Matroid Polytopes and Polyhedral Fans are Signable. IPCO 1995: 198-211 - 1994
- [j13]Peter Kleinschmidt, Ilse Mitterreiter, Jim Piper:
Improved chromosome classification using monotonic functions of mahalanobis distance and the transportation method. Math. Methods Oper. Res. 40(3): 305-323 (1994) - [j12]Peter Kleinschmidt, Ilse Mitterreiter, Christian Rank:
A hybrid method for automatic chromosome karyotyping. Pattern Recognit. Lett. 15(1): 87-96 (1994) - 1992
- [j11]Peter Kleinschmidt, Shmuel Onn:
On the diameter of convex polytopes. Discret. Math. 102(1): 75-77 (1992) - 1991
- [j10]Michael Tso, Peter Kleinschmidt, Ilse Mitterreiter, Jim Graham:
An efficient transportation algorithm for automatic chromosome karyotyping. Pattern Recognit. Lett. 12(2): 117-126 (1991) - 1990
- [j9]Victor Klee, Peter Kleinschmidt:
Geometry of the Gass-Saaty Parametric Cost LP Algorithm. Discret. Comput. Geom. 5: 13-26 (1990) - [j8]Jörg Gretenkort, Peter Kleinschmidt, Bernd Sturmfels:
On the Existence of Certain Smooth Toric Varieties. Discret. Comput. Geom. 5: 255-262 (1990) - [c3]Hans Achatz, Peter Kleinschmidt, Konstantinos Paparrizos:
A Dual Forest Algorithm for the Assignment Problem. Applied Geometry And Discrete Mathematics 1990: 1-10 - [c2]Peter Kleinschmidt, Niels Schwartz, Bernd Sturmfels:
Unimodular Fans, Linear Codes, and Toric Manifolds. Discrete and Computational Geometry 1990: 179-186 - [c1]Peter Kleinschmidt, Zeev Smilansky:
New Results for Simplicial Spherical Polytopes. Discrete and Computational Geometry 1990: 187-198
1980 – 1989
- 1988
- [j7]Rolf Bühner, Peter Kleinschmidt:
Reflections on the architecture of a decision support system for personnel assignment scheduling in production cell technology. Decis. Support Syst. 4(4): 473-480 (1988) - 1987
- [j6]Victor Klee, Peter Kleinschmidt:
The d-Step Conjecture and Its Relatives. Math. Oper. Res. 12(4): 718-755 (1987) - [j5]Peter Kleinschmidt, Carl W. Lee, Heinz Schannath:
Transportation problems which can be solved by the use of hirsch-paths for the dual problems. Math. Program. 37(2): 153-168 (1987) - 1986
- [j4]David W. Barnette, Peter Kleinschmidt, Carl W. Lee:
An Upper Bound Theorem for Polytope Pairs. Math. Oper. Res. 11(3): 451-464 (1986) - 1984
- [j3]Peter Kleinschmidt, Carl W. Lee:
On k-stacked polytopes. Discret. Math. 48(1): 125-127 (1984) - 1980
- [j2]Peter Kleinschmidt:
A steinitz-type theorem for the projective plane. Discret. Math. 32(1): 53-57 (1980)
1970 – 1979
- 1976
- [j1]Bernd Kind, Peter Kleinschmidt:
On the Maximal Volume of Convex Bodies with Few Vertices. J. Comb. Theory A 21(1): 124-128 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
