Theo dõi
Rudolf Fleischer
Rudolf Fleischer
Heinrich Heine University Düsseldorf, Germany
Email được xác minh tại hhu.de
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Exploring the role of visualization and engagement in computer science education
TL Naps, G Rößling, V Almstrum, W Dann, R Fleischer, C Hundhausen, ...
Working group reports from ITiCSE on Innovation and technology in computer …, 2002
10022002
Evaluating the educational impact of visualization
T Naps, S Cooper, B Koldehofe, C Leska, G Rößling, W Dann, ...
Acm sigcse bulletin 35 (4), 124-136, 2003
2392003
On‐line scheduling revisited
R Fleischer, M Wahl
Journal of Scheduling 3 (6), 343-353, 2000
1842000
Order-preserving matching
J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ...
Theoretical Computer Science 525, 68-79, 2014
1712014
Episode matching
G Das, R Fleischer, L Gasieniec, D Gunopulos, J Kärkkäinen
Combinatorial Pattern Matching: 8th Annual Symposium, CPM 97 Aarhus, Denmark …, 1997
1311997
On the Bahncard problem
R Fleischer
Theoretical Computer Science 268 (1), 161-174, 2001
1112001
Low-resolution gait recognition
J Zhang, J Pu, C Chen, R Fleischer
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 40 …, 2010
1102010
Tight bounds on maximal and maximum matchings
T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov
Discrete Mathematics 285 (1-3), 7-15, 2004
1092004
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
H Alt, R Fleischer, M Kaufmann, K Mehlhorn, S Näher, S Schirra, C Uhrig
Proceedings of the sixth annual symposium on Computational geometry, 281-289, 1990
1051990
Datenstrukturen und Effiziente Algorithmen, Band 1: Sortieren und Suchen
K Mehlhorn
Teubner, 1986
1021986
Exploring an unknown graph efficiently
R Fleischer, G Trippen
Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005
982005
Efficient exact geometric computation made easy
C Burnikel, R Fleischer, K Mehlhorn, S Schirra
Proceedings of the fifteenth annual symposium on Computational geometry, 341-350, 1999
861999
A strong and easily computable separation bound for arithmetic expressions involving radicals
C Burnikel, R Fleischer, K Mehlhorn, S Schirra
Algorithmica 27 (1), 87-99, 2000
712000
Algorithm animation for teaching
R Fleischer, L Kučera
Software Visualization: International Seminar Dagstuhl Castle, Germany, May …, 2002
682002
Online routing in convex subdivisions
P Bose, A Brodnik, S Carlsson, ED Demaine, R Fleischer, A López-Ortiz, ...
International Symposium on Algorithms and Computation, 47-59, 2000
682000
Online scheduling revisited
R Fleischer, M Wahl
European Symposium on Algorithms, 202-210, 2000
662000
Online routing in convex subdivisions
P Bose, A Brodnik, S Carlsson, ED Demaine, R Fleischer, A López-Ortiz, ...
International Journal of Computational Geometry & Applications 12 (04), 283-295, 2002
622002
A simple balanced search tree with O (1) worst-case update time
R Fleischer
International Journal of Foundations of Computer Science 7 (02), 137-149, 1996
601996
On simultaneous inner and outer approximation of shapes
R Fleischer, K Mehlhorn, G Rote, E Welzl, C Yap
Proceedings of the sixth annual symposium on Computational geometry, 216-224, 1990
601990
Competitive online approximation of the optimal search ratio
R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen
SIAM Journal on Computing 38 (3), 881-898, 2008
59*2008
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20