Rudolf Fleischer

According to our database, Rudolf Fleischer authored at least 86 papers between 1989 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Weight balancing on boundaries.

Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot

J. Comput. Geom., 2022

2019

Guest Editorial: Special Issue on Approximation and Online Algorithms.

Roberto Solis-Oba, Rudolf Fleischer

Theory Comput. Syst., 2019

2016

Counting Circles Without Computing Them.

Rudolf Fleischer

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2014

Order-preserving matching.

Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama

Theor. Comput. Sci., 2014

Competitive Analysis of the Windfall Game.

Rudolf Fleischer, Tao Zhang

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Weight Balancing on Boundaries and Skeletons.

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

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

A Survey of the Game "Lights Out!".

Rudolf Fleischer, Jiajin Yu

Proceedings of the Space-Efficient Data Structures, 2013

2012

An algorithmic analysis of the Honey-Bee game.

Rudolf Fleischer, Gerhard J. Woeginger

Theor. Comput. Sci., 2012

Train Marshalling Is Fixed Parameter Tractable.

Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Computing minimum diameter color-spanning sets is hard.

Rudolf Fleischer, Xiaoming Xu

Inf. Process. Lett., 2011

2010

Low-Resolution Gait Recognition.

Junping Zhang, Jian Pu, Changyou Chen, Rudolf Fleischer

IEEE Trans. Syst. Man Cybern. Part B, 2010

Distance Approximating Dimension Reduction of Riemannian Manifolds.

Changyou Chen, Junping Zhang, Rudolf Fleischer

IEEE Trans. Syst. Man Cybern. Part B, 2010

The Tourist in the Shopping Arcade.

Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

J. Univers. Comput. Sci., 2010

Densest <i>k</i>-Subgraph Approximation on Intersection Graphs.

Danny Z. Chen, Rudolf Fleischer, Jian Li

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Computing Minimum Diameter Color-Spanning Sets.

Rudolf Fleischer, Xiaoming Xu

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Extended Islands of Tractability for Parsimony Haplotyping.

Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Edge Clique Partition of K 4-Free and Planar Graphs.

Rudolf Fleischer, Xiaotian Wu

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

Foreword.

Rudolf Fleischer, Jinhui Xu

Theor. Comput. Sci., 2009

Die Another Day.

Rudolf Fleischer

Theory Comput. Syst., 2009

On the Camera Placement Problem.

Rudolf Fleischer, Yihui Wang

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition.

Changyou Chen, Junping Zhang, Rudolf Fleischer

Proceedings of the Advances in Biometrics, Third International Conference, 2009

Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem.

Rudolf Fleischer, Xi Wu, Liwei Yuan

Proceedings of the Algorithms, 2009

Is the World Linear?

Rudolf Fleischer

Proceedings of the Efficient Algorithms, 2009

2008

Robotics.

Rudolf Fleischer

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Competitive Online Approximation of the Optimal Search Ratio.

Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

SIAM J. Comput., 2008

2007

Approximating the Maximum Sharing Problem.

Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.

Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Efficient Algorithms for <i>k</i> -Disjoint Paths Problems on DAGs.

Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Approximating the minimum weight weak vertex cover.

Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu

Theor. Comput. Sci., 2006

Guest Editor's Foreword.

Rudolf Fleischer

Int. J. Comput. Geom. Appl., 2006

Online Maintenance of k-Medians and k-Covers on a Line.

Rudolf Fleischer, Mordecai J. Golin, Yan Zhang

Algorithmica, 2006

Foreword.

Rudolf Fleischer

Algorithmica, 2006

On Approximating the Maximum Simple Sharing Problem.

Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Traversing the Machining Graph.

Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu

Proceedings of the Algorithms, 2006

06421 Abstracts Collection -- Robot Navigation.

Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz

Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

06421 Executive Summary -- Robot Navigation.

Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz

Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Non-metric Multicommodity and Multilevel Facility Location.

Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Approximating Spanning Trees with Inner Nodes Cost.

Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang

Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Competitive online searching for a ray in the plane.

Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Exploring an Unknown Graph Efficiently.

Rudolf Fleischer, Gerhard Trippen

Proceedings of the Algorithms, 2005

On the Effectiveness of Visualizations in a Theory of Computing Course.

Rudolf Fleischer, Gerhard Trippen

Proceedings of the Cognitive Systems, Joint Chinese-German Workshop, Shanghai, 2005

2004

Preface: Algorithmic Combinatorial Game Theory.

Rudolf Fleischer, Richard J. Nowakowski

Theor. Comput. Sci., 2004

New results for online page replication.

Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden

Theor. Comput. Sci., 2004

Traveling salesmen in the presence of competition.

Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt

Theor. Comput. Sci., 2004

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.

Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski

Theor. Comput. Sci., 2004

Solitaire Clobber.

Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer

Theor. Comput. Sci., 2004

Finding optimal paths in MREP routing.

Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong

Inf. Process. Lett., 2004

Tight bounds on maximal and maximum matchings.

Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov

Discret. Math., 2004

Fun-Sort--or the chaos of unordered binary search.

Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro

Discret. Appl. Math., 2004

Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness.

Rudolf Fleischer, Hisashi Koga

Algorithmica, 2004

Kayles on the Way to the Stars.

Rudolf Fleischer, Gerhard Trippen

Proceedings of the Computers and Games, 4th International Conference, 2004

2003

Exploring the role of visualization and engagement in computer science education.

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

ACM SIGCSE Bull., 2003

Evaluating the educational impact of visualization.

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

ACM SIGCSE Bull., 2003

Experimental Studies of Graph Traversal Algorithms.

Rudolf Fleischer, Gerhard Trippen

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Maximum residual energy routing with reverse energy cost.

Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer

Proceedings of the Global Telecommunications Conference, 2003

2002

Online Routing in Convex Subdivisions.

Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro

Int. J. Comput. Geom. Appl., 2002

Balanced <i>k</i>-colorings.

Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang

Discret. Math., 2002

2001

On the Bahncard problem.

Rudolf Fleischer

Theor. Comput. Sci., 2001

Optimal Robot Localization in Trees.

Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen

Inf. Comput., 2001

The Complexity of Clickomania

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro

CoRR, 2001

Algorithm Animation for Teaching.

Rudolf Fleischer, Ludek Kucera

Proceedings of the Software Visualization, 2001

2000

Limited bookmark randomized online algorithms for the paging problem.

Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore

Inf. Process. Lett., 2000

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra

Algorithmica, 2000

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.

Peter Sanders, Rudolf Fleischer

Proceedings of the Algorithm Engineering, 2000

Online Scheduling Revisited.

Rudolf Fleischer, Michaela Wahl

Proceedings of the Algorithms, 2000

Using Finite Experiments to Study Asymptotic Performance.

Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup

Proceedings of the Experimental Algorithmics, 2000

Optimal robot localization in trees.

Rudolf Fleischer, Gerhard Trippen

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

New results for online page replication.

Rudolf Fleischer, Steven S. Seiden

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Decision Trees: Old and New Results.

Rudolf Fleischer

Inf. Comput., 1999

Graph Drawing and Its Applications.

Rudolf Fleischer, Colin Hirsch

Proceedings of the Drawing Graphs, 1999

Efficient Exact Geometric Computation Made Easy.

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1997

More Efficient Parallel Totally Monotone Matrix Searching.

Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid

J. Algorithms, 1997

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Episode Matching.

Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996

Matching Nuts and Bolts Faster.

Noga Alon, Phillip G. Bradford, Rudolf Fleischer

Inf. Process. Lett., 1996

A Simple Balanced Search Tree with O(1) Worst-Case Update Time.

Rudolf Fleischer

Int. J. Found. Comput. Sci., 1996

1995

A Communication-Randomness Tradeoff for Two-Processor Systems

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn

Inf. Comput., February, 1995

Matching Nuts and Bolts Faster.

Phillip G. Bradford, Rudolf Fleischer

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.

Rudolf Fleischer

Algorithmica, 1994

1993

A Lower Bound for the Worst Case of Bottom-Up-Heapsort

Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig

Inf. Comput., February, 1993

Genaue Analyse einiger kombinatorischer Algorithmen.

Rudolf Fleischer

PhD thesis, 1993

1992

Simultaneous Inner and Outer Approximation of Shapes.

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1992

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.

Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig

Algorithmica, 1992

Selected Topics from Computational Geometry, Data Structures and Motion Planning.

Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig

Proceedings of the Data Structures and Efficient Algorithms, 1992

1990

A Time-Randomness Tradeoff for Communication Complexity.

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Communication Complexity of Multi-Processor Systems.

Rudolf Fleischer

Inf. Process. Lett., 1989