Rudolf Fleischer

113 papers A* 3A 5B 14C 5Misc 8Journal 48Unranked 25
YearRankTypeTitle / Venue / Authors
2022 J jnl
Weight balancing on boundaries.
J. Comput. Geom.
Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
2019 J jnl
Guest Editorial: Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst.
Roberto Solis-Oba, Rudolf Fleischer
2018 B ed.
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
WAOA
Roberto Solis-Oba, Rudolf Fleischer
2016 Misc conf
Counting Circles Without Computing Them.
FUN
Rudolf Fleischer
2015 — ed.
Intelligent Cloud Computing - First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers
ICC
Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana
2015 J jnl
Weight Balancing on Boundaries and Skeletons.
CoRR
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
2014 Misc conf
Competitive Analysis of the Windfall Game.
FUN
Rudolf Fleischer, Tao Zhang
2014 J jnl
Order-preserving matching.
Theor. Comput. Sci.
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2014 A* conf
Weight Balancing on Boundaries and Skeletons.
SoCG
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
2013 — conf
A Survey of the Game "Lights Out!".
Space-Efficient Data Structures, Streams, and Algorithms
Rudolf Fleischer, Jiajin Yu
2013 J jnl
Order Preserving Matching
CoRR
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2012 J jnl
An algorithmic analysis of the Honey-Bee game.
Theor. Comput. Sci.
Rudolf Fleischer, Gerhard J. Woeginger
2012 Misc conf
Train Marshalling Is Fixed Parameter Tractable.
FUN
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
2011 J jnl
An Algorithmic Analysis of the Honey-Bee Game
CoRR
Rudolf Fleischer, Gerhard J. Woeginger
2011 J jnl
Computing minimum diameter color-spanning sets is hard.
Inf. Process. Lett.
Rudolf Fleischer, Xiaoming Xu
2010 Misc conf
An Algorithmic Analysis of the Honey-Bee Game.
FUN
Rudolf Fleischer, Gerhard J. Woeginger
2010 Misc conf
Computing Minimum Diameter Color-Spanning Sets.
FAW
Rudolf Fleischer, Xiaoming Xu
2010 B conf
Densest
WAOA
Danny Z. Chen, Rudolf Fleischer, Jian Li
2010 J jnl
Distance Approximating Dimension Reduction of Riemannian Manifolds.
IEEE Trans. Syst. Man Cybern. Part B
Changyou Chen, Junping Zhang, Rudolf Fleischer
2010 — conf
Edge Clique Partition of K 4-Free and Planar Graphs.
CGGA
Rudolf Fleischer, Xiaotian Wu
2010 B conf
Extended Islands of Tractability for Parsimony Haplotyping.
CPM
Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
2010 J jnl
Low-Resolution Gait Recognition.
IEEE Trans. Syst. Man Cybern. Part B
Junping Zhang, Jian Pu, Changyou Chen, Rudolf Fleischer
2010 J jnl
The Tourist in the Shopping Arcade.
J. Univers. Comput. Sci.
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2009 J jnl
Die Another Day.
Theory Comput. Syst.
Rudolf Fleischer
2009 A conf
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem.
ESA
Rudolf Fleischer, Xi Wu, Liwei Yuan
2009 J jnl
Foreword.
Theor. Comput. Sci.
Rudolf Fleischer, Jinhui Xu
2009 — conf
Is the World Linear?
Efficient Algorithms
Rudolf Fleischer
2009 — conf
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition.
ICB
Changyou Chen, Junping Zhang, Rudolf Fleischer
2009 B conf
On the Camera Placement Problem.
ISAAC
Rudolf Fleischer, Yihui Wang
2008 C ed.
Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings
AAIM
Rudolf Fleischer, Jinhui Xu
2008 J jnl
Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput.
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2008 — ch.
Robotics.
Encyclopedia of Algorithms
Rudolf Fleischer
2007 Misc conf
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.
COCOON
Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
2007 B conf
Approximating the Maximum Sharing Problem.
WADS
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu
2007 Misc conf
Die Another Day.
FUN
Rudolf Fleischer
2007 C conf
Efficient Algorithms for
AAIM
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
2007 — ed.
Robot Navigation, 15.10. - 20.10.2006
Robot Navigation
Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz
2006 — conf
06421 Abstracts Collection -- Robot Navigation.
Robot Navigation
Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz
2006 — conf
06421 Executive Summary -- Robot Navigation.
Robot Navigation
Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz
2006 J jnl
Approximating the minimum weight weak vertex cover.
Theor. Comput. Sci.
Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu
2006 — conf
Competitive Online Searching for a Ray in the Plane.
Robot Navigation
Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2006 — conf
Die Another Day.
Data Structures
Rudolf Fleischer
2006 J jnl
Foreword.
Algorithmica
Rudolf Fleischer
2006 J jnl
Guest Editor's Foreword.
Int. J. Comput. Geom. Appl.
Rudolf Fleischer
2006 C conf
Non-metric Multicommodity and Multilevel Facility Location.
AAIM
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
2006 B conf
On Approximating the Maximum Simple Sharing Problem.
ISAAC
Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
2006 J jnl
Online Maintenance of k-Medians and k-Covers on a Line.
Algorithmica
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
2006 A conf
Traversing the Machining Graph.
ESA
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
2005 C conf
Approximating Spanning Trees with Inner Nodes Cost.
PDCAT
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang
2005 C conf
Competitive online searching for a ray in the plane.
EuroCG
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2005 A conf
Exploring an Unknown Graph Efficiently.
ESA
Rudolf Fleischer, Gerhard Trippen
2005 — conf
On the Effectiveness of Visualizations in a Theory of Computing Course.
Cognitive Systems
Rudolf Fleischer, Gerhard Trippen
2004 B ed.
Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
ISAAC
Rudolf Fleischer, Gerhard Trippen
2004 J jnl
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci.
Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
2004 J jnl
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness.
Algorithmica
Rudolf Fleischer, Hisashi Koga
2004 A conf
Competitive Online Approximation of the Optimal Search Ratio.
ESA
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2004 J jnl
Finding optimal paths in MREP routing.
Inf. Process. Lett.
Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
2004 J jnl
Fun-Sort--or the chaos of unordered binary search.
Discret. Appl. Math.
Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004 — conf
Kayles on the Way to the Stars.
Computers and Games
Rudolf Fleischer, Gerhard Trippen
2004 J jnl
New results for online page replication.
Theor. Comput. Sci.
Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden
2004 — conf
Online Maintenance of k-Medians and k-Covers on a Line.
SWAT
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
2004 J jnl
Preface: Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci.
Rudolf Fleischer, Richard J. Nowakowski
2004 J jnl
Solitaire Clobber.
Theor. Comput. Sci.
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2004 J jnl
Tight bounds on maximal and maximum matchings.
Discret. Math.
Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2004 J jnl
Traveling salesmen in the presence of competition.
Theor. Comput. Sci.
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
2003 J jnl
Evaluating the educational impact of visualization.
ACM SIGCSE Bull.
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
2003 — conf
Experimental Studies of Graph Traversal Algorithms.
WEA
Rudolf Fleischer, Gerhard Trippen
2003 J jnl
Exploring the role of visualization and engagement in computer science education.
ACM SIGCSE Bull.
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
2003 B conf
Maximum residual energy routing with reverse energy cost.
GLOBECOM
Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer
2002 J jnl
Balanced
Discret. Math.
Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2002 — ed.
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]
Experimental Algorithmics
Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt
2002 J jnl
Online Routing in Convex Subdivisions.
Int. J. Comput. Geom. Appl.
Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
2002 J jnl
Solitaire Clobber
CoRR
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2002 — conf
Solitaire Clobber.
Computers and Games
Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2002 J jnl
Traveling Salesmen in the Presence of Competition
CoRR
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
2001 — conf
Algorithm Animation for Teaching.
Software Visualization
Rudolf Fleischer, Ludek Kucera
2001 J jnl
On the Bahncard problem.
Theor. Comput. Sci.
Rudolf Fleischer
2001 J jnl
Optimal Robot Localization in Trees.
Inf. Comput.
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
2001 J jnl
The Complexity of Clickomania
CoRR
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
2001 B conf
Tight Bounds on Maximal and Maximum Matchings.
ISAAC
Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2000 J jnl
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.
Algorithmica
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
2000 — conf
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
WAE
Peter Sanders, Rudolf Fleischer
2000 B conf
Balanced
MFCS
Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2000 J jnl
Limited bookmark randomized online algorithms for the paging problem.
Inf. Process. Lett.
Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
2000 — conf
New results for online page replication.
APPROX
Rudolf Fleischer, Steven S. Seiden
2000 B conf
Online Routing in Convex Subdivisions.
ISAAC
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
2000 A conf
Online Scheduling Revisited.
ESA
Rudolf Fleischer, Michaela Wahl
2000 — conf
Optimal robot localization in trees.
SCG
Rudolf Fleischer, Gerhard Trippen
2000 — conf
Using Finite Experiments to Study Asymptotic Performance.
Experimental Algorithmics
Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
1999 J jnl
Decision Trees: Old and New Results.
Inf. Comput.
Rudolf Fleischer
1999 — conf
Efficient Exact Geometric Computation Made Easy.
SCG
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
1999 — conf
Graph Drawing and Its Applications.
Drawing Graphs
Rudolf Fleischer, Colin Hirsch
1998 Misc conf
On The Bahncard Problem.
COCOON
Rudolf Fleischer
1997 A* conf
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.
SODA
Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
1997 B conf
Episode Matching.
CPM
Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
1997 J jnl
More Efficient Parallel Totally Monotone Matrix Searching.
J. Algorithms
Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid
1996 J jnl
A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
Int. J. Found. Comput. Sci.
Rudolf Fleischer
1996 J jnl
Matching Nuts and Bolts Faster.
Inf. Process. Lett.
Noga Alon, Phillip G. Bradford, Rudolf Fleischer
1995 J jnl
A Communication-Randomness Tradeoff for Two-Processor Systems
Inf. Comput.
Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
1995 B conf
Matching Nuts and Bolts Faster.
ISAAC
Phillip G. Bradford, Rudolf Fleischer
1994 J jnl
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.
Algorithmica
Rudolf Fleischer
1993 J jnl
A Lower Bound for the Worst Case of Bottom-Up-Heapsort
Inf. Comput.
Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig
1993 B conf
A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
ISAAC
Rudolf Fleischer
1993 A* conf
Decision trees: old and new results.
STOC
Rudolf Fleischer
1993 — —
Genaue Analyse einiger kombinatorischer Algorithmen.
Rudolf Fleischer
1992 J jnl
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992 — conf
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Data Structures and Efficient Algorithms
Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
1992 J jnl
Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica
Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1991 — conf
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort.
ISA
Rudolf Fleischer
1990 — conf
A Time-Randomness Tradeoff for Communication Complexity.
WDAG
Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
1990 — conf
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
SCG
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990 — conf
On Simultaneous Inner and Outer Approximation of Shapes.
SCG
Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1989 J jnl
Communication Complexity of Multi-Processor Systems.
Inf. Process. Lett.
Rudolf Fleischer