Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Simon, Klaus"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Divisor functions and pentagonal numbers
Klaus Simon
Trends in Mathematics
, 2004, pp. 69-70
Tetris-hashing or optimal table compression
Nicola Galli
,
Bernhard Seybold
,
Klaus Simon
Discrete Applied Mathematics
110
(1), 2001, pp. 41-58
On the
P_4
-components of graphs
Thomas Raschle
,
Klaus Simon
Discrete Applied Mathematics
100
(3), 2000, pp. 215-235
q
-series arising from the study of random graphs
George E. Andrews
,
Davide Crippa
,
Klaus Simon
SIAM Journal on Discrete Mathematics
10
(1), 1997, pp. 41-56
A dynamic algorithm for line graph recognition
Daniele Giorgio Degiorgi
,
Klaus Simon
Lecture Notes in Computer Science
1017
, 1995, pp. 37-48
Recognition of graphs with threshold dimension two
Thomas Raschle
,
Klaus Simon
Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, May 29 - June 1, 1995)
, 1995, pp. 650-661
A note on lexicographic breadth first search for chordal graphs
Klaus Simon
Information Processing Letters
54
, 1995, pp. 249-251
A cleanup on transitive orientation
Klaus Simon
,
Paul Trunz
Lecture Notes in Computer Science
831
, 1994, pp. 59-85
On the distribution of the transitive closure in a random acyclic digraph
Klaus Simon
,
Davide Crippa
,
Fabian Collenberg
Lecture Notes in Computer Science
726
, 1993, pp. 345-356
Selected topics from computational geometry, data structures and motion planning
Rudolf Fleischer
,
Otfried Fries
,
Kurt Mehlhorn
,
Stefan Meiser
,
Stefan Näher
,
Hans Rohnert
,
Stefan Schirra
,
Klaus Simon
,
Athanasios Tsakalidis
,
Christian Uhrig
Lecture Notes in Computer Science
594
, 1992, pp. 25-43
On transitive orientation
Klaus Simon
,
Paul Trunz
Technical Report (171), 1991, December
Finding a minimal transitive reduction in a strongly connected digraph within linear time
Klaus Simon
Lecture Notes in Computer Science
411
, 1989, pp. 245-259
An improved algorithm for transitive closure on acyclic digraphs
Klaus Simon
Theoretical Computer Science
58
, 1988, pp. 325-346