default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Simon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j12]Ursina Caluori, Klaus Simon:
DETEXTIVE optical character recognition with pattern matching on-the-fly. Pattern Recognit. 48(3): 827-836 (2015)- 2013
- [j11]Dietmar Zenker, Klaus Simon, Leo Gros, Thorsten Daubenfeld:
Comprehensive Virtual Mathematics Training - A Crucial Support to Bridge the Gap for Undergraduate Students. Int. J. Eng. Pedagog. 3(3): 24-27 (2013) - [c32]Dietmar Zenker, Klaus Simon, Leo Gros, Thorsten Daubenfeld:
Comprehensive virtual mathematics training. EDUCON 2013: 627-630 - [c31]Ursina Caluori, Klaus Simon:
Similarity measures for pattern matching on-the-fly. ICMV 2013: 906721 - [c30]Dennis Küpper, Zofia Baranczuk, Ursina Caluori, Iris Sprow, Matthias Scheller Lichtenauer, Klaus Simon, Peter Zolliker:
High Dynamic Range imaging: is the game worth the candle? CIC 2013: 231-235 - [c29]Ursina Caluori, Klaus Simon:
Glyph recognition by pattern matching with on-the-fly generated patterns. SoftCOM 2013: 1-5 - 2011
- [c28]Ursina Caluori, Dennis Küpper, Klaus Simon:
DIN 6164 for Gamut Mapping? Color Imaging: Displaying, Processing, Hardcopy, and Applications 2011: 78660A - 2010
- [c27]Dennis Küpper, Klaus Simon:
Aspects of computational geometry in gamut mapping implementations. Color Imaging: Displaying, Processing, Hardcopy, and Applications 2010: 75280J - [c26]Marcel Meili, Dennis Küpper, Zofia Baranczuk, Ursina Caluori, Klaus Simon:
Filter methods to preserve local contrast and to avoid artifacts in gamut mapping. Color Imaging: Displaying, Processing, Hardcopy, and Applications 2010: 75280I
2000 – 2009
- 2009
- [c25]Matthias Scheller Lichtenauer, Safer Mourad, Peter Zolliker, Klaus Simon:
Classification of Paper Images to Predict Substrate Parameters Prior to Print. CCIW 2009: 150-159 - [c24]Tobias Stamm, Klaus Simon:
Dotgain estimation using linear least squares incorporating neighboring and clustering effects. Color Imaging: Displaying, Processing, Hardcopy, and Applications 2009: 72411A - [c23]Ursina Caluori, Klaus Simon:
An RGB color management concept based on an improved gamut mapping algorithm. Color Imaging: Displaying, Processing, Hardcopy, and Applications 2009: 724118 - 2007
- [j10]Peter Zolliker
, Klaus Simon:
Retaining Local Image Information in Gamut Mapping Algorithms. IEEE Trans. Image Process. 16(3): 664-672 (2007) - [j9]Joachim Giesen, Eva Schuberth, Klaus Simon, Peter Zolliker, Oliver Zweifel:
Image-Dependent Gamut Mapping as Optimization Problem. IEEE Trans. Image Process. 16(10): 2401-2410 (2007) - 2006
- [j8]Peter Zolliker, Klaus Simon:
Continuity of gamut mapping algorithms. J. Electronic Imaging 15(1): 013004 (2006) - [c22]Peter Zolliker, Klaus Simon:
Adding Local Contrast to Global Gamut Mapping Algorithms. CGIV 2006: 257-261 - [c21]Joachim Giesen, Eva Schuberth, Klaus Simon, Daniel Zeiter, Peter Zolliker:
A framework for image-dependent gamut mapping. Color Imaging: Processing, Hardcopy, and Applications 2006: 605805 - [c20]Joachim Giesen, Eva Schuberth, Klaus Simon, Peter Zolliker:
A kernel approach to gamut boundary computation. EUSIPCO 2006: 1-4 - 2005
- [c19]Joachim Giesen, Eva Schuberth, Klaus Simon, Peter Zolliker:
Toward image-dependent gamut mapping: fast and accurate gamut boundary determination. Color Imaging: Processing, Hardcopy, and Applications 2005: 201-210 - [c18]Peter Zolliker, Markus Dätwyler, Klaus Simon:
Continuity of gamut mapping algorithms. Color Imaging: Processing, Hardcopy, and Applications 2005: 220-233 - 2004
- [c17]Úlfar Steingrímsson, Klaus Simon:
Quality Assessment of the JPEG 2000 Compression Standard. CGIV 2004: 337-342 - 2003
- [c16]Klaus Simon, Beat Trachsler:
A Random Walk Approach for Light Scattering in Material. DRW 2003: 289-300 - 2002
- [c15]Úlfar Steingrímsson, Klaus Simon, Walter Steiger, Kurt Schläpfer:
The Gamut Obtainable with Surface Colors. CGIV 2002: 287-291 - [c14]Klaus Simon:
A Stochastic Interpretation of Kubelka-Munk. CGIV 2002: 468-472 - [c13]Safer Mourad, Patrick Emmel, Klaus Simon, Roger D. Hersch:
Prediction of Monochrome Reflectance Spectra with an Extended Kubelka-Munk Model. CIC 2002: 298-304 - 2001
- [j7]Nicola Galli, Bernhard Seybold, Klaus Simon:
Tetris-Hashing or optimal table compression. Discret. Appl. Math. 110(1): 41-58 (2001) - 2000
- [b3]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 - [j6]Thomas Raschle, Klaus Simon:
On the P4-components of graphs. Discret. Appl. Math. 100(3): 215-235 (2000)
1990 – 1999
- 1998
- [c12]Bernhard Seybold, Felix J. Metzger, G. Ogan, Klaus Simon:
Using Blocks for Constraint Satisfaction. CP 1998: 474 - 1997
- [j5]Davide Crippa, Klaus Simon, Paul Trunz:
Markov Processes Involving q-Stirling Numbers. Comb. Probab. Comput. 6(2): 165-178 (1997) - [j4]Davide Crippa, Klaus Simon:
q-distributions and Markov processes. Discret. Math. 170(1-3): 81-98 (1997) - [j3]George E. Andrews, Davide Crippa, Klaus Simon:
q-Series Arising From The Study of Random Graphs. SIAM J. Discret. Math. 10(1): 41-56 (1997) - [c11]Bernhard Seybold, Felix J. Metzger, G. Ogan, J. Bathelt, Fabian Collenberg, J. Taiber, Klaus Simon, M. Engeli:
Spatial Modelling with Geometric Constraints. PACT 1997: 307-320 - 1995
- [j2]Klaus Simon:
A Note on Lexicographic Breadt First Search for Chordal Graphs. Inf. Process. Lett. 54(5): 249-251 (1995) - [c10]Thomas Raschle, Klaus Simon:
Recognition of graphs with threshold dimension two. STOC 1995: 650-661 - [c9]Daniele Giorgio Degiorgi, Klaus Simon:
A Dynamic Algorithm for Line Graph Recognition. WG 1995: 37-48 - 1994
- [c8]Klaus Simon, Paul Trunz:
A Cleanup on Transitive Orientation. ORDAL 1994: 59-85 - 1993
- [c7]Klaus Simon, Davide Crippa, Fabian Collenberg:
On the Distribution of the Transitive Closure in a Random Acyclic Digraph. ESA 1993: 345-356 - 1992
- [b2]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 - [c6]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 - 1991
- [c5]Klaus Simon:
A New Simple Linear Algorithm to Recognize Interval Graphs. Workshop on Computational Geometry 1991: 289-308
1980 – 1989
- 1989
- [c4]Klaus Simon:
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. WG 1989: 245-259 - 1988
- [j1]Klaus Simon:
An Improved Algorithm for Transitive Closure on Acyclic Digraphs. Theor. Comput. Sci. 58: 325-346 (1988) - [c3]Klaus Simon:
On Minimum Flow and Transitive Reduction. ICALP 1988: 535-546 - 1987
- [b1]Klaus Simon:
Effiziente Algorithmen für transitive Hülle, transitive Reduktion und minimale Flussprobleme. Saarland University, Saarbrücken, Germany, 1987, pp. 1-102 - 1986
- [c2]Klaus Simon:
An Improved Algorithm for Transitive Closure on Acyclic Digraphs. ICALP 1986: 376-386 - 1985
- [c1]Kurt Mehlhorn, Klaus Simon:
Intersecting two polyhedra one of which is convex. FCT 1985: 534-542
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-04-25 05:44 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:
