Rudolf Fleischer

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 3

Top Venues

CoRR

FUN

Theory Comput. Syst.

J. Comput. Geom.

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
Weight balancing on boundaries. J. Comput. Geom. 13 (1) (2022)
Roberto Solis-Oba, Rudolf Fleischer
Guest Editorial: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 63 (8) (2019)
Rudolf Fleischer
Counting Circles Without Computing Them. FUN (2016)
Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang
Weight Balancing on Boundaries and Skeletons. CoRR (2015)
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
Order-preserving matching. Theor. Comput. Sci. 525 (2014)
Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang
Weight Balancing on Boundaries and Skeletons. SoCG (2014)
Rudolf Fleischer, Tao Zhang
Competitive Analysis of the Windfall Game. FUN (2014)
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
Order Preserving Matching CoRR (2013)
Rudolf Fleischer, Jiajin Yu
A Survey of the Game "Lights Out!". Space-Efficient Data Structures, Streams, and Algorithms (2013)
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
Train Marshalling Is Fixed Parameter Tractable. FUN (2012)
Rudolf Fleischer, Gerhard J. Woeginger
An algorithmic analysis of the Honey-Bee game. Theor. Comput. Sci. 452 (2012)
Rudolf Fleischer, Xiaoming Xu
Computing minimum diameter color-spanning sets is hard. Inf. Process. Lett. 111 (21-22) (2011)
Rudolf Fleischer, Gerhard J. Woeginger
An Algorithmic Analysis of the Honey-Bee Game CoRR (2011)
Rudolf Fleischer, Gerhard J. Woeginger
An Algorithmic Analysis of the Honey-Bee Game. FUN (2010)
Danny Z. Chen, Rudolf Fleischer, Jian Li
-Subgraph Approximation on Intersection Graphs. WAOA (2010)
Rudolf Fleischer, Xiaotian Wu
Edge Clique Partition of K 4-Free and Planar Graphs. CGGA (2010)
Rudolf Fleischer, Xiaoming Xu
Computing Minimum Diameter Color-Spanning Sets. FAW (2010)
Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
Extended Islands of Tractability for Parsimony Haplotyping. CPM (2010)
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16 (5) (2010)
Changyou Chen, Junping Zhang, Rudolf Fleischer
Distance Approximating Dimension Reduction of Riemannian Manifolds. IEEE Trans. Syst. Man Cybern. Part B 40 (1) (2010)
Junping Zhang, Jian Pu, Changyou Chen, Rudolf Fleischer
Low-Resolution Gait Recognition. IEEE Trans. Syst. Man Cybern. Part B 40 (4) (2010)
Changyou Chen, Junping Zhang, Rudolf Fleischer
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition. ICB (2009)
Rudolf Fleischer
Die Another Day. Theory Comput. Syst. 44 (2) (2009)
Rudolf Fleischer
Is the World Linear? Efficient Algorithms (2009)
Rudolf Fleischer, Yihui Wang
On the Camera Placement Problem. ISAAC (2009)
Rudolf Fleischer, Jinhui Xu
Foreword. Theor. Comput. Sci. 410 (45) (2009)
Rudolf Fleischer, Xi Wu, Liwei Yuan
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. ESA (2009)
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive Online Approximation of the Optimal Search Ratio. SIAM J. Comput. 38 (3) (2008)
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
-Disjoint Paths Problems on DAGs. AAIM (2007)
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)
Rudolf Fleischer
Die Another Day. FUN (2007)
Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON (2007)
Rudolf Fleischer
Foreword. Algorithmica 46 (1) (2006)
Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive Online Searching for a Ray in the Plane. Robot Navigation (2006)
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45 (4) (2006)
Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu
Approximating the minimum weight weak vertex cover. Theor. Comput. Sci. 363 (1) (2006)
Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz
06421 Abstracts Collection -- Robot Navigation. Robot Navigation (2006)
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
Non-metric Multicommodity and Multilevel Facility Location. AAIM (2006)
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
Traversing the Machining Graph. ESA (2006)
Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz
06421 Executive Summary -- Robot Navigation. Robot Navigation (2006)
Rudolf Fleischer
Die Another Day. Data Structures (2006)
Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
On Approximating the Maximum Simple Sharing Problem. ISAAC (2006)
Rudolf Fleischer
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 16 (2-3) (2006)
Rudolf Fleischer, Gerhard Trippen
Exploring an Unknown Graph Efficiently. ESA (2005)
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive online searching for a ray in the plane. EuroCG (2005)
Rudolf Fleischer, Gerhard Trippen
On the Effectiveness of Visualizations in a Theory of Computing Course. Cognitive Systems (2005)
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang
Approximating Spanning Trees with Inner Nodes Cost. PDCAT (2005)
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive Online Approximation of the Optimal Search Ratio. ESA (2004)
Rudolf Fleischer, Hisashi Koga
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. Algorithmica 38 (2) (2004)
Rudolf Fleischer, Richard J. Nowakowski
Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313 (3) (2004)
Rudolf Fleischer, Gerhard Trippen
Kayles on the Way to the Stars. Computers and Games (2004)
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. Discret. Appl. Math. 144 (3) (2004)
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. 313 (3) (2004)
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
Solitaire Clobber. Theor. Comput. Sci. 313 (3) (2004)
Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden
New results for online page replication. Theor. Comput. Sci. 324 (2-3) (2004)
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313 (3) (2004)
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
Online Maintenance of k-Medians and k-Covers on a Line. SWAT (2004)
Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
Tight bounds on maximal and maximum matchings. Discret. Math. 285 (1-3) (2004)
Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
Finding optimal paths in MREP routing. Inf. Process. Lett. 89 (2) (2004)
Thomas L. Naps, Guido Rößling, Vicki L. Almstrum, Wanda P. 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. ACM SIGCSE Bull. 35 (2) (2003)
Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer
Maximum residual energy routing with reverse energy cost. GLOBECOM (2003)
Rudolf Fleischer, Gerhard Trippen
Experimental Studies of Graph Traversal Algorithms. WEA (2003)
Thomas L. Naps, Stephen Cooper, Boris Koldehofe, Charles Leska, Guido Rößling, Wanda P. 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. ACM SIGCSE Bull. 35 (4) (2003)
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
Traveling Salesmen in the Presence of Competition CoRR (2002)
Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
-colorings. Discret. Math. 254 (1-3) (2002)
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
Solitaire Clobber. Computers and Games (2002)
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. Geom. Appl. 12 (4) (2002)
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
Solitaire Clobber CoRR (2002)
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
Optimal Robot Localization in Trees. Inf. Comput. 171 (2) (2001)
Rudolf Fleischer, Ludek Kucera
Algorithm Animation for Teaching. Software Visualization (2001)
Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
Tight Bounds on Maximal and Maximum Matchings. ISAAC (2001)
Rudolf Fleischer
On the Bahncard problem. Theor. Comput. Sci. 268 (1) (2001)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
The Complexity of Clickomania CoRR (2001)
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27 (1) (2000)
Rudolf Fleischer, Steven S. Seiden
New results for online page replication. APPROX (2000)
Rudolf Fleischer, Michaela Wahl
Online Scheduling Revisited. ESA (2000)
Rudolf Fleischer, Gerhard Trippen
Optimal robot localization in trees. SCG (2000)
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)
Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics (2000)
Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
-Colorings. MFCS (2000)
Peter Sanders, Rudolf Fleischer
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. WAE (2000)
Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76 (4-6) (2000)
Rudolf Fleischer, Colin Hirsch
Graph Drawing and Its Applications. Drawing Graphs (1999)
Rudolf Fleischer
Decision Trees: Old and New Results. Inf. Comput. 152 (1) (1999)
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
Efficient Exact Geometric Computation Made Easy. SCG (1999)
Rudolf Fleischer
On The Bahncard Problem. COCOON (1998)
Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
Episode Matching. CPM (1997)
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA (1997)
Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid
More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23 (2) (1997)
Noga Alon, Phillip G. Bradford, Rudolf Fleischer
Matching Nuts and Bolts Faster. Inf. Process. Lett. 59 (3) (1996)
Rudolf Fleischer
A Simple Balanced Search Tree with O(1) Worst-Case Update Time. Int. J. Found. Comput. Sci. 7 (2) (1996)
Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
A Communication-Randomness Tradeoff for Two-Processor Systems Inf. Comput. 116 (2) (1995)
Phillip G. Bradford, Rudolf Fleischer
Matching Nuts and Bolts Faster. ISAAC (1995)
Rudolf Fleischer
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. Algorithmica 11 (2) (1994)
Rudolf Fleischer
Decision trees: old and new results. STOC (1993)
Rudolf Fleischer
A Simple Balanced Search Tree with O(1) Worst-Case Update Time. ISAAC (1993)
Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig
A Lower Bound for the Worst Case of Bottom-Up-Heapsort Inf. Comput. 102 (2) (1993)
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)
Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8 (5&6) (1992)
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) (1992)

Rudolf Fleischer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rudolf Fleischer