Lectures in 1995

• M.J. van den Akker, A time-indexed formulation for single-machine scheduling problems, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• C.P.M.J. Baggen, Diamond codes , EIDMA Coding and Crypto Seminar, February 1995.

• C.P.M.J. Baggen, Diamond Codes, University of Essen, March 1995.

• C.P.M.J. Baggen, Diamond codes, Delft University of Technology, April 1995.

• A. Barg, Large families of low-correlated sequences, TWI, TU Delft, April 1995.

• A. Barg, Galois rings and families of low-correlated sequences, RWTH Aachen, Institut f\"ur Elektrische Nachrichtentechniek, July 1995.

• A. Barg, On minimal supports in linear codes, 11th International Symposium ``Applied Algebra, Algebraic Algorithms and Error-Correcting Codes'', July 1995.

• A. Barg, Two families of low correlated binary sequences, INRIA, Paris, July 1995.

• A. Barg, A broadcast key-distribution scheme based on block designs, 5th IMA conference on cryptography and coding, Cirencester, England, December 1995.

• H. van den Berg, Existential Graphs and Dynamic Predicate Logic, Werkgroep Dynamische Representatie, Universiteit Twente, March 1995.

• H. van den Berg, Anaphora, Existential Graphs, and Dynamic Predicate Logic, Accolade '95, Amsterdam, March 1995.

• H. van den Berg, Existential Graphs and Dynamic Predicate Logic, Third International Conference on Conceptual Structures, Santa Cruz, U.S.A., August 1995.

• A. Blokhuis, Multiple Blocking sets and lacunary polynomials I and II, Combinatorial Theory Seminar, Eindhoven, March 1995.

• A. Blokhuis, Arcs and Blocking Sets, Geometry Seminar of the University of Napels II, Caserta, April 1995.

• A. Blokhuis, Multiple Blocking Sets in Desarguesian Planes, Tallini Seminar, Rome, April 1995.

• A. Blokhuis, Arcs and blocking sets, Universita della Basilicata, Potenza, April 1995.

• A. Blokhuis, Blocking sets in Desarguesian planes, recent developments, Nederlands Mathematisch Congres, Groningen, April 1995.

• A. Blokhuis, Multiple Blocking Sets in Desarguesian Planes, Conference Hypergraphs and Symmetric Structures, Balatonlelle, Hongarije, June 1995.

• A. Blokhuis, Lacunary Polynomals over Finite fields, 3rd International conference on Finite Fields and Applications, Glasgow, July 1995.

• A. Blokhuis, On complete arcs in planes of odd order, Combinatorial Theory Seminar, Eindhoven, Septem ber 1995.

• A. Blokhuis, On the number of directions determined by the graph of a function on a field, Combinatorial Theory Seminar, Eindhoven, November 1995.

• M.A. de Boer, Gr\"obner bases and cyclic codes, EIDMA/Galois Minicursus Computer Algebra, Eindhoven, September 1995.

• A. Bosselaers, Software implementations of cryptographic algorithms, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• A. Bosselaers, PC Security \& Evaluatie Criteria, Airport Security Training Center, Zaventem, November 1995.

• A. Bosselaers, Recent results about collisions in hash functions, CWI Cryptography Working Group, Amsterdam, November 1995.

• H.J. Broersma, Dirac's minimum degree condition restricted to claws, 15th British Combinatorial Conferen ce, Stirling, Scotland, July 1995.

• H.J. Broersma, Toughness and long cycles in planar graphs, 5th Int. Symp. on Graph Theory and Combinatorics, Marseille-Luminy, France, September 1995.

• H.J. Broersma, Long cycles in planar graphs, Dinsdagseminarium, Universiteit Twente, Enschede, October 1995.

• F. Buekenhout, The rise of incidence geometry in the 20th century, Main speaker at Congress Carolus Magnus, Aachen, March 1995.

• F. De Clerck, Recent constructions of (semi)partial geometries, Second\`a Universit\`a di Napoli, Caserta, October 1995.

• A.M. Cohen, Voorstellingen van eindige groepen in algebra\"{\i}sche groepen, Wiskunde Colloquium, Leiden, February 1995.

• A.M. Cohen, Een computeralgebrapakket is nog geen eindproduct voor industrie, Colloquium Computeralgebra in Onderwijs, Universteit Twente, March 1995.

• A.M. Cohen, Computers: de (be)rekening gepresenteerd, Ned. Math. Congres, Groningen, April 1995.

• A.M. Cohen, Algebraic group modules with finitely many orbits, Combin. Th. Seminar, Eindhoven, April 1995.

• A.M. Cohen, Algorithms for the structure determination of Lie algebras, Algorithms in Algebra workshop, Texel, May 1995.

• A.M. Cohen, Finite subgroups of exceptional Lie groups, The Reinhold-Baer-Kolloquium \"uber Geometrie, W\"urzburg, May 1995.

• A.M. Cohen, Lie algebras (their use for commutative algebras and vice versa), Computational Aspects of Commutative Algebra and Algebraic Geometry, Oberwolfach, May 1995.

• A.M. Cohen, Algorithms for the structure determination of Lie algebras, CoCoa meeting, Genua, May 1995.

• A.M. Cohen, On the structure determination of Lie algebras, 10th Summer School on Computing Techni ques in Physics, Skalskdvur, Caech Republic, September 1995.

• A.M. Cohen, Gr\"obner bases and Galois groups, EIDMA/Galois minicourse, Eindhoven, September 1995.

• A.M. Cohen, Computer algebra for industry, Math. colloquium, Odense, October 1995.

• A.M. Cohen, The influence of computers on proofs, CARMA workshop, The Technical University of Denmark, Bylund, October 1995.

• A.M. Cohen, The influence of computers on proofs, Math. and CS Colloquium, Santa Cruz, December 1995.

• A.M. Cohen, Tensor categories and exceptional groups representations, Vertex operator algebras seminar, Santa Cruz, December 1995.

• A.M. Cohen, The ACELA project, Organic Math. workshop, Vancouver, December 1995.

• A.M. Cohen, Interactive proof of a finiteness theorem, Organic Math. workshop, Vancouver, December 1995.

• A.M. Cohen, Deligne's conjecture regarding a tensor category for the exceptional groups, Caltech Group Theory Seminar, Pasedena, December 1995.

• G. Cornelissen, Zeroes of Eisenstein series, S\'eminaire Toulouse 6/95, Journ\'ees Arithm\'etiques Barcelona 7/95, Oberseminar Saarbr\"ucken, November 1995.

• H. Cuypers, Extensions of generalized polygons and sporadic simple groups, Katholieke Universiteit Nijmegen, May 1995.

• H. Cuypers, Cotriangular spaces and Lie algebras, Combinatorial Theory Seminar, TU Eindhoven, September 1995.

• H. Cuypers, Working with permutation groups, Galois/Eidma minicourse on Computer Algebra, September 1995.

• E.R. van Dam, Graphs with constant $\mu$ and $\overline{\mu}$, Eindhoven University of Technology, Seminar Combinatorial Theory, May 1995.

• E.R. van Dam, Graphs with constant $\mu$ and $\overline{\mu}$, Bled, Slovenia, Third Slovenian International Conference in Graph Theory, June 1995.

• E.R. van Dam, Graphs with few distinct eigenvalues, bounds on subsets and association schemes, Amsterdam, Negentiende Discrete Dag, November 1995.

• J.-P. Doignon, A walk in the land of semiorders, Conference on Ordinal and Symbolic Data Analysis, Paris, 1995.

• J.-P. Doignon, A model for the emergence of preference relations, 26th European Mathematical Psychology Group Meeting, Regensburg, 1995.

• J.-P. Doignon, The well-graded family of semiorders, Groupe de contact du FNRS. Mod\`eles math\'ematiques en sciences humaines, Mons, 1995.

• J.-P. Doignon, Un probl\`eme g\'eom\'etrique li\'e au vote approbatoire. Rencontres Francophones de Recherche Op\'erationnelle, Mons, 1995.

• T.S.H. Driessen, The assignment problem: a description of threats in terms of bargaining ranges within and outside the core of the assignment game, Colloquium Landelijk Netwerk Mathematische Besliskunde (LNMB), Utrecht, April 1995.

• T.S.H. Driessen, A game-theoretic approach to the bankruptcy problem: the case of the dual bankruptcy game and consistency of anti-core allocations, Game Theory seminar, Universitat de Barcelona, Spain, April 1995.

• T.S.H. Driessen, The assignment problem: a description of threats in terms of bargaining ranges within and outside the core of the assignment game, Game Theory seminar, Universidade de Santiago de Compostela, Santiago de Compostela, Spain, May 1995.

• T.S.H. Driessen, The rol of convexity (supermodularity), k-convexity and related notions within cooperative game theory: a survey, Game Theory seminar, Universitat AUTONOMA de Barcelona, Bellaterra (Barcelona), Spain, May 1995.

• T.S.H. Driessen, A game theoretic approach to the bankruptcy problem: the case of the dual bankruptcy game and consistency of anti-core allocations, International conference on Game Theory and Applications (in honor of Robert J. Aumann on his 65th birthday), The Hebrew University of Jerusalem, Jerusalem, Israel, June 1995.

• T.S.H. Driessen, Game-theoretic modelling of the bankruptcy problem, 20th Symposium on Operations Research, Passau, Germany, September 1995.

• T.S.H. Driessen, An alternative game theoretic model of the bankruptcy problem: the case of the greedy bankruptcy game, Game Theory seminar, University of Limburg, Maastricht, September 1995.

• T.S.H. Driessen, The assignment problem: a description of threats in terms of bargaining ranges within and outside the core of the assignment game, International conference on New Directions in the Theory of Markets and Games (in honor of Robert J. Aumann). The Fields Institute (for research in mathematical sciences), University of Toronto, Toronto, Canada, October 1995.

• T.S.H. Driessen, The assignment problem: a description of threats in terms of barganing ranges within and outside the core of the assignment game, Economics seminar, The Ohio State University, Columbus, Ohio, U.S.A., October 1995.

• T.S.H. Driessen, An alternative game theoretic analysis of the bankruptcy problem from the Talmud: the case of the greedy bankruptcy game, Economics seminar, University of Rochester, Rochester, New York, U.S.A., November 1995.

• C.A. van Eijl, A polyhedral approach to discrete lot-sizing, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• F. G\"obel, Cyclic Graphs, Ned. Math. Congres, Groningen, April 1995.

• R. Govaerts, Van tamtam tot virtuele realiteit, Universiteit Derde Leeftijd Leuven, October 1995.

• R. Govaerts, Telecommunicatie in opmars. Van tamtam naar virtuele realiteit, cursus Davidsfonds Universiteit Vrije Tijd, October-November 1995.

• W. de Graaf, Algorithms for Lie Algebras, Workshop Algorithms in Algebra, Texel, May 1995.

• W. de Graaf, Decomposition of a Semisimple Lie Algebra, Discrete Dag, Amsterdam, November 1995.

• W.H. Haemers, Graphs with few distinct eigenvalues, Balatonlelle, Hongary, June 1995.

• W.H. Haemers, Eigenvalues and regularity of graphs, Stirling, Scotland, July 1995.

• W.H. Haemers, A Hoffman type bound for disconnected subgraphs with an application to equidistand code pairs in an association scheme, Eindhoven, TUE, September 1995.

• A.P. Hekstra, Telephone links designed for speech, used for data, TUE/EI, November 1995.

• C. Hoede, Sources of Graph Theory, EIDMA workshop on the future of graph theory, Enschede, February 1995.

• C. Hoede, Modellering van de politieorganisatie, Hoofdbureau van Politie, Rotterdam, March 1995.

• C. Hoede, Wissensgraphen, Technische Universit\"at Berlin, Berlin, Germany, March 1995.

• C. Hoede, Die Zukunft der Graphentheorie, Von Humboldt Universit\"at Berlin, Berlin, Germany, June 1995.

• C. Hoede, Graphentheoretische Probleme, Cottbus, Technische Universit\"at Cottbus, Germany, June 1995.

• C. Hoede, On the ontology of knowledge graphs, International Conference on Conceptual Structures 95, Santa Cruz, U.S.A., August 1995.

• C. Hoede, Een metavermoeden in de grafentheorie, Staff-studentcolloquium, Enschede, September 1995.

• C. Hoede, On hamiltonicity of graphs, Kolloquium \"uber Kombinatorik, Braunschweig, Germany, November 1995.

• C.P.M. van Hoesel, Solving frequency assignment problems with branch and cut, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• H.D.L. Hollmann, Lecture at the IEEE Int. Symposium on Information Theory, Whistler, B.C., Canada, September 1995.

• H.D.L. Hollmann, Several lectures at the ``Coding, Crypto, and Information Theory Seminar'', Eindhoven. (Don't know exact dates, Henk v. Tilborg, the organizer, will have this information.) ??

• J.A. Hoogeveen, Scheduling with positional completion times, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• J.A. Hoogeveen, Earliness-tardiness scheduling around almost equal due dates, Workshop on Models and Algorithms for Planning and Scheduling Problems, Wernigerode, Germany, May 1995.

• J.A. Hoogeveen, Formulating a scheduling problem with almost identical jobs by using positional completion times, 4th Conference on Integer Programming and Combinatorial Optimization, Copenhagen, Denmark, May 1995.

• Tam{\`a}s Horv{\`a}th, Lecture at the 1995 IEEE International Symposium on Information Theory, Whistler, Canada, September 1995.

• C.A.J. Hurkens, Preemptive head-body-tail scheduling, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• C.A.J. Hurkens, Lower bounds for the multiprocessor flow shop problem, Workshop on Models and Algorithms for Planning and Scheduling Problems, Wernigerode, Germany, May 1995.

• L. Knudsen, Multiple encryption, Ecole Normale Sup\'erieure, Paris, November 1995.

• L. Knudsen, Block ciphers, Hoyteknologisenteret, Bergen (N), December 1995.

• L. Knudsen, B. Preneel, Cryptanalysis of LOKI-DBH: the last piece of the puzzle, presentation at the rump session of Eurocrypt '95, Saint-Malo (F), May 1995.

• J.K. Lenstra, Recente ontwikkelingen in de combinatorische optimalisering, Jublilee Congress Vereniging voor Statistiek en Operationele Research, Utrecht, April 1995.

• J.K. Lenstra, Research at the TUE: an overview, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• J.K. Lenstra, Lower bounds for the multiprocessor flow shop, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• J.K. Lenstra, Lower bounds for the multiprocessor flow shop and Open shop scheduling: 3 is easy, 4 is hard, Seminar on Scheduling in Computer and Manufac turing Systems, Dagstuhl, Germany, May 1995.

• J.K. Lenstra, The complexity of approximation, Workshop on Models and Algorithms for Planning and Scheduling Problems, Wernigerode, Germany, May 1995.

• J.K. Lenstra, ECMI Course in Combinatorial Optimization, G"oteborg, Sweden, June 1995.

• J.K. Lenstra, Developments in combinatorial optimization, Aarhus, Denmark, June 1995.

• J.K. Lenstra, Approximation algorithms for job shop scheduling, Workshop on Combinatorial Optimization, Ankara, Turkey, July 1995.

• J.K. Lenstra, Multiprocessor flowshop scheduling, Workshop on Combinatorial Opti mization, Ankara, Turkey, July 1995.

• J.K. Lenstra, Combinatorial optimization and frequency assignment: an overview of algorithmic approaches, Symposium on Combinatorial Algorithms for Military Applications, Scheveningen, November 1995.

• J.H. van Lint, Digitale Codierung von Musik, Universiteit Bern, February 1995.

• J.H. van Lint, Codierung zur Fehlerkorrektur auf Compact Disc, Math. Vereniging Bern, February 1995.

• J.H. van Lint, Die Mathematik des CD-Players (4 voordrachten), Ingenieursschule Biel, February 1995.

• J.H. van Lint, Problemen rond 13, 13e Dies (GEWIS), June 1995.

• J.H. van Lint, Goed kan soms nog beter, Opening Academisch jaar 1995, September 1995.

• J.H. van Lint, De Wiskunde van de Compact Disc, Vrije Universiteit Amsterdam, September 1995.

• H. Van Maldeghem, The magic World of Jacques Tits, W\"urzburg, May 1995 (Colloquium {\em Reinhold-Baer-Kolloquium \"uber Geometrie\/}).

• H. Van Maldeghem, Generalized Polygons and the Moufang condition, Oberwolfach, October 1995 (conference {\em Geometries and Groups\/}).

• H. Van Maldeghem, Embeddings, Polarities, Veblen and Something Else, Oberwolfach, October 1995 (conference {\em Geometries and Groups\/}).

• R. de Man, On composants of solenoids and Knaster continua, 1995 Annual Spring Topology and Southeast Dynamics Conference, April 1995.

• W. Mielants, Can the best of all possible worlds be a random structure? (from a mathematical point of view), Seminar on buildings and finite geometry (R.U.G. - U.L.B.), February 1995.

• W. Mielants, Can the best of all possible worlds be a randomstructure? (from a philosophical point of view), At the congress {\em Einstein meets Magritte}, Brussels, June 1995.

• W. Mielants, Het meetkunde onderwijs aan de Universiteit Gent, Voordracht georganiseerd door de didactische cel van het Belgisch Wiskundig Genootschap, March 1995.

• R.R. Pellikaan, On asymptotically good codes, DRET Arm‰es, Paris, France, January 1995.

• R.R. Pellikaan, On asymptotically good curves and codes, Combinatorical Theory Seminar, Eindhoven, March 1995.

• R.R. Pellikaan, Algebraic-geometric codes without algebraic geometry, Colloquium lecture, Universiteit van Utrecht, March 1995.

• R.R. Pellikaan, Algebraic-geometric codes 1, Philips Research Laboratories, Eindhoven, April 1995.

• R.R. Pellikaan, Algebraic-geometric codes 2, Philips Research Laboratories, Eindhoven, June 1995.

• R.R. Pellikaan, Algebraic-geometric codes without algebraic geometry, Arithmetic, Geometry and Coding Theory 5, Centre International de Recontres Math\'ematiques, Luminy, France, June 1995.

• R.R. Pellikaan, Gr\"obner bases and error-correcting codes, Galoi/Eidma minicourse on computer algebra, Eindhoven, September 1995.

• R.R. Pellikaan, Algebraisch geometrische Codes ohne algebraische Geometrie, D\"usseldorf, Duitsland, November 1995.

• B. Preneel, A new forgery attack on message authentication codes, Ecole Normale Sup\'erieure, Paris, April 1995.

• B. Preneel, Encryption and integrity in security protocols, Cambridge Workshop on Cryptographic Protocols, Cambridge (UK), April 1995.

• B. Preneel, Authentication codes, Euler Institute for Discrete Mathematics and its Applications (EIDMA), Eindhoven, May 1995.

• B. Preneel, Cryptanalysis, Euler Institute for Discrete Mathematics and its Applications (EIDMA), Eindhoven, June 1995.

• B. Preneel, Conventional cryptographic algorithms, part I, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• B. Preneel, Digital signatures and information authentication, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• B. Preneel, Kanaalcodering, Postgraduaat Telecommunicatie, Alcatel Bell, October 1995.

• B. Preneel, Broncodering, Postgraduaat Telecommunicatie, Alcatel Bell, November 1995.

• B. Preneel, Netwerkbeveiliging, Airport Security Training Center, Zaventem, November 1995.

• B. Preneel, P.C. van Oorschot, On the security of two MAC algorithms, presentation at the rump session of Crypto'95, Santa Barbara, CA (US), August 1995.

• C. Radu, Electronic payment systems: An overview, Utimaco Belgium, Holsbeek, April 1995.

• V. Rijmen, Recent advances in cryptanalysis, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• J. Simonis, The uniqueness of the [23,14,5] Wagner Code, the 900th meeting of the AMS, DePaul University, Chicago, March 25, 1995.

• J. Simonis, The uniqueness of the Wagner Code, International Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, May, 1995.

• J. Simonis, Configurations and computers, University of Illinois in Chicago, April, 1995.

• J. Simonis, Configurations and computers, University of Illinois in Chicago, April, 1995. University of Syracuse, April, 1995.

• J. Simonis, Configurations and computers, SEAMS Regional Conference on Mathematical Analysis and Statistics, Yogyakarta, July 13, 1995.

• H.J.M. Sterk, Introduction to algebraic groups, Combinatorial Seminar, Eindhoven, January 1995.

• H.J.M. Sterk, Groups, lattices and complex spaces, Combinatorial Seminar, Eindhoven, September 1995.

• H.J.M. Sterk, Working with Permutation Groups, Galois/Eidma minicourse on Computer algebra, Eindhoven, September 1995.

• L. Storme, Cyclic caps on quadrics and Hermitian varieties, at the University of South Australia (Adelaide, Australia), March 1995.

• L. Storme, Cyclic caps on quadrics and Hermitian varieties, at the University of Western Australia (Perth, Australia), March 1995.

• L. Storme, Cyclic caps on quadrics and Hermitian varieties, two lectures at the University of Naples (Italy), May 1995.

• L. Storme, Monomial flocks and ovals, at {\em Hypergraphs and symmetric structures}, Balatonlelle (Hungary), June 1995.

• J.A. Thas, Weakly embedded polar spaces and embedded generalized hexagons, Kansas State University, January 1995.

• J.A. Thas, $k$-arcs, hyperovals, partial flocks and flocks, University of California at Santa Cruz, January 1995.

• J.A. Thas, $k$-arcs, hyperovals, partial flocks and flocks, University of Naples, February 1995.

• J.A. Thas, Weakly embedded polar spaces and embedded generalized hexagons, University of Rome, March 1995.

• J.A. Thas, Weakly embedded polar spaces and embedded generalized hexagons, {\em R.C. Bose Memorial Conference}, Colorado State Univ. (USA), June 1995.

• H.C.A. van Tilborg, De vele toepassingen van de cryptologie, NGI Lezing Regio Zuid-Nederland, Eindhoven, April 1995.

• H.C.A. van Tilborg, De geschiedenis van twee families niet-lineaire codes; een oud vermoeden blijkt niet waar, 31-ste Nederlands Mathematisch Congres, Groningen, April 1995.

• H.C.A. van Tilborg, Cryptologie; mogelijkheden, moeilijkheden, mogelijkheden, 25 jaar SOBU, Tilburg, April 1995.

• H.C.A. van Tilborg, Optimum cyclic burst-correcting codes and their decoding algorithm, International Workshop on optimal codes and related topics, May 1995.

• H.C.A. van Tilborg, Security; where are we today, TNO Seminar Visions on Future Developments in Information Security, Delft, August 1995.

• H.C.A. van Tilborg, Enhanced decoding of interleaved error correcting codes, IEEE International Symposium on Information Theory, Whistler, Canada, September 1995.

• H.C.A. van Tilborg, Multilevel codes; some examples, their decoding, Link\"oping, Sweden, December 1995.

• H.C.A. van Tilborg, A broadcast key distribution scheme based on block design, 5th IMA Conference on \ Cryptography and Coding, Cirencester, Engeland, December 1995.

• H.C.A. van Tilborg, Authentication codes: an area where coding and cryptography meet, 5th IMA Conference on Cryptography and Coding, Cirencester, Engeland, December 1995.

• J. van Tilburg, Post HTO -- Security in modern telecommunication networks, Den Haag, October 1995.

• S.R. Tiourine, Upper and lower bounding techniques for frequency assignment pro blems, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• S.R. Tiourine, Design of local search algorithms, Symposium on Combinatorial Algorithms for Military Applications, Scheveningen, November 1995.

• L.M.G.M. Tolhuizen, EIDMA coding, crypto and information theory seminar, ``Block variatons of Diamond codes'' February 1995.

• L.M.G.M. Tolhuizen, EIMDA Course CIC-2, ``Cooperating error correcting codes'', April 1995.

• L.M.G.M. Tolhuizen, University of Utrecht, ``Foutcorrigerende codes in de CD'', May 1995.

• H. Trommel, $D_\lambda$-cycles and long cycles in graphs with large degrees, 15th British Combinatorial Conference, Stirling, U.K., July 1995.

• van Trung Tran, Lecture at the DMV-Tagung 1995 an der Universit"at Ulm, September 1995.

• M. Vandenwauver, SESAME: an architecture for distributed system security, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• M. Vandenwauver, Gedistribueerde systemen en cryptografie: Deel 1: PGP, en Deel 2: Kerberos en SESAME, KVIV Kursus Beveiliging van genetwerkte computersystemen, Antwerpen, October 1995.

• M. Vandenwauver, Beveiliging van gedistribueerde computer systemen, Airport Security Training Center, Zaventem, November 1995.

• J. Vandewalle, De rol van cryptografie in informatiebeveiliging, TNO Delft, January 1995.

• J. Vandewalle, Technical approaches to thwart computer fraud, International course on state of the art and evolution of computer security and industrial cryptography, Arenberg Castle, Heverlee, June 1995.

• J. Vandewalle, Informatietechnologie\"{e}n en beveiliging met cryptografie, Airport Security Training Center, Zaventem, November 1995.

• J. Vandewalle, Cryptografie en informatiebeveiliging, Postgraduaat Telecommunicatie, Alcatel Bell, December 1995.

• H.J. Veldman, Hamilton cycles in nearly claw-free graphs, 15th British Combinatorial Conference, Stirling, U.K., July 1995.

• A.P.A. Vestjens, On-line scheduling of identical machines, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• A.P.A. Vestjens, On-line scheduling of identical machines, Workshop on Models and Algorithms for Planning and Scheduling Problems, Wernigerode, Germany, May 1995.

• A.J. Han Vinck, M-Tone Signaling, SAMSUNG, Kijung, Korea, November 1995.

• A.J. Han Vinck, Synchronization, KAIST, Taejon, Korea, November 1995.

• A.J. Han Vinck, Packet Synchronization Aspects, University of Lancaster, England, October 1995.

• A.J. Han Vinck, Punctured Convolutional Codes, University of Lancaster, England, October 1995.

• A.J. Han Vinck, Packet Synchronization Aspects, University of Victoria, Kanada, September 1995.

• A.J. Han Vinck, Digitale Kommunikation, B\"undigkeit, Sicherheit, Zuverl\"assigkeit, Kolloquium am Fachbereich 12, Universit\"at Essen, June 1995.

• A.J. Han Vinck, Coding for Spread Spectrum systems, CCG-Kurs Oberpfaffenhofen, May 1995.

• A.J. Han Vinck, Coding for Multi-User Channels with Applications to Mobile Radio, Workshop am IEM, May 1995.

• A.J. Han Vinck, Packet Synchronization Aspects, DLR Oberpfaffenhofen, April 1995.

• A.J. Han Vinck, Synchronisation und Fehlerdetektion, DFG-Schwerpunkt, Bonn, April 1995.

• A.J. Han Vinck, Science Parc, Universit\"at Essen, February 1995.

• A.J. Han Vinck, Convolutional Codes: An Overview, Universit\"at Mainz, February 1995.

• A.J. Han Vinck, The M-Algorithm and its Complexity, University of Eindhoven, February 1995.

• A.J. Han Vinck, Communication over Power Lines, RWE, Essen, January 1995.

• M. Wennink, Scheduling with convex piecewise linear objective functions, Workshop op Graph Algorithms and Scheduling within the HCM Program ``Models, algorithms and systems for decision making'', Berlin, Germany, April 1995.

• G.J. Woeginger, A well-solvable special case of the quadratic assignment problem, 14th European Congress on Operational Research, Jerusalem, Israel, July 1995.

• G.J. Woeginger, Sometimes travelling is easy: the master tour problem, European Symposium on Algorithms, Corfu, Greece, September 1995.

• G.J. Woeginger, Approximability results for minimizing the total flow time, Konrad-Zuse-Institut, Berlin, Germany, November 1995.