Rudolf Fleischer

According to our database1, Rudolf Fleischer
  • authored at least 105 papers between 1989 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Counting Circles Without Computing Them.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Weight Balancing on Boundaries and Skeletons.
CoRR, 2015

2014
Order-preserving matching.
Theor. Comput. Sci., 2014

Competitive Analysis of the Windfall Game.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Order Preserving Matching
CoRR, 2013

A Survey of the Game "Lights Out!".
Proceedings of the Space-Efficient Data Structures, 2013

2012
An algorithmic analysis of the Honey-Bee game.
Theor. Comput. Sci., 2012

Train Marshalling Is Fixed Parameter Tractable.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Computing minimum diameter color-spanning sets is hard.
Inf. Process. Lett., 2011

An Algorithmic Analysis of the Honey-Bee Game
CoRR, 2011

2010
Low-Resolution Gait Recognition.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 2010

Distance Approximating Dimension Reduction of Riemannian Manifolds.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 2010

The Tourist in the Shopping Arcade.
J. UCS, 2010

Densest k-Subgraph Approximation on Intersection Graphs.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

An Algorithmic Analysis of the Honey-Bee Game.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Computing Minimum Diameter Color-Spanning Sets.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Extended Islands of Tractability for Parsimony Haplotyping.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Edge Clique Partition of K 4-Free and Planar Graphs.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Foreword.
Theor. Comput. Sci., 2009

Die Another Day.
Theory Comput. Syst., 2009

On the Camera Placement Problem.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition.
Proceedings of the Advances in Biometrics, Third International Conference, 2009

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

Is the World Linear?
Proceedings of the Efficient Algorithms, 2009

2008
Robotics.
Proceedings of the Encyclopedia of Algorithms, 2008

Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput., 2008

2007
Approximating the Maximum Sharing Problem.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Die Another Day.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Efficient Algorithms for k -Disjoint Paths Problems on DAGs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Approximating the minimum weight weak vertex cover.
Theor. Comput. Sci., 2006

Guest Editor's Foreword.
Int. J. Comput. Geometry Appl., 2006

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

Foreword.
Algorithmica, 2006

On Approximating the Maximum Simple Sharing Problem.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Traversing the Machining Graph.
Proceedings of the Algorithms, 2006

Die Another Day.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

06421 Abstracts Collection -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

06421 Executive Summary -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Competitive Online Searching for a Ray in the Plane.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Non-metric Multicommodity and Multilevel Facility Location.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Approximating Spanning Trees with Inner Nodes Cost.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Competitive online searching for a ray in the plane.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Exploring an Unknown Graph Efficiently.
Proceedings of the Algorithms, 2005

On the Effectiveness of Visualizations in a Theory of Computing Course.
Proceedings of the Cognitive Systems, Joint Chinese-German Workshop, Shanghai, 2005

2004
Preface: Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004

New results for online page replication.
Theor. Comput. Sci., 2004

Traveling salesmen in the presence of competition.
Theor. Comput. Sci., 2004

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004

Solitaire Clobber.
Theor. Comput. Sci., 2004

Finding optimal paths in MREP routing.
Inf. Process. Lett., 2004

Tight bounds on maximal and maximum matchings.
Discrete Mathematics, 2004

Fun-Sort--or the chaos of unordered binary search.
Discrete Applied Mathematics, 2004

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

Online Maintenance of k-Medians and k-Covers on a Line.
Proceedings of the Algorithm Theory, 2004

Competitive Online Approximation of the Optimal Search Ratio.
Proceedings of the Algorithms, 2004

Kayles on the Way to the Stars.
Proceedings of the Computers and Games, 4th International Conference, 2004

2003
Exploring the role of visualization and engagement in computer science education.
SIGCSE Bulletin, 2003

Evaluating the educational impact of visualization.
SIGCSE Bulletin, 2003

Experimental Studies of Graph Traversal Algorithms.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Maximum residual energy routing with reverse energy cost.
Proceedings of the Global Telecommunications Conference, 2003

2002
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2002

Balanced k-colorings.
Discrete Mathematics, 2002

Solitaire Clobber
CoRR, 2002

Traveling Salesmen in the Presence of Competition
CoRR, 2002

Solitaire Clobber.
Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2001
On the Bahncard problem.
Theor. Comput. Sci., 2001

Optimal Robot Localization in Trees.
Inf. Comput., 2001

The Complexity of Clickomania
CoRR, 2001

Tight Bounds on Maximal and Maximum Matchings.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Algorithm Animation for Teaching.
Proceedings of the Software Visualization, 2001

2000
Limited bookmark randomized online algorithms for the paging problem.
Inf. Process. Lett., 2000

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

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
Proceedings of the Algorithm Engineering, 2000

Balanced k-Colorings.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Online Routing in Convex Subdivisions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Online Scheduling Revisited.
Proceedings of the Algorithms, 2000

Using Finite Experiments to Study Asymptotic Performance.
Proceedings of the Experimental Algorithmics, 2000

Optimal robot localization in trees.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

New results for online page replication.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Decision Trees: Old and New Results.
Inf. Comput., 1999

Graph Drawing and Its Applications.
Proceedings of the Drawing Graphs, 1999

Efficient Exact Geometric Computation Made Easy.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
On The Bahncard Problem.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
More Efficient Parallel Totally Monotone Matrix Searching.
J. Algorithms, 1997

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

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

1996
Matching Nuts and Bolts Faster.
Inf. Process. Lett., 1996

A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
Int. J. Found. Comput. Sci., 1996

1995
A Communication-Randomness Tradeoff for Two-Processor Systems
Inf. Comput., February, 1995

Matching Nuts and Bolts Faster.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

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

1993
A Lower Bound for the Worst Case of Bottom-Up-Heapsort
Inf. Comput., February, 1993

Genaue Analyse einiger kombinatorischer Algorithmen.
PhD thesis, 1993

Decision trees: old and new results.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica, 1992

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

Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort.
Proceedings of the ISA '91 Algorithms, 1991

1990
A Time-Randomness Tradeoff for Communication Complexity.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

On Simultaneous Inner and Outer Approximation of Shapes.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Communication Complexity of Multi-Processor Systems.
Inf. Process. Lett., 1989


  Loading...