Klaus Simon

Matthias Scheller Lichtenauer, Safer Mourad, Peter Zolliker, Klaus Simon: Classification of Paper Images to Predict Substrate Parameters Prior to Print. CCIW 2009: 150-159

Peter Zolliker, Klaus Simon: Retaining Local Image Information in Gamut Mapping Algorithms. IEEE Transactions on Image Processing 16(3): 664-672 (2007)

Joachim Giesen, Eva Schuberth, Klaus Simon, Peter Zolliker, Oliver Zweifel: Image-Dependent Gamut Mapping as Optimization Problem. IEEE Transactions on Image Processing 16(10): 2401-2410 (2007)

Peter Zolliker, Klaus Simon: Continuity of gamut mapping algorithms. J. Electronic Imaging 15(1): 013004 (2006)

Klaus Simon, Beat Trachsler: A Random Walk Approach for Light Scattering in Material. DRW 2003: 289-300

Safer Mourad, Patrick Emmel, Klaus Simon, Roger D. Hersch: Prediction of Monochrome Reflectance Spectra with an Extended Kubelka-Munk Model. Color Imaging Conference 2002: 298-304

Nicola Galli, Bernhard Seybold, Klaus Simon: Tetris-Hashing or optimal table compression. Discrete Applied Mathematics 110(1): 41-58 (2001)

Klaus Simon: Programmieren für Mathematiker und Naturwissenschaftler - eine pragmatische Einführung mit C++ (2. Aufl.). vdf Lehrbuch, vdf 2000, isbn 978-3-7281-2747-1, pp. I-VII, 1-207

Thomas Raschle, Klaus Simon: On the P4-components of graphs. Discrete Applied Mathematics 100(3): 215-235 (2000)

Bernhard Seybold, F. Metzger, G. Ogan, Klaus Simon: Using Blocks for Constraint Satisfaction. CP 1998: 474

Davide Crippa, Klaus Simon, Paul Trunz: Markov Processes Involving q-Stirling Numbers. Combinatorics, Probability & Computing 6(2): 165-178 (1997)

Davide Crippa, Klaus Simon: q-distributions and Markov processes. Discrete Mathematics 170(1-3): 81-98 (1997)

George E. Andrews, Davide Crippa, Klaus Simon: q-Series Arising From The Study of Random Graphs. SIAM J. Discrete Math. 10(1): 41-56 (1997)

Klaus Simon: A Note on Lexicographic Breadt First Search for Chordal Graphs. Inf. Process. Lett. 54(5): 249-251 (1995)

Thomas Raschle, Klaus Simon: Recognition of graphs with threshold dimension two. STOC 1995: 650-661

Daniele Giorgio Degiorgi, Klaus Simon: A Dynamic Algorithm for Line Graph Recognition. WG 1995: 37-48

Klaus Simon, Paul Trunz: A Cleanup on Transitive Orientation. ORDAL 1994: 59-85

Klaus Simon, Davide Crippa, Fabian Collenberg: On the Distribution of the Transitive Closure in a Random Acyclic Digraph. ESA 1993: 345-356

Klaus Simon: Effiziente Algorithmen für perfekte Graphen. Leitfäden und Monographien der Informatik, Teubner 1992, isbn 978-3-519-02940-3, pp. I-VIII, 1-286

Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig: Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43

Klaus Simon: A New Simple Linear Algorithm to Recognize Interval Graphs. Workshop on Computational Geometry 1991: 289-308

Klaus Simon: Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. WG 1989: 245-259

Klaus Simon: An Improved Algorithm for Transitive Closure on Acyclic Digraphs. Theor. Comput. Sci. 58: 325-346 (1988)

Klaus Simon: On Minimum Flow and Transitive Reduction. ICALP 1988: 535-546

Klaus Simon: An Improved Algorithm for Transitive Closure on Acyclic Digraphs. ICALP 1986: 376-386

Kurt Mehlhorn, Klaus Simon: Intersecting two polyhedra one of which is convex. FCT 1985: 534-542