| 2007 |
|---|
| 76 | | 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 |
| 75 | EE | Rudolf Fleischer,
Qi Ge,
Jian Li,
Hong Zhu:
Efficient Algorithms for k -Disjoint Paths Problems on DAGs.
AAIM 2007: 134-143 |
| 74 | EE | Qizhi Fang,
Rudolf Fleischer,
Jian Li,
Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.
COCOON 2007: 439-447 |
| 73 | EE | Rudolf Fleischer:
Die Another Day.
FUN 2007: 146-155 |
| 72 | EE | Amitabh 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 |
|---|
| 71 | EE | Rudolf Fleischer,
Jian Li,
Shijun Tian,
Hong Zhu:
Non-metric Multicommodity and Multilevel Facility Location.
AAIM 2006: 138-148 |
| 70 | EE | Rudolf Fleischer:
Die Another Day.
Data Structures 2006 |
| 69 | EE | Danny Z. Chen,
Rudolf Fleischer,
Jian Li,
Haitao Wang,
Hong Zhu:
Traversing the Machining Graph.
ESA 2006: 220-231 |
| 68 | EE | Danny Z. Chen,
Rudolf Fleischer,
Jian Li,
Zhiyi Xie,
Hong Zhu:
On Approximating the Maximum Simple Sharing Problem.
ISAAC 2006: 547-556 |
| 67 | EE | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation.
Robot Navigation 2006 |
| 66 | EE | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation.
Robot Navigation 2006 |
| 65 | EE | Andrea Eubeler,
Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane.
Robot Navigation 2006 |
| 64 | EE | Rudolf Fleischer,
Mordecai J. Golin,
Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line.
Algorithmica 45(4): 549-567 (2006) |
| 63 | EE | Rudolf Fleischer:
Foreword.
Algorithmica 46(1): 1 (2006) |
| 62 | EE | Rudolf Fleischer:
Guest Editor's Foreword.
Int. J. Comput. Geometry Appl. 16(2-3): 95-96 (2006) |
| 61 | EE | Yong 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 |
|---|
| 60 | EE | Rudolf Fleischer,
Gerhard Trippen:
On the Effectiveness of Visualizations in a Theory of Computing Course.
Cognitive Systems 2005: 15-24 |
| 59 | EE | Rudolf Fleischer,
Gerhard Trippen:
Exploring an Unknown Graph Efficiently.
ESA 2005: 11-22 |
| 58 | EE | Rudolf Fleischer,
Qi Ge,
Jian Li,
Shijun Tian,
Haitao Wang:
Approximating Spanning Trees with Inner Nodes Cost.
PDCAT 2005: 660-664 |
| 2004 |
|---|
| 57 | | Rudolf Fleischer,
Gerhard Trippen:
Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings
Springer 2004 |
| 56 | EE | Rudolf Fleischer,
Gerhard Trippen:
Kayles on the Way to the Stars.
Computers and Games 2004: 232-245 |
| 55 | EE | Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio.
ESA 2004: 335-346 |
| 54 | EE | Rudolf Fleischer,
Mordecai J. Golin,
Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line.
SWAT 2004: 102-113 |
| 53 | EE | Therese 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) |
| 52 | EE | Therese 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) |
| 51 | EE | Rudolf Fleischer,
Mordecai J. Golin,
Chin-Tau A. Lea,
Steven Wong:
Finding optimal paths in MREP routing.
Inf. Process. Lett. 89(2): 57-63 (2004) |
| 50 | EE | Rudolf Fleischer,
Richard J. Nowakowski:
Preface: Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci. 303(3): 313 (2004) |
| 49 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber.
Theor. Comput. Sci. 303(3): 325-338 (2004) |
| 48 | EE | Sá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) |
| 47 | EE | Erik 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) |
| 46 | EE | Rudolf Fleischer,
Wodzimierz Glazek,
Steven S. Seiden:
New results for online page replication.
Theor. Comput. Sci. 324(2-3): 219-251 (2004) |
| 2003 |
|---|
| 45 | EE | Rudolf Fleischer,
Gerhard Trippen:
Experimental Studies of Graph Traversal Algorithms.
WEA 2003: 120-133 |
| 44 | EE | Rudolf Fleischer,
Hisashi Koga:
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness.
Algorithmica 38(2): 363-376 (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 |
| 42 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber.
Computers and Games 2002: 188-200 |
| 41 | EE | Sándor P. Fekete,
Rudolf Fleischer,
Aviezri S. Fraenkel,
Matthias Schmitt:
Traveling Salesmen in the Presence of Competition
CoRR cs.CC/0212001: (2002) |
| 40 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber
CoRR cs.DM/0204017: (2002) |
| 39 | EE | Therese 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) |
| 38 | EE | Prosenjit 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 |
|---|
| 37 | EE | Therese C. Biedl,
Erik D. Demaine,
Christian A. Duncan,
Rudolf Fleischer,
Stephen G. Kobourov:
Tight Bounds on Maximal and Maximum Matchings.
ISAAC 2001: 308-319 |
| 36 | EE | Rudolf Fleischer,
Ludek Kucera:
Algorithm Animation for Teaching.
Software Visualization 2001: 113-128 |
| 35 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Lars Jacobsen,
J. Ian Munro:
The Complexity of Clickomania
CoRR cs.CC/0107031: (2001) |
| 34 | EE | Rudolf Fleischer,
Kathleen Romanik,
Sven Schuierer,
Gerhard Trippen:
Optimal Robot Localization in Trees.
Inf. Comput. 171(2): 224-247 (2001) |
| 33 | EE | Rudolf Fleischer:
On the Bahncard problem.
Theor. Comput. Sci. 268(1): 161-174 (2001) |
| 2000 |
|---|
| 32 | EE | Rudolf Fleischer,
Steven S. Seiden:
New results for online page replication.
APPROX 2000: 144-154 |
| 31 | EE | Peter Sanders,
Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
Algorithm Engineering 2000: 135-146 |
| 30 | | Rudolf Fleischer,
Michaela Wahl:
Online Scheduling Revisited.
ESA 2000: 202-210 |
| 29 | EE | Catherine C. McGeoch,
Peter Sanders,
Rudolf Fleischer,
Paul R. Cohen,
Doina Precup:
Using Finite Experiments to Study Asymptotic Performance.
Experimental Algorithmics 2000: 93-126 |
| 28 | EE | Prosenjit 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 |
| 27 | EE | Therese 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 |
| 26 | EE | Rudolf Fleischer,
Gerhard Trippen:
Optimal robot localization in trees.
Symposium on Computational Geometry 2000: 373-374 |
| 25 | EE | Christoph 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) |
| 24 | EE | Wolfgang 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 |
|---|
| 23 | EE | Rudolf Fleischer,
Colin Hirsch:
Graph Drawing and Its Applications.
Drawing Graphs 1999: 1-22 |
| 22 | EE | Christoph 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 |
|---|
| 20 | EE | Rudolf 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 |
|---|
| 16 | EE | Noga 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 |
|---|
| 14 | | Phillip 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 |
|---|
| 11 | | Rudolf Fleischer:
A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
ISAAC 1993: 138-146 |
| 10 | EE | Rudolf 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 |
|---|
| 4 | EE | Rudolf 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 |
| 3 | EE | 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.
Symposium on Computational Geometry 1990: 281-289 |
| 2 | | Rudolf 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) |
