Rudolf Hans Fleischer

CV

(October 12, 2017)

Professor

Department of Computer Science

German University of Technology in Oman

Muscat, Sultanate of Oman

Email: rudolf.fleischer@gmail.com

URL: http://staff.gutech.edu.om/~rudolf

Tel office: +968-22061185

Tel mobile: +968-97256284

1. Bibliographical Data

Personal Details

• Date of birth: June 26, 1964.

• Place of birth: Saarbrucken, Germany.

• Family status: Divorced, two daughters.

• Citizenship: German.

Education

1. Mar 1988: Diplom in Computer Science, Universitat Saarbrucken, Germany.Thesis: Kommunikationskomplexitat von Mehrprozessorsystemen (Communication com-plexity of multi-processor systems).Supervisor: Prof Dr Dr hc Kurt Mehlhorn.

2. Sep 1988–Aug 1989: Chinese language, Peking University, Beijing, P.R. China.

3. May 1993: PhD in Computer Science, Universitat Saarbrucken, Germany.Thesis: Genaue Analyse einiger kombinatorischer Algorithmen (Exact analysis of somecombinatorial algorithms).Supervisor: Prof Dr Dr hc Kurt Mehlhorn.

4. Feb 1999: Habilitation in Computer Science, Universitat Saarbrucken, Germany.

Work Experience

1. Aug 1984–Feb 1988: Teaching Assistant and programmer in the DFG-Sonderforschungs-bereich 124 VLSI-Entwurf und Parallelitat (VLSI-Design and Parallelism), CS Depart-ment, Universitat Saarbrucken, Germany.I tutored various undergraduate and graduate courses and seminars.

2. Mar 1988–Aug 1988: Research Associate in the group of Prof Dr Dr hc Kurt Mehlhorn,CS Department, Universitat Saarbrucken, Germany.

3. Sep 1989–Mar 1992: Research Associate in the group of Prof Dr Dr hc Kurt Mehlhorn,CS Department, Universitat Saarbrucken, Germany.

4. Apr 1992–Aug 1999: Research Associate at the Max Planck Institute for Informatics(MPI-INF), Saarbrucken, Germany, in the Algorithms and Complexity group, headedby Prof Dr Dr hc Kurt Mehlhorn.

1

5. Apr 1998–Jul 1998: Visiting Professor, CS Department, Universitat Trier, Germany.

6. Sep 1999–Aug 2000: Research Associate Professor, CS Department, University of Wa-terloo, Canada.

7. Aug 2000–Jun 2004: Associate Professor, CS Department, The Hong Kong Universityof Science and Technology (HKUST), Hong Kong.

8. Since Jul 2004 (on leave since Sep 2011): Professor, School of Computer Science, FudanUniversity, Shanghai, P.R. China.

9. Since Apr 2007: Founder and CEO of web services company China German IT Solu-tions Ltd., Shanghai, China.

10. 2009–2012: Co-Founder of Schall und Rauch, German-Chinese cultural exchange center.

11. Since Sep 2011: Professor, Department of Computer Science, German University ofTechnology (GUtech), Muscat, Sultanate of Oman.

12. Dec 2011–Mar 2016: Head of Department of Computer Science, German University ofTechnology (GUtech), Muscat, Sultanate of Oman.

13. Jan 2013–Mar 2016: Dean of Faculty of Engineering and Computer Science, GermanUniversity of Technology (GUtech), Muscat, Sultanate of Oman.

Awards and Scholarships

1. 1981: Finalist of the Bundeswettbewerb Mathematik (German Highschool MathematicsCompetition).

2. Oct 1984–Mar 1988: Fellow of the Studienstiftung des Deutschen Volkes (German Na-tional Academic Foundation).

3. Jun 1986–Mar 1988: Fellow of the Siemens-Studentenkreis.

4. Sep 1988–Aug 1989: Scholarship of the Alfried Krupp von Bohlen und Halbach-Stiftungin cooperation with the Studienstiftung des Deutschen Volkes (German National Aca-demic Foundation) to study Chinese at Peking University in Beijing, P.R. China.

5. Apr 1997–Feb 1999: Habilitation Scholarship of the DFG (Deutsche Forschungsgemein-schaft = German Research Foundation).

6. Mar 2001: First International Engineering Education Scholars Workshop, Hong Kong;one of three representatives of the School of Engineering, HKUST.

7. Aug 2001: APRU Fellow (Association of Pacific Rim Universities), Human Migrationin the Pacific Region: Emerging Patterns and New Opportunities, Los Angeles andBeijing; the only representative of HKUST.

8. Dec 2001: HKUST Teaching Innovation Award (for introducing various student cen-tered teaching methods). First Teaching and Learning Symposium by the TeachingCommunity of HKUST — Teaching Innovations: Fostering a Creative and Collabora-tive Environment, HKUST.

9. Feb 2002: Co-author of a paper by my PhD student Gerhard Trippen that won anHonorable Mention at the ACM (HK Chapter) Postgraduate Research Day 2002, HongKong University, Hong Kong.

10. May 2004: HKUST Award for Excellence in Teaching Innovation (for successfully in-troducing Just-in-Time-Teaching to COMP 272). Second Teaching and Learning Sym-posium — Teaching Innovations: Continuous Learning and Improvement, HKUST.

11. Jun 2007: Fudan University Undergraduate Teaching Award, 2nd class.

12. Apr 2008: Fudan University Key Developing Course Theory of Computing.

13. Sep 2008: Shanghai Government Key Developing Course Theory of Computing.

2

14. Dec 2010: Elected by the students as one of the five best professors in the School ofComputer Science at Fudan University.

15. Sep 2013: Shanghai Magnolia Award (Silver).

Awards By My Students

1. 2006: Li Jian, Fudan First Class Scholarship.

2. 2008: Xu Xiaoming, Fudan First Class Scholarship.

3. 2008: Yu Jiajin, Morgan-Stanley Scholarship.

4. 2008: Yu Jiajin, Fudan First Class Scholarship.

5. 2009: Wu Xi, First Grade People’s Scholarship for Graduate Students.

6. 2009: Wu Xi, Special Award, Tencent Technology Excellence Scholarship.

7. 2009: Xu Xiaoming, AMD Scholarship, first class.

8. Fall 2009: Xu Xiaoming and Yu Jiajin, best paper award, 2009 Theoretical ComputerScience Annual Conference, China.

9. Sep 2010-Aug 2011: Wang Yihui, Google Anita Borg Memorial Scholarship.

10. 2010: Wu Xi, Marvell Technology Scholarship.

11. 2010: Wu Xi, Intel Fellowship.

12. Sep 2012-Aug 2013: Gao Jiawei, Google Anita Borg Memorial Scholarship.

13. 2013: Michelle Liang Miner, best full paper award, ICALT 2013.

14. GUtech Eagles, Gulf Championship at the 16th ACM Arab Collegiate ProgrammingContest (ACPC 2013), Nov 21-24, 2013, in Sharm el Sheikh, Egypt.

15. GUtech Eagles, Gulf Championship at the 19th ACM Arab Collegiate ProgrammingContest (ACPC 2016), Nov 11-15, 2016, in Sharm el Sheikh, Egypt.

2. Research

Research Interests

• Major interests: FPT algorithms, online and approximation algorithms, data struc-tures, computational geometry, algorithmic game theory, experimental algorithmics,algorithm visualization, computer science education.

• Minor interests: randomized algorithms, parallel algorithms, complexity theory.

Grants

1. Dec 2000–Nov 2001: Oblivious Sorting Algorithms.HKUST Direct Allocation Grant DAG00/01.EG03, HKD 100,000. Principal investiga-tor, HKUST. Finished successfully.

2. Sep 2001–Jun 2004: Competitive Strategies for Graph Exploration and Localization.RGC grant HKUST6010/01E, HKD 387,248. Principal investigator, HKUST. Finishedsuccessfully.

3. Jan–Dec 2003: Exploration and Search in Geometric Environments.RGC/DAAD grant G-HK024/02, HKD 28,400. Principal investigator, HKUST. Col-laboration with Prof Dr Rolf Klein, Universitat Bonn, Germany. Finished successfully.

4. Sep 2003–Jun 2004: Routing in Emerging Information Networks.RGC grant HKUST6201/03E, HKD 324,000. Co-investigator, HKUST. Principal in-vestigator: Prof Chin-Tau Lea (EEE), HKUST. Finished successfully.

3

5. Jan–Dec 2004: Exploration and Search in Geometric Environments.RGC/DAAD grant G-HK024/02-II, HKD 29,600. Principal investigator, HKUST andFudan. Collaboration with Prof Dr Rolf Klein, Universitat Bonn, Germany. Finishedsuccessfully.

6. Jan 2004–May 2005: Study on the Learning Effectiveness of Visualizations.HKUST Teaching Development Grant CLI-00369E (Continuous Learning and Improve-ment Through Teaching Innovation), HKD 75,000. Until Jun 2004: Principal investiga-tor, HKUST. After Jul 2004: co-PI, Fudan (PI: Dr David Rossiter, HKUST). Finishedsuccessfully.

7. Jan 2004–Dec 2005: Competitive Search in Known and Unknown Environments.RGC Direct Allocation Grant DAG03/04.EG05, HKD 92,000. Until Jun 2004: Principalinvestigator, HKUST. After Jul 2004: co-PI, Fudan (PI: Prof Mordecai Golin, HKUST).Finished successfully.

8. Jun 2004: Competitive Search in Known and Unknown Environments.RGC grant HKUST6180/04E, HKD 339,414. Principal investigator, HKUST. I had todecline the grant because I left Hong Kong in July 2004.

9. Sep 2004–Aug 2011: Online algorithms for problems in robotics.Fudan startup grant, RMB 400,000. Principal investigator, Fudan.

10. Dec 20–22, 2004: 15th Annual International Symposium on Algorithms and Computa-tion (ISAAC 2004), Hong Kong.Croucher Foundation CF04/05.EG01, HKD 100,000, and KC Wong FoundationKCWEF03/04.EG05, HKD 40,000. Principal investigator, HKUST and Fudan.

11. Jan 2005–Dec 2006: Fudan University Research Cooperation Grant to invite Prof RolfKlein, Universitat Bonn, Germany, for a 2-month visit to Fudan. RMB 50,000. PrincipalInvestigator, Fudan.

12. Jan 2006–Dec 2008: Online algorithms for autonomous robots.NSFC grant 60573025, RMB 230,000. Principal investigator, Fudan. Finished success-fully.

13. Jul 2007–Dec 2009: Super-resolution based on human visual perceptual principle.Ministry of Science and Technology, National High Technology Research and Devel-opment Program of China (863 Program), project No. 2007AA01Z176, RMB 140,000(total project RMB 910,000). Co-PI, Fudan (PI: Zhang Junping, Fudan). Finished suc-cessfully.

14. Jun 2008–May 2010: Kernel minimization for geometric graphs.Robert Bosch Foundation, Germany, Science Bridge China No. 32.5.8003.0040.0,Euro 11,050. Principal investigator, Fudan, together with Prof Rolf Niedermeier, FriedrichSchiller University of Jena, Germany. Finished successfully.

15. Jun 17–21, 2008: International Summer School on FPT Algorithms, Shanghai, China.NSFC, RMB 30,000. Principal investigator, Fudan, together with Chen Yijia (SJTU)and Jianer Chen (Texas A&M). Finished successfully.

16. Jun 23–25, 2008: 4th International Conference on Algorithmic Aspects in Informationand Management (AAIM 2008), Shanghai, China.NSFC grant 60810306015, RMB 30,000. Principal investigator, Fudan, together withXu Jinhui (Buffalo). Finished successfully.

17. Sep 2008–Aug 2011: Fudan and Shanghai Government Key Developing Course Theoryof Computing. 50,000RMB, Principal investigator, Fudan.

18. Sep 2009–Aug 2011: Efficient algorithms for network problems.Shanghai Committee of Science and Technology, Grant 08DZ2271800, RMB 10,000.Principal investigator, Fudan.

4

19. Sep 2009–Aug 2011: A Theory of Computation intelligent online tutoring system basedon ActiveMath.Shanghai Committee of Science and Technology, Grant 09DZ2272800, RMB 10,000.Principal investigator, Fudan.

20. Sep 2009–Sep 2011: Extending the Frontiers of ActiveMath to China.Shanghai Key Laboratory of Intelligent Information Processing, China, open projectIIPL-09-002, RMB 20,000. Principal investigator, Fudan.

21. Jan 2010–Dec 2012: FPT algorithms for planar graphs.NSFC grant 60973026, RMB 320,000. Principal investigator, Fudan.

22. Mar–May 2010: Research visit of my student Wang Yihui at University of Kyoto. FudanGraduate School, RMB 30,000.

23. Jul–Dec 2010: Research visit of my student Xu Kaixuan at NTU Singapore. Fullysupported by NTU.

24. Jul 4–15, 2010: International Summer School on Algorithmic Game Theory.Shanghai Government Education Committee, RMB 200,000 RMB; and School of Com-puter Science, Fudan, RMB 30,000. Principal investigator, Fudan. Finished successfully.

25. Aug 28–Sep 1, 2010: Joint German-Sino Workshop on Algorithm Engineering, Shang-hai, China.Sino-German Center for Research Promotion in Beijing (DFG and NSFC), RMB 166,360and Euro 15,000. Principal investigator, Fudan. Finished successfully.

26. Sep–Nov 2010: Research visit of my student Zhang Wenyan at University of Utrecht.Fudan Graduate School, RMB 30,000.

27. Jan–Feb 2011: Research visit of my student Michelle Miner Liang at DFKI Saarbrucken,Germany. Fully supported by DFKI.

28. Jul–Nov 2011: Research visit of my student Liang Miner at DFKI Saarbrucken, Ger-many. DAAD scholarship.

29. Oct 2011-Jun 2012: Altruistic Nash equilibria.Gao Jiawei, Chun-Tsung undergraduate project, Fudan, 4,000 RMB.

30. Jan 2012–Dec 2013: Scalable Algorithms for Massive Complex Data Analysis.2012 International Program Development Fund Australia. Co-PI, Fudan (PI: SeokheeHong, University of Sydney, Australia).

31. May–Dec 2012: Study on parameterized algorithms and complexity of target set selec-tion.Ma Wenxuan, Chun-Tsung undergraduate project, Fudan, 5,000 RMB.

University Research Projects

1. Jun 1995–Mar 1999: OnVis; a system for visualisation and animation of online algo-rithms (a prototype has been implemented). Principal investigator, MPI-INF.

2. Jul 1998–Jun 1999: Site coordinator of the European Union ESPRIT LTR projectALCOM-IT (No. 20244), MPI-INF.

3. Oct 1998–Oct 1999: LEDA-Anim; a library of animated LEDA data structures andalgorithms (a prototype has been implemented). Principal investigator, MPI-INF.

4. Jul 2001–Jul 2004: CELT project 00318E, Computer Animation Repository. Principalinvestigator, HKUST and Fudan.

5. Mar 2002–Jun 2004: CELT project CLI-00332E, Promoting active learning throughjust-in-time teaching and peer interaction, sub-project in the UGC umbrella projectContinuous Learning and Improvement (CLI) through teaching innovation. Principalinvestigator, HKUST.

5

6. Jan 2003–Jul 2004: Member of the HKUST CLI Special Interest Groups Peer Learningand Teaching and Learning Tools.

7. Sep 2009–Aug 2011: Implementation of an e-textbook for the course Theory of Com-puting in ActiveMath.

8. Aug 2015–Jun 2016: Blended learning grant Online Course Modules for Programming.Principal investigator, GUtech.

PhD Thesis Supervision

1. Jun 1998–Jun 2001: Volker Priebe, Average case complexity of graph problems, MPI-INF, co-supervisor.

2. Feb 2001–Dec 2001: Samee Ullah Khan, Algorithmic combinatorial game theory, HKUST.He left Hong Kong in Dec 2001 to study at the University of Texas in Arlington, USA.

3. Feb 2001–Jul 2006: Gerhard Trippen, Competitive graph exploration and localization,HKUST.

4. Sep 2002–Jun 2004: Zhou Zhen, HKUST. He graduated at HKUST in 2007 under thesupervision of Prof Mordecai Golin.

5. Sep 2005–Dec 2009: Li Yi, Data streaming for a video-on-demand system, Fudan. Jan2010: changed supervisor (Prof Zang Binyu).

6. Sep 2007–Apr 2017: Qian Yingneng, Algorithmic mechanism design for the EITC,Fudan. Part-time, did not finish the thesis.

7. Sep 2008–Jun 2013: Michelle Liang Miner, Progressive zoom navigation support forpersonalized e-learning, Fudan.

8. Sep 2008–Jun 2013: Zhang Wenyan, FPT and ILP, Fudan.

9. Mar 2009–Jun 2012: Wang Yihui, Dynamic programming speedups and camera probeproblem, Fudan.

10. Sep 2010–Jun 2013: Cen Yuanyuan, Altruistic equilibria for congestion games, Fudan.

Master’s Thesis Supervision

(German thesis grades are 1.0=very good, 2.0=good, 3.0=average, 4.0=weak, 5.0=fail,in Saarbrucken they must be confirmed by a second professor).

1. Oct 1989–Dec 1990: Josef Lugger, Algorithmen fur das Separationsproblem in der Ebeneund im IR3 (Algorithms for the separation problem in the plane and in the IR3), Uni-versitat Saarbrucken, Germany. Grade: 1.3.

2. Sep 1990–Jan 1993: Rainer Gammel, Algorithmen zur Triangulierung von Polygonen(Algorithms for triangulating polygons), Universitat Saarbrucken, Germany. Grade: 1.3.

3. Sep 1991–Sep 1992: Francoise Hontoy, Arrangements von Hyperebenen mit Anwendun-gen (Arrangements of hyperplanes with applications), Universitat Saarbrucken, Ger-many. Grade: 1.3.

4. Apr 1996–Nov 1997: Holger Kappel, Eine Methode zur Berechnung von Vorzeichenganzzahliger Determinanten (A method for computing the sign of the determinant ofinteger matrices), Universitat Saarbrucken, Germany. Grade: 1.7.

5. Feb 1998–Feb 1999: Barbara Ruppert, Chazelle’s linearer Algorithmus zur Polygon-triangulierung (Chazelle’s linear time algorithm for polygon triangulation), UniversitatSaarbrucken, Germany. Grade: 1.0.

6. Dec 1998–Mar 2000: Gerhard Trippen, Das Lokalisierungsproblem fur mobile Roboter(The localization problem for mobile robots), Universitat Saarbrucken, Germany. Grade:1.0.

6

7. Jan 1999–Dec 2000: Michaela Wahl, Online scheduling, Universitat Saarbrucken, Ger-many. Grade: 1.0.

8. Sep 2003–Jan 2006: Leung Kam Chiu, HKUST. The games of Fiver and Lights Out.Did not finish the thesis.

9. Jan 2005–Jul 2007: Li Jian, Fudan (co-supervisor).

10. Sep 2005–Jun 2008: Cai Sheng, FPT algorithms for the vertex cover problem, Fudan.

11. Sep 2005–Jun 2008: Zhang Tao, On two online maximization problems with look-ahead,Fudan.

12. Sep 2006–Jun 2009: Wang Mingyue, On-line algorithm for searching a moving targeton m rays, Fudan.

13. Sep 2006–Feb 2009: Wang Yihui, Fudan. Switched to Fudan PhD program, Mar 2009.

14. Sep 2006–Jun 2009: Xu Yichen, Research and extension of the minimum labeling span-ning tree problem, Fudan.

15. Sep 2007–Jun 2010: Xu Xiaoming, Dynamic programming speed-ups, Fudan.

16. Sep 2007–Jun 2010: Yu Jiajin, Markov user model under the generalized second priceauction, Fudan.

17. Sep 2008–Jun 2011: Lai Xinke, Fixed-parameterized-tractable algorithm research fordominating set on planar graphs, Fudan.

18. Sep 2008–Jun 2011: Wu Xiaotian, FPT-algorithms for the clique partitioning problem,Fudan.

19. Sep 2008–Jun 2011: Xu Kaixuan, The extended subgraph isomorphism problem, Fudan.

20. Sep 2009–Jun 2012: Xu Yunfeng, K-link shortest path algorithms for interval graphs,Fudan.

21. Mar 2010–Jun 2011: Wu Xi, entered PhD program at University of Wisconsin at Madi-son before graduating from Fudan.

22. Sep 2010–Jun 2013: Gong Boru, Lattice theory and its applications in cryptography,Fudan.

23. Sep 2011–Jun 2014: Chen Chongcheng, Monochromatic Dissection, Fudan.

MSc Student Supervision

1. Sep 2002–Jan 2004: Law Ho Man Janelle, HKUST.

Undergraduate Student Supervision

1. Sep 2002–Jun 2004: Tsui Ho Man, HKUST.

2. Sep 2004–Aug 2006: Zhang Qin, Fudan.

3. Apr 2005–2008: Cheng Chen, Fudan.

4. Sep 2009–Aug 2011: Chen Chongcheng, Fudan.

5. Feb–Aug 2010: Romain Mouret, intern from EPITA, France.

6. May 2010–Aug 2011: Li Yuan, Fudan.

7. May 2010–Aug 2011: Yang Yi, Fudan.

8. Aug 2010–Aug 2011: Ma Wenxuan, Fudan.

9. Aug 2010–Aug 2011: Lin Yuhao, Fudan.

10. Sep 2010–Aug 2011: Gao Jiawei, Fudan.

11. Jun–Aug 2011: Miciah Masters, East Carolina University, USA, exchange student, NSFEAPSI Program for China 2011.

7

12. Jan 2011–Dec 2011: Zhu Fengqin, Fudan.

13. Dec 2013–Jun 2014: Hisham Shaban, GUtech, Bachelor thesis: ”Improved Linear WorldSuperresolution”.

14. Dec 2013–Jun 2014: Issa al Rawahi, GUtech, Bachelor thesis: ”GUtech MaintenanceSystem”.

15. Feb–Jun 2015: Shaima Ali Al-Wahaibi, GUtech, Bachelor thesis: ”Car Wash MobileApplication”.

16. Feb–Sep 2015: Narjes Jamali, GUtech, Bachelor thesis: ”E-Learning: Virtual ChemicalLab Application”.

17. Apr–Sep 2015: Nusaiba al Sulaimani, GUtech, Bachelor thesis: ”Tangible vs. VirtualSliders: Understanding User Preference Towards Input Methods”.

18. Apr–Sep 2015: Ahlam al Mutawa, GUtech, Bachelor thesis: ”Back-of-Device TactilePatterns Based on iPhone UIs”.

Academic Careers of my Students

1. Gao Jaiwei, PhD student, Department of Computer Science, University of California,San Diego, USA.

2. Li Jian, Assistant Prof, Institute for Interdisciplinary Information Sciences (IIIS), Ts-inghua University, Beijing, China.

3. Michelle Liang, Postdoc, International Technological University (ITU), San Jose, USA.

4. Gerhard Trippen, Lecturer, Department of Management, University of Toronto Mis-sissauga, Canada.

5. Wu Xi, PhD student, University of Wisconsin-Madison, USA.

6. Li Yi, Lecturer, Software School, Fudan University, Shanghai, China.

7. Yu Jiajin, Research Scientist, Facebook, USA.

8. Zhang Qin, Assistant Professor, Computer Science Department, Indiana UniversityBloomington, USA.

3. Publications

I have listed authors in the order of their appearance in the paper, which in nearly all casesis by alphabetical order of family name.

Citations on Google Scholar:

• Citations: 2,492

• h-index: 23.

• i10-index: 45.

Patents

P 1. R. Fleischer and Y. Wang. An optimal method for detector location, 2012. Chinapatent no. 200910056307.2, awarded 29 May 2012.

P 2. R. Fleischer and X. Xu. Reconstruction based super-resolution method, 2012. Chinapatent no. 200910196053.4, awarded 5 July 2012.

8

Refereed Journals

J 1. R. Fleischer. Communication complexity of multi-processor systems. InformationProcessing Letters, 30:57–65, 1989.

J 2. R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C. K. Yap. Simultaneous inner andouter approximation of shapes. Algorithmica, 8:365–389, 1992. Invited submissionto a special issue on selected papers of SoCG 1990.

J 3. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Naher, S. Schirra, and C. Uhrig.Approximate motion planning and the complexity of the boundary of the union ofsimple geometric figures. Algorithmica, 8:391–406, 1992. Invited submission to aspecial issue on selected papers of SoCG 1990.

J 4. R. Fleischer, B. Sinha, and C. Uhrig. A lower bound for the worst case of bottom-up-heapsort. Information and Computation, 102(2):263–279, 1993.

J 5. R. Fleischer. A tight lower bound for the worst case of bottom-up-heapsort. Algo-rithmica, 11:104–115, 1994. the paper was later also invited to be submitted to aspecial issue of IJFCS on selected papers of ISA 1991.

J 6. R. Fleischer, H. Jung, and K. Mehlhorn. A communication-randomness tradeoff fortwo-processor systems. Information and Computation, 116(2):155–161, 1995.

J 7. R. Fleischer. A simple balanced search tree with O(1) worst-case update time. Inter-national Journal of Foundations of Computer Science, 7(2):137–149, 1996. Invitedsubmission to a special issue on selected papers of ISAAC 1993.

J 8. N. Alon, P. G. Bradford, and R. Fleischer. Matching nuts and bolts faster. Informa-tion Processing Letters, 59(3):123–127, 1996.

J 9. P. G. Bradford, R. Fleischer, and M. Smid. More efficient parallel totally monotonematrix searching. Journal of Algorithms, 23:386–400, 1997.

J 10. R. Fleischer. Decision trees: Old and new results. Information and Computation,152:44–61, 1999.

J 11. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. A strong and easily com-putable separation bound for arithmetic expressions involving radicals. Algorith-mica, 27(1):87–99, 2000. Invited submission to a special issue on the implementationof geometric algorithms.

J 12. R. Fleischer and M. Wahl. On-line scheduling revisited. Journal of Scheduling,3(6):343–353, 2000.

J 13. W. W. Bein, R. Fleischer, and L. L. Larmore. Limited bookmark randomized onlinealgorithms for the paging problem. Information Processing Letters, 76(4–6):155–162,2000.

J 14. R. Fleischer. On the Bahncard problem. Theoretical Computer Science, 268(1):161–174, 2001. Invited submission to a special issue on online algorithms.

J 15. R. Fleischer, K. Romanik, S. Schuierer, and G. Trippen. Optimal robot localizationin trees. Information and Computation, 171:224–247, 2001.

J 16. T. Biedl, E. Cenek, T. M. Chan, E. D. Demaine, M. L. Demaine, R. Fleischer, andM.-W. Wang. Balanced k-colorings. Discrete Mathematics, 254(1-3):19–32, 2002.

J 17. P. Bose, A. Brodnik, S. Carlsson, E. D. Demaine, R. Fleischer, A. Lopez-Ortiz,P. Morin, and J. I. Munro. Online routing in convex subdivisions. InternationalJournal of Computational Geometry and Applications, 12(4):283–296, 2002. Invitedsubmission to a special issue on selected papers of ISAAC 2000.

J 18. T. L. Naps (co-chair), G. Roßling (co-chair), V. Almstrum, W. Dann, R. Fleischer,C. Hundhausen, A. Korhonen, L. Malmi, M. McNally, S. Rodger, and J. A.Velazquez-Iturbide. Exploring the role of visualization and engagement in computer

9

science education. Report of the ITiCSE 2002 Working Group on “Improving theEducational Impact of Algorithm Visualization”. ACM SIGCSE Bulletin, 35(2):131–152, 2003.

J 19. T. L. Naps (co-chair), G. Roßling (co-chair), J. Anderson, S. Cooper, W. Dann,R. Fleischer, B. Koldehofe, A. Korhonen, M. Kuittinen, L. Malmi, C. Leska,M. McNally, J. Rantakokko, and R. J. Ross. Evaluating the educational impact ofvisualization. Report of the ITiCSE 2003 Working Group on “Evaluating the Educa-tional Impact of Algorithm Visualization”. ACM SIGCSE Bulletin, 35(4):124–136,2003.

J 20. E. D. Demaine, M. L. Demaine, and R. Fleischer. Solitaire Clobber. TheoreticalComputer Science, 313(3):325–338, 2004. Special issue on Algorithmic CombinatorialGame Theory, Dagstuhl, Germany, 2002.

J 21. S. Fekete, R. Fleischer, A. Fraenkel, and M. Schmitt. Traveling salesmen in the pres-ence of competition. Theoretical Computer Science, 313(3):377–392, 2004. Specialissue on Algorithmic Combinatorial Game Theory, Dagstuhl, Germany, 2002.

J 22. R. Fleischer and H. Koga. Balanced scheduling toward loss-free packet queuing anddelay fairness. Algorithmica, 38(2):363–376, 2004. Invited submission to a specialissue on selected papers of ISAAC 2001.

J 23. R. Fleischer, M. Golin, C.-T. Lea, and S. Wong. Finding optimal paths in MREProuting. Information Processing Letters, 89:57–63, 2004.

J 24. E. Demaine, R. Fleischer, A. S. Fraenkel, and R. J. Nowakowski. Open problems atthe 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. TheoreticalComputer Science, 313(3):539–543, 2004.

J 25. T. Biedl, E. D. Demaine, C. A. Duncan, R. Fleischer, and S. G. Kobourov. Tightbounds on maximal and maximum matchings. Discrete Mathematics, 285(1-3):7–15,2004.

J 26. T. Biedl, T. Chan, E. D. Demaine, R. Fleischer, M. Golin, J. A. King, and J. I.Munro. Fun-Sort — Or the chaos of unordered binary search. Discrete AppliedMathematics, 144(3):231–236, 2004. Invited submission to a special issue on selectedpapers of Fun With Algorithms 2, 2001.

J 27. R. Fleischer, W. G lazek, and S. Seiden. New results for online page replication.Theoretical Computer Science, 324:219–251, 2004.

J 28. R. Fleischer, M. J. Golin, and Y. Zhang. Online maintenance of k-medians and k-covers on a line. Algorithmica, 45(4):549–567, 2006.

J 29. Y. Zhang, Q. Ge, R. Fleischer, T. Jiang, and H. Zhu. Approximating the minimumweight weak vertex cover. Theoretical Computer Science, 363(1):99–105, 2006.

J 30. S. Cai, R. Fleischer, and H. Zhu. Linear kernelization algorithm for the vertex coverproblem (in Chinese). Journal of Computer Research and Development, 45(1):53–56,2008.

J 31. R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Online approx-imation of the optimal search ratio. SIAM Journal on Computing, 38(3):881–898,2008.

J 32. R. Fleischer. Die another day. Theory of Computing Systems, 44(2):204–215, 2009.Invited submission to a special issue on selected papers of FUN 2007.

J 33. C. Chen, J. Zhang, and R. Fleischer. Distance approximating dimension reductionof Riemannian manifolds. IEEE Transactions on Systems, Man, and Cybernetics —Part B: Cybernetics, 40(1):208–217, 2010.

J 34. Q. Fang, R. Fleischer, J. Li, and X. Sun. Algorithms for core stability, core large-

10

ness, exactness, and extendability of flow games. Frontiers of Mathematics in China,5(1):47–63, 2010.

J 35. R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. The tourist inthe shopping arcade. The Journal of Universal Computer Science, 12(5):676–685,2010.

J 36. J. Zhang, J. Pu, C. Chen, and R. Fleischer. Low-resolution gait recognition. IEEETransactions on Systems, Man, and Cybernetics — Part B: Cybernetics, 40(4):986–996, 2010.

J 37. X. Wu, Y. Lin, and R. Fleischer. Research of fixed parameter algorithm for cliquepartition problem. Computer Engineering, 37(11):92–93, 2011.

J 38. R. Fleischer and W. Zhang. A new kernelization and parameterized algorithm for theplanar clique cover problem. Journal of Wuhan University (Natural Science Edition),57(6):461–464, 2011. Also presented at the 2011 National Conference on TheoreticalComputer Science (NCTCS 2011), Wuhan, China, October 22-23, 2011.

J 39. R. Fleischer and X. Xu. Computing minimum diameter color-spanning sets is hard.Information Processing Letters, 111(21–22):1054–1056, 2011.

J 40. K. Xu and R. Fleischer. Optimized algorithm of extended subgraph isomorphismproblem (in Chinese). Computer Engineering, 37(19):38–40, 2011.

J 41. R. Fleischer and G. J. Woeginger. An algorithmic analysis of the Honey Bee Game.Theoretical Computer Science, 452:75–87, 2012.

J 42. B.-R. Gong, Y.-L. Zhao, R. Fleischer, and X.-Y. Wang. Generalization of Schnorrscheme and its application in lattice cryptography (in Chinese). Computer Engineer-ing, 40(4):130–135, 2014.

J 43. J. Kim, P. Eades, R. Fleischer, S.-H. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi,and T. Tokuyama. Order preserving matching. Theoretical Computer Science,525:68–79, 2014.

J 44. D. Z. Chen, R. Fleischer, J. Li, H.-T. Wang, and H. Zhu. Traversing the machininggraph. Algorithmica. To appear.

Refereed Conferences

C 1. R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C. K. Yap. On simultaneous innerand outer approximation of shapes. In Proceedings of the 6th Annual ACM Sympo-sium on Computational Geometry (SoCG’90), pages 216–224, 1990. A full versionof this paper has appeared as journal paper [J 2].

C 2. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Naher, S. Schirra, and C. Uhrig.Approximate motion planning and the complexity of the boundary of the union ofsimple geometric figures. In Proceedings of the 6th Annual ACM Symposium onComputational Geometry (SoCG’90), pages 281–289, 1990. A full version of thispaper has appeared as journal paper [J 3].

C 3. R. Fleischer, H. Jung, and K. Mehlhorn. A time-randomness tradeoff for commu-nication complexity. In Proceedings of the 4th Workshop on Distributed Algorithms(WDAG’90). Springer Lecture Notes in Computer Science 486, pages 390–401, 1990.A full version of this paper has appeared as journal paper [J 6].

C 4. R. Fleischer. A tight lower bound for the worst case of bottom-up-heapsort. InProceedings of the 2nd International Symposium on Algorithms (ISA’91). SpringerLecture Notes in Computer Science 557, pages 251–262, 1991. A full version of thispaper has appeared as journal paper [J 5].

11

C 5. R. Fleischer. Decision trees: Old and new results. In Proceedings of the 25th ACMSymposium on the Theory of Computation (STOC’93), pages 468–477, 1993. A fullversion of this paper has appeared as journal paper [J 10].

C 6. R. Fleischer. A simple balanced search tree with O(1) worst-case update time. InProceedings of the 4th International Symposium on Algorithms and Computation(ISAAC’93). Springer Lecture Notes in Computer Science 762, pages 138–146, 1993.A full version of this paper has appeared as journal paper [J 7].

C 7. P. G. Bradford and R. Fleischer. Matching nuts and bolts faster. In Proceedingsof the 6th International Symposium on Algorithms and Computation (ISAAC’95).Springer Lecture Notes in Computer Science 1004, pages 402–408, 1995. A fullversion of this paper has appeared as journal paper [J 8].

C 8. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. A strong and easily com-putable separation bound for arithmetic expressions involving square roots. InProceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA’97),pages 702–709, 1997. A full version of this paper has appeared as journal paper [J 11].

C 9. G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. Karkkainen. Episodematching. In Proceedings of the 8th Annual Symposium on Combinatorial PatternMatching (CPM’97). Springer Lecture Notes in Computer Science 1264, pages 12–27,1997.

C 10. R. Fleischer. FUN with implementing algorithms. In E. Lodi, L. Pagli, andN. Santoro, editors, Proceedings of the 1998 International Conference FUN with Al-gorithms (FUN’98), pages 88–98. Carleton Scientific, Proceedings in Informatics 4,1999.

C 11. R. Fleischer. On the Bahncard problem. In Proceedings of the 4th Annual Interna-tional Computing and Combinatorics Conference (COCOON’98). Springer LectureNotes in Computer Science 1449, pages 65–74, 1998. A full version of this paper hasappeared as journal paper [J 14].

C 12. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Efficient exact geometriccomputation made easy. In Proceedings of the 15th Annual ACM Symposium onComputational Geometry (SoCG’99), pages 341–350, 1999.

C 13. R. Fleischer and G. Trippen. Optimal robot localization in trees. In Proceedings ofthe 16th Annual ACM Symposium on Computational Geometry (SoCG’00), pages373–374, 2000. A video shown at the 9th Annual Video Review of ComputationalGeometry.

C 14. T. Biedl, E. Cenek, T. M. Chan, E. D. Demaine, M. L. Demaine, R. Fleischer, andM.-W. Wang. Balanced k-colorings. In Proceedings of the 25th International Sympo-sium on the Mathematical Foundations of Computer Science (MFCS’00). SpringerLecture Notes in Computer Science 1893, pages 202–211, 2000. A full version ofthis paper has appeared as journal paper [J 16].

C 15. R. Fleischer and M. Wahl. Online scheduling revisited. In Proceedings of the 8thEuropean Symposium on Algorithms (ESA’00). Springer Lecture Notes in ComputerScience 1879, pages 202–210, 2000. A full version of this paper has appeared asjournal paper [J 12].

C 16. R. Fleischer and S. Seiden. New results for online page replication. In Proceedingsof the 3rd International Workshop on Approximation Algorithms for CombinatorialOptimization (APPROX’00). Springer Lecture Notes in Computer Science 1913,pages 144–154, 2000. A full version of this paper has appeared as journal paper [J 27].

C 17. R. Fleischer and P. Sanders. Asymptotic complexity from experiments? A case studyfor randomized algorithms. In Proceedings of the 4th Workshop of Algorithms and

12

Engineering (WAE’00). Springer Lecture Notes in Computer Science 1982, pages135–146, 2000. A full version of this paper has appeared as book chapter [Ch 5].

C 18. P. Bose, A. Brodnik, S. Carlsson, E. D. Demaine, R. Fleischer, A. Lopez-Ortiz,P. Morin, and J. I. Munro. Online routing in convex subdivisions. In Proceedingsof the 11th International Symposium on Algorithms and Computation (ISAAC’00).Springer Lecture Notes in Computer Science 1969, pages 47–59, 2000. A full versionof this paper has appeared as journal paper [J 17].

C 19. T. Biedl, T. Chan, E. D. Demaine, R. Fleischer, M. Golin, and J. I. Munro. Fun-Sort. In E. Lodi, L. Pagli, and N. Santoro, editors, Proceedings of the 2nd Interna-tional Conference FUN with Algorithms (FUN’01), pages 15–26. Carleton Scientific,Proceedings in Informatics 10, 2001. A full version of this paper has appeared asjournal paper [J 26].

C 20. T. Biedl, E. D. Demaine, C. A. Duncan, R. Fleischer, and S. G. Kobourov. Tightbounds on maximal and maximum matchings. In Proceedings of the 12th Interna-tional Symposium on Algorithms and Computation (ISAAC’01). Springer LectureNotes in Computer Science 2223, pages 308–319, 2001. A full version of this paperhas appeared as journal paper [J 25].

C 21. P. Crescenzi, N. Faltin, R. Fleischer, C. Hundhausen, S. Naher, G. Roßling,J. Stasko, and E. Sutinen. The Algorithm Animation Repository. In Proceedings ofthe 2nd Program Visualization Workshop, pages 14–16, HornstrupCentret, Denmark,June 27-28 2002. http://stwww.weizmann.ac.il/g-cs/benari/pvw%5Cpvw.htm.

C 22. E. D. Demaine, M. L. Demaine, and R. Fleischer. Solitaire Clobber. In Proceedingsof the 3rd International Conference on Computers and Games (CG’02). SpringerLecture Notes in Computer Science 2883, pages 188–200, 2003. A full version ofthis paper has appeared as journal paper [J 20].

C 23. R. Fleischer and G. Trippen. Experimental studies of graph traversal algorithms.In Proceedings of the 2nd International Workshop on Experimental and EfficientAlgorithms (WEA’03). Springer Lecture Notes in Computer Science 2647, pages120–133, 2003.

C 24. Q. Xie, C.-T. Lea, R. Fleischer, and M. Golin. Energy efficient routing with back-ward energy cost. In Proceedings of the IEEE 2003 Global Telecommunications Con-ference (Globecom’03), volume 1, pages 564–570, 2003.

C 25. R. Fleischer, M. Golin, C.-T. Lea, and S. Wong. Finding optimal paths in MREProuting. In Proceedings of the 2003 Australian Telecommunications, Networks andApplications Conference (ATNAC), 2003. 9 pages. A full version of this paper hasappeared as journal paper [J 23].

C 26. R. Fleischer, M. J. Golin, and Y. Zhang. Online maintenance of k-medians and k-covers on a line. In Proceedings of the 9th Scandinavian Workshop on AlgorithmTheory (SWAT’04). Springer Lecture Notes in Computer Science 3111, pages 102–113, 2004. A full version of this paper has appeared as journal paper [J 28].

C 27. R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Competitiveonline approximation of the optimal search ratio. In Proceedings of the 12th EuropeanSymposium on Algorithms (ESA’04). Springer Lecture Notes in Computer Science3221, pages 335–346, 2004. A full version of this paper has appeared as journalpaper [J 31].

C 28. R. Fleischer and G. Trippen. Exploring an unknown graph efficiently. In Proceedingsof the 13th European Symposium on Algorithms (ESA’05). Springer Lecture Notesin Computer Science 3669, pages 11–22, 2005. A full version of this paper has beensubmitted as journal paper [?].

C 29. R. Fleischer, Q. Ge, J. Li, S. Tian, and H. Wang. Approximating spanning trees with

13

inner nodes cost. In Proceedings of the 6th International Conference on Parallel andDistributed Computing (PDCAT’05), pages 660–664, 2005.

C 30. R. Fleischer and G. Trippen. Kayles on the way to the stars. In Proceedings of the4th International Conference on Computers and Games (CG’04). Springer LectureNotes in Computer Science 3846, pages 232–245, 2006.

C 31. R. Fleischer, J. Li, S. Tian, and H. Zhu. Non-metric multicommodity and multilevelfacility location. In Proceedings of the 2nd International Conference on AlgorithmicAspects in Information and Management (AAIM’06). Springer Lecture Notes inComputer Science 4041, pages 138–148, 2006.

C 32. D. Z. Chen, R. Fleischer, J. Li, H.-T. Wang, and H. Zhu. Traversing the machininggraph. In Proceedings of the 14th European Symposium on Algorithms (ESA’06).Springer Lecture Notes in Computer Science 4168, pages 220–231, 2006.

C 33. D. Z. Chen, R. Fleischer, J. Li, Z. Xie, and H. Zhu. On approximating the maxi-mum simple sharing problem. In Proceedings of the 17th International Symposiumon Algorithms and Computation (ISAAC’06). Springer Lecture Notes in ComputerScience 4288, pages 547–556, 2006.

C 34. R. Fleischer. Die another day. In Proceedings of the 4th International ConferenceFUN with Algorithms (FUN’07). Springer Lecture Notes in Computer Science 4475,pages 146–155, 2007. A full version of this paper has appeared as journal paper [J 32].

C 35. R. Fleischer, Q. Ge, J. Li, and H. Zhu. Efficient algorithms for k-disjoint pathsproblems on DAGs. In Proceedings of the 3rd International Conference on Algorith-mic Aspects in Information and Management (AAIM’07). Springer Lecture Notesin Computer Science 4508, pages 134–143, 2007.

C 36. Q. Fang, R. Fleischer, J. Li, and X. Sun. Algorithms for core stability, core large-ness, exactness, and extendability of flow games. In Proceedings of the 13th AnnualInternational Computing and Combinatorics Conference (COCOON’07). SpringerLecture Notes in Computer Science 4598, pages 439–447, 2007. A full version of thispaper has appeared as journal paper [J 34].

C 37. A. Chaudhary, D. Z. Chen, R. Fleischer, X. S. Hu, J. Li, M. Niemier, Z. Xie, andH. Zhu. Approximating the maximum sharing problem. In Proceedings of the 10thWorkshop on Algorithms and Data Structures (WADS’07). Springer Lecture Notesin Computer Science 4619, pages 52–63, 2007.

C 38. R. Fleischer and Y. Wang. Dynamic Pareto optimal matching. In Proceedings of the2008 International Symposium on Information Science and Engineering (ISISE’08),volume 2, pages 797–802, 2008.

C 39. C. Chen, J. Zhang, and R. Fleischer. Multilinear tensor-based non-parametric di-mension reduction for gait recognition. In Proceedings of the 3rd IAPR/IEEE Inter-national Conference on Biometrics (ICB’09). Springer Lecture Notes in ComputerScience 5558, pages 1037–1046, 2009.

C 40. R. Fleischer, X. Wu, and L. Yuan. Experimental study of FPT algorithms for thedirected feedback vertex set problem. In Proceedings of the 17th European Sympo-sium on Algorithms (ESA’09). Springer Lecture Notes in Computer Science 5757,pages 611–622, 2009.

C 41. R. Fleischer and Y. Wang. On the camera placement problem. In Proceedings ofthe 20th International Symposium on Algorithms and Computation (ISAAC’09).Springer Lecture Notes in Computer Science 5878, pages 255–264, 2009.

C 42. R. Fleischer and G. J. Woeginger. An algorithmic analysis of the Honey Bee Game.In Proceedings of the 5th International Conference FUN with Algorithms (FUN’10).

14

Springer Lecture Notes in Computer Science 6099, pages 178–189, 2010. A fullversion of this paper has appeared as journal paper [J 41].

C 43. R. Fleischer, J. Guo, R. Niedermeier, J. Uhlmann, Y. Wang, M. Weller, and X. Wu.Extended islands of tractability for parsimony haplotyping. In Proceedings of the21st Annual Symposium on Combinatorial Pattern Matching (CPM’10). SpringerLecture Notes in Computer Science 6129, pages 214–226, 2010.

C 44. R. Fleischer and X. Xu. Computing minimum diameter color-spanning sets. InProceedings of the 4th International Frontiers of Algorithmics Workshop (FAW’10).Springer Lecture Notes in Computer Science 6213, pages 285–292, 2010. A fullversion of this paper has appeared as journal paper [J 39].

C 45. S. Z. Chen, R. Fleischer, and J. Li. Densest k-subgraph approximation on inter-section graphs. In Proceedings of the 8th Workshop on Approximation and OnlineAlgorithms (WAOA’10). Springer Lecture Notes in Computer Science 6534, pages83–93, 2010.

C 46. E. Andres, R. Fleischer, and M. Liang. An adaptive Theory of Computation onlinecourse in ActiveMath. In Proceedings of the 5th International Conference on Com-puter Science and Education (ICCSE’10), pages 317–322. IEEE Computer SocietyPress, Los Alamitos, 2010.

C 47. R. Fleischer and X. Wu. Edge clique partition of K4-free and planar graphs. In Pro-ceedings of the China-Japan Joint Conference on Computational Geometry, Graphsand Applications (CGGA’10). Springer Lecture Notes in Computer Science 7033,pages 84–95, 2011.

C 48. R. Fleischer. Just-in-time teaching in China and Oman. In Proceedings of the 5thConference on eLearning Excellence in the Middle East, pages 470–479, 2012.

C 49. L. Brueggeman, M. Fellows, R. Fleischer, M. Lackner, C. Komusiewicz, Y. Koutis,A. Pfandler, and F. Rosamond. Train marshalling is fixed parameter tractable. InProceedings of the 6th International Conference FUN with Algorithms (FUN’12).Springer Lecture Notes in Computer Science 7288, pages 51–56, 2012.

C 50. R. Fleischer. Introducing European style education to Oman. In Proceedings of the6th Conference on eLearning Excellence in the Middle East, pages 181–184, 2014.

C 51. L. Barba, O. Cheong, J. L. de Carufel, M. G. Dobbins, R. Fleischer, A. Kawamura,M. Korman, Y. Okamoto, J. Pach, Y. Tang, T. Tokuyama, S. Verdonschot, andT. Wang. Weight balancing on boundaries and skeletons. In Proceedings of the 30thAnnual ACM Symposium on Computational Geometry (SoCG’14), pages 436–443,2014.

C 52. R. Fleischer and T. Zhang. A competitive analysis of the Windfall game. In Proceed-ings of the 7th International Conference FUN with Algorithms (FUN’14). SpringerLecture Notes in Computer Science 8496, pages 188–198, 2014.

C 53. R. Fleischer. Counting circles without computing them. In Proceedings of the8th International Conference FUN with Algorithms (FUN’16). Schloss Dagstuhl— Leibniz-Zentrum fur Informatik, Leibniz International Proceedings in Informat-ics (LIPIcs), vol. 49, pages 17:1–17:7, 2016. doi = http://dx.doi.org/10.4230/

LIPIcs.FUN.2016.17.

C 54. R. Fleischer. Elmsley’s problem revisited. In 20th Japan Conference on Discreteand Computational Geometry and Graphs (JCDCG 3 ’17), 2017.

Editorial Work

B 1. R. Fleischer, editor. Proceedings of the 22nd Workshop uber Komplexitatstheorie,effiziente Algorithmen und Datenstrukturen. Technical Report MPI-I-94-104. Max-

15

Planck-Institut fur Informatik, 66123 Saarbrucken, Germany, February 1994.

B 2. R. Fleischer, B. Moret, and E. M. Schmidt, editors. Experimental Algorithmics.Springer Lecture Notes in Computer Science 2547, 2002. 280 pages.

B 3. R. Fleischer and R. Nowakowski. Preface. Theoretical Computer Science (specialissue on the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory),313(3):313, 2004.

B 4. R. Fleischer and G. Trippen, editors. Proceedings of the 15th International Sympo-sium on Algorithms and Computation (ISAAC’04). Springer Lecture Notes in Com-puter Science 3341. Springer-Verlag, Heidelberg, 2004. 950 pages.

B 5. R. Fleischer. Guest editor’s foreword. Algorithmica (special issue on selected papersof ISAAC 2004), 46(1):1–2, 2006.

B 6. R. Fleischer. Guest editor’s foreword. International Journal of Computational Ge-ometry and Applications (special issue on selected papers of ISAAC 2004), 16(2–3):95–96, 2006.

B 7. R. Fleischer and J. Xu, editors. Proceedings of the 4th International Conference onAlgorithmic Aspects in Information and Management (AAIM’08). Springer LectureNotes in Computer Science 5034. Springer-Verlag, Heidelberg, 2008. 359 pages.

B 8. R. Fleischer and J. Xu. Guest editor’s foreword. Theoretical Computer Science(special issue on selected papers of AAIM 2008), 410(45):4533, 2009.

B 9. A. Al-Saidi, R. Fleischer, Z. Maamar, and O. F. Rana, editors. Proceedings of the1st International Conference on Intelligent Cloud Computing: Theoretical Founda-tions and Applications (ICC’14). Springer Lecture Notes in Computer Science 8993.Springer International Publishing, Cham, 2015. 169 pages.

B 10. R. Fleischer and R. Solis-Oba, editors. Proceedings of the 15th Workshop on Approx-imation and Online Algorithms (WAOA’17). Springer Lecture Notes in ComputerScience ??? Springer International Publishing, Cham, 2018.

Refereed Book Chapters

Ch 1. R. Fleischer, O. Fries, K. Mehlhorn, S. Meiser, S. Naher, H. Rohnert, S. Schirra,K. Simon, A. Tsakalidis, and C. Uhrig. Selected topics from computational geome-try, data structures and motion planning. In B. Monien and Th. Ottmann, editors,Data Structures and Efficient Algorithms: Final Report on the DFG Special JointInitiative. Springer Lecture Notes in Computer Science 594, pages 25–43. Springer-Verlag, Heidelberg, 1992.

Ch 2. R. Fleischer and C. Hirsch. Graph drawing applications. In M. Kaufmann andD. Wagner, editors, Drawing Graphs — Methods and Models, Springer LectureNotes in Computer Science 2025, chapter 1, pages 1–22. Springer-Verlag, Heidel-berg, 2001. Invited book chapter.

Ch 3. R. Fleischer and L. Kucera. Algorithm animation for teaching. In S. Diehl, editor,Software Visualization, State-of-the-Art Survey, Springer Lecture Notes in Com-puter Science 2269, pages 113–128. Springer-Verlag, Heidelberg, 2002.

Ch 4. T. C. Biedl, E. D. Demaine, R. Fleischer, and L. Jacobsen. The complexity of Click-omania. In R. J. Nowakowski, editor, More Games of No Chance — CombinatorialGames at MSRI, 2000, volume 42 of Mathematical Sciences Research Institute Pub-lications, pages 389–404. Cambridge University Press, Cambridge, England, 2002.Invited submission to a book on selected papers of the 2000 MSRI Workshop onCombinatorial Games.

Ch 5. C. McGeoch, P. Sanders, R. Fleischer, P. R. Cohen, and D. Precup. Searchingfor big-oh in the data: Inferring asymptotic complexity from experiments. In

16

R. Fleischer, B. Moret, and E. M. Schmidt, editors, Experimental Algorithmics,Springer Lecture Notes in Computer Science 2547, pages 93–126. Springer-Verlag,Heidelberg, 2002.

Ch 6. R. Fleischer and G. Trippen. On the effectiveness of visualizations in a Theory ofComputing course. In R. Lu, J. H. Siekmann, and C. Ullrich, editors, CognitiveSystems, pages 15–24. Springer Lecture Notes in Computer Science 4429, 2007.

Ch 7. R. Fleischer. Online robotics. In M.-Y. Kao, editor, Encyclopedia of Algorithms.Springer-Verlag, Heidelberg, 2008. 785–787.

Ch 8. E. D. Demaine, M. L. Demaine, R. Fleischer, R. A. Hearn, and T. von Oertzen. Thecomplexity of the Dyson Telescopes puzzle. In M. H. Albert and R. J. Nowakowski,editors, Games of No Chance 3, volume 56 of Mathematical Sciences Research Insti-tute Publications, pages 271–285. Cambridge University Press, Cambridge, England,2009.

Ch 9. R. Fleischer. Is the world linear? In S. Albers, H. Alt, and S. Naher, editors, Effi-cient Algorithms, pages 368–379. Springer Lecture Notes in Computer Science 5760,2009.

Ch 10. R. Fleischer and J. Yu. A survey of the game ”Lights Out!”. In A. Brodnik, editor,Space-Efficient Data Structures, Streams, and Algorithms. Springer Lecture Notesin Artificial Intelligence 8066, pages 176–198. Springer Lecture Notes in ComputerScience 8066, 2013.

Unrefereed Workshops and Dagstuhl Seminars

(Note: Schloss Dagstuhl is a renowned conference center for international computerscience workshops. Usually, about 40-50 of the most renowned experts in an areameet for a week to discuss recent developments. Participation is strictly by invitationonly.)

W 1. R. Fleischer. A simple balanced search tree with O(1) worst-case update time. In8th European Workshop on Computational Geometry, University of Utrecht, Nether-lands, March 12–13, 1992. A full version of this paper has appeared as conferencepaper [C 6] and as journal paper [J 7].

W 2. R. Fleischer. On the Bahncard problem. In ALCOM Workshop on On-line Algo-rithms (OLA’98), Udine, Italy, September 4–5, 1998. A full version of this paperhas appeared as conference paper [C 11] and as journal paper [J 14].

W 3. R. Fleischer. Self-organizing data structures and compression – A survey. In DI-MACS Workshop on Codes and Trees: Algorithmic and Information Theoretic Ap-proaches, DIMACS Center, Rutgers, USA, October 5–7, 1998.

W 4. R. Fleischer. Caching — A theoretician’s view. In M. Schwartzbach, M. Sagiv, andK. Weihe, editors, Dagstuhl Seminar on Programs with Recursively Defined DataStructures using Pointers, seminar no. 98161, report no. 207, page 15, April 20–24,1998.

W 5. R. Fleischer and S. Seiden. Page replication — Variations on a theme. In Inter-national Conference on Optimization (SIGOPT’99), Trier, Germany, March 22-24,1999. A full version of this paper has appeared as conference paper [C 16] andjournal paper [J 27].

W 6. R. Fleischer and C. Hirsch. Graph drawing applications. In M. Kaufmann andD. Wagner, editors, Dagstuhl GI Research Seminar on Graph Drawing, eventno. 99142, 1999. A full version of this paper has appeared as book chapter [Ch 2].

17

W 7. R. Fleischer and S. Seiden. Page replication — Variations on a theme. In A. Fiat,A. Karlin, and G. Woeginger, editors, Dagstuhl Seminar on Competitive Algorithms,seminar no. 99251, report no. 243, page 18, June 20–25, 1999. A full version of thispaper has appeared as conference paper [C 16] and journal paper [J 27].

W 8. T. Biedl, E. Cenek, T. M. Chan, E. D. Demaine, M. L. Demaine, R. Fleischer, andM.-W. Wang. Balanced colorings. In S. Albers, I. Munro, and P. Widmayer, editors,5th Dagstuhl Seminar on Data Structures, seminar no. 00091, report no. 267, page 8,February 27–March 3, 2000. A full version of this paper has appeared as conferencepaper [C 14] and as journal paper [J 16].

W 9. R. Fleischer. Algorithm animation for teaching. In S. Diehl, P. Eades, and J. Stasko,editors, Dagstuhl Seminar on Software Visualization, seminar no. 01211, reportno. 307, May 20–25, 2001. A full version of this paper has appeared as book chap-ter [Ch 3].

W 10. R. Fleischer. Fun and frustration — One year teaching at HKUST. In Proceedings ofthe First Teaching and Learning Symposium by the Teaching Community of HKUST— Teaching Innovations: Fostering a Creative and Collaborative Environment, pages42–45, HKUST, Hong Kong, Dec 12, 2001.

W 11. R. Fleischer, K. Romanik, S. Schuierer, and G. Trippen. Optimal robot localiza-tion in trees. In Proceedings of the 3rd ACM (Hong Kong Chapter) PostgraduateResearch Day, University of Hong Kong, February 2, 2002.

W 12. R. Fleischer and S. U. Khan. Xiangqi and combinatorial game theory. In E. D.Demaine, R. Fleischer, A. Fraenkel, and R. Nowakowski, editors, Dagstuhl Seminaron Algorithmic Combinatorial Game Theory, seminar no. 02081, report no. 334,February 17–22, 2002.

W 13. P. Crescenzi, N. Faltin, R. Fleischer, C. Hundhausen, S. Naher, G. Roßling,J. Stasko, and E. Sutinen. AAR — The Algorithm Animation Repository. InS. Albers, R. Sedgewick, and P. Widmayer, editors, Dagstuhl Seminar on DataStructures, seminar no. 02091, report no. 335, February 24–March 1, 2002. A fullversion of this paper has appeared as conference paper [C 21].

W 14. R. Fleischer and G. Trippen. Experimental studies of graph traversal algorithms.In S. Albers, A. Fiat, and G. Woeginger, editors, Dagstuhl Seminar on Online Al-gorithms, seminar no. 02271, report no. 347, June 30–July 5, 2002. A full version ofthis paper has appeared as conference paper [C 23].

W 15. P. Crescenzi, N. Faltin, R. Fleischer, C. Hundhausen, S. Naher, G. Roßling,J. Stasko, and E. Sutinen. AAR — The Algorithm Animation Repository. In ITI-TCS Day 7 — WG 2002 Satellite, Prague, Czech Republic, June 11, 2002. A fullversion of this paper has appeared as conference paper [C 21].

W 16. R. Fleischer, M. Golin, C.-T. Lea, and S. Wong. MRE routing. In S. Albers,A. Fiat, and G. Woeginger, editors, Dagstuhl Seminar on Online Algorithms, sem-inar no. 02271, report no. 347, June 30–July 5, 2002. A full version of this paperhas appeared as conference paper [C 25] and journal paper [J 23].

W 17. R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Competitivesearch in unknown environments. In R. Fleischer, R. Klein, and A. Lopez-Ortiz,editors, Dagstuhl Seminar on Robot Navigation, seminar no. 03501, Dec 7–12, 2003.http://www.dagstuhl.de/03501/Proceedings. A full version of this paper has ap-peared as workshop paper [W 21], conference paper [C 27], and journal paper [J 31].

W 18. R. Fleischer and G. Trippen. Planar graph exploration. In R. Fleischer, R. Klein,and A. Lopez-Ortiz, editors, Dagstuhl Seminar on Robot Navigation, seminarno. 03501, Dec 7–12, 2003. http://www.dagstuhl.de/03501/Proceedings.

18

W 19. R. Fleischer. Online problems in robotics. In R. Fleischer, R. Klein, and A. Lopez-Ortiz, editors, Dagstuhl Seminar on Robot Navigation, seminar no. 03501, Dec 7–12,2003. http://www.dagstuhl.de/03501/Proceedings.

W 20. R. Fleischer and G. Trippen. Kayles on the way to the stars. In Proceedings of the5th ACM (Hong Kong Chapter) Postgraduate Research Day, Chinese Universityof Hong Kong, January 31, 2004. A full version of this paper has appeared asconference paper [C 30].

W 21. R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Competi-tive search ratio of graphs and polygons. In Proceedings of the 20th EuropeanWorkshop on Computational Geometry (EWCG’04), 2004. 4 pages. See http:

//www.us.es/ewcg04/EWCG04.htm. A full version of this paper has appeared asconference paper [C 27] and as journal paper [J 31].

W 22. R. Fleischer. Just-in-time: Better teaching in Hong Kong. In Proceedings of theSecond Teaching and Learning Symposium by the Teaching Community of HKUST— Teaching Innovations: Continuous Learning and Improvement, May 2004. 4pages.

W 23. R. Fleischer. COMP 272: Theory of Computing — A study on the learning ef-fectiveness of visualizations. In Proceedings of the Second Teaching and LearningSymposium by the Teaching Community of HKUST — Teaching Innovations: Con-tinuous Learning and Improvement, May 2004. 3 pages.

W 24. A. Eubeler, R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen.Competitive online searching for a ray in the plane. In Proceedings of the 21stEuropean Workshop on Computational Geometry (EWCG’05), pages 107–110, 2005.

W 25. R. Fleischer. Die another day. In L. Arge, R. Sedgewick, and D. Wagner, edi-tors, Dagstuhl Seminar on Data Structures, seminar no. 06091, Feb 26–Mar 3, 2006.http://drops.dagstuhl.de/portals/index.php?semnr=06091. A full version ofthis paper has appeared as conference paper [C 34] and as journal paper [J 32].

W 26. S. Fekete, R. Fleischer, R. Klein, and A. Lopez-Ortiz. Executive summary —robot navigation. In F. Sandor, R. Fleischer, R. Klein, and A. Lopez-Ortiz, edi-tors, Dagstuhl Seminar on Robot Navigation, seminar no. 06421, Oct 15–20, 2006.http://drops.dagstuhl.de/portals/index.php?semnr=06421.

W 27. A. Eubeler, R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen.Competitive online searching for a ray in the plane. In S. Fekete, R. Fleischer,R. Klein, and A. Lopez-Ortiz, editors, Dagstuhl Seminar on Robot Navigation, sem-inar no. 06421, Oct 15–20, 2006. http://drops.dagstuhl.de/portals/index.

php?semnr=06421.

W 28. A. Eubeler, R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen.Searching for rays and lower bound constructions. In Proceedings of the 22nd Eu-ropean Conference on Operational Research (EURO XXII), page 65, 2007.

W 29. R. Fleischer. To share or not to share? An approximate answer. In 3rd BertinoroWorkshop on Algorithms and Data Structures (ADS’07), Sep 30–Oct 5, 2007. http://www.dis.uniroma1.it/~demetres/events/ads07/.

W 30. R. Fleischer and Y. Miao. A new FPT algorithm for the edge dominating set prob-lem. In Abstracts of the 2nd Annual Meeting of Asian Association for Algorithmsand Computation (AAAC’09), 2009.

W 31. R. Fleischer and Y. Wang. On the camera placement problem. In Abstracts ofthe 2nd Annual Meeting of Asian Association for Algorithms and Computation(AAAC’09), 2009. A full version of this paper has appeared as conference pa-per [C 41].

19

W 32. R. Fleischer, X. Wu, and L. Yuan. Experimental study of FPT algorithms for thedirected feedback vertex set problem. In Abstracts of the 2nd Annual Meeting ofAsian Association for Algorithms and Computation (AAAC’09), 2009. A full versionof this paper has appeared as conference paper [C 40].

W 33. R. Fleischer, X. Wu, and L. Yuan. Experimental study of FPT algorithms for thedirected feedback vertex set problem. In J. Barbay, R. Klein, A. Lopez-Ortiz, andR. Niedermeier, editors, Dagstuhl Seminar on Adaptive, Output Sensitive, Onlineand Parameterized Algorithms, seminar no. 09171, Apr 19–24, 2009. http://www.

dagstuhl.de/en/program/calendar/semhp/?semnr=09171. A full version of thispaper has appeared as conference paper [C 40].

W 34. R. Fleischer and T. Zhang. Two online maximization problems with look-ahead.In Abstracts of the 2nd Annual Meeting of Asian Association for Algorithms andComputation (AAAC’09), 2009.

W 35. R. Fleischer and G. J. Woeginger. An algorithmic analysis of the Honey Bee Game.In Abstracts of the 3rd Annual Meeting of Asian Association for Algorithms andComputation (AAAC’10), 2010. A full version of this paper has appeared as con-ference paper [C 42] and as journal paper [J 41].

W 36. R. Fleischer and X. Xu. Minimum diameter color-spanning sets. In Abstracts ofthe 3rd Annual Meeting of Asian Association for Algorithms and Computation(AAAC’10), 2010. A full version of this paper has appeared as conference pa-per [C 44] and has appeared as journal paper [J 39].

W 37. S. Z. Chen, R. Fleischer, and J. Li. Densest k-subgraph approximation on inter-section graphs. In Abstracts of the 3rd Annual Meeting of Asian Association forAlgorithms and Computation (AAAC’10), 2010. A full version of this paper hasappeared as conference paper [C 45].

W 38. R. Fleischer, J. Guo, R. Niedermeier, J. Uhlmann, Y. Wang, M. Weller, and X. Wu.Extended islands of tractability for parsimony haplotyping. In Abstracts of the 3rdAnnual Meeting of Asian Association for Algorithms and Computation (AAAC’10),2010. A full version of this paper has appeared as conference paper [C 43].

W 39. R. Fleischer, Y. Wang, and X. Wu. Greedily monitoring edges in a flow network. InProceedings of the 8th International Conference on Optimization: Techniques andApplications (ICOTA’10), page 114, 2010.

W 40. R. Fleischer, Y. Wang, and X. Wu. Greedily monitoring edges in a flow network.In Abstracts of the 4th Annual Meeting of Asian Association for Algorithms andComputation (AAAC’11), 2011. Short abstract.

W 41. R. Fleischer and X. Wu. Edge clique partition of K4-free and planar graphs. InAbstracts of the 4th Annual Meeting of Asian Association for Algorithms and Com-putation (AAAC’11), 2011. Short abstract. A full version of this paper has appearedas conference paper [C 47].

W 42. R. Fleischer. AE meets GD. In C. Demetrescu, M. Kaufmann, S. Kobourov, andP. Mutzel, editors, Dagstuhl Seminar on Graph Drawing with Algorithm EngineeringMethods (Seminar no. 11191), Dagstuhl Reports vol. 1, no. 5, page 51, May 8–13,2011. http://drops.dagstuhl.de/opus/volltexte/2011/3204/.

W 43. R. Fleischer. The Hydra game. In International Workshop in Mathematics in Oman2012, 2012.

W 44. L. Brueggeman, M. Fellows, R. Fleischer, M. Lackner, C. Komusiewicz, Y. Koutis,A. Pfandler, and F. Rosamond. Train marshalling is fixed parameter tractable. InM. R. Fellows, J. Guo, D. Marx, and S. Saurabh, editors, Dagstuhl Seminar on DataReduction and Problem Kernels (Seminar no. 12241), Dagstuhl Reports vol. 2, no. 6,

20

page 33, June 10–15, 2012. http://drops.dagstuhl.de/opus/volltexte/2012/

3729/. A full version of this paper has appeared as conference paper [C 49].

W 45. J. Kim, P. Eades, R. Fleischer, S.-H. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi,and T. Tokuyama. Order-preserving matching. In Abstracts of the 6th AnnualMeeting of Asian Association for Algorithms and Computation (AAAC’13), 2013.A full version of this paper has appeared as journal paper [J 43].

W 46. L. Barba, J. L. de Carufel, R. Fleischer, A. Kawamura, M. Korman, Y. Okamoto,Y. Tang, T. Tokuyama, S. Verdonschot, and T. Wang. Geometric weight balanc-ing. In Abstracts of the 6th Annual Meeting of Asian Association for Algorithmsand Computation (AAAC’13), 2013. A full version of this paper has appeared asconference paper [C 51].

W 47. L. Barba, J. L. de Carufel, R. Fleischer, A. Kawamura, M. Korman, Y. Okamoto,Y. Tang, T. Tokuyama, S. Verdonschot, and T. Wang. Geometric weight balancing.In 16th Japan Conference on Discrete and Computational Geometry and Graphs(JCDCG’13), 2013. A full version of this paper has appeared as conference pa-per [C 51].

W 48. R. Fleischer and M. Golin. Realising 2D-embedded partial orders. In 16th JapanConference on Discrete and Computational Geometry and Graphs (JCDCG’13),2013.

W 49. L. Barba, O. Cheong, J. L. de Carufel, M. Dobbins, R. Fleischer, A. Kawamura,M. Korman, Y. Okamoto, J. Pach, Y. Tang, T. Tokuyama, S. Verdonschot, andT. Wang. Geometric weight balancing in 3D. In Abstracts of the 7th Annual Meet-ing of Asian Association for Algorithms and Computation (AAAC’14), 2014. A fullversion of this paper has appeared as conference paper [C 51].

W 50. R. Fleischer, S. G. Kobourov, T. Mchedlidze, W. Meulemans, A. Quigley, and B. E.Rogowitz. Report of the Working Group on Cognition. In U. Brandes, I. Finocchi,M. Nollenburg, and A. Quigley, editors, Empirical Evaluation for Graph Drawing(Dagstuhl Seminar 15052), Dagstuhl Reports vol. 5, issue 1, pp. 243–258, pages 252–254, January 25–30, 2015. http://drops.dagstuhl.de/opus/volltexte/2015/

5041.

Technical Reports

(Only reports that have not appeared as a refereed paper)

R 1. R. Fleischer and S. U. Khan. Xiangqi and combinatorial game theory. Technical Re-port HKUST-TCSC-2002-01, The Hong Kong University of Science and Technolgoy,February 2002. 12 pages.

5. ServiceProfessional Service

• Advisory Boards:

∗ Since Mar 2006: Member of the AAIM Steering Committee.

∗ May 2010–Dec 2014: Member of the Support Board of the JAIST Center for Grad-uate Education Initiative.

∗ Jan–Dec 2011: Founding chair of the Shanghai ACM SIGACT Chapter.

• Editorial boards:

21

1. Since Aug 2006: Computational Geometry: Theory and Applications, editor.

2. Since Nov 2008: Frontiers of Computer Science, editor.

• Guest editor:

1. Experimental Algorithmics. Springer Lecture Notes in Computer Science, volume2547, 280 pages, 2002. Springer Verlag, Heidelberg. Co-editors: Erik MeinecheSchmidt (Aarhus) and Bernard Moret (Albuquerque).

2. Theoretical Computer Science A, special issue on the 2002 Dagstuhl Seminar onAlgorithmic Combinatorial Game Theory, vol. 313 (3), 2004. Co-editor: RichardNowakowski (Dalhousie).

3. Algorithmica, special issue on ISAAC 2004, vol. 46, 2006.

4. International Journal of Computational Geometry and Applications, special issueon ISAAC 2004, vol. 16, 2006.

5. Theoretical Computer Science A, special issue on AAIM 2008, vol. 410, 2009.

6. Theory of Computing Systems (TOCS), special issue on WAOA 2017, to appear in2018.

• Conference program committees:

1. Jun 12–14, 2000: Video Chair of the 16th Annual Symposium on ComputationalGeometry (SoCG 2000), Hong Kong.

2. Sep 19–22, 2000: GI Informatik 2000 — Junge Informatik, Berlin, Germany.

3. Jan 5–6, 2001: 3rd Workshop on Algorithm Engineering and Experiments (ALENEX2001), Washington DC, USA.

4. Nov 21–23, 2002: 13th Annual International Symposium on Algorithms and Com-putation (ISAAC 2002), Vancouver, Canada.

5. Sep 16–20, 2003: ESA Satellite Workshop on Approximation and Online Algorithms(WAOA 2003), Budapest, Hungary.

6. Dec 15–17, 2003: 14th Annual International Symposium on Algorithms and Com-putation (ISAAC 2003), Kyoto, Japan.

7. May 26–28, 2004: 3rd International Conference Fun with Algorithms (FUN 2004),Isola d’Elba, Italy.

8. Jul 20–22, 2004: 31th International Colloquium on Automata, Languages and Pro-gramming (ICALP 2004), Track A, Turku, Finland.

9. Dec 20–22, 2004: (PC chair and organizer) 15th Annual International Symposiumon Algorithms and Computation (ISAAC 2004), Hong Kong.

10. May 10–13, 2005: 4th International Workshop on Efficient and Experimental Al-gorithms (WEA 2005), Santorini Island, Greece.

11. Dec 19–21, 2005: 16th Annual International Symposium on Algorithms and Com-putation (ISAAC 2005), Sanya, Hainan, China.

12. Jun 20–22, 2006: 2nd International Conference on Algorithmic Aspects in Infor-mation and Management (AAIM 2006), Hong Kong.

13. Aug 16–18, 2006: 12th Annual International Computing and Combinatorics Con-ference (COCOON 2006), Taipei, Taiwan.

14. Feb 20–22, 2007: 24th International Symposium on Theoretical Aspects of ComputerScience (STACS 2007), Aachen, Germany.

15. May 22–25, 2007: 4th Annual Conference on Theory and Applications of Models ofComputation (TAMC 2007), Shanghai, China.

16. Jun 6–8, 2007: 3rd International Conference on Algorithmic Aspects in Informationand Management (AAIM 2007), Portland, USA.

22

17. Jun 6–9, 2007: 6th International Workshop on Efficient and Experimental Algo-rithms (WEA 2007), Rome, Italy.

18. Aug 12–15, 2007: First International Conference on Combinatorial Optimizationand Applications (COCOA 2007), Xi’an, China.

19. Apr 25–29, 2008: 5th Annual Conference on Theory and Applications of Models ofComputation (TAMC 2008), Xian, China.

20. Jun 23–25, 2008: (PC co-chair and organizer) 4th International Conference onAlgorithmic Aspects in Information and Management (AAIM 2008), Shanghai,China.

21. Feb 18–20, 2009: 3rd Workshop on Algorithms and Computation (WALCOM 2009),Kolkata, India.

22. Apr 11–12, 2009: 2nd Annual Meeting of the Asian Association for Algorithms andComputation (AAAC 2009), Hangzhou, China.

23. Jun 10–12, 2009: 3rd International Conference on Combinatorial Optimization andApplications (COCOA 2009), Yellow Mountains, China.

24. Jun 16–18, 2009: 5th International Conference on Algorithmic Aspects in Informa-tion and Management (AAIM 2009), San Francisco, USA.

25. Jun 20–23, 2009: 3rd International Frontiers of Algorithmics Workshop (FAW2009), Hefei, China.

26. Dec 17–20, 2009: 16th IEEE International Conference on High Performance Com-puting (HiPC 2009), Cochin, India.

27. Apr 17–19, 2010: 3rd Annual Meeting of the Asian Association for Algorithms andComputation (AAAC 2010), Pohang, South Korea.

28. Aug 11–13, 2010: 4th International Frontiers of Algorithmics Workshop (FAW2010), Wuhan, China.

29. Aug 18–22, 2010: 5th International Conference on Frontiers of Computer Scienceand Technology (FCST 2010), Changchun, China.

30. Sep 9–10, 2010: 8th Workshop on Approximation and Online Algorithms (WAOA2010), Liverpool, United Kingdom.

31. Dec 15–17, 2010: 21st Annual International Symposium on Algorithms and Com-putation (ISAAC 2010), Jeju Island, South Korea.

32. Feb 18–20, 2011: 5th Workshop on Algorithms and Computation (WALCOM 2011),New Delhi, India.

33. Apr 16–17, 2011: 4th Annual Meeting of the Asian Association for Algorithms andComputation (AAAC 2011), Hsinchu, Taiwan.

34. May 28–31, 2011: 7th International Conference on Algorithmic Aspects in Informa-tion and Management (AAIM 2011), joint FAW-AAIM conference, Jinhua, China.

35. Sep 5–9, 2011: 19th Annual European Symposium on Algorithms, Track B (ESA2011), Saarbrucken, Germany.

36. Sep 8–9, 2011: 9th Workshop on Approximation and Online Algorithms (WAOA2011), Saarbrucken, Germany.

37. Sep 26–27, 2011: (publication chair) 2011 Advanced Parallel Processing TechnologySymposium (APPT 2011), Shanghai, China.

38. Nov 16–18, 2011: 6th International Conference on Frontier of Computer Scienceand Technology (FCST 2011), Theoretical Computer Science Track, Changsha,China.

23

39. Apr 21–22, 2012: (Organizer and PC chair) 5th Annual Meeting of the Asian As-sociation for Algorithms and Computation (AAAC 2012), Shanghai, China.

40. May 21–25, 2012: 25th IEEE International Parallel and Distributed ProcessingSymposium (IPDPS 2012), Algorithm Track, Shanghai, China.

41. Aug 20–22, 2012: 18th Annual International Computing and Combinatorics Con-ference (COCOON 2012), Sydney, Australia.

42. Aug 27–31, 2012: 37th International Symposium on Mathematical Foundations ofComputer Science (MFCS 2012), Bratislava, Slovakia.

43. Nov 21–23, 2012: 7th International Conference on Frontier of Computer Scienceand Technology (FCST 2012), Parallel and Distributed Computing Track, Suzhou,China.

44. Dec 6–8, 2012: Thailand-Japan Joint Conference on Computational Geometry andGraphs (TJJCCGG 2012), Bangkok, Thailand.

45. Dec 19–21, 2012: 23rd Annual International Symposium on Algorithms and Com-putation (ISAAC 2012), Taipei, Taiwan.

46. Aug 19–23, 2013: 19th International Symposium on Fundamentals of ComputationTheory (FCT 2013), Liverpool, UK.

47. Jan 5, 2014: 16th Meeting on Algorithm Engineering and Experiments (ALENEX2014), Portland, Oregon, USA.

48. Feb 24–26, 2014: (Organizer and PC member) International Conference on Intel-ligent Cloud Computing: Theoretical Foundations and Applications (ICC 2014),Muscat, Oman.

49. Sep 7–10, 2014: 3rd Workshop on Techniques and Applications for Mobile Com-munications & Commerce (TAMoCo 2014), Warsaw, Poland.

50. May 26–29, 2015: 11th International Conference Beyond Databases, Architecturesand Structures (BDAS 2015), Ustron, Poland.

51. Aug 5–7, 2015: 16th Algorithms and Data Structures Symposium (WADS 2015),Victoria, Canada.

52. Sep 14–16, 2015: 18th Japan Conference on Discrete and Computational Geometryand Graphs (JCDCG2 2015), Kyoto, Japan.

53. Feb 23–25, 2016: Innovative Information Systems for Societal Advancement (IISSA2016), Sur, Oman.

54. Mar 15–16, 2016: The 3rd MEC IEEE International Conference on Big Data andSmart Cities (ICBDSC 2016), Muscat, Oman.

55. May 31–Jun 3, 2016: 12th International Conference Beyond Databases, Architec-tures and Structures (BDAS 2016), Ustron, Poland.

56. Nov 18–20, 2016: International Conference on Computational Intelligence in In-formation Systems (CIIS 2016), Brunei.

57. Dec 12–14, 2016: 27th International Symposium on Algorithms and Computation(ISAAC 2016), Sydney, Australia.

58. Dec 15–17, 2016: 10th IEEE International Conference on Open Source Systems andTechnologies (ICOSST 2016), Lahore, Pakistan.

59. Apr 3–5, 2017: 9th Asian Conference on Intelligent Information and Database Sys-tems (ACIIDS 2017), Special Session on Scalable Data Analysis in Bioinformaticsand Biomedical Informatics (SDABBI), Kanazawa, Japan.

60. Jun 23–25, 2017: 11th International Frontiers of Algorithmics Workshop (FAW2017), Chengdu, China.

24

61. Jul 14–15, 2017: International Conference on Computational Intelligence and DataEngineering (ICCIDE 2017), Mylavaram, India.

62. Sep 7–8, 2017: (PC co-chair) The 15th Workshop on Approximation and OnlineAlgorithms (WAOA 2017), Vienna, Austria.

63. Dec 18–20, 2017: 11th IEEE International Conference on Open Source Systems andTechnologies (ICOSST 2017), Lahore, Pakistan.

64. Mar 26–28, 2018: The International Conference Towards Extensible and AdaptableMethods in Computing 2018 (TEAMC 2018), New Delhi, India.

65. Jun 13–15, 2018: 9th International Conference Fun with Algorithms (FUN 2018),La Maddalena Island, Italy.

• Organization of conferences:

1. Feb 1994: 22nd GI-Workshop Komplexitatstheorie und effiziente Algorithmen, Saar-brucken.

2. Sep 11–15, 2000: (Main organizer) Dagstuhl Seminar on Experimental Algorith-mics. Co-organizers: Bernard Moret (University of Texas at Albuquerque) andErik Meineche Schmidt (University of Aarhus, Denmark).

3. Jun 7–10, 2001: Invited workshop leader Elite Universities and Research Networksfor the Stimulation of Innovation. 4th East Asia Symposium Innovation and itsGeneral Conditions: Initiative, Departure, Establishment, Beijing, PRC. Organizedby the German National Scholarship Foundation, the Ministry of Education of thePRC, the China Scholarship Council Beijing, and the East Asia Institute Lud-wigshafen.

4. Feb 18–22, 2002: (Main organizer) Dagstuhl Seminar on Algorithmic Combinato-rial Game Theory. Co-organizers: Erik Demaine (University of Waterloo, Canada),Aviezri Fraenkel (Weizmann Institute, Israel), and Richard Nowakowski (Univer-sity of Dalhousie, Canada).

5. Sep 9–13, 2002: (Main organizer) Dagstuhl Seminar on Experimental Algorithmics.Co-organizers: Jon Bentley (Avaya, USA), Bernard Moret (University of Texas atAlbuquerque, USA), and Erik Meineche Schmidt (University of Aarhus, Denmark).

6. Dec 8–12, 2003: (Co-organizer) Dagstuhl Seminar on On-Line Navigation. Co-organizers: Rolf Klein (University of Bonn, Germany) and Alejandro Lopez-Ortiz(University of Waterloo, Canada).

7. Dec 20–22, 2004: (Organizer and PC chair) 15th Annual International Sympo-sium on Algorithms and Computation (ISAAC 2004), Hong Kong. Supported byCroucher Foundation (HKD 100,000) and KC Wong Foundation (HKD 40,000).

8. Oct 15–20, 2006: (Co-organizer) Dagstuhl Seminar on Robot Navigation. Co-organizers:Sandor Fekete (University of Braunschweig, Germany), Rolf Klein (University ofBonn, Germany), and Alejandro Lopez-Ortiz (University of Waterloo, Canada).

9. Oct 14–19, 2007: (Co-organizer) International Xu Guangqi Conference. Shanghai,China.

10. Jun 17–21, 2008: (Main organizer) Summer School on FPT Algorithms. Shanghai,China. Co-organizer: Chen Yijia (SJTU, Shanghai, China) and Jianer Chen (TexasA&M, USA). Supported by NSFC (RMB 30,000).

11. Jun 23–25, 2008: (Main organizer and PC co-chair) 4th International Conferenceon Algorithmic Aspects in Information and Management (AAIM 2008), Shanghai,China. Co-organizer: Xu Jinhui (University of Buffalo, USA). Supported by NSFC(RMB 30,000).

12. Jul 4–15, 2010: (Organizer) International Summer School on Algorithmic Game

25

Theory (GAME 2010), Shanghai, China. Supported by Shanghai Government Ed-ucation Committee (RMB 20,000) and School of Computer Science, Fudan (RMB30,000).

13. Aug 28–Sep 1, 2010: (Main organizer) Joint German-Sino Workshop on AlgorithmEngineering (AE 2010), Shanghai, China. Co-organizer: Peter Sanders (KIT, Karl-sruhe, Germany). Supported by Sino-German Center for Research Promotion inBeijing (DFG and NSFC), (RMB 166,360 and Euro 15,000).

14. Apr 21–22, 2012: (Organizer and PC chair) 5th Annual Meeting of the Asian As-sociation for Algorithms and Computation (AAAC 2012), Shanghai, China.

15. Feb 18–22, 2013: (Main organizer) Workshop on FPT Algorithms and AlgorithmEngineering (Mostly Not About Graphs), Muscat, Sultanate of Oman. Co-organizers:Michael Fellows (Charles Darwin University, Darwin, Australia), Kurt Mehlhorn(MPI for Informatics, Saarbrucken, Germany), and Saket Saurabh (IMS Chennai,India).

16. Feb 24–26, 2014: (Main organizer and PC member) International Conference on In-telligent Cloud Computing: Theoretical Foundations and Applications (ICC 2014),Muscat, Oman.

17. Nov 11–13, 2015: (Co-organizer) Sixth International Conference on MathematicalAspects of Computer and Information Sciences (MACIS 2015), Special Session(SS10) on Algorithm Engineering in Geometric Computing, Berlin, Germany.

• Invited Talks:

1. Aug, 2006: Search and exploration of unknown graphs, The 19th International Sym-posium on Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil, Jul30–Aug 4, 2006.

2. Oct 26, 2006: Alternative Models of Computation, BASICS 2006 Summer School,SJTU, Shanghai, China, Oct 26–29, 2006.

3. Feb 6, 2007: Die another day, PICB Mini Symposium on Combinatorial ProblemsArising in Computational Biology, PICB, Shanghai, China, Feb 6, 2007.

4. Oct 9, 2007: Geometric shape matching, DAAD Summer School on Methods fromMathematics and Computer Science for Pattern Recognition in Biology, PICB,Shanghai, China, Sep 30–Oct 13, 2007.

5. Nov 17, 2008: Online problems in robotics, 50th Anniversary of the Departmentof Computer Science and Engineering, Shanghai Jiaotong University, Nov 17–21,2008.

6. Dec 20, 2008: Some little combinatorial problems in discrete geometry and ongraphs. Joint Meeting of the American Mathematical Society and Shanghai Math-ematical Society, Shanghai, China, Dec 17–21, 2008.

7. Jun 25, 2010: FPT algorithms and bioinformatics, University of Greifswald, Ger-many.

8. Dec 10, 2010: Greedily monitoring edges in a flow network. 8th International Con-ference on Optimization: Techniques and Applications (ICOTA 2010), Shanghai,China, Dec 10–13, 2010.

9. Jan 22, 2011: FPT algorithms and bioinformatics, Zhejiang University, Hangzhou,China.

10. May 17, 2011: FPT algorithms and bioinformatics, RWTH Aachen, Germany.

11. Dec 19, 2011: International Conference on Mathematical and Computational Mod-els (ICMCM 2011), PSG College of Technology, Coimbatore, India, Dec 19–21,2011.

26

12. May 27, 2012: Algorithmic challenges in operating a data centre, DCD ConvergedMuscat 2012, Muscat, Sultanate of Oman, May 27–28, 2012.

13. Oct 31, 2012: E-government adoption in public administration organizations, AsianeServices Centre Workshop, Shanghai, China.

14. Dec 17–18, 2014: 1st International Conference on Computational Systems andCommunication (ICCSC 2014), LBS Institute of Technology for Women, Trivan-drum, Kerala, India. The conference was later cancelled.

• Team Coach:

1. Nov 21-24, 2013: 16th ACM Arab Collegiate Programming Contest (ACPC 2013),Sharm el Sheikh, Egypt, coach of the GUtech Eagles Programming Team, winningthe Gulf Championship.

2. Nov 6–8, 2015: 12th World Robot Olympiad (WRO 2015), Doha, Qatar, coach ofthe GUtech Robot College Team.

3. Apr 26–27, 2016: 3rd ACM Oman Collegiate Programming Contest (OCPC 2016),Muscat, Oman, coach of the GUtech Eagles and GUtech Owls Programming Teams.

4. Nov 11-15, 2016: 19th ACM Arab Collegiate Programming Contest (ACPC 2016),Sharm el Sheikh, Egypt, coach of the GUtech Owls Programming Team, winningthe Gulf Championship.

5. Nov 25–27, 2016: 13th World Robot Olympiad (WRO 2016), New Dehli, India,coach of the GUtech Robot College Team.

• External PhD Committees:

1. Feb 2001: Isaac K. K. To, Hong Kong University, Hong Kong.

2. Mar 2005: Gianni Franceschini, University of Pisa, Italy.

3. Jan 2009: Zhang Lele, University of Melbourne, Australia.

4. Apr 2010: Jian Xia, HKUST, Hong Kong.

• Scholarship selection committees:

1. Jun 1998 (also invited in 1999 and 2000): Studienstiftung des Deutschen Volkes(German National Academic Foundation), Saarbrucken.

2. Mar 1999: 34th Jugend forscht, regional contest Saarland (a German competitionfor young scientists at the high school level), Saarbrucken.

3. Mar 2001: AIESEC Marco Polo Project (internship exchange project with Karl-sruhe, Germany), HKUST.

4. Dec 2001 and Dec 2002: AIESEC Internship Exchange Program, HKUST.

5. May 2002: AEARU Summer Camp, HKUST.

6. Jun 2008: DAAD PhD scholarships, Beijing.

• Panelist:

1. May 2002: Panel on Teaching Experience Survey, HKUST.

• Review committees:

1. Mar 1997: Hong Kong Research Grants Council.

2. Mar 1998: Hong Kong Research Grants Council.

3. Jun 1999: EU Fifth Framework Programme.

4. May 2000: NSF ITR, panel member.

5. May 2002: Hong Kong Research Grants Council.

6. May 2003: EU Sixth Framework Programme, panel member and rapporteur.

7. Feb 2004: EU Sixth Framework Programme.

27

8. Jul 2009: Leibniz Zentrum fur Informatik (LZI — Schloss Dagstuhl), Leibniz So-ciety, Germany.

9. Feb 2010: EU Seventh Framework Programme.

10. Aug 2010: Austrian Science Fund (FWF).

11. Sep 2012: 2012 Sultan Qaboos Award for Excellence in eGovernment, assessor.

12. Oct 2012: Ministry of Higher Education, Oman, program reviewer.

13. Since Sep 2014: Open Research Grant (ORG) Committee in the Information andCommunications Technologies (ICT) Sector, The Research Council of Oman (TRC),member.

14. Oct 2015: Oman National Robot Olympiad (NRO 2015), judge.

• Book reviews:

1. Aug 2001: A. K. Peters.

2. Aug 2007: Springer.

• I worked as a referee for many major journals and conferences in theoretical computerscience.

• Membership in professional organizations:

1. Jan 1985–Dec 1999: Member of the GI (Gesellschaft fur Informatik = GermanComputer Science Society).

2. Since Sep 1998: Founding member of the Verein der Freunde der Saarbrucker Infor-matik e.V. (Society of the Friends of Computer Science at Universitat Saarbrucken).

3. Since Feb 2000: Member of the Association of Computing Machinery (ACM). SeniorMember since 2006.

4. Since Apr 2008: Member of the Asian Association for Algorithms and Computation(AAAC).

5. Since May 2017: Internal Assessor of the European Foundation for Quality Man-agement (EFQM).

University Service

• Saarbrucken:

1. Jun 1992–Jun 1998: Member of the Board of the MPI-INF.

2. Jun 1992–Jun 1998 (two three-year terms): Elected representative of the staff ofthe MPI-INF, in the Scientific Council of the Max Planck Society. There, I servedon the Europolitical Advisory Committee, the Strategical Planning Committee,the Public Relations Council, and several appointment committees for Max Planckdirectors.

3. Sep 1998–Aug 1999: Coordinator of the DFG Graduate School Efficiency und Com-plexity of Algorithms and Computers on behalf of Prof Kurt Mehlhorn.

• Waterloo:No committee duties.

• HKUST:

1. Aug 2000–Aug 2003: Postgraduate Committee, Department of Computer Science.Department level.

2. Dec 2000–Jun 2002: HKUST Standing List of Potential Hearing Committee forStaff Grievances. University level.

3. Aug 2001–Aug 2003: Organizer of the Computer Science Theory Group Seminar.Department level.

28

4. Sep 2001–Aug 2003: Research Travel Grant Faculty Review Committee. Universitylevel.

5. Sep 2001–Aug 2003: (Chair) Recruiting Committee, Department of Computer Sci-ence. Department level.

6. Jan 2002–Dec 2003: Senate of HKUST, elected representative of School of Engi-neering. University level.

7. Jan 2002–Jun 2004: Warden of PG Hall 2. University level.

8. Jun 2002–May 2004: HKUST Technology Review Committee. University level.

9. Jul 2002–Jun 2004: Senate Committee on Teaching and Learning Quality. Univer-sity level.

10. Sep 2003–Jun 2004: Facilities Committee, Department of Computer Science. De-partment level.

• Fudan:No committee duties.

• GUtech:

1. Dec 2011–Mar 2016: Head of Department of Computer Science.

2. Dec 2011–Mar 2016: Head of the Computer Science Department Curriculum Re-view Committee.

3. Since Jan 2012: Member of the University Student Affairs Steering Committee.

4. Since Nov 2012: Member of the University IT Support Steering Committee.

5. Jun–Dec 2012: Head of the University Website Development Team.

6. Jan 2013–Mar 2016: Dean, Faculty of Engineering and Computer Science.

7. Since May 2013: Head of the University Academic Regulations Review Committee.

8. Nov 2013–Mar 2016: Member of the University Curriculum Development Commit-tee.

9. Nov 2013–Mar 2016: Member of the University Research Chair Planning Commit-tee.

10. Nov 2013–Mar 2015: Member of the ACQUIN Reaccreditation Committee, respon-sible for the Computer Science Department Report and most of the UniversityReport.

11. Since Jan 2014: Head of the GUtech Blended Learning Committee.

29