March 7, 2019

CURRICULUM VITAE - Shmuel Zaks

Birth-date: August 21, 1949Place of Birth: IsraelMarital Status: Married + 4Citizenship: IsraelAddress: 23 Ha‘Hagana Street, Kiriat-Ata, IsraelTel: +972-4-8448736 (home), +972-4-8294329 (office), 972-54-4948746 (cellular)Email: zaks@cs.technion.ac.il

Academic degrees

1979 Ph.D., Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illi-nois, U.S.A.

1972 M.Sc., Mathematics, Technion, Israel.1971 B.Sc. (Cum Laude), Mathematics, Technion, Israel.

Academic positions

Since 2008 Joan Callner-Miller Chair in Computer Science, Technion, Israel.Since 1999 Professor, Computer Science Dept., Technion, Israel.1989 - 1998 Associate Professor, Computer Science Dept., Technion, Israel.1981 - 1989 Senior Lecturer, Computer Science Dept., Technion, Israel.1979 - 1980 Lecturer, Computer Science Dept., Technion, Israel.

Visiting positions

Sabbatical positions are underlined.

2-7/2013 Visiting Professor, Catedra de Excelencia, Universidad CarlosIII, Madrid, Spain.

9/2016, 2-7/2013, 12/2011 Visiting Professor, Institute IMDEA Networks, Madrid, Spain.

9/2016, 2/2013, 2/2011, 9/2010,2/2010, 9/2008

Visiting Professor, Department of Computer Science, Univer-sity of Liverpool, UK.

2/2017, 2/2016, 9/2012, 6/2008,6/2007, 6/2006, 2/2004

Visiting Professor, Department of Computer Science, Univer-sity of l’Aquila, Italy.

9/2011, 9/2003, 6/1997, 9/1996 Visiting Professor, Department of Computer Science, Univer-sity of Rome ”La Sapienza”, Italy.

7/2010 Research Director, INRIA Sophia Antipolis, France.3/2009 Visiting Professor, Universidad Rey Juan Carlos, Madrid,

Spain.1-2/2009 Visiting Professor, Department of Computer Science, Univer-

sity of Rome ”La Sapienza”, Italy.10-11/2008 Research Director, INRIA Sophia Antipolis, France.

12/2008 Visiting researcher, Create-Net, Trento, italy.

1

2-8/2000 Visiting Professor, Department of Computer Science and Soft-ware Engineering, The University of Newcastle, NSW, Aus-tralia.

8/2000 Visiting Professor, Department of Computer Science, Come-nius University, Bratislava, Slovakia.

6/1996, 7/1997 Visiting Professor, Department of Systems and Informatics,University of Florence, Italy.

1993-1994 Visiting Professor, Department of Computer Science, HongKong University of Science & Technology, Hong Kong.

9/1992 Visiting Professor, IRISA, Rennes, France .Summer 1991 Visiting Faculty, Computer Science Department, Aarhus Uni-

versity, Denmark.Summer 1990 Summer Faculty, IBM Research Center, Zurich, Switzerland.10/1989 Visiting Professor, INRIA, Paris,France.9/1989 Summer Faculty, Department of Computer Science, University

of Helsinki, Finland.Summer 1984, summer 1985,summer 1988

Visiting Scientist, School of Computer Science, Carleton Uni-versity, Ottawa, Canada.

Summer 1986, summer 1987 Summer Faculty, Department of Computer Science, IBM - T.J. Watson Research Center, Yorktown Heights, New York ,U.S.A.

1984 Visiting Scientist, Lab. for Computer Science, MIT, MA,U.S.A.

Summer 1979, summer 1980,summer 1982

Visiting Professor, Department of Computer Science, NavalPostgraduate School, Monterey, CA , U.S.A.

Summer 1978 Summer Student, Department of Computer Science, IBM -T. J. Watson Research Center, Yorktown Heights, New York,U.S.A.

1976 - 1979 Research Assistant, Department of Computer Science, Univer-sity of Illinois at Urbana-Champaign, Urbana, Illinois, U.S.A.

Teaching experience

Since 1979 Department of Computer Science, Technion, Haifa, Israel:Automata and formal languagesCombinatorics and graph algorithmsGraph algorithmsDiscrete mathematicsIntroduction to programming (PL/1, Pascal)Software systems (PDP-11 assembly language)Distributed algorithmsAdvanced topics in distributed algorithmsAdvanced topics in networking: ATM networksAdvanced topics in networking: Optical networks

Feb.-Aug. Department of Computer Science and Software Engineering,2000 The University of Newcastle, NSW, Australia:

Graph AlgorithmsDistributed algorithms

1993 - 1994 Department of Computer Science, Hong Kong Universityof Science & Technology, Hong Kong:

2

Distributed algorithmsData structures and algorithms

1994 Department of Computer Science, The Hong Kong University, Hong Kong:Distributed algorithms

1972 - 1973 Teaching Assistant, Mathematics Department, Technion, Haifa, Israel.Summer Department of Computer Science, Naval Postgraduate School,

1979, Monterey, CA 94120, U.S.A.:1980, Data structures1982 Discrete mathematics

PL/1 programming languageFortran programming language

Administrative positions

1. Technion (general activities)

1/2015 - 9/2017 Head, Tchnion Faculty Association2006-2008, 2010-2011

Member, Senate committee for promotion (Va’adat Keva le’minui segelbachir u’kviut)

1/2001 - 12/2003 Dean of Undergraduate Studies2000-04, 2006-08 Member, Senate committee for undergraduate and graduate studies

(Va’adat Keva le’limudei hasmacha u’musmachim)1996 - 1999 Vice Dean of Undergraduate Studies1997 Chair, Committee for Alumni Matters1993,1996-1997 Member, Faculty-Student Committee1996-97, 2000-02 Judge, Student Disciplinary Court1993 Assistant for disciplinary issues for Undergraduate and Graduate Stu-

dents

2. Department of Computer Science, Technion

1996 - 2000 Chair, Graduate studies Committee1988 - 1992 Chair, Undergraduate studies Committee1984 - 1985 Chair, Curriculum Committee2006-2008 Member, Graduate Studies Committee1997 Department’s representative in the Committee for Higher Degrees1986-1987 Member, Curriculum Committee1984-1986 Member, Graduate Studies Committee1979-1982 Member, Undergraduate Studies Committee1979 Member, Curriculum Committee1979-1980 Departmental Colloquium Organized1979-1982 Open house day organizer

3. Other

Since 2006 Member of the academic council, Ort Braude College, Carmiel, Israel10/2014-9/2016 Advisor for Computer Science issues, HIT - Holon Institute of Tech-

nology, Holon, Israel

3

Grants

1987-1988 Complexity of algorithms for distributed networks, Keren Emet, Ministry of Scienceand Technology, $13,000.

1991-1995 Algorithm design and fault tolerance in computer networks, French-Israeli cooperationprogram , Ministry of Science and Technology, $60,000. Joint with Prof. D. Dolev(The Hebrew U.), A. Segall and R. Cohen, and the group of Professor M. Raynal inIrisa, Rennes, France.

1998-1999 Studies and Simulations of Virtual Path Layout in ATM Networks, Software Tech-nology Lab grant, Dept. of Computer Science, Technion, $ 3500.

2001-2002 Design and Routing in ATM and Optimal Networks, Software Technology Lab grant,Dept. of Computer Science, Technion, $ 34,000.

2004-2008 Graphs and algorithms in communications (GRAAL), COST 293 - European Co-operation in the field of Scientific and Technical Research, =C 160,000. Joint withresearchers from several European countries.

2008-2011 On-line and Off-line Approximation of Resource Provision in Optical Networks, IsraelScience Foundation, $ 150,000. (Principal Investigator. co-Investigator: MordechaiShalom).

2011 Graph Coloring Problems in Optical Networks, The British Council, =C 6,000.2016-2017 Peta Cloud Consortium, Israel Academy of Science, $ 60,000.

Summer Schools and Special Courses

1. Distributed Algorithms, Dept. of Computer Science, Teollisuuskatu 23, 00510 Helsinki,Finland, September 1989.

2. Advanced Topics in Distributed Algorithms, Dept. of Computer Science, Teollisu-uskatu 23, 00510 Helsinki, Finland, June 1990.

3. Distributed Algorithms, ALCOM Summer School on Efficient Algorithm Design, Com-puter Science Dept., Aarhus University, Aarhus, Denmark, August 1991.

4. Distributed Graph Algorithms, Summer School on Distributed Algorithms, Universityof Siena, Italy, June 1994.

5. Distributed Graph Algorithms, Summer School on Applied Mathematics: StructuralInformation and Communication Complexity, University of Siena, Italy, June 1997.

6. Distributed Algorithms: Introduction and perspectives, Summer School on Dis-tributed Systems, University of Rome, La Sapienza, Italy, September 2003.

7. On static and dynamic approximation of switching cost and traffic groom-ing in optical networks, GRAAL/AEOLUS Spring School on Hot Topics in NetworkAlgorithms, Bertinoro, Italy, May 2008.

8. Distributed computing - highlights, University of L’Aquila, Italy, January 2009.

9. Distributed computing - highlights, University of Rome, La Sapienza, Italy, February2009.

10. Online algorithms: Introduction, and studies in optical networks, MountainWorkshop on graphs and on-line algorithms, Montserrat, Spain, July 2013.

11. Fault tolerance and related issues in distributed computing, University ofL’Aquila, Italy, February 2016.

4

Invited Talks in Conferences

Note: these papers are also listed under Conferences below.

• Keynote talks

1. Path Layout in ATM Networks, 24th Seminar on Current Trends in Theoryand Practice of Informatics (SOFSEM), Milovy, The Czech Republic, Springer-VerlagLNCS 1338, November 1997, pp. 144-160.

2. Optimal Layouts in ATM Networks, 16th International Symposium on ComputerScience and Information Sciences (ISCIS), Izmir, Turkey, October 1999.

3. Duality in ATM Layout Problems, 4th Italian Conference on Algorithms andComplexity (CIAC), Rome, March 2000, pp. 44-58.

4. On the Use of Duality and Geometry in Layouts for ATM Networks, 25thInternational Symposium on Mathematical Foundation of Computer Science (MFCS),Bratislava, Slovakia, August 2000. pp. 114-131.

5. Research directions in ATM and Optical Networks, 11th International Col-loquium on Structural Information and Communication Complexity (SIROCCO), Slo-vakia, June 2004.

6. Optimal parallel scheduling, 13th Haifa Workshop on Interdisciplinary Applications ofGraph Theory, Combinatorics and Computing, Haifa, Israel, May 2013.

7. Optical networks and scheduling - models, problems, challenges, 41stInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG),Munich, Germany, June 2015.

8. Online lower bounds and offline inapproximability in optical networks,14th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW),track on Distributed Computing with Mobile Agents, Athens, Greece, June 29 - July 2,2015.

9. Online and approximation in optical networks and scheduling, 8th IEEEInternational Conference on Computational Intelligence and Communication Networks(CICN), THDC-IHET Tehri, India, 23-25 December, 2016.

10. Online and approximation algorithms for optical networks and schedul-ing, 24th International Colloquium on Structural Information and CommunicationComplexity (SIROCCO), Porquerolles, France, 19-22 June, 2017.

• Invited talks

1. Path Layout in ATM Networks, The DIMACS Workshop on Networks in Dis-tributed Computing, DIMACS Center, Rutgers University, October 1997.

2. Design issues in ATM and Optical Networks, MFCS Workshop on AlgorithmicFoundations of Communication Networks, Bratislava, Slovakia, August 2000.

3. Minimizing the number of ADMs with and without traffic grooming: com-plexity and approximability, 8th International Conference on Transparent OpticalNetworks (ICTON), University of Nottingham, UK, June 18-22, 2006.

4. Scheduling in synchronous ATM networks, Bertinoro Workshop on AdversarialModeling and Analysis of Communication Networks, Bertinoro, Italy, November 2006.

5. Optimal on-line algorithm for minimizing the number of ADMs in opticalnetworks, 9th International Conference on Transparent Optical Networks (ICTON),Rome, Italy, July 2007.

5

6. Practical and deployment issues to be considered in regenerator place-ment and operation of translucent optical networks, 12th InternationalConference on Transparent Optical Networks (ICTON), Munich, Germany, June 2010.

7. Packing in optical networks, Dagstuhl Seminar: Packing and Scheduling Algo-rithms for Information and Communication Services, Schloss Dagstuhl - Leibniz-Centerfor Informatics, Wadern, Germany, Feb. 2011.

8. On the complexity of online and approximation algorithms in opticalnetworks, with implications to scheduling theory , 1st Rangoli of Algo-rithms (RoA), December 11-12, 2016, Chennai, India, part of the 36th IARCS AnnualConference on Foundations of Software Technology and Theoretical Computer Science(FSTTCS).

Steering Committee

1999-2000 Chair, International Workshop on Distributed Algorithms on Graphs (DISC).1997-1998 vice-Chair, International Workshop on Distributed Algorithms on Graphs (DISC).1985-1997 member, International Workshop on Distributed Algorithms on Graphs

(WDAG/DISC).2006-2010 member, International Colloquium on Structural Information and Communication

Complexity (SIROCCO).

Program Committee Chair

1. 6th International Workshop on Distributed Algorithms on Graphs (WDAG), Technion,Haifa, Israel, October 1992, co-Chair with A. Segall.

2. 14th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Italy, June 2007, co-Chair with G. Prencipe.

Program Committee Member

1. 2nd International Workshop on Distributed Algorithms on Graphs (WDAG), Amsterdam,The Netherlands, July 1987.

2. 14th International Workshop on Graph Theoretic Concepts in Computer Science (WG),Amsterdam, The Netherlands, June 1988.

3. 7th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Ontario,Canada, August 1988.

4. 4th International Workshop on Distributed Algorithms on Graphs (WDAG), Bari, Italy,September 1990.

5. 5th International Workshop on Distributed Algorithms on Graphs (WDAG), Delphi, Greece,October 1991.

6. 6th International Workshop on Distributed Algorithms on Graphs (WDAG), Technion,Haifa, Israel, October 1992 .

7. 12th ACM Symposium on Principles of Distributed Computing (PODC), Ithaca, U.S.A.,August 1993.

6

8. 7th International Workshop on Distributed Algorithms on Graphs (WDAG), Lausanne,Switzerland, September 1993.

9. 2nd International Colloquium on Structural Information and Communication Complexity(SIROCCO), June 12 – 14, 1995 Patras, Greece.

10. 4th International Workshop on Algorithms and Data Structures (WADS), August 1995,Ottawa, Canada.

11. 9th International Workshop on Distributed Algorithms on Graphs (WDAG), Rennes,France, September 1995.

12. Workshop on Algorithmic Aspects of Communication, Bologna (Italy) July, 1997.

13. 25th International Colloquium on Automata, Languages and Programming (ICALP), Aal-borg, Denmark, July, 1998.

14. 6th International Colloquium on Structural Information and Communication Complexity(SIROCCO), June 1999, Bordeaux, France.

15. 6th Annual International Computing and Combinatorics Conference (COCOON), Sydney,Australia, July, 2000.

16. 7th International Colloquium on Structural Information and Communication Complexity(SIROCCO), L’Aquila, Italy, June, 2000.

17. 12th International Symposium on Algorithms and Computation (ISAAC), Christchurch,New Zealand, December, 2001.

18. 28th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, The CzechRepublic, November 2001.

19. 9th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Andros, Greece, June 2002.

20. 11th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Bratislava, Slovakia, June, 2004.

21. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Las Vegas,NV, USA, July, 2005.

22. 13th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Chester, UK, June 2006.

23. 31st International Symposium on Mathematical Foundations of Computer Science (MFCS),High Tatras, Slovakia, August 28 - September 1, 2006.

24. 14th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Italy, June 2007.

25. 28th International Conference on Distributed Computing Systems (ICDCS), Beijing, China,June 2008.

26. 34th International Workshop on Graph Theoretic Concepts in Computer Science (WG),Durham, UK, June 2008.

27. 24th International Symposium on Distributed Computing (DISC), Boston, September 2010.

7

28. 5th Conference on Fun with Algorithms (FUN), Ischia, Italy, June 2010.

29. 35th International Symposium on Mathematical Foundations of Computer Science, (MFCS),Brno, Czech Republic, August 2010.

30. 10th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics andComputing, Haifa, Israel, May 2010.

31. 11th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics andComputing, Haifa, Israel, May 17-19, 2011.

32. 15th International Conference On Principles Of Distributed Systems (OPODIS), Toulouse,France, December 2011.

33. 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG),Haifa, Israel, June 2012.

34. 19th International Colloquium on Structural Information and Communication Complexity(SIROCCO), Iceland, June 2012.

35. 26th International Symposium on Distributed Computing (DISC), Salvador, Brazil, Octo-ber 2012.

36. 16th International Conference on Principles of Distributed Systems (OPODIS), Rome,Italy, December 2012.

37. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems(SSS), Osaka, Japan, November 2013.

38. 34th International Conference on Distributed Computing Systems (ICDCS), Madrid, Spain,June-July 2014.

39. 34th ACM Symposium on Principles of Distributed Computing (PODC), 2015.

40. 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems(SSS), Dallas, Texas, November 2017.

41. 44th Annual Int’l Conference on Current Trends in Theory and Practice of Computer Sci-ence” (SOFSEM), Krems an der Donau, Austria, February 2018.

Panel member

• The Contributions of the DISC Community to Distributed Computing: A Historical Perspec-tive, 20th International Workshop on Distributed Algorithms (DISC), Stockholm, Sweden,September 2006.

Editorial board

1989-2000 Information Processing Letters

Prizes

Prize for Innovation in Distributed Computing, SIROCCO, 2017

8

Supervised Students

• PhD

1. Shay Kutten, 1986, Distributed Algorithms for Asynchronous Computer Networks (ajoint supervision in 1985 with E. Korach, replacing S. Moran).

2. Ofer Biran, 1988, A Combinatorial Characterization of the Distributed Tasks which areSolvable in the Presence of One Faulty Processor (a joint supervision with S. Moran).

3. Ornan Gerstel, 1995, Virtual Path Design in ATM Networks.

4. Tamar Eilam, 1998, Compact Routing (a joint supervision with S. Moran).

5. Mordechai Shalom, 2006, Studies in Optical Networks.

6. Ariella Voloshin, 2016, Placement of Regenerators in Optical Networks (a joint super-vision with H. Shachnai).

• MSc

1. Shalom Mordechai, 1985, An Improved Algorithm for Distributed Leader Finding inBidirectional Rings of Processors (a joint supervision with S. Moran).

2. Ornan Gerstel, 1986, Upper and Lower Bounds for Distributed Algorithms for OrderStatistics Problems.

3. Ziv Harpaz, 1986, Trade-offs Between Sense of Direction and Communication Com-plexity in Distributed Systems.

4. Yishay Mansour, 1986, Bit Complexity in Distributed Computations.

5. Yossi Malka, 1988, A Simple Distributed Scheduler - Analysis and Applications (a jointsupervision with S. Moran).

6. Moshe Molcho, 1990, Fault Tolerant Algorithms for a Distributed Network with a De-tection Cycle.

7. Sara Bitan, 1991, Linear Broadcast Routing.

8. King-Shan Lui, 1994, Scheduling in Synchronous Networks and the Greedy Algorithm(in Hong Kong University of Science & Technology, Hong Kong).

9. Derek Hing-Leung Ngok, 1994, Greedy Scheduling on Synchronous Chain Networks (inHong Kong University of Science & Technology, Hong Kong).

10. Marcelo Feighelstein, 1998, Duality in ATM Path Layouts.

11. Ariella Voloshin, 1998, Domination and independence problems for intervals on lines(a joint supervision with M. Kaminski).

12. Viacheslav Chernoy, 2010, On the performance of Dijkstras 3rd self-stabilizing algorithmfor mutual exclusion.

13. Itamar Hartstein, 2012, On the Complexity of the Regenerator Location Problem -Treewidth and Other Parameters (a joint supervision with M. Shalom).

• Postdoctoral researchers

1. Dr. Ignasi Sau, September 2009 - June 2010.

2. Dr. George Mertzios, January - April 2010.

9

Referee for

Acta Informatica AlgorithmicaBIT Discrete MathematicsDiscrete Applied Mathematics Distributed ComputingIEEE J. on Selected Areas in Communications IEEE Trans. on CommunicationIEEE Trans. on Comp. Biology and Bioinformatics IEEE Trans. on ComputersIEEE Trans. on Information Theory IEEE Trans. on NetworkingIEEE Trans. on Software Engineering Information and ComputationInformation Processing Letters Int. J. of Computer MathematicsJ. of Algorithms J. of Computer and System SciencesJ. of Graph Theory J. of Information Processing and CyberneticsJ. of Parallel and Distributed Computing Mathematical ReviewsParallel & Distributed Technology Parallel Processing LettersIAM J. on Computing Software - Practice & ExperienceThe Computer J. Theoretical Computer Science

10

PUBLICATIONS

Theses

1. Reduction of Automata, M.Sc. Thesis, Mathematics Dept., Technion, Haifa, Israel, 1972.Thesis advisor: Professor Azaria Paz.

2. Studies in Graph Algorithms: Generation and Labeling Problems, Ph.D. Thesis, ComputerScience Dept., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, U.S.A.,1979. Thesis advisor: Professor Chung Laung Liu.

Books

1. Nissim Francez and Shmuel Zaks, Automata and Formal Languages, (in Hebrew), The OpenUniversity, Tel-Aviv, Israel, 1987.

2. Co-author of a chapter on Traffic Grooming: Combinatorial Results and Practical Resolu-tions, in Graphs and Algorithms in Communication Networks Studies in Broadband, Optical,Wireless and Ad Hoc Networks, eds. A. Koster and X. Munoz, in EATCS Series Texts inTheoretical Computer Science, 2010, pp. 63-94.

3. Adrian Segall and Shmuel Zaks (eds.): Proceedings of the 6th International Workshop onDistributed Algorithms (WDAG), (LNCS), Haifa, Israel, November 2-4, 1992.

4. Giuseppe Prencipe and Shmuel Zaks (eds.): Proceedings of the 14th International Collo-quium on Structural Information and Communication Complexity (SIROCCO), (LNCS),Castiglioncello, Italy, June 5-8, 2007.

Journal Papers

1. Shmuel Zaks and Dana Richards, Generating Trees and Other Combinatorial Objects Lexi-cographically, SIAM Journal on Computing, 8, 1979, pp. 73-81.

2. Shmuel Zaks, Lexicographic Generation of Ordered Trees, Theoretical Computer Sci-ence, 10, 1980, pp. 63-82.

3. Nachum Dershowitz and Shmuel Zaks, Enumerations of Ordered Trees, Discrete Mathe-matics, 31, 1980, pp. 9-28.

4. David Plaisted and Shmuel Zaks, An NP-Complete Matching Problem, Discrete AppliedMathematics, 2, 1980, pp. 65-72.

5. Yehoshua Perl and Shmuel Zaks, Deficient Generalized Fibonacci Maximum Path Graphs,Discrete Mathematics, 34, 1981, pp. 153-164.

6. Yehoshua Perl and Shmuel Zaks, On the Complexity of Edge Labelings for Trees, Theoret-ical Computer Science, 19, 1982, pp. 1-16.

7. Yossi Shiloach, Uzi Vishkin and Shmuel Zaks, Golden Ratios in a Pair Covering Problem,Discrete Mathematics, 41, 1982, pp. 57-65.

11

8. Shmuel Zaks, Generation and Ranking of k-ary Trees, Information Processing Letters,14(1), 1982, pp. 44-48.

9. Sara Porat, Nissim Francez, Shlomo Moran and Shmuel Zaks, Fair Derivations in Context-Free Grammars, Information and Control, 55, 1982, pp. 108-116.

10. Ashok K. Chandra, Larry T. Kou, George Markowsky and Shmuel Zaks, On Sets of Booleann-Vectors with all k-Projections Surjective, Acta Informatica, 20, 1983, pp. 103-112.

11. Shmuel Zaks, Generalized Profile Numbers, The Fibonacci Quarterly, February 1983,pp. 58-61.

12. Shmuel Zaks, A New Algorithm for Generation of Permutations, Bit, 24, 1984, pp. 196-204.

13. Shmuel Zaks, Optimal Distributed Algorithms for Sorting and Ranking, IEEE Transac-tions on Computers, Special Issue on Sorting, c-34,4, April 1985, pp. 376-379.

14. Nachum Dershowitz and Shmuel Zaks, Ordered Trees and Non-Crossing Partitions, Dis-crete Mathematics, 62, 1986, pp. 215-218.

15. Ephraim Korach, Shlomo Moran and Shmuel Zaks, The Optimality of Distributed Construc-tions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network ofProcessors, SIAM Journal on Computing, 16(2), 1987, pp. 231-236.

16. Yishay Mansour and Shmuel Zaks, On the Bit Complexity of Distributed Computations ina Ring with a Leader, Information and Computation, 75(2), 1987, pp. 162-177.

17. Paul Erdos, Israel Koren, Shlomo Moran, Gabby Silberman and Shmuel Zaks, Minimum-Diameter Cyclic Arrangements in Mapping Data Flow Graphs onto VLSI Arrays, Mathe-matical Systems Theory, 21, 1988, pp. 85-98.

18. Ori Gerstel, Yishay Mansour and Shmuel Zaks, Bit Complexity of Order Statistics on aDistributed Star Network, Information Processing Letters, 30, 1989, 127-132.

19. Ephraim Korach, Shlomo Moran and Shmuel Zaks, Optimal Lower Bounds for Some Dis-tributed Algorithms for a Complete Network of Processors, Theoretical Computer Sci-ence, 64, 1989, pp. 125-132.

20. Hagit Attiya, Jan van Leeuwen, Nicola Santoro and Shmuel Zaks, Efficient Elections inChordal Ring Networks, Algorithmica, 4(3), 1989, pp. 437-446.

21. Nachum Dershowitz and Shmuel Zaks, Patterns in Trees, Discrete Applied Mathemat-ics, 25, 1989, pp. 241-255.

22. Nachum Dershowitz and Shmuel Zaks, The Cycle Lemma and Some Applications, Euro-pean Journal on Combinatorics, 1990, pp. 35-40.

23. Alon Itai, Shay Kutten, Yaron Wolfstahl and Shmuel Zaks, Optimal Distributed t-ResilientElection in Complete Networks, IEEE Transactions on Software Engineering, 16(4),April 1990, pp. 415-420.

24. Ching-Tsun Chou, Israel Cidon, Inder Gopal and Shmuel Zaks, Synchronizing AsynchronousBounded-Delay Networks, IEEE Transactions on Communications, 38(2), February1990, pp. 144-147.

12

25. Ofer Biran, Shlomo Moran and Shmuel Zaks, A Combinatorial Characterization of theDistributed Tasks Which Are Solvable in the Presence of One Faulty Processor, Journalof Algorithms, A special issue devoted to selected PODC 1988 papers, 11, 1990, pp.420-440.

26. Sara Bitan and Shmuel Zaks, Optimal Linear Broadcast, Journal of Algorithms, 14,March 1993, pp. 288-315.

27. Yossi Malka, Shlomo Moran and Shmuel Zaks, A Lower Bound on the Period Length of aDistributed Scheduler, Algorithmica, 10, November 1993, pp. 383-398.

28. Dexter Kozen and Shmuel Zaks, Optimal Bounds for the Change-Making Problem, Theo-retical Computer Science, 123, 1994, pp. 377-388.

29. Ori Gerstel and Shmuel Zaks, A New Characterization of Tree Medians with Applicationsto Distributed Algorithms, Networks, 24(1), January 1994, pp. 23-29.

30. Ephraim Korach, Gerard Tel and Shmuel Zaks, Optimal Synchronization of ABD Networks,IEEE/ACM Transactions on Networking, 4(1), February 1994, pp. 66-69.

31. Ofer Biran, Shlomo Moran and Shmuel Zaks, Tight Bounds on the Round Complexity ofDistributed 1-Solvable Tasks, Theoretical Computer Science, 145, 1995, pp. 271-290.

32. Israel Cidon, Ori Gerstel and Shmuel Zaks, Optimal Virtual Path Layout in ATM Networkswith Shared Routing Table Switches, The Chicago Journal of Theoretical ComputerScience, 3, 1996.

33. Ori Gerstel, Israel Cidon and Shmuel Zaks, The Layout of Virtual Paths in ATM Networks,IEEE/ACM Transactions on Networking, 4(6), December 1996, pp. 873-884.

34. Ori Gerstel and Shmuel Zaks, The Bit Complexity of Distributed Sorting, Algorithmica,18(3), 1997, pp. 405-416.

35. Siu-Wing Cheng, Michael Kaminski and Shmuel Zaks, Minimum Dominating Sets of Inter-vals on Lines, Algorithmica, 20, 1998, pp. 294-308.

36. Ori Gerstel, Avishai Wool and Shmuel Zaks, Optimal Layouts on a Chain ATM Network,Discrete Applied Mathematics , special issue on Network Communications, 83, 1998,pp. 157-178.

37. Mordecai J. Golin and Shmuel Zaks, Labelled Trees and Pairs of Input-Output Permutationsin Priority Queues, Theoretical Computer Science, 205, 1998, pp. 99-114.

38. Ori Gerstel, Israel Cidon and Shmuel Zaks, Efficient Support for the Client-Server Paradigmover ATM Networks, IEEE/ACM Transactions on Networking, 6(4), August 1998, pp.432-446.

39. Shmuel Zaks, Path Layout in ATM Networks - A Survey, Networks in Distributed Com-puting, M. Mavronicolas, M. Merritt, and N. Shavit, Eds., DIMACS: Series in DiscreteMathematics and Theoretical Computer Science, 1998, pp. 145-160.

40. King-Shan Lui and Shmuel Zaks, Scheduling in Synchronous Networks and the Greedy Algo-rithm, Theoretical Computer Science, a special issue for selected WDAG 1997 papers,220, 1999, pp. 157-183.

13

41. Tamar Eilam, Michele Flammini and Shmuel Zaks, A Complete Characterization of thePath Layout Construction Problem for ATM Networks with Given Hop Count and Load,Parallel Processing Letters,8, 2, 1998, pp. 207-220.

42. Tamar Eilam, Shlomo Moran and Shmuel Zaks, Lower Bounds for Linear Interval Routing,Networks, 34, 1999, pp. 37-46.

43. Yeffim Dinitz, Tamar Eilam, Shlomo Moran and Shmuel Zaks, On the Totalk-Diameter ofConnection Networks, Theoretical Computer Science, 247(1-2), September 2000, pp.213-228.

44. Shmuel Zaks, Design issues in ATM and Optical Networks, Computers and ArtificialIntelligence, Special Issue on Algorithmic Foundations of Communication Networks, 20(2),2001.

45. Tamar Eilam, Shlomo Moran and Shmuel Zaks, Lightpath Aarrangement in Survivable Ringsto Minimize the Switching Cost , IEEE Journal on Selected Areas in Communica-tions (JSAC), special issue on WDM-based network architectures, 20(1), January 2002,pp. 172-182.

46. Tamar Eilam, Shlomo Moran and Shmuel Zaks, The Complexity of the Characterizationof Networks Supporting Shortest-Path Interval Routing, Theoretical Computer Science,289(1), November 2002, pp. 85-104.

47. Michele Flammini, Mordechai Shalom and Shmuel Zaks, On Minimizing the Number ofADMs - Tight Bounds for an Algorithm Without Preprocessing, Journal of Parallel andDistributed Computing, 67(4), April 2007, pp. 448-455.

48. Mordechai Shalom and Shmuel Zaks, Minimizing the Number of ADMs in SONET Ringswith Maximum Throughput with Implications to the Grooming Problem, Theoretical Com-puter Science, a special issue for selected SIROCCO 2005 papers, 384(2-3), October 2007,pp. 250-262 .

49. Mordechai Shalom and Shmuel Zaks, A 10/7 + ε Aapproximation for Minimizing the Num-ber of ADMs in SONET Rings, IEEE Trans. on Networking, 15(6), 2007, pp. 1593-1602.

50. Fanica Gavril, Ron Pinter and Shmuel Zaks, Intersection Representations of Matrices bySubtrees and Unicycles on Graphs, Journal of Discrete Algorithms, 6(2), June 2008,pp. 216-228.

51. Michele Flammini, Luca Moscardelli, Mordechai Shalom and Shmuel Zaks, Approximatingthe Traffic Grooming Problem, Journal of Discrete Algorithms, 6(3), 2008, pp. 472-479.

52. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Approximating the Traffic Grooming Problem in Tree and Star Networks, Journal ofParallel and Distributed Computing, 68(7), 2008, pp. 939-948.

53. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem,Computer Networks, 52(9), 2008, pp. 1721-1731.

54. Nachum Dershowitz and Shmuel Zaks, More patterns in trees: up and down, young andold, odd and even, SIAM Journal on Discrete Mathematics, 23(1), 2009, pp. 447-465.

14

55. Michele Flammini, Mordechai Shalom and Shmuel Zaks, On Minimizing the Number ofADMs in a General Topology Optical Network, Discrete Applied Mathematics, 157(12),2009, pp. 2701-2717.

56. George B. Mertzios, Ignasi Sau and Shmuel Zaks, A New Intersection Model and ImprovedAlgorithms for Tolerance Graphs, SIAM Journal on Discrete Mathematics, 23(4),2009, pp. 1800-1813.

57. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Optimal on-line algorithm forminimizing the number of ADMs in optical networks, Journal of Discrete Algorithms,8(2), 2010, pp. 174-188.

58. Viacheslav Chernoy, Mordechai Shalom and Shmuel Zaks, On the Performance of Dijkstra’sThird Self-Stabilizing Algorithm for Mutual Exclusion and Related Algorithms, DistributedComputing, 23(1), 2010, pp. 43-60.

59. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom,Tami Tamir and Shmuel Zaks, Minimizing Total Busy Time in Parallel Scheduling with Ap-plication to Optical Networks, Theoretical Computer Science, 411(40-42), 2010, pp.3553-3562.

60. Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelliand Shmuel Zaks, On the Complexity of Placement of Regenerators in Optical Networks,IEEE/ACM Transactions on Networking, 19(2), April 2011, pp. 498 -511.

61. George B. Mertzios, Ignasi Sau and Shmuel Zaks, The Recognition of Tolerance and BoundedTolerance Graphs is NP-complete, SIAM Journal on Computing, 40(5), September 2011,pp. 1234-1257.

62. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Optimizing Regenerator Cost in Traffic Grooming, Theoretical Computer Science,412(52), 2011, pp. 7109-7121.

63. Antonio Fernandez Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks, Opportunis-tic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony,Distributed Computing, 25, 4, 2012, pp. 279-296.

64. George B. Mertzios, Ignasi Sau, Mordechai Shalom and Shmuel Zaks, Placing Regeneratorsin Optical Networks to Satisfy Multiple Sets of Requests, IEEE/ACM Transactions onNetworking 20(6), 2012, pp. 1870-1879.

65. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, On the Complexity of the Regenerator Cost Problem in General Networks with TrafficGrooming, Algorithmica, 68, 2014, pp. 671-691.

66. Didem Gozupek , Mordechai Shalom, Ariella Voloshinand Shmuel Zaks, On the Complex-ity of Constructing Minimum Changeover Cost Arborescences, Theoretical ComputerScience, 540, 2014, pp. 40–52.

67. Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong, Fencol C.C. Yung and ShmuelZaks, Online Optimization of Busy Time on Parallel Machines, Theoretical ComputerScience, 560, 2014, pp. 190-206.

15

68. George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong and ShmuelZaks, Optimizing Busy Time on Parallel Machines, Theoretical Computer Science, 562,2015, pp. 524-541.

69. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, On-line Maximum Matching inComplete Multi-partite Graphs with an Application to Optical Networks, Discrete AppliedMathematics, 199, 2016, pp. 123-136.

70. Itamar Hartstein, Mordechai Shalom and Shmuel Zaks, On the Complexity of the Regener-ator Location Problem - Treewidth and Other Parameters, Discrete Applied Mathemat-ics, 199, 2016, pp. 199-225.

71. George B. Mertzios and Shmuel Zaks, On the Intersection of Tolerance and CocomparabilityGraphs, Discrete Applied Mathematics, 199, 2016, pp. 46-88.

72. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-Intersectingand Non-Splitting Paths, Theoretical Computer Science, 2016, pp. 40-50

73. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-IntersectingNon-Splitting Paths in a Tree: Representations of Holes-Part I, Discrete Applied Math-ematics, 2016, pp. 47-60.

74. Didem Gozupek, Hadas Shachnai, Mordechai Shalom and Shmuel Zaks, Constructing Min-imum Changeover Cost Arborescenses in Bounded Treewidth Graphs, Theoretical Com-puter Science, 2016, 621, pp. 22–36.

75. Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Antonio Capone and ShmuelZaks, Enhanced Content Update Dissemination through D2D in 5G Cellular Networks,IEEE Transactions on Wireless Communications, 2016, 15, 11, pp 7517–7530.

76. Kshitiz Verma, Gianluca Rizzo, Antonio Fernandez Anta, Ruben Cuevas Rumın, ArturoAzcorra, Shmuel Zaksand Alberto Garca-Martnez, Energy-Optimal Collaborative File Dis-tribution in Wired Networks, Peer-to-Peer Networking and Applications. 10(4), 2017,pp. 925-944.

77. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-Intersectingand Non-Splitting One Bend Paths in a Grid, Discrete Mathematics & TheoreticalComputer Science, June 2017, Vol 19 no. 1.

78. George B. Mertzios, Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, OnlineRegenerator Placement, Theory of Computing Systems, October 2017, 61(3), pp. 739-754.

79. Hadas Shachnai, Ariella Voloshin and Shmuel Zaks, Optimizing bandwidth allocation inelastic optical networks with application to scheduling, Journal of Discrete Algorithms,vol. 45, 2017, pp. 1–13.

80. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-IntersectingNon-Splitting Paths in a Tree: Representations of Holes-Part II, Discrete Mathematics& Theoretical Computer Science, Vol. 20 no. 1, January 2018, pp 1-28.

81. Hadas Shachnai, Ariella Voloshin and Shmuel Zaks, Flexible Bandwidth Assignment withApplication to Optical Networks, Journal of Sceduling, June 2018, 21(3), pp 327-336.

82. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Profit Maximization in Flex-Grid All-Optical Networks, accepted to Transactions on Computer Systems .

16

Submitted

83. Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H.Wong and Shmuel Zaks, it Complexity and Online Algorithms for Minimum Skyline Coloringof Intervals, to Theoretical Computer Science.

Conference Papers

84. Shmuel Zaks and Chung Laung Liu, Decomposition of Graphs into Trees, Proceedings of the8th Southeastern Conference on Combinatorics, Graph Theory and Computing,Louisiana State Univ., Baton Rouge, LA, 1977, Congr. Numer. 19, 1977, pp. 643-654.

85. Nachum Dershowitz and Shmuel Zaks, Applied Tree Enumerations, 6th Colloquium onTrees in Algebra and Programming (CAAP), Genoa, Italy, 1981, pp . 180-193.

86. Nachum Dershowitz and Shmuel Zaks, Patterns in Trees, 9th Colloquium on Trees inAlgebra and Programming (CAAP), Bordeaux, France, March 1984.

87. Ephraim Korach, Shlomo Moran and Shmuel Zaks, Tight Lower and Upper Bounds for aClass of Distributed Algorithms for a Complete Network of Processors, 3rd ACM Sympo-sium on Principles of Distributed Computing (PODC), Vancouver, Canada, August1984, pp. 199-207.

88. Ephraim Korach, Shlomo Moran and Shmuel Zaks, The Optimality of Distributed Con-structions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Net-work of Processors, 4th ACM Symposium on Principles of Distributed Computing(PODC), Minaki, Ontario, Canada, August 1985, pp. 277-286.

89. Nicola Santoro, Jorge Urrutia and Shmuel Zaks, Sense of Direction and CommunicationComplexity in Complete Networks, 1st International Workshop on Distributed Al-gorithms on Graphs (WDAG), Carleton University, Ottawa, Canada, July 1985, pp.123-132.

90. Eli Gafni, Michael C. Loui, Prasoon Tiwari, Douglas B. West and Shmuel Zaks, LowerBounds on Common Knowledge in Distributed Algorithms, 1st InternationalWorkshop on Distributed Algorithms on Graphs (WDAG), Carleton University,Ottawa, Canada, July 1985, pp. 49-68.

91. Ziv Harpaz and Shmuel Zaks, On the Cost of Sense of Direction in Distributed Networks,23rd Allerton Conference on Communication, Control and Computing, Urbana,Illinois, October 1985.

92. Yishay Mansour and Shmuel Zaks, On the Bit Complexity of Distributed Computations in aRing with a Leader, 5th ACM Symposium on Principles of Distributed Computing(PODC), Calgary, Canada, August 1986, pp. 151-160.

93. Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl and Shmuel Zaks, Making DistributedSpanning Tree Algorithms Fault-Resilient, 4th Symposium on Theoretical Aspects ofComputer Science (STACS), Passau, Germany, February 1987, pp. 432-444.

17

94. Hagit Attiya, Nicola Santoro and Shmuel Zaks, From Rings to Complete Networks - Θ(n) toΘ(nlogn) Distributed Leader Election, 2nd Symposium on Cooperation, Concurrencyand Communication Colloque C3, Angouleme, France, May 1987, pp. 19-26.

95. Ching-Tsun Chou, Israel Cidon, Inder Gopal and Shmuel Zaks, Synchronizing Bounded-Delay Networks, 2nd International Workshop on Distributed Algorithms (WDAG),Amsterdam, Holland, July 1987, pp. 212-218.

96. Jan van Leeuwen, Nicola Santoro, Jorge Urrutia and Shmuel Zaks, Guessing Games andDistributed Computations in Synchronous Networks, 14th International Colloquium onAutomata, Languages and Programming (ICALP), Karlsruhe, Germany, July 1987,pp. 347-356.

97. Yossi Malka, Shlomo Moran and Shmuel Zaks, A Simple Distributed Scheduler - Analysisand Applications, 3rd International Workshop on Parallel Computation and VLSITheory, Aegean Workshop on Computing (AWOC), Corfu, Greece, June 1988, pp.351-360.

98. Ofer Biran, Shlomo Moran and Shmuel Zaks, A Combinatorial Characterization of theDistributed Tasks Which Are Solvable in the Presence of One Faulty Processor, 7th ACMSymposium on Principles of Distributed Computing (PODC), Toronto, Canada,August 1988, pp. 263-275.

99. Ephraim Korach, Gerard Tel and Shmuel Zaks, Optimal Synchronization of ABD Networks,International Conference on Concurrency (CONCURRENCY), Hamburg, Ger-many, October 1988, pp. 353-367.

100. Sara Bitan and Shmuel Zaks, Optimal Linear Broadcast, International Symposium onAlgorithms (SIGAL), Tokyo, Japan, August 1990, pp. 368-377.

101. Ofer Biran, Shlomo Moran and Shmuel Zaks, Deciding 1-Solvability of Distributed Tasks isNP-Hard, 16th International Workshop on Graph-Theoretic Concepts in Com-puter Science (WG), Berlin, Germany, June 1990, pp. 206-220.

102. Ofer Biran, Shlomo Moran and Shmuel Zaks, Tight Bounds on the Round Complexity of Dis-tributed 1-Solvable Tasks, 4th International Workshop on Distributed Algorithms(WDAG), Bari, Italy, September 1990, pp. 373-389.

103. Ori Gerstel, and Shmuel Zaks, A New Characterization of Tree Medians with Applications toDistributed Algorithms, 18th International Workshop on Graph-Theoretic Conceptsin Computer Science (WG), Frankfurt, Germany, June 1992,

pp. 135-144.

104. Dexter and Shmuel Zaks, Optimal Bounds for the Change-Making Problem, 20th Interna-tional Colloquium on Automata, Languages and Programming (ICALP), Lund,Sweden, July 1993, pp. 150-161.

105. Ori Gerstel and Shmuel Zaks, The Bit Complexity of Distributed Sorting, 1st Annual Eu-ropean Symposium on Algorithms (ESA), Bad Honnef, Germany, September-October1993, pp. 181-191.

106. Sara Bitan and Shmuel Zaks, Optimal Linear Broadcast Routing with Capacity Limitations,4th International Symposium on Algorithms and Computation (ISAAC), HongKong, December 1993, pp. 287-296.

18

107. Ori Gerstel and Shmuel Zaks, Path Layout in ATM Networks, 1st International Collo-quium on Structural Information And Communication Complexity (SIROCCO),Ottawa, Canada, May 1994.

108. Ori Gerstel and Shmuel Zaks, The Virtual Path Layout Problem in Fast Networks, 13thACM Symposium on Principles of Distributed Computing (PODC), Los Angeles,CA, U.S.A., August 1994, pp. 235-243.

109. Moshe Molcho and Shmuel Zaks, Robust Asynchronous Algorithms in Networks with a FaultDetection Ring, 5th International Symposium on Algorithms and Computation(ISAAC), Beijing, China, August 1994, pp. 101-109.

110. Mordecai J. Golin and Shmuel Zaks, Labelled Trees and Pairs of Input-Output Permutationsin Priority Queues, 20th International Workshop on Graph-Theoretic Concepts inComputer Science (WG), Munchen, Germany, June 1994, pp. 282-291.

111. Israel Cidon, Ori Gerstel and Shmuel Zaks, A Scalable Approach to Routing in ATM Net-works, 8th International Workshop on Distributed Algorithms (WDAG), TheNetherland, September 1994, pp. 209-222.

112. Ori Gerstel, Michel Hurfin, Noel Plouzeau, Michel Raynal and Shmuel Zaks, On-the-FlyReplay: a Practical Paradigm and its Implementation for Distributed Debugging, 6th IEEESymposium on Parallel and Distributed Processing (SPDP), Dallas, Texas, October1994, pp. 266-272.

113. Ori Gerstel and Shmuel Zaks, Model and Designs for Path Layout in ATM Networks, 2ndInternational Workshop on Discrete Mathematics and Algorithms, Jinan Univer-sity, GuangZhou, China, December 1994, pp. 148-162.

114. Siu-Wing Cheng, Michael Kaminski and Shmuel Zaks, Minimum Dominating Sets of Inter-vals on Lines, 1st Annual International Computing and Combinatorics Conference(COCOON), Xi’an, China, August 1995, pp. 520-529.

115. Ori Gerstel, Avishai Wool and Shmuel Zaks, Optimal Layouts on a Chain ATM Network,3rd Annual European Symposium on Algorithms (ESA), Corfu, Greece, September1995, pp. 508-522.

116. Ori Gerstel, Israel Cidon and Shmuel Zaks, Efficient Support for the Client/Server Paradigmover Heterogenous ATM Networks, 15th IEEE Conference of the IEEE Computerand Communications Societies, Networking the Next Generation (INFOCOM),March 1996, San Francisco, CA, USA, pp. 1294-1301.

117. Derek H. Ngok and Shmuel Zaks, On the Power of Local Information in Scheduling inSynchronous Networks, 3rd International Colloquium on Structural Informationand Communication Complexity ( SIROCCO), Siena, Italy, June 1996, pp. 301-312.

118. Tamar Eilam, Shlomo Moran and Shmuel Zaks, A Lower Bound for Linear Interval Routing,10th International Workshop on Distributed Algorithms (WDAG), Bologna, Italy,October 1996, pp. 191-205.

119. Yefim Dinitz, Tamar Eilam, Shlomo Moran and Shmuel Zaks, On the Totalk-Diameter ofConnection Networks, 5th Israeli Symposium on Theory of Computing and Systems(ISTCS), Ramat-Gan, Israel, June 1997, pp. 96-106.

19

120. Yefim Dinitz, Marcelo Feighelstein and Shmuel Zaks, On Optimal Graphs Embedded intoPaths and Rings, with Analysis using l1-Spheres, 23rd International Workshop onGraph-Theoretic Concepts in Computer Science (WG), Berlin, Germany, June 1997,pp. 171-183.

121. Tamar Eilam, Michele Flammini and Shmuel Zaks, A Complete Characterization of the PathLayout Construction Problem for ATM Networks with Given Hop Count and Load, 24thInternational Colloquium on Automata, Languages and Programming (ICALP),Bologna, Italy, July 1997, pp. 527-537.

122. Tamar Eilam, Shlomo Moran and Shmuel Zaks, The Complexity of the Characterizationof Networks Supporting Shortest-Path Interval Routing, 4th International Colloquiumon Structural Information and Communication Complexity (SIROCCO), MonteVerita, Ascona, Switzerland, July 1997, pp. 99-111.

123. Marcelo Feighelstein and Shmuel Zaks, Duality in Chain ATM Virtual Path Layouts, 4thInternational Colloquium on Structural Information and Communication Com-plexity (SIROCCO), Monte Verita, Ascona, Switzerland, July 1997, pp. 228-239.

124. Ori Gerstel, Avishai Wool and Shmuel Zaks, Optimal Average-Case Layouts on Chain Net-works, Workshop on Algorithmic Aspects of Communication, Bologna, Italy, July1997.

125. Shmuel Zaks, Duality in Ordered Trees and Virtual Path Layouts in ATM Networks, 15thIMACS World Congress, Distributed Algorithms of Discrete Mathematics, Berlin,Germany, August 1997.

126. King-Shan Lui and Shmuel Zaks, Scheduling in synchronous networks and the greedy algo-rithm, 11th International Workshop on Distributed Algorithms (WDAG), Saar-brucken, Germany, September 1997, pp. 66-80.

127. Tamar Eilam, Shlomo Moran and Shmuel Zaks, A simple DFS-Based algorithm for linear in-terval routing, 11th International Workshop on Distributed Algorithms (WDAG),Saarbrucken, Germany, September 1997, pp. 37-51.

128. Shmuel Zaks, Path Layout in ATM Networks - A survey, The DIMACS Workshop onNetworks in Distributed Computing, DIMACS Center, Rutgers University, October1997.

129. Shmuel Zaks, Path Layout in ATM Networks, 24th Seminar on Current Trends in The-ory and Practice of Informatics (SOFSEM), Milovy, The Czech Republic, Springer-Verlag LNCS 1338, November 1997, pp. 144-160.

130. Shmuel Zaks, Optimal Layouts in ATM Networks, 16th International Symposium onComputer Science and Information Sciences (ISCIS), Izmir, Turkey, October 1999.

131. Shmuel Zaks, Duality in ATM Layout Problems, 4th Italian Conference on Algorithmsand Complexity (CIAC), Rome, March 2000, pp. 44-58.

132. Shmuel Zaks, On the Use of Duality and Geometry in Layouts for ATM Networks, 25thInternational Symposium on Mathematical Foundation of Computer Science(MFCS), Bratislava, Slovakia, August 2000, pp. 114-131.

20

133. Shmuel Zaks, Design Issues in ATM and Optical Networks, MFCS Workshop on Al-gorithmic Foundations of Communication Networks, Bratislava, Slovakia, August2000.

134. Tamar Eilam, Shlomo Moran and Shmuel Zaks, Approximation Algorithms for SurvivableOptical Networks, Proceedings of the 14th International Workshop on DistributedAlgorithms (DISC), Toledo, Spain, October 2000, pp. 104-118.

135. Shmuel Zaks, Research directions in ATM and Optical Networks, 11th InternationalColloquium on Structural Information and Communication Complexity (SIRO-CCO), Slovakia, June 2004.

136. Mordechai Shalom and Shmuel Zaks, A 10/7 + ε Approximation for Minimizing the Numberof ADMs in SONET Rings, 1st International Conference on Broadband Communi-cations, Networks and Systems (BROADNETS), San Jose, California. USA, October2004, pp. 254-262.

137. Shmuel Zaks, On design problems in ATM and Optical Networks, Workshop of Self-Stabilizing Distributed Systems, BIRS, Banff, Canada, October 2004.

138. Mordechai Shalom and Shmuel Zaks, Minimizing the Number of ADMs in SONET Ringswith Maximum Throughput, 12th International Colloquium on Structural Informa-tion and Communication Complexity (SIROCCO), Mont-St-Michel, France, May2005, pp. 277-291.

139. Shmuel Zaks, On the complexity of the Traffic Grooming Problem, Workshop on GraphClasses, Width Parameters and Optimization, Prague, October 2005.

140. Michele Flammini, Luca Moscardelli, Mordechai Shalomand Shmuel Zaks, Approximatingthe Traffic Grooming Problem, 16th Annual International Symposium on Algorithmsand Computation (ISAAC), Sanya, Hainan, China, December 2005, pp. 915-924.

141. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Minimizing the number of ADMs with and without traffic grooming: complexity andapproximability, 8th International Conference on Transparent Optical Networks(ICTON), University of Nottingham, UK, June 2006.

142. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Approximating the Traffic Grooming Problem in Tree and Star Networks, 32nd Inter-national Workshop on Graph-Theoretic Concepts in Computer Science (WG),Bergen, Norway, June 2006, pp. 147-158.

143. Michele Flammini, Mordechai Shalom and Shmuel Zaks, On Minimizing the Number ofADMs - Tight Bounds for an Algorithm Without Preprocessing, 3rd Workshop on Com-binatorial and Algorithmic Aspects of Networking (CAAN), Chester, United King-dom, July 2006, pp. 72-85.

144. Michele Flammini, Mordechai Shalom and Shmuel Zaks, On Minimizing the Number ofADMs in a General Topology Optical Network, Proceedings of the 20th InternationalWorkshop on Distributed Algorithms (DISC), Stockholm, Sweden, September 2006,pp. 459-473.

145. Mordechai Shalom and Shmuel Zaks, Minimizing the number of ADMs with and withouttraffic grooming: complexity and approximability, Workshop on Adversarial Modelingand Analysis of Communication Networks, Bertinoro, Italy, November 2006.

21

146. Prudence W.H. Wong, Mordechai Shalom and Shmuel Zaks, Optimal on-line colorings forminimizing the number of ADMs in optical networks, London Stringology Days (LSD)2007 (UK-Israeli Bilateral String Algorithms Workshop), King’s College London, UK,March 2007.

147. Shmuel Zaks, Optimal on-line colorings for minimizing the number of ADMs in opticalnetworks, 1st Workshop on Dynamic networks (DYNAMO 2007), Universite diSalerno, Italy, May 2007.

148. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Optimal on-line algorithm forminimizing the number of ADMs in optical networks, 7th Haifa Workshop on Interdis-ciplinary Applications of Graph Theory, Combinatorics, and Algorithms, May2007.

149. Nachum Dershowitz and Shmuel Zaks, More patterns in trees: up and down, young and old,odd and even, to 1st Canadian Discrete and Algorithmic Mathematics Conference(CanaDAM), Banff Conference Center, Banff, Alberta, Canada, May 2007.

150. Mordechai Shalom, Walter Unger and Shmuel Zaks, On the Complexity of the Traffic Groom-ing Problem in Optical Networks, 4th International Conference on Fun With Algo-rithms (FUN), Castiglioncello (LI), Tuscany, Italy, June 2007, pp. 262-271.

151. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Optimal on-line algorithm forminimizing the number of ADMs in optical networks, invited paper, 9th InternationalConference on Transparent Optical Networks (ICTON), Rome, Italy, July 2007.

152. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Optimal on-line algorithm forminimizing the number of ADMs in optical networks, 21st International Symposiumon Distributed Computing (DISC), Lemesos, Cyprus, September 2007, pp. 435-449.

153. Viacheslav Chernoy, Mordechai Shalom and Shmuel Zaks, On the Performance of Dijkstra’sThird Self-Stabilizing Algorithm for Mutual Exclusion, 9th International Symposium onStabilization, Safety, and Security of Distributed Systems (SSS), Paris, France,November 2007, pp 114-123.

154. Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, MordechaiShalom and Shmuel Zaks, Selfishness, Collusion and Power of Local Search for the ADMsMinimization Problem, to 3rd International Workshop On Internet And NetworkEconomics (WINE), San Diego, CA, USA. December 2007, pp. 404-411.

155. Viacheslav Chernoy, Mordechai Shalom and Shmuel Zaks, On the Performance of Beauquierand Debas’s Self-Stabilizing Algorithm for Mutual Exclusion, 15th International Collo-quium on Structural Information and Communication Complexity (SIROCCO),Villars-sur-Ollon, Switzerland, June 2008, pp. 221-233.

156. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Approximating the Traffic Grooming Problem with respect to ADMs and OADMs,14th International European Conference on Parallel and Distributed Computing(EuroPar), Las Palmas de Gran Canaria, Spain, August 2008, pp. 920-929.

157. Viacheslav Chernoy, Mordechai Shalom and Shmuel Zaks, A Self-stabilizing algorithm withtight bounds for mutual exclusion on a ring, 22nd International Symposium on Dis-tributed Computing (DISC), Arcachon, France, September 2008, pp. 63-77.

22

158. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom,Tami Tamir and Shmuel Zaks, Minimizing Total Busy Time in Parallel Scheduling withApplication to Optical Networks, 23rd IEEE International Parallel & DistributedProcessing Symposium (IPDPS), Rome, Italy, 2009, pp. 1-12.

159. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, On-line Maximum Matching inComplete Multipartite Graphs with Implications to the Minimum ADM problem on a StarTopology, 16th International Colloquium on Structural Information and Commu-nication Complexity (SIROCCO), Piran, Slovenia, May 2009, pp. 281-294.

160. Michele Flammini, Alberto Marchetti Spaccamela, Gianpiero Monaco, Luca Moscardelliand Shmuel Zaks, On the Complexity of Placement of Regenerators in Optical Networks,21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),Calgary, Canada, August 2009, pp. 154-162.

161. George B. Mertzios, Ignasi Sau and Shmuel Zaks, A New Intersection Model and ImprovedAlgorithms for Tolerance Graphs, 35th International Workshop on Graph-TheoreticConcepts in Computer Science (WG), Montpellier, France, June 2009, pp. 285-295.

162. George B. Mertzios, Ignasi Sau and Shmuel Zaks, The Recognition of Tolerance and BoundedTolerance Graphs is NP-complete, 27th International Symposium on Theoretical As-pects of Computer Science ( STACS), Nancy, France, March 2010, pp. 585-596.

163. Ignasi Sau, Mordechai Shalom and Shmuel Zaks, Traffic Grooming in Star Networks viaMatching Techniques, 17th International Colloquium on Structural Informationand Communication Complexity (SIROCCO), Nesin Mathematics Village, Sirirince,Turkey, June 2010, pp. 41-56.

164. Chava Vijaya Saradhi, Shmuel Zaks, Riccardo Fedrizzi, Andrea Zanardi, and Elio Salvadori,Practical and deployment issues to be considered in regenerator placement and operation oftranslucent optical networks, 12th International Conference on Transparent OpticalNetworks (ICTON), Munich, Germany, June 2010.

165. George B. Mertzios, Ignasi Sau, Mordechai Shalom and Shmuel Zaks, Placing Regeneratorsin Optical Networks to Satisfy Multiple Sets of Requests, 37th International Colloquiumon Automata, Languages and Programming (ICALP), Bordeaux, France, July 2010,pp. 333-344. Best paper award.

166. Antonio Fernandez Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks, Opportunis-tic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony,24th International Symposium on Distributed Computing (DISC), Cambridge,Massachusetts, USA, September 2010, pp. 374-388.

167. George B. Mertzios and Shmuel Zaks, On the Intersection of Tolerance and CocomparabilityGraphs, 21st Annual International Symposium on Algorithms and Computation(ISAAC), Jeju Island, Korea, December 2010, pp. 230-240.

168. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Optimization of Regenerators in Optical Networks with Traffic Grooming, 14th Inter-national Conference On Principles Of Distributed Systems (OPODIS), Tozeur,Tunisia, December 2010, pp. 443-458.

169. Shmuel Zaks, Packing in optical networks, Dagstuhl Seminar: Packing and Scheduling Al-gorithms for Information and Communication Services, Schloss Dagstuhl - Leibniz-Centerfor Informatics, Wadern, Germany, Feb. 2011.

23

170. Antonio Fernandez Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks, Opportunis-tic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousnessand randomization vs. determinism (Brief announcement), 25th International Sympo-sium on Distributed Computing (DISC), 2011, pp. 202-204.

171. George B. Mertzios, Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Online Re-generator Placement, 15th International Conference On Principles Of DistributedSystems (OPODIS), Toulouse, France, December 2011, pp. 4-17.

172. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, On the Complexity of the Regenerator Cost Problem in General Networks with TrafficGrooming, 15th International Conference On Principles Of Distributed Systems(OPODIS), Toulouse, France, December 2011, pp. 96-111.

173. Martin Farach-Colton, Antonio Fernandez Anta, Alessia Milani, Miguel A. Mosteiro andShmuel Zaks, Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adap-tiveness vs. obliviousness and randomization vs. determinism, 10th Latin AmericanTheoretical INformatics (LATIN), Arequipa, Peru, April 2012, pp. 303-314.

174. Didem Gozupek, Mordechai Shalom, Ariella Voloshinand Shmuel Zaks, On the Complex-ity of Constructing Minimum Reload Cost Path-Trees, (short paper), 2nd InternationalSymposium on Combinatorial Optimization (ISCO), Athens, Greece, April 2012.

175. George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong and ShmuelZaks, Optimizing Busy Time on Parallel Machines, 26th IEEE International Parallel& Distributed Processing Symposium (IPDPS), Shanghai, China, May 2012, pp.238-248.

176. Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong, Fencol C.C. Yung and ShmuelZaks, Online Optimization of Busy Time on Parallel Machines, 9th annual conferenceon Theory and Applications of Models of Computation (TAMC), Beijing, China,May 2012, pp. 448-460.

177. Itamar Hartstein, Mordechai Shalom and Shmuel Zaks, On the Complexity of the Regener-ator Location Problem - Treewidth and Other Parameters, 10th Workshop on Approx-imation and Online Algorithms, (WAOA), Ljubljana, Slovenia, September 2012, pp.42-55.

178. Shmuel Zaks, Optimal parallel scheduling, 13th Haifa Workshop on InterdisciplinaryApplications of Graph Theory, Combinatorics and Computing, Haifa, Israel, May2013.

179. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Maximizing Bandwidth provi-sion in interval scheduling with application to optical networks, 15th International Con-ference on Transparent Optical Networks (ICTON), Cartagena, Spain, June 2013.

180. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Interval Scheduling to Maxi-mize Bandwidth Provision, 11th Workshop on Models and Algorithms for Planningand Scheduling Problems (MAPSP), Abbaye des Premontres, France, June 2013.

181. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-IntersectingNon-Splitting Paths in a Tree: Representations of Holes, 39th International Workshopon Graph-Theoretic Concepts in Computer Science (WG), Lubeck, Germany, June2013, pp. 115-126.

24

182. Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks, Profit Maximization in Flex-Grid All-Optical Networks, to 20th International Colloquium on Structural Infor-mation and Communication Complexity (SIROCCO), Ischia, Italy, July 2013, pp.249-260.

183. Shmuel Zaks, On-line studies in optical networks, Mountain Workshop on graphs andon-line algorithms, Montserrat, Spain, July 2013.

184. Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Antonio Capone and ShmuelZaks, Interference Coordination Strategies for Content Update Dissemination in LTE-A,33rd Annual IEEE International Conference on Computer Communications (IN-FOCOM), Toronto, Canada, April 2014, pp. 1797-1805.

185. Hadas Shachnai, Ariella Voloshin and Shmuel Zaks, Optimizing Bandwidth Allocation inFlex-Grid Optical Networks with Application to Scheduling, 28th IEEE InternationalParallel & Distributed Processing Symposium (IPDPS), Arizona, USA, May 2014,pp. 862-871.

186. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-Intersectingand Non-Splitting Paths, 14th Haifa Workshop in Interdisciplinary Applications ofGraph Theory, Combinatorics and Algorithms, Haifa, Israel, June 2014.

187. Hadas Shachnai, Ariella Voloshin and Shmuel Zaks, Flexible Bandwidth Assignment withApplication to Optical Networks, 39th International Symposium on MathematicalFoundations of Computer Science (MFCS), Budapest, Hungary, August 2014, pp.613-624.

188. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-IntersectingNon-Splitting Paths in a Tree: Representations of Holes-Part I, Graphs of Edge-Intersectingand Non-Splitting Paths PART I: Introduction and Some Results, 9th Interna-tional Colloquium on Graphs and Optimization (GO), Sirmione, Italy, July 2014.

189. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-Intersectingand Non-Splitting Paths, 15th Italian Conference on Theoretical Computer Science(ICTCS), Perugia, Italy, September 2014, pp. 45-58.

190. Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks, Graphs of Edge-Intersectingand Non-Splitting Paths, to appear in Algorithmic Graph Theory on the AdriaticCoast (AGTAC), Koper, Slovenia, June 2015.

191. Didem Gozupek, Hadas Shachnai, Mordechai Shalom and Shmuel Zaks, Constructing Min-imum Changeover Cost Arborescenses in Bounded Treewidth Graphs, to 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization (CTW), Istanbul,Turkey, May 2015.

192. Shmuel Zaks, Optical networks and scheduling - models, problems, challenges, 41st Inter-national Workshop on Graph-Theoretic Concepts in Computer Science (WG),Munich, Germany, June 2015.

193. Shmuel Zaks, Online lower bounds and offline inapproximability in optical networks, 14thInternational Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW),track on Distributed Computing with Mobile Agents, Athens, Greece, July 2015.

25

194. Kshitiz Verma, Alberto Garcia-Martinez and Shmuel Zaks, Designing Low Cost and En-ergy Efficient Access Networks for the Developing World, The 30th IEEE InternationalConference on Advanced Information Networking and Applications (AINA),Crans-Montana, Switzerland, March 2016, pp. 266–273.

195. Shmuel Zaks, On the complexity of online and approximation algorithms in optical networks,with implications to scheduling theory , 1st Rangoli of Algorithms (RoA), a workshopin 36th IARCS Annual Conference on Foundations of Software Technology andTheoretical Computer Science (FSTTCS), Chennai, India, December 2016.

196. Shmuel Zaks, Online and approximation in optical networks and scheduling, 8th IEEEInternational Conference on Computational Intelligence and CommunicationNetworks (CICN), THDC-IHET Tehri, India, December 2016.

197. Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H. Wongand Shmuel Zaks, Complexity and online algorithms for a coloring problem on a line, 13thWorkshop on Models and Algorithms for Planning and Scheduling Problems(MAPSP), Seeon-Seebruck, Germany, June 2017.

198. Shmuel Zaks, Online and approximation algorithms for optical networks and scheduling,24th International Colloquium on Structural Information and CommunicationComplexity (SIROCCO), Porquerolles, France, June 2017.

199. Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H.Wong and Shmuel Zaks, it Complexity and Online Algorithms for Minimum SkylineColoring of Intervals, 11th Annual International Conference on Combinatorial Op-timization and Applications (COCOA), Shanghai, China, December 2017.

200. Martin Farach-Colton, Antonio Fernandez Anta, Alessia Milani , Miguel A. Mosteiro andShmuel Zaks, Opportunistic Information Dissemination in Mobile Ad-hoc Networks: TheProfit of Global Synchrony, 2nd Workshop on Computing in Dynamic Networks (CoDyn),in conjunction with DISC’17, Vienna, Austria, October 2017.

201. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and ShmuelZaks, Online Network Clustering, 17th International Conference on Autonomous Agentsand Multiagent Systems (AAMAS), Stockholm, Sweden, July 2018.

Submitted

202. Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom and Shmuel Zaks, MaximizingCommunication Throughput in Tree Networks, to ICALP 2019.

203. Yuval Emek, Shay Kutten, Mordechai Shalom and Shmuel Zaks, Hierarchical b-Matchingto ICALP 2019.

26