The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rudolf Fleischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
    Episode Matching. [Citation Graph (1, 0)][DBLP]
    CPM, 1997, pp:12-27 [Conf]
  2. Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
    Non-metric Multicommodity and Multilevel Facility Location. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:138-148 [Conf]
  3. Rudolf Fleischer, Steven S. Seiden
    New results for online page replication. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:144-154 [Conf]
  4. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:188-200 [Conf]
  5. Rudolf Fleischer, Gerhard Trippen
    Kayles on the Way to the Stars. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2004, pp:232-245 [Conf]
  6. Rudolf Fleischer
    On The Bahncard Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:65-74 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:281-289 [Conf]
  8. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    Efficient Exact Geometric Computation Made Easy. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:341-350 [Conf]
  9. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:216-224 [Conf]
  10. Rudolf Fleischer, Gerhard Trippen
    Optimal robot localization in trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:373-374 [Conf]
  11. Rudolf Fleischer, Colin Hirsch
    Graph Drawing and Its Applications. [Citation Graph (0, 0)][DBLP]
    Drawing Graphs, 1999, pp:1-22 [Conf]
  12. Rudolf Fleischer, Ludek Kucera
    Algorithm Animation for Teaching. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:113-128 [Conf]
  13. Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
    Using Finite Experiments to Study Asymptotic Performance. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:93-126 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:25-43 [Conf]
  15. Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
    Traversing the Machining Graph. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:220-231 [Conf]
  16. Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
    Competitive Online Approximation of the Optimal Search Ratio. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:335-346 [Conf]
  17. Rudolf Fleischer, Gerhard Trippen
    Exploring an Unknown Graph Efficiently. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:11-22 [Conf]
  18. Rudolf Fleischer, Michaela Wahl
    Online Scheduling Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:202-210 [Conf]
  19. Rudolf Fleischer
    A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:251-262 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  21. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight Bounds on Maximal and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:308-319 [Conf]
  22. Phillip G. Bradford, Rudolf Fleischer
    Matching Nuts and Bolts Faster. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:402-408 [Conf]
  23. Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
    On Approximating the Maximum Simple Sharing Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:547-556 [Conf]
  24. Rudolf Fleischer
    A Simple Balanced Search Tree with O(1) Worst-Case Update Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:138-146 [Conf]
  25. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-Colorings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:202-211 [Conf]
  26. Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang
    Approximating Spanning Trees with Inner Nodes Cost. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2005, pp:660-664 [Conf]
  27. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:702-709 [Conf]
  28. Rudolf Fleischer
    Decision trees: old and new results. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:468-477 [Conf]
  29. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
    Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:102-113 [Conf]
  30. Peter Sanders, Rudolf Fleischer
    Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:135-146 [Conf]
  31. Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
    A Time-Randomness Tradeoff for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:390-401 [Conf]
  32. Rudolf Fleischer, Gerhard Trippen
    Experimental Studies of Graph Traversal Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:120-133 [Conf]
  33. Rudolf Fleischer, Gerhard Trippen
    On the Effectiveness of Visualizations in a Theory of Computing Course. [Citation Graph (0, 0)][DBLP]
    Cognitive Systems, 2005, pp:15-24 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:391-406 [Journal]
  35. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:1, pp:87-99 [Journal]
  36. Rudolf Fleischer
    A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:104-115 [Journal]
  37. Rudolf Fleischer, Hisashi Koga
    Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:363-376 [Journal]
  38. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:365-389 [Journal]
  39. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
    Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:549-567 [Journal]
  40. Rudolf Fleischer
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:1- [Journal]
  41. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
    The Complexity of Clickomania [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  42. Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
    Traveling Salesmen in the Presence of Competition [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  43. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:231-236 [Journal]
  45. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:19-32 [Journal]
  46. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight bounds on maximal and maximum matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:7-15 [Journal]
  47. Rudolf Fleischer
    Decision Trees: Old and New Results. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:152, n:1, pp:44-61 [Journal]
  48. Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
    A Communication-Randomness Tradeoff for Two-Processor Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:2, pp:155-161 [Journal]
  49. Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
    Optimal Robot Localization in Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:224-247 [Journal]
  50. Rudolf Fleischer, B. P. Sinha, Christian Uhrig
    A Lower Bound for the Worst Case of Bottom-Up-Heapsort [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:2, pp:263-279 [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  52. Rudolf Fleischer
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:95-96 [Journal]
  53. Rudolf Fleischer
    A Simple Balanced Search Tree with O(1) Worst-Case Update Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:137-150 [Journal]
  54. Noga Alon, Phillip G. Bradford, Rudolf Fleischer
    Matching Nuts and Bolts Faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:3, pp:123-127 [Journal]
  55. Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
    Limited bookmark randomized online algorithms for the paging problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:4-6, pp:155-162 [Journal]
  56. Rudolf Fleischer
    Communication Complexity of Multi-Processor Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:2, pp:57-65 [Journal]
  57. Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
    Finding optimal paths in MREP routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:57-63 [Journal]
  58. Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid
    More Efficient Parallel Totally Monotone Matrix Searching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:386-400 [Journal]
  59. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:325-338 [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:539-543 [Journal]
  61. Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
    Traveling salesmen in the presence of competition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:377-392 [Journal]
  62. Rudolf Fleischer, Richard J. Nowakowski
    Preface: Algorithmic Combinatorial Game Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:313- [Journal]
  63. Rudolf Fleischer
    On the Bahncard problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:161-174 [Journal]
  64. Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden
    New results for online page replication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:219-251 [Journal]
  65. Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu
    Approximating the minimum weight weak vertex cover. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:99-105 [Journal]
  66. Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
    Efficient Algorithms for k -Disjoint Paths Problems on DAGs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:134-143 [Conf]
  67. Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
    Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:439-447 [Conf]
  68. Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu
    Approximating the Maximum Sharing Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:52-63 [Conf]
  69. Rudolf Fleischer
    Die Another Day. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:146-155 [Conf]

  70. Is the World Linear? [Citation Graph (, )][DBLP]


  71. Extended Islands of Tractability for Parsimony Haplotyping. [Citation Graph (, )][DBLP]


  72. Competitive Online Searching for a Ray in the Plane. [Citation Graph (, )][DBLP]


  73. 06421 Abstracts Collection -- Robot Navigation. [Citation Graph (, )][DBLP]


  74. 06421 Executive Summary -- Robot Navigation. [Citation Graph (, )][DBLP]


  75. Die Another Day. [Citation Graph (, )][DBLP]


  76. Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. [Citation Graph (, )][DBLP]


  77. Competitive online searching for a ray in the plane. [Citation Graph (, )][DBLP]


  78. Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition. [Citation Graph (, )][DBLP]


  79. On the Camera Placement Problem. [Citation Graph (, )][DBLP]


  80. An Algorithmic Analysis of the Honey-Bee Game. [Citation Graph (, )][DBLP]


  81. Computing Minimum Diameter Color-Spanning Sets. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002