dblp.uni-trier.dewww.uni-trier.de

Rudolf Fleischer Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
84EERudolf Fleischer, Xi Wu, Liwei Yuan: Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. ESA 2009: 611-622
83EERudolf Fleischer: Is the World Linear? Efficient Algorithms 2009: 368-379
82EEChangyou Chen, Junping Zhang, Rudolf Fleischer: Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition. ICB 2009: 1030-1039
2008
81 Rudolf Fleischer, Jinhui Xu: Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings Springer 2008
80EERudolf Fleischer: Robotics. Encyclopedia of Algorithms 2008
79EERudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: Competitive Online Approximation of the Optimal Search Ratio. SIAM J. Comput. 38(3): 881-898 (2008)
2007
78 Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: Robot Navigation, 15.10. - 20.10.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
77EERudolf Fleischer, Qi Ge, Jian Li, Hong Zhu: Efficient Algorithms for k -Disjoint Paths Problems on DAGs. AAIM 2007: 134-143
76EEQizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun: Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447
75EERudolf Fleischer: Die Another Day. FUN 2007: 146-155
74EEAmitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu: Approximating the Maximum Sharing Problem. WADS 2007: 52-63
2006
73EERudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu: Non-metric Multicommodity and Multilevel Facility Location. AAIM 2006: 138-148
72EERudolf Fleischer: Die Another Day. Data Structures 2006
71EEDanny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu: Traversing the Machining Graph. ESA 2006: 220-231
70EEDanny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu: On Approximating the Maximum Simple Sharing Problem. ISAAC 2006: 547-556
69EESándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006
68EESándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Executive Summary -- Robot Navigation. Robot Navigation 2006
67EEAndrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006
66EERudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006)
65EERudolf Fleischer: Foreword. Algorithmica 46(1): 1 (2006)
64EERudolf Fleischer: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 16(2-3): 95-96 (2006)
63EEYong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu: Approximating the minimum weight weak vertex cover. Theor. Comput. Sci. 363(1): 99-105 (2006)
2005
62EERudolf Fleischer, Gerhard Trippen: On the Effectiveness of Visualizations in a Theory of Computing Course. Cognitive Systems 2005: 15-24
61EERudolf Fleischer, Gerhard Trippen: Exploring an Unknown Graph Efficiently. ESA 2005: 11-22
60EERudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang: Approximating Spanning Trees with Inner Nodes Cost. PDCAT 2005: 660-664
2004
59 Rudolf Fleischer, Gerhard Trippen: Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings Springer 2004
58EERudolf Fleischer, Gerhard Trippen: Kayles on the Way to the Stars. Computers and Games 2004: 232-245
57EERudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346
56EERudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113
55EETherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004)
54EETherese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight bounds on maximal and maximum matchings. Discrete Mathematics 285(1-3): 7-15 (2004)
53EERudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong: Finding optimal paths in MREP routing. Inf. Process. Lett. 89(2): 57-63 (2004)
52EERudolf Fleischer, Richard J. Nowakowski: Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 313 (2004)
51EEErik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Theor. Comput. Sci. 303(3): 325-338 (2004)
50EESándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling salesmen in the presence of competition. Theor. Comput. Sci. 303(3): 377-392 (2004)
49EEErik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski: Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 539-543 (2004)
48EERudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden: New results for online page replication. Theor. Comput. Sci. 324(2-3): 219-251 (2004)
2003
47EERudolf Fleischer, Gerhard Trippen: Experimental Studies of Graph Traversal Algorithms. WEA 2003: 120-133
46EERudolf Fleischer, Hisashi Koga: Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. Algorithmica 38(2): 363-376 (2003)
45EEThomas L. Naps, Guido Rößling, Vicki L. Almstrum, Wanda Dann, Rudolf Fleischer, Christopher D. Hundhausen, Ari Korhonen, Lauri Malmi, Myles F. McNally, Susan H. Rodger, J. Ángel Velázquez-Iturbide: Exploring the role of visualization and engagement in computer science education. SIGCSE Bulletin 35(2): 131-152 (2003)
44EEThomas L. Naps, Stephen Cooper, Boris Koldehofe, Charles Leska, Guido Rößling, Wanda Dann, Ari Korhonen, Lauri Malmi, Jarmo Rantakokko, Rockford J. Ross, Jay Anderson, Rudolf Fleischer, Marja Kuittinen, Myles F. McNally: Evaluating the educational impact of visualization. SIGCSE Bulletin 35(4): 124-136 (2003)
2002
43 Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt: Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000] Springer 2002
42EEErik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Computers and Games 2002: 188-200
41EESándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling Salesmen in the Presence of Competition CoRR cs.CC/0212001: (2002)
40EEErik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber CoRR cs.DM/0204017: (2002)
39EETherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-colorings. Discrete Mathematics 254(1-3): 19-32 (2002)
38EEProsenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro: Online Routing in Convex Subdivisions. Int. J. Comput. Geometry Appl. 12(4): 283-296 (2002)
2001
37EETherese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319
36EERudolf Fleischer, Ludek Kucera: Algorithm Animation for Teaching. Software Visualization 2001: 113-128
35EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro: The Complexity of Clickomania CoRR cs.CC/0107031: (2001)
34EERudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen: Optimal Robot Localization in Trees. Inf. Comput. 171(2): 224-247 (2001)
33EERudolf Fleischer: On the Bahncard problem. Theor. Comput. Sci. 268(1): 161-174 (2001)
2000
32EERudolf Fleischer, Steven S. Seiden: New results for online page replication. APPROX 2000: 144-154
31EEPeter Sanders, Rudolf Fleischer: Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. Algorithm Engineering 2000: 135-146
30EERudolf Fleischer, Michaela Wahl: Online Scheduling Revisited. ESA 2000: 202-210
29EECatherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup: Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics 2000: 93-126
28EEProsenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz: Online Routing in Convex Subdivisions. ISAAC 2000: 47-59
27EETherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-Colorings. MFCS 2000: 202-211
26EERudolf Fleischer, Gerhard Trippen: Optimal robot localization in trees. Symposium on Computational Geometry 2000: 373-374
25EEChristoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000)
24EEWolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore: Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000)
1999
23EERudolf Fleischer, Colin Hirsch: Graph Drawing and Its Applications. Drawing Graphs 1999: 1-22
22EEChristoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: Efficient Exact Geometric Computation Made Easy. Symposium on Computational Geometry 1999: 341-350
21 Rudolf Fleischer: Decision Trees: Old and New Results. Inf. Comput. 152(1): 44-61 (1999)
1998
20EERudolf Fleischer: On The Bahncard Problem. COCOON 1998: 65-74
1997
19 Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen: Episode Matching. CPM 1997: 12-27
18 Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709
17 Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid: More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997)
1996
16EENoga Alon, Phillip G. Bradford, Rudolf Fleischer: Matching Nuts and Bolts Faster. Inf. Process. Lett. 59(3): 123-127 (1996)
15 Rudolf Fleischer: A Simple Balanced Search Tree with O(1) Worst-Case Update Time. Int. J. Found. Comput. Sci. 7(2): 137-150 (1996)
1995
14EEPhillip G. Bradford, Rudolf Fleischer: Matching Nuts and Bolts Faster. ISAAC 1995: 402-408
13 Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Communication-Randomness Tradeoff for Two-Processor Systems Inf. Comput. 116(2): 155-161 (1995)
1994
12 Rudolf Fleischer: A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. Algorithmica 11(2): 104-115 (1994)
1993
11EERudolf Fleischer: A Simple Balanced Search Tree with O(1) Worst-Case Update Time. ISAAC 1993: 138-146
10EERudolf Fleischer: Decision trees: old and new results. STOC 1993: 468-477
9 Rudolf Fleischer, B. P. Sinha, Christian Uhrig: A Lower Bound for the Worst Case of Bottom-Up-Heapsort Inf. Comput. 102(2): 263-279 (1993)
1992
8 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
7 Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992)
6 Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992)
1991
5 Rudolf Fleischer: A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. ISA 1991: 251-262
1990
4EERudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: On Simultaneous Inner and Outer Approximation of Shapes. Symposium on Computational Geometry 1990: 216-224
3EEHelmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Symposium on Computational Geometry 1990: 281-289
2EERudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401
1989
1 Rudolf Fleischer: Communication Complexity of Multi-Processor Systems. Inf. Process. Lett. 30(2): 57-65 (1989)

Coauthor Index

1Vicki L. Almstrum [45]
2Noga Alon [16]
3Helmut Alt [3] [6]
4Jay Anderson [44]
5Wolfgang W. Bein [24]
6Therese C. Biedl [27] [35] [37] [39] [54] [55]
7Prosenjit Bose [28] [38]
8Phillip G. Bradford [14] [16] [17]
9Andrej Brodnik [28] [38]
10Christoph Burnikel [18] [22] [25]
11Svante Carlsson [28] [38]
12Eowyn Cenek [27] [39]
13Timothy M. Chan [27] [39] [55]
14Amitabh Chaudhary [74]
15Changyou Chen [82]
16Danny Z. Chen [70] [71] [74]
17Paul R. Cohen [29]
18Stephen Cooper [44]
19Wanda Dann [44] [45]
20Gautam Das [19]
21Erik D. Demaine [27] [28] [35] [37] [38] [39] [40] [42] [49] [51] [54] [55]
22Martin L. Demaine [27] [35] [39] [40] [42] [51]
23Christian A. Duncan [37] [54]
24Andrea Eubeler [67]
25Qizhi Fang [76]
26Sándor P. Fekete [41] [50] [68] [69] [78]
27Aviezri S. Fraenkel [41] [49] [50]
28Otfried Fries [8]
29Leszek Gasieniec [19]
30Qi Ge [60] [63] [77]
31Wodzimierz Glazek [48]
32Mordecai J. Golin [53] [55] [56] [66]
33Dimitrios Gunopulos [19]
34Colin Hirsch [23]
35Xiaobo Sharon Hu (Xiaobo Hu) [74]
36Christopher D. Hundhausen [45]
37Lars Jacobsen [35]
38Tao Jiang [63]
39Hermann Jung [2] [13]
40Tom Kamphans (Thomas Kamphans) [57] [67] [79]
41Juha Kärkkäinen [19]
42Michael Kaufmann [3] [6]
43James A. King [55]
44Rolf Klein [57] [67] [68] [69] [78] [79]
45Stephen G. Kobourov [37] [54]
46Hisashi Koga [46]
47Boris Koldehofe [44]
48Ari Korhonen [44] [45]
49Ludek Kucera [36]
50Marja Kuittinen [44]
51Elmar Langetepe [57] [67] [79]
52Lawrence L. Larmore [24]
53Chin-Tau A. Lea [53]
54Charles Leska [44]
55Jian Li [60] [70] [71] [73] [74] [76] [77]
56Alejandro López-Ortiz [28] [38] [68] [69] [78]
57Lauri Malmi [44] [45]
58Catherine C. McGeoch [29]
59Myles F. McNally [44] [45]
60Kurt Mehlhorn [2] [3] [4] [6] [7] [8] [13] [18] [22] [25]
61Stefan Meiser [8]
62Bernard M. E. Moret [43]
63Pat Morin [28] [38]
64J. Ian Munro [28] [35] [38] [55]
65Stefan Näher [3] [6] [8]
66Thomas L. Naps [44] [45]
67Michael T. Niemier [74]
68Richard J. Nowakowski [49] [52]
69Doina Precup [29]
70Jarmo Rantakokko [44]
71Susan H. Rodger [45]
72Hans Rohnert [8]
73Kathleen Romanik [34]
74Rockford J. Ross [44]
75Guido Rößling [44] [45]
76Günter Rote [4] [7]
77Peter Sanders [29] [31]
78Stefan Schirra [3] [6] [8] [18] [22] [25]
79Erik Meineche Schmidt [43]
80Matthias Schmitt [41] [50]
81Sven Schuierer [34]
82Steven S. Seiden [32] [48]
83Klaus Simon [8]
84B. P. Sinha [9]
85Michiel H. M. Smid [17]
86Xiaoxun Sun [76]
87Shijun Tian [60] [73]
88Gerhard Trippen [26] [34] [47] [57] [58] [59] [61] [62] [67] [79]
89Athanasios K. Tsakalidis [8]
90Christian Uhrig [3] [6] [8] [9]
91J. Ángel Velázquez-Iturbide [45]
92Michaela Wahl [30]
93Haitao Wang [60] [71]
94Ming-wei Wang [27] [39]
95Emo Welzl [4] [7]
96Steven Wong [53]
97Xi Wu [84]
98Zhiyi Xie [70] [74]
99Jinhui Xu [81]
100Chee-Keng Yap (Chee Yap) [4] [7]
101Liwei Yuan [84]
102Junping Zhang [82]
103Yan Zhang [56] [66]
104Yong Zhang [63]
105Hong Zhu [63] [70] [71] [73] [74] [77]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)