| 2007 |
|---|
| 22 | EE | 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) |
| 21 | EE | Peter Zolliker,
Klaus Simon:
Retaining Local Image Information in Gamut Mapping Algorithms.
IEEE Transactions on Image Processing 16(3): 664-672 (2007) |
| 2003 |
|---|
| 20 | EE | Klaus Simon,
Beat Trachsler:
A Random Walk Approach for Light Scattering in Material.
DRW 2003: 289-300 |
| 2002 |
|---|
| 19 | EE | 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 |
| 2001 |
|---|
| 18 | | Nicola Galli,
Bernhard Seybold,
Klaus Simon:
Tetris-Hashing or optimal table compression.
Discrete Applied Mathematics 110(1): 41-58 (2001) |
| 2000 |
|---|
| 17 | | Thomas Raschle,
Klaus Simon:
On the P4-components of graphs.
Discrete Applied Mathematics 100(3): 215-235 (2000) |
| 1998 |
|---|
| 16 | EE | Bernhard Seybold,
F. Metzger,
G. Ogan,
Klaus Simon:
Using Blocks for Constraint Satisfaction.
CP 1998: 474 |
| 1997 |
|---|
| 15 | | Davide Crippa,
Klaus Simon,
Paul Trunz:
Markov Processes Involving q-Stirling Numbers.
Combinatorics, Probability & Computing 6(2): 165-178 (1997) |
| 14 | EE | Davide Crippa,
Klaus Simon:
q-distributions and Markov processes.
Discrete Mathematics 170(1-3): 81-98 (1997) |
| 13 | EE | 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) |
| 1995 |
|---|
| 12 | EE | Thomas Raschle,
Klaus Simon:
Recognition of graphs with threshold dimension two.
STOC 1995: 650-661 |
| 11 | | Daniele Giorgio Degiorgi,
Klaus Simon:
A Dynamic Algorithm for Line Graph Recognition.
WG 1995: 37-48 |
| 10 | EE | Klaus Simon:
A Note on Lexicographic Breadt First Search for Chordal Graphs.
Inf. Process. Lett. 54(5): 249-251 (1995) |
| 1994 |
|---|
| 9 | | Klaus Simon,
Paul Trunz:
A Cleanup on Transitive Orientation.
ORDAL 1994: 59-85 |
| 1993 |
|---|
| 8 | | Klaus Simon,
Davide Crippa,
Fabian Collenberg:
On the Distribution of the Transitive Closure in a Random Acyclic Digraph.
ESA 1993: 345-356 |
| 1992 |
|---|
| 7 | | 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 |
|---|
| 6 | | Klaus Simon:
A New Simple Linear Algorithm to Recognize Interval Graphs.
Workshop on Computational Geometry 1991: 289-308 |
| 1989 |
|---|
| 5 | | Klaus Simon:
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time.
WG 1989: 245-259 |
| 1988 |
|---|
| 4 | | Klaus Simon:
On Minimum Flow and Transitive Reduction.
ICALP 1988: 535-546 |
| 3 | | Klaus Simon:
An Improved Algorithm for Transitive Closure on Acyclic Digraphs.
Theor. Comput. Sci. 58: 325-346 (1988) |
| 1986 |
|---|
| 2 | | Klaus Simon:
An Improved Algorithm for Transitive Closure on Acyclic Digraphs.
ICALP 1986: 376-386 |
| 1985 |
|---|
| 1 | | Kurt Mehlhorn,
Klaus Simon:
Intersecting two polyhedra one of which is convex.
FCT 1985: 534-542 |
