Rudolf Fleischer

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2010
36Densest k-Subgraph Approximation on Intersection Graphs. Danny Z. Chen, Rudolf Fleischer, Jian Li. WAOA 2010, 83-93. Web SearchBibTeXDownload
2007
35Efficient Algorithms for k -Disjoint Paths Problems on DAGs. Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu. AAIM 2007, 134-143. Web SearchBibTeXDownload
34Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun. COCOON 2007, 439-447. Web SearchBibTeXDownload
33Approximating the Maximum Sharing Problem. Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu. WADS 2007, 52-63. Web SearchBibTeXDownload
2006
32Non-metric Multicommodity and Multilevel Facility Location. Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu. AAIM 2006, 138-148. Web SearchBibTeXDownload
31Online Maintenance of k-Medians and k-Covers on a Line. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang. Algorithmica (45): 549-567 (2006). Web SearchBibTeXDownload
30Traversing the Machining Graph. Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu. ESA 2006, 220-231. Web SearchBibTeXDownload
29Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Int. J. Comput. Geometry Appl. (16): 95-96 (2006). Web SearchBibTeXDownload
28On Approximating the Maximum Simple Sharing Problem. Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu. ISAAC 2006, 547-556. Web SearchBibTeXDownload
2706421 Abstracts Collection -- Robot Navigation. Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz. Robot Navigation 2006. Web SearchBibTeXDownload
2606421 Executive Summary -- Robot Navigation. Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz. Robot Navigation 2006. Web SearchBibTeXDownload
25Approximating the minimum weight weak vertex cover. Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu. Theor. Comput. Sci. (363): 99-105 (2006). Web SearchBibTeXDownload
2005
24Approximating Spanning Trees with Inner Nodes Cost. Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang. PDCAT 2005, 660-664. Web SearchBibTeXDownload
2004
23Fun-Sort--or the chaos of unordered binary search. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro. Discrete Applied Mathematics (144): 231-236 (2004). Web SearchBibTeXDownload
22Tight bounds on maximal and maximum matchings. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. Discrete Mathematics (285): 7-15 (2004). Web SearchBibTeXDownload
21Online Maintenance of k-Medians and k-Covers on a Line. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang. SWAT 2004, 102-113. Web SearchBibTeXDownload
20Appendix 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. (303): 539-543 (2004). Web SearchBibTeXDownload
19Solitaire Clobber. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer. Theor. Comput. Sci. (303): 325-338 (2004). Web SearchBibTeXDownload
2003
18Evaluating the educational impact of visualization. Thomas L. Naps, Stephen Cooper, Boris Koldehofe, Charles Leska, Guido Rößling, Wanda Dann, Ari Korhonen, Lauri Malmi, Jarmo Rantakokko, Rockford J. Ross, Jay Anderson, Rudolf Fleischer, Marja Kuittinen, Myles F. McNally. SIGCSE Bulletin (35): 124-136 (2003). Web SearchBibTeXDownload
17Exploring the role of visualization and engagement in computer science education. Thomas L. Naps, Guido Rößling, Vicki L. Almstrum, Wanda Dann, Rudolf Fleischer, Christopher D. Hundhausen, Ari Korhonen, Lauri Malmi, Myles F. McNally, Susan H. Rodger, J. Ángel Velázquez-Iturbide. SIGCSE Bulletin (35): 131-152 (2003). Web SearchBibTeXDownload
2002
16Solitaire Clobber. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer. Computers and Games (cs.DM/0204017): 188-200 (2002). Web SearchBibTeXDownload
15Balanced k-colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. Discrete Mathematics (254): 19-32 (2002). Web SearchBibTeXDownload
14Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. Int. J. Comput. Geometry Appl. (12): 283-296 (2002). Web SearchBibTeXDownload
2001
13The Complexity of Clickomania. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro. CoRR (cs.CC/0107031) (2001). Web SearchBibTeXDownload
12Tight Bounds on Maximal and Maximum Matchings. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. ISAAC 2001, 308-319. Web SearchBibTeXDownload
2000
11Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. Peter Sanders, Rudolf Fleischer. Algorithm Engineering 2000, 135-146. Web SearchBibTeXDownload
10Using Finite Experiments to Study Asymptotic Performance. Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup. Experimental Algorithmics 2000, 93-126. Web SearchBibTeXDownload
9Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. ISAAC 2000, 47-59. Web SearchBibTeXDownload
8Balanced k-Colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. MFCS 2000, 202-211. Web SearchBibTeXDownload
1999
7Graph Drawing and Its Applications. Rudolf Fleischer, Colin Hirsch. Drawing Graphs 1999, 1-22. Web SearchBibTeXDownload
1997
6Episode Matching. Zdenek Tronícek, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen. CPM 1997, 12-27. Cited by 66Web SearchBibTeXDownload
1996
5Matching Nuts and Bolts Faster. Noga Alon, Phillip G. Bradford, Rudolf Fleischer. Inf. Process. Lett. (59): 123-127 (1996). Web SearchBibTeXDownload
1995
4Matching Nuts and Bolts Faster. Noga Alon, Phillip G. Bradford, Rudolf Fleischer. ISAAC 1995, 402-408. Web SearchBibTeXDownload
1992
3Simultaneous Inner and Outer Approximation of Shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. Algorithmica (8): 365-389 (1992). Web SearchBibTeXDownload
2Selected 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. Data Structures and Efficient Algorithms 1992, 25-43. Web SearchBibTeXDownload
1990
1On Simultaneous Inner and Outer Approximation of Shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. Symposium on Computational Geometry 1990, 216-224. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research