Research Articles

• E. Aarts, Bekentenissen over het boek van een vriend, in Simplex Sigillum Veri (eds. E.H.L. Aarts, H.M.M. ten Eikelder, C. Hemerik, M.\ Rem), Technische Universiteit Eindhoven (1995), 25--29.

• E.H.L. Aarts and J.H.M. Korst, Boltzmann machines, in Handbook of Brain Theory and Neural Networks (ed. M. Arbib), MIT Press, Cambridge MA (1995), 162--166.

• E.H.L. Aarts, H.P. Stehouwer, J. Wessels and P.J. Zwietering, Neural networks for combinatorial optimization, Proceedings New Developments in Neural Nets and their Applications, Tokyo, The Japan Institute of Systems Research (1994), 39--54. (nagekomen)

• E.H.L. Aarts, H.P. Stehouwer, J. Wessels and P.J. Zwietering, Neural networks for combinatorial optimization, in Proceedings if the 3rd IFIP WG-7.6 Working Conference on Optimization-Based Computer Aided Modelling and Design (eds. J. Dol`ezal, J.\ Fidler), Prague (1994), 25--40.

• A.G. van Asch and F. van der Blij, Measurements of curvilineal angles, Bull. Belg. Math. Soc. 2 (1995), 575--591.

• A. Ashikhmin, A. Barg, G. Cohen and L. Huguet, Variations on minimal codewords in linear codes, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (eds. G. Cohen, M. Giustu, T. Mora), LNCS 948, Springer (1995), 96--105.

• P. Auer, P.M. Long, W. Maass and G.J. Woeginger, On the complexity of function learning, Machine Learning 18 (1995), 187--230.

• C.P.M.J. Baggen, On the Use of Mathematics by Inventor, ICIAM 95, Book of Abstracts (1995), 157.

• C.P.M.J. Baggen and L.M.G.M. Tolhuizen, On the Diamond Code Construction, Proc. 16-th Symp. on Information Theory in The Benelux (1995), 123--126.

• C.P.M.J. Baggen and L.M.G.M. Tolhuizen, On the Diamond Code Construction, Proc. 1995 IEEE Int. Symp. on Information Theory (1995), 243.

• E. Balas, J.K. Lenstra and A. Vazacopoulos, The one-machine problem with delayed precedence constraints and its use in job shop sche duling, Management Science 41 (1995), 94--109.

• E. Balas, J.K. Lenstra and A. Vazacopoulos, The one-machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science 41 (1995), 94--109.

• E. Balas, J.K. Lenstra, and A. Vazacopoulos, The one-machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science 41 (1995), 94--109.

• B. de Bart and F.M.J. Willems, Combining Enumerative Shaping Techniques and Block Coded Modulation for ISI Channels, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel, The Netherlands (1995), 167--173.

• D. Bauer, H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree, Discrete Mathematics 141 (1995), 1--10.

• D. Bauer, H.J. Broersma and H.J. Veldman, On generalizing a theorem of Jung, Ars Combinatoria 40 (1995), 207--218.

• D. Bauer, E. Schmeichel and H.J. Veldman, Cycles in tough graphs -- updating the last four years, Graph Theory, Combinatorics, and Applications, in Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs 1 (eds. Y. Alavi, A. Schwenk), Wiley and Sons, Inc. (1995), 19--34.

• H. van den Berg, Anaphora, existential Graphs, and DPL, in Proceedings Accolade'95 (eds. S. Fischer, M. Trautwein), Department of Philosophy, University of Amsterdam, Dutch Graduate School in Logic (1995), 1--16.

• H. van den Berg, Existential graphs and dynamics predicate logic, in Conceptual Structures: Applications, Implementations and Theory. Proceedings of the Third International Conference on Conceptual Structures (ICCS'95) (eds. G. Ellis, R.A. Levinson, W. Rich, J.F. Sowa), Springer-Verlag, Lecture Notes in Artificial Intelligence 954 (1995), 338--352.

• H. van den Berg, Modal predicate logics for conceptual graphs, in Proceedings Accolade '94 (ed. A. Nieuwendijk), Department of Philosophy, University of Amsterdam, Dutch Graduate School in Logic (1995), 65--86.

• E. van Blanken, J. van den Heuvel and H.J. Veldman, Pancyclicity of hamiltonian line graphs, Discrete Mathematics 138 (1995), 379--385.

• A. Blokhuis, A.E. Brouwer and T. Szönyi, The number of directions determined by a function f on a finite field, Journal Combinatorial Theory A 70 (1995), 349--353.

• A. Blokhuis and T. Kloks, On the equivalence covering number of splitgraphs, Informatio Processing Letters 54 (1995), 301--304.

• A. Blokhuis and G.E. Moorhouse, Some p-ranks Related to Orthogonal Spaces, Journal of Algebraic Combinatorics 4 (1995), 295--316.

• A. Blokhuis, H.A. Wilbrink and A. Sali, Perfect Sumsets in Finite Abelian Groups. Linear Algebra and its Applications 226--228 (1995), 47--56.

• V. Braun, On Properties of Binary Maxentropic DC-free Runlength-Limited Sequences, Proc. of the 1995 IEEE International Symposium on Information Theory, Whistler, Canada (1995), 203.

• H.J. Broersma and F. Göbel, Bipartite regular graphs with fixed diameter, Networks 26 (1995), 139--144.

• H.J. Broersma and M. Lu, Cycles through particular subgraphs of claw-free graphs, Journal of Graph Theory 20 (1995), 459--465.

• A.E. Brouwer, Toughness and spectrum of a graph, Linear Algebra and Applications 226--228 (1995), 267--271.

• A.E. Brouwer, Variations on a theme by Weetman. Discrete Mathematics 138 (1995), 137--145.

• A.E. Brouwer, Block Designs, in Handbook of Combinatorics (eds. R. Graham, M. Groetschel, L. Lovász), Elsevier, Amsterdam (1995), 693--745.

• A.E. Brouwer and W.H. Haemers, Association schemes, in Handbook of Combinatorics (eds. R. Graham, M. Groetschel, L. Lovász) , Elsevier, Amsterdam (1995), 747--771.

• A.E. Brouwer, J. Hemmeter and A. Woldar, The complete list of maximal clinques of Quad (n,q), q odd. European Journal Combinatorics 16 (1995), 107--110.

• A.E. Brouwer and H.A. Wilbrink, Block Designs, in Handbook of incidence geometry (ed. F. Buekenhout), Elsevier, Amsterdam (1995), 349--382.

• F. Buekenhout, An introduction to incidence geometry, Chap. 1 of Handbook of Incidence Geometry (1995), 1--25.

• F. Buekenhout, Foundations of incidence geometry, Chap. 3 of Handbook of Incidence Geometry (1995), 63--105.

• F. Buekenhout, Finite groups and geometries: a view on the present state and on the future, in Groups of Lie type and their Geometries (eds. W.M. Kantor, L. Di Martino), Cambridge U.P. (1995), 35--42.

• F. Buekenhout and P. Cameron, Projective and affine geometry over a division ring, Chap. 2 of Handbook of Incidence Geometry (1995), 27--61.

• F. Buekenhout, M. Dehon and I. Deschutter, Projective injections of geometries and their affine extensions, Jour. Geom. 52 (1995), 41--53.

• F. Buekenhout and A. Pasini, Finite diagram geometries extending buildings, Chap. 22 in Handbook of Incidence Geometry (1995), 1143--1253.

• R.E. Burkard, E. Cela and G.J. Woeginger, A minmax assignment problem in treelike communication networks, European Journal of Operational Research 87 (1995), 670--684,

• S. Chang, Q. Lu, G. Tang and W. Yu, On decomposition of the total tardiness problem, Operations Research Letters 17 (1995), 221--229.

• B. Chen and A.P.A. Vestjens. Scheduling on identical machines: How good is LPT in an on-line setting?, Warwick Business School Research Papers 194 (1995), 7 pp.

• B. Chen, A. van Vliet and G.J. Woeginger, An optimal algorithm for preemptive on-line scheduling, Operations Research Letters 18 (1995), 127--131.

• B. Chen and G.J. Woeginger, A study of on-line shop scheduling problems on two machines, in Minimax Problems and Applications (eds. D.-Z. Du, P.M. Pardalos), Kluwer, Dordrecht (1995), 97--107.

• P. Chrétienne, E.G. Coffman jr., J.K. Lenstra and Z. Liu (eds.), Scheduling Theory and Its Applications, Wiley, Chichester (1995).

• F. De Clerck and H. Van Maldeghem, Some classes of rank 2 geometries, Chapter 10 in ``Handbook of Incidence Geometry, Buildings and Foundations'' (ed. F. Buekenhout), North-Holland (1995), 433--475.

• A.M. Cohen, Point-line geometries associated with buildings, in Handbook of Incidence Geometry, Buildings and Foundations (ed. F. Buekenhout), Elsevier, Amsterdam (1995), 647--737.

• A.M. Cohen and D.B. Wales, Finite simple subgroups of semisimple complex Lie groups -- a survey, Groups of Lie Type and their Geometries (eds. W.M. Kantor, L. Di Martino), LMS Lecture Notes no. 207, Cambridge University Press, Cambridge (1995), 77--6.

• A.M. Cohen and D.B. Wales, SL (3, 3) is not maximal subgroup of the Lie group of type F4, Lin. Alg. and its Appl. 226--228 (1995), 287--296.

• G. Cornelissen, Sur les zéros des séries d'Eisenstein de poids pour (), C. R. Acad. Sci. Paris 321, Série I (1995), 817--820.

• A. Cossidente and L. Storme, Caps on elliptic quadrics, Finite Fields Appl. 1 (1995), 412--420.

• P. Cowling and F. Maffioli, Bounds for the Symmetric Travelling Salesman Problem through Matroid Formulation, European Journal of Operational Research 83 (1995), 301--310.

• F.M.G.T. Cuypers, On delta spaces satisfying Pasch's axiom, Journal of Geometry 53 (1995), 67--75.

• F.M.G.T. Cuypers, Affine Grassmannians, Journal Comb. Th. (A) 70 (1995), 289--305.

• F.M.G.T. Cuypers, Regular quaternionic polytopes, Lin. Alg. and its Appl. 226--228 (1995), 311--329.

• F.M.G.T. Cuypers, Flag-transitive extensions of buildings of type and , Groups of Lie Type and their Geometries (eds. W.M. Kantor, L. Di Martino), Cambridge University Press, Cambridge (1995), 97--110.

• F.M.G.T. Cuypers and J.I. Hall, The 3-transposition groups with trivial center, Journal of Algebra 178 (1995), 149--193.

• J. Daemen, R. Govaerts and J. Vandewalle, Correlation matrices, Fast Software Encryption, LNCS 1008 (ed. B. Preneel), Springer-Verlag (1995), 275--285.

• E. van Dam, Regular graphs with four eigenvalues, Linear Algebra Appl. 226--228 (1995), 139--162.

• E. van Dam and W. Haemers, Eigenvalues and the diameter of graphs, Linear Multilin. Alg. 39 (1995), 33--44.

• V.G. Deineko, R. Rüdiger and G.J. Woeginger, Sometimes travelling is easy: the master tour problem, in Proceedings of the Third Annual European Symposium on Algorithms, Lecture Notes on Computer Science LNCS 979, Springer, Berlin (1995), 128--141.

• D. van Delft, Het leven van een handelsreiziger, Wetenschapsbijlage NRC 5 (1995).

• M. Deza, V.P. Grishukhin, and M. Laurent, Hypermetrics in geometry of numbers, in Combinatorial Optimization (eds. W. Cook, L. Lovász, P. Seymour), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20, American Mathematical Society, Providence, R.I. (1995), 1--109.

• T.S.H. Driessen, A bankruptcy problem and an information trading problem, applications to k-convex games, ZOR-Methods and Models of Operations Research 41 (1995), 313--324.

• T.S.H. Driessen and C. Chang, (Pre)kernel catchers for cooperative games, OR Spektrum 17 (1995), 23--26.

• A. Frank and T. Jordán, How to make a strongly connected digraph two-connected, in Integer Programming and Combinatorial Optimization (eds. E. Balas, J. Clausen), Springer Lecture Notes in Computer Science 920 (1995), 414--425.

• G. Galambos and G.J. Woeginger, Minimizing the weighted number of tardy jobs in UET open shops, ZOR -- Mathematical Methods of Operations Research 41 (1995), 109--114.

• G. Galambos and G.J. Woeginger, Online bin-packing -- a restricted survey, ZOR -- Mathematical Methods of Operations Research 42 (1995), 25--45.

• J. Van Geel, The excellence property for generic splitting fields. A survey, Nieuw Archief, 13 (3) (1995), 297--311.

• Michel Gendreau, Martine Labbé and Gilbert Laporte, Efficient Heuristics for the Design of Ring Networks, Telecommunication systems 4 (1995), 177--188.

• A.M.H. Gerards, Matching, in Network Models (eds. M.O. Ball et al.), Handbooks in Operations Research and Management Science 7, North-Holland, Amsterdam (1995), 135--224.

• A.M.H. Gerards, On Tutte's characterization of graphic matroids---a graphic proof, Journal of Graph Theory 20 (1995), 351--359.

• A.M.H. Gerards and M. Laurent, A characterization of box -integral binary clutters, Journal of Combinatorial Theory, Series B 65 (1995), 186--207.

• R.W. Goldbach and H.L. Claasen, Classification of non-commutative rings of order dividing p to the power 4, Indagationes mathematicae 6, 2 (1995), 167--187.

• M. de Graaf and A. Schrijver, Characterizing homotopy of systems of curves on a compact surface by crossing numbers, Linear Algebra and Its Applications 226 (1995), 519--528.

• W. Haemers, Interlacing Eigenvalues and graphs, Linear Alg. Appl. 226--228 (1995), 593--616.

• W. Haemers and M.J. Coster, Quasi-symmetric designs related to the triangular graph, Designs, Codes and Cryptography 5 (1995), 27--42.

• W. Haemers and E. Spence, Graphs cospectral to distance-regular graphs, Linear Multilin Alg. 39 (1995), 91--107.

• P.W. Heijnen and H.C.A. van Tilborg, Optimum cyclic burst-correcting codes and their decoding algorithm, Proceedings of the International Workshop on optimal codes and related topics, Panora ma, Shumen, Bulgaria (1995), 74--89.

• C. Hoede, On the ontology of knowledge graphs, in Conceptual Structures, Applications, Implementation and Theory (eds. G. Ellis, R. Levinson, W. Rich, J.F. Sowa), Lecture Notes in Artificial Intelligence 954 (1995), 308--322.

• C. Hoede, On the ontology of knowledge graphs, in Conceptual Structures, Applications, Implementation and Theory (eds. G. Ellis, R. Levinson, W. Rich, J.F. Sowa), Lecture Notes in Artificial Intelligence 954 (1995), 308--322.

• D.W. Hoffmann and J. Van Geel, Minimal forms with respect to function fields of conics, Manus. Math. 86 (1995), 23--48.

• D.W. Hoffmann, D.W. Lewis and J. Van Geel, Minimal forms for function fields of conics, in Proceedings AMS Summer Institute, Quadratic forms and division algebras: Connections with algebraic K-theory and algebraic geometry, Proceedings of Symposia in Pure Mathemaics 58.2 (1995), 227--237.

• T. Höholdt and G.R. Pellikaan, On decoding algebraic-geometric codes, IEEE Transactions on Information Theory IT-41 (1995), 1589--1614.

• H. van der Holst, A short proof of the planarity characterization of Colin de Verdiere, Journal of Combinatorial Theory B 65 (1995), 269--272

• H. van der Holst, M. Laurent and A. Schrijver, On a minor-monotone graph invariant, Journal of Combinatorial Theory B 65 (1995), 291--304.

• H. van der Holst, L. Lovász and A. Schrijver, On the invariance of Colin de Verdière's graph parameter under clique sums, Linear Algebra and its Applications 226 (1995), 509--517.

• J.A. Hoogeveen and S.L. van de Velde, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time, Operations Research Letters 17 (1995), 205--208.

• J.A. Hoogeveen and S.L. van de Velde, Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems, Mathematical Programming 70 (1995), 173--190.

• J.A. Hoogeveen and S.L. van de Velde, Formulating a scheduling problem with almost identical jobs by using positional completion times, in Integer Programming and Combinatorial Optimization (eds. E. Balas, J. Clausen) , Lecture Notes in Computer Science 920, Springer, Berlin (1995), 292--306.

• J.A. Hoogeveen and S.L. van de Velde, Minimizing total completion time and maximum cost simultaneously is solvable in polynomi al time, Operations Research Letters 17 (1995), 205--208.

• J.A. Hoogeveen and S.L. van de Velde, Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems, Mathematical Programming 70 (1995), 173--190.

• Olaf Hooijen and H.C. Ferreira, Power Line Communication: An Overview, SAIEE (South African Institute of Electrical Engineers) Transactions 86 (1995), 145--161.

• C. Huybrechts, The nonexistence of 3-dimensional locally projective spaces of orders (2,9), J. Comb. Th. (A) 71 (1995), 340--342.

• M. Joswig and H. Van Maldeghem, An essay on the Ree octagons, J. Alg.\ Combin. 4 (1995), 145--164.

• J.A.H. Kahlman and K.A. Schouhamer Immink, Channel Code with Embedded Pilot Tracking Tones for D-VCR, IEEE Trans on Consumer Electronics CE-41 (1) (1995), 180--185.

• H. Kellerer, T. Tautenhahn and G.J. Woeginger, Open shop scheduling with release dates to minimize maximum lateness, Naval Research Logistics 42 (1995), 141--145.

• D. Keppens and W. Mielants, On then number of points of a plane algebraic curve on , Ars Combinatoria 40 (1995), 121--128.

• C. Kirfel and G.R. Pellikaan, The minimum distance of codes in an array coming from telecopic semigroups, IEEE Transactions on Information Theory IT-41 (1995), 1720--1732.

• B. Klinz, R. Rüdiger and G.J. Woeginger, Permuting matrices to avoid forbidden submatrices, Discrete Applied Mathematics 60 (1995), 223--248.

• B. Klinz, R. Rüdiger and G.J. Woeginger, On the recognition of permuted bottleneck Monge matrices, Discrete Applied Mathematics 63 (1995), 43--74.

• B. Klinz and G.J. Woeginger, Minimum cost dynamic flows: the series-parallel case, in Integer Programming and Combinatorial Optimization (eds. E. Balas, J. Clausen), Lecture Notes in Computer Science 920, Springer, Berlin (1995), 329--343.

• E.A. de Kock, E.H.L. Aarts, G. Essink, R.E.J. Jansen and J.H.M. Korst, A variable-depth search algorithm for recursive bi-partitioning of signal flow graphs, OR Spektrum 17 (1995), 159--172.

• A.W.J. Kolen and J.K. Lenstra, Combinatorics in operations research, in Handbook of Combinatorics (eds. R.L. Graham, M. Grötschel, L. Lovász), North-Holland, Amsterdam (1995), 1875--1910.

• A.W.J. Kolen and J.K. Lenstra, Combinatorics in operations research, in Handbook of Combinatorics (eds. R.L. Graham, M. Gr"otschel, L. Lovász), North-Holland, Amsterdam (1995), 1875--1910.

• A.W.J. Kolen and J.K. Lenstra, Combinatorics in operations research, in Handbook of Combinatorics (eds. R.L. Graham et al.), Elsevier Science, Amsterdam (1995), 1875--1910.

• V. Korjik, M. Ivkov, Yu. Merinovich, A. Barg and H.C.A. van Tilborg, A broadcast key distribution scheme based on block designs, in Cryptography and Coding (ed. C. Boyd), LNCS 1025, Springer Verlag, New York (1995), 3--12.

• J.H.M. Korst, S.P.P. Pronk, E.H.L. Aarts and F. Lamerikx, Periodic scheduling in a multimedia server, Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation, Paris, France 1 (1995), 205--216.

• Jan Korst, Wim Verhaegh and Emile Aarts, Mijmeringen over de leesmap, in Simplex Sigillum Veri (eds. E.H.L. Aarts, H.M.M. ten Eikelder, C. Hemerik, M.\ Rem), Technische Universiteit Eindhoven (1995), 231--234.

• M. Labbé, Gilbert Laporte and S. Martello, An exact Algorithm for the Dual Bin Packing Problem, Operations Research Letters 17 (1995), 9--18.

• M. Labbé, D. Peeters and J.F. Thisse, Facility location on networks, Handbook in Operations Research and Management Science 8: Network Routing (1995), 551--624.

• M. Laurent and S. Poljak, On a positive semidefinite relaxation of the cut polytope, Linear Algebra and its Applications 223 (1995), 439--461.

• M. Laurent and S. Poljak, One-third-integrality in the metric polytope, Mathematical Programing 71 (1995), 29--50.

• S. Lehman, A characterization of the grassmannian of points and lines for -buildings, Bull. Soc. Math. Belg. Simon Stevin 2 (1995), 87--97.

• J.K. Lenstra and D.B. Shmoys, Computing near-optimal schedules, in Scheduling Theory and Its Applications (eds. P. Chr'etienne, E.G. Coffman, Jr., J.K. Lenstra, Z. Liu), Wiley, Chichester (1995), 1--14.

• J.K. Lenstra and D.B. Shmoys, Computing near-optimal schedules, in Scheduling Theory and Its Applications (eds. P. Chr'etienne et al.), Wiley, Chichester (1995), 1--14.

• J.K. Lenstra and D.B. Shmoys, Computing near-optimal schedules, in Scheduling Theory and Its Applications (eds. P. Chrétienne, E.G. Coffman jr., J.K. Lenstra, Z. Liu), Wiley, Cichester (1995), 1--14.

• A. J. de Lind van Wijngaarden, Quasi-linear Synchronization Codes, Proc. 1995 IEEE Int'l Symp. on Inform. Theory, Whistler, Canada (1995), 463.

• A. J. de Lind van Wijngaarden and H. Morita, Extended Prefix Synchronized Codes, Proc. 1995 IEEE Int'l Symp. on Inform. Theory, Whistler, Canada (1995), 465.

• A. J. de Lind van Wijngaarden and H. Morita, An Enumerative Coding Algorithm for Extended Prefix-Synchronized Codes, Proc. 18th Symp. on Information Theory and its Applications, Hanamaki, Japan (1995), 13--16.

• A. J. de Lind van Wijngaarden and H. Morita, Coding Algorithms for EPS-Codes using Index Functions, Proc. 1995 Int'l Symp. on Synchronisation (1995), 102--104.

• A. J. de Lind van Wijngaarden and T.J. Willink, On the Performance of Distributed Marker Sequences for Gaussian Channels, Proc. 1995 Int'l Symp. on Synchronisation (1995), 84--90.

• J.H. van Lint, Coding Theory, in Chapter 16, Handbook of Combinatorics (eds. R.L. Graham, M. Grötschel, L.\ Lovász), Elsevier (1995), 773--807.

• H. Van Maldeghem, The non-existence of certain regular generalized polygons, Arch. Math. 64 (1995), 86--96.

• H. Van Maldeghem, The geometry of traces in Ree octagons, in Groups of Lie Type and their Geometries (eds. W.M. Kantor, L. Di Martino), Cambridge University Press, London Math. Soc. Lect. Notes Ser. 207 (1995), 157--171.

• A.J. de Man, On composants of solenoids, Fundamenta Mathematica 147 (1995), 181--188.

• A.J. de Man, On composants of solenoids, Electronic Research Announcements of the AMS 1 (2) (1995), 87--90.

• Ph. Masson, Description explicite d'une famille de groupes de Kac-Moody affines, Bull. Belg. Math. Soc. Simon Stevin 2 (1995), 183--195.

• H.B. Meeuwissen, J.P.M. Schalkwijk and A.H.A. Bloemen, An Extension of the Achievable Rate Region of Schalkwijk's 1983 Coding Strategy for the Binary Multiplying Channel, Proceedings IEEE 1995 International Symposium on Information Theory, Whistler, BC, Canada (1995), 445.

• J.S.B. Mitchell, G. Rote, G. Sundaram and G.J. Woeginger, Counting convex polygons in planar point sets, Information Processing Letters 56 (1995), 45--49.

• C.M. O'Keefe and J.A. Thas, Ovoids of the quadric , , European J. Combin. 16 (1995), 87--92.

• L. Patrovics and K.A. Schouhamer Immink, Performance assessment of guided scrambling, Proc. IEEE 3rd Symposium on Communications and Vehicular Technology in the Benelux, Eindhoven, The Netherlands (1995), 122--127.

• M.J.P. Peeters, On the p-ranks of net graphs, Codes Designs and Cryptography 5 (1995), 139--153.

• M.J.P. Peeters, Uniqueness of Strongly Regular graphs having minimal p-rank, Linear Alg. Appl. 226--228 (1995), 9--31.

• B. Preneel, Ongeoorloofde onderschepping van computercommunicaties - encryptie, Handboek Informatiebeveiliging, Kluwer (1995), 101--146.

• B. Preneel, Software performance of encryption algorithms and hash functions ( invited talk), Proceedings of the Workshop on Selected Areas in Cryptography -- SAC'95, Ottawa (1995), 89--98.

• B. Preneel and P.C. van Oorschot, MDx-MAC and building fast MACs from hash functions, Advances in Cryptology, Proceedings Crypto'95, LNCS 963 (ed. D. Coppersmith), Springer-Verlag (1995), 1--14.

• B. Preneel and P.C. van Oorschot, Further comments on keyed MD5, CryptoBytes 1 (2), 15.

• B. Preneel and J. Walrand, Convergence of a quasistatic frequency allocation algorithm, Journal of High Speed Networks 4 (1995), 1--21.

• C. Radu, R. Govaerts and J. Vandewalle, Prepaid electronic cheques using public-key certificates, Cryptography and Coding, Proceedings 5th IMA Conference, LNCS 1025 (ed. C. Boyd), Springer-Verlag (1995), 132--141.

• C. Radu, M. Vandenwauver, R. Govaerts and J. Vandewalle, Methodology for implementing the access control in behaviorally object-oriented database systems, Intelligent Systems, Proceedings of the Third Golden West International Conference (ed. E.A. Yfantis), Kluwer Academic Publishers (1995), 749--75

• C. Radu, M. Vandenwauver, R. Govaerts and J. Vandewalle, An efficient traceable payment system, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel (NL) (1995), 61--67.

• Michel Rey, Patrick Soriano and Etienne Stampfli, La localisation d'une installation de stockage de dechets stabilises: le cas de la Suisse romande, INFOR 33 (1995), 50--62.

• V. Rijmen and B. Preneel, Improved characteristics for differential cryptanalysis of hash functions based on block ciphers, Fast Software Encryption, LNCS 1008 (ed. B. Preneel), Springer-Verlag (1995), 242--248.

• V. Rijmen and B. Preneel, Cryptanalysis of McGuffin, Fast Software Encryption, LNCS 1008 (ed. B. Preneel), Springer-Verlag (1995), 353--358.

• V. Rijmen and B. Preneel, On weaknesses of non-surjective round functions, Proceedings of the Workshop on Selected Areas in Cryptography -- SAC'95, Ottawa (1995), 100--106.

• R. Rüdiger and G.J. Woeginger, The cone of Monge matrices: extremal rays and applications, ZOR -- Mathematical Methods of Operations Research 42 (1995), 161--168.

• J.P.M. Schalkwijk , H.B. Meeuwissen and A.H.A. Bloemen, New Results on a Fundamental Problem in Network Information Theory, Tijdschrift van het Nederlands Elektronica- en Radiogenootschap 60 (1995), nr. 3, 99--104.

• J.P.M. Schalkwijk, H.B. Meeuwissen and P.J.E. Diedericks, Two-way Channels with Delay, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel, The Netherlands (1995), 33--39.

• K.A. Schouhamer Immink, Digital Versatile Disc (DVD): Channel Coding and System Requirements, Proceedings SMPTE Convention, New Orleans (1995).

• K.A. Schouhamer Immink, MultiMedia Compact Disc: Channel Coding and System Requirements, Proceedings 99th AES Convention, New York (1995).

• K.A. Schouhamer Immink, Constructions of Almost-Block-Decodable RLL Codes, IEEE Trans on Information Theory 41 (1995), 284--287.

• K.A. Schouhamer Immink, EFMPlus: The Coding Format of the MultiMedia Compact Disc, IEEE Trans on Consumer Electronics CE-41 (1995), 491--497.

• K.A. Schouhamer Immink, G.J. van den Enden, and J.A.H. Kahlman, System Requirements of a Stationary-Head Multi-Track Recorder, IEEE Trans on Magnetics 31 (2) (1995), 1027--1030.

• A. Schrijver, Polyhedral combinatorics, in Handbook of Combinatorics (eds. R.L. Graham et al.), Elsevier Science, Amsterdam (1995), 1649--1704.

• H. Schwarte, Informationstheoretische Untersuchungen zur Approximation von Übertragungskanälen, Dissertation, Essen (1995).

• J.J. Seidel, Geometric representations of graphs, Lin. Multilin. Algebra 39 (1995), 45--57.

• J.J. Seidel, Isometric embeddings ad geometric designs, Discr. Math. 136 (1995), 281--293.

• J.J. Seidel and M. Aigner, Knoten, Spin Modelle und Graphen, Jahresberichte D.M.V. 97 (1995), 75--96.

• Yu.M. Shtarkov, Tj.J. Tjalkens and F.M.J. Willems, Multialphabet Universal Coding of Memoryless Sources, Problems of Information Transmission 31 (1995), no. 2, 114--127.

• E.E. Shult and J.A. Thas, Constructions of polygons from buildings, Proc. London Math. Soc. 71 (3) (1995), 397--440.

• J. Simonis, MacWilliams identities and coordinate partitions, Linear Algebra and its applications 216 (1995), 81--91.

• J. Simonis, Stoeien met Hilbertmatrices, Caleidoscoop van de Wiskunde, Delftse Universitaire Pers, Delft (1995).

• J. Simonis, GUAVA, a computer algebra package for coding theory, Computer Algebra Nederland nieuwsbrief 13 (1994).

• V. De Smet and H. Van Maldeghem, A geometric construction of a class of twisted field planes by Ree-Tits unitals, Geom. Dedicata 58 (1995), 127--143.

• Th.H.M. Smits, De vierde dimensie, Caleidoscoop van de Wiskunde, Delftse Universitaire Pers, Delft (1995).

• C.C. De Souza and M. Laurent, Some new classes of facets for the equicut polytope, Discrete Applied Mathematics 62 (1995), 167--191.

• F. Spieksma, G.J. Woeginger and Z. Yu, Scheduling with safety distances, Annals of Operations Research 57 (1995), 251--264.

• H.P. Stehouwer, E.H.L. Aarts and J. Wessels, Multi-layered perceptrons for on-line lot sizing, Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation, Paris, France 1 (1995), 279--287.

• H.J.M. Sterk, Lattices and K3 surfaces of degree 6, Linear Algebra and its Applications 226--228 (1995), 297--109.

• H.J.M. Sterk, Compactifications of the period spaces of Enriques surfaces II, Math. Z. 220 (1995), 427--444.

• L. Storme and H. Van Maldeghem, Primitive arcs in PG, J. Combin. Theory, Ser. A 69 (2) (1995), 200--216.

• L. Storme and H. Van Maldeghem, Cyclic caps in PG, Geom. Dedicata 56 (1995), 271--284.

• L. Storme and H. Van Maldeghem, Arcs fixed by a large cyclic group, Atti Sem. Mat. Fis. Univ. Modena XLIII (1995), 273--280.

• L. Storme and J.A. Thas, k-arcs and partial flocks, Linear Algebra Appl. 226--228 (1995), 33--45.

• F.W. Sun and H.C.A. van Tilborg, The Leech lattice, the octocode, and decoding algorithms, IEEE Trans. Inf. Theory 41 (1995), 1097--1106.

• J.A. Thas, Projective Geometry over a Finite Field, Chapter 7 in ``Handbook of Incidence Geometry'' (ed. F. Buekenhout), North-Holland (1995), 295--347.

• J.A. Thas, Generalized Polygons, Chapter 9 in ``Handbook of Incidence Geometry'' (ed. F. Buekenhout), North-Holland (1995), 383-- 431.

• J. A. Thas and H. Van Maldeghem, The classification of finite generalized quadrangles admitting a group acting transitively on ordered pentagons, J. London Math. Soc. 51 (1995), 209--218.

• H.C.A. van Tilborg, Authentication codes: an area where coding and cryptography meet, in Cryptography and Coding (ed. C. Boyd), LNCS 1025, Springer Verlag, New York (1995), 169--183.

• S.R. Tiourine, C.A.J. Hurkens and J.K. Lenstra, Combinatorial Bound for the RLFAP, Rapport T.221.B voor het EUCLID CALMA ``Radio Link Frequency Assignment Project'' voor de ``Management Group'' die de ministeries van defensie van Nederland, Groot-Brittannië en Frankrijk vertegenwoordigde (1995), 12.

• S.R. Tiourine, C.A.J. Hurkens and J.K. Lenstra, Local Search, Rapport 233 voor het EUCLID CALMA ``Radio Link Frequency Assignment Project'' voor de "Management Group" die de ministeries van defensie van Nederland, Groot-Brittannië en Frankrijk vertegenwoordigde (1995), 8.

• S.R. Tiourine, C.A.J. Hurkens and J.K. Lenstra, Local Search, Rapport T. 233 voor het EUCLID CALMA ``Radio Link Frequency Assignment Project'' voor de ``Management Group'' die de ministeries van defensie van Nederland, Groot-Brittannië en Frankrijk vertegenwoordigde (1995), 15.

• S.R. Tiourine, C.A.J. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Rapport 2.5 voor het EUCLID CALMA ``Radio Link Frequency Assignment Project'' voor de ``Management Group'' die de ministeries van defensie van Nederland, Groot-Brittanni"e en Frankrijk vertegenwoordigde (1995), 9. Proceedings of the CALMA Symposium on Combinatorial Algorithms for Military Applications, Scheveningen (1995), 53-62.

• Tj.J. Tjalkens and F.M.J. Willems, A Comparison of the Lempel-Ziv 1977 and 1978 Universal Data Compression Schemes, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel, The Netherlands (1995), 1--2.

• L.M.G.M. Tolhuizen and C.P.M.J. Baggen, Block variations of Diamond codes, Proc. 16-th Symp. on Information Theory in The Benelux (1995), 127--131.

• L. Tolhuizen, Henk Hollmann and Ton Kalker, On the Realizablity of Bi-orthogonal, m-Dimensional 2 band Filter Bank, IEEE Trans. Sign. Proc. 43 (1995), 640--648.

• L.M.G.M. Tolhuizen, K.A. Schouhamer Immink and H.D.L. Hollmann, Constructions and Properties of Block Codes for Partial-Response Channels, IEEE Trans. on Inform. Th. IT-41 (6) (1995), 2019--2026.

• L. Tolhuizen, K.A. Schouhamer Immink, and H. Hollmann, Constructions and Properties of Block Codes for Partial-Response Channels, IEEE Trans on Information Theory 41 (1995), 2019--2026.

• van Trung Tran, On the Construction of Authentication and Secrecy Codes, Designs, Codes and Cryptography 5 (1995).

• J. Vandewalle, B. Preneel, R. Govaerts and J. Dumortier, Informatiebeveiliging, in Wegen van Hoop. Universitaire Perspectieven (Red. B. Pattyn, B. Raymaekers, C. Steel, H. Van Gorp, C. De Ranter, A. Dupré, M-J. Bellen), Universitaire Pers Leuven (1995), 308--321.

• H.J. Veldman, -cycles in 3-cyclable graphs, Graphs and Combinatorics 11 (1995), 379--388.

• W.F.J. Verhaegh, P.E.R. Lippens, E.H.L. Aarts and J.H.M. Korst, Improved force-directed scheduling in high-throughput digital signal processing, IEEE Transactions on Computer Aided Design 14 (1995), 945--960.

• W.F.J. Verhaegh, P.E.R. Lippens, E.H.L. Aarts, J.H.M. Korst, J.L. van Meerbergen, and A. van der Werf, Improved force-directed scheduling in high-throughput digital signal processing, IEEE Transactions on Computer-Aided Design 14 (1995), 945--960.

• M.G.A. Verhoeven and E.H.L. Aarts, Parallel local search and job shop scheduling, in Parallel Algorithms for Irregular Problems: State of the Art (eds. A. Ferreira, J.D.P. Rolim), Kluwer, Dordrecht (1995), 195--212.

• M.G.A. Verhoeven, E.H.L. Aarts and M.E.M. Severens, Local search for the Steiner tree problem in graphs, Proceedings of the International Conference on Applied Decision Technologies, London (1995), 345--351.

• M.G.A. Verhoeven, E.H.L. Aarts and P.C.J. Swinkels, A parallel 2-opt algorithm for the traveling salesman problem, Future Generation Computer Systems 11 (1995), 175--182.

• P.J.M. Veugen, Tail Conditions for Multiple Repetition Feedback Block Coding, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel, The Netherlands (1995), 107--113.

• P.J.M. Veugen, Multiple Repetition Feedback Coding for Arbitrary Discrete Memoryless Channels, Proceedings IEEE 1995 International Symposium on Information Theory, Whistler, BC, Canada (1995), 457.

• P.J.M. Veugen, The Security of an RSA-Based Cut-and-Choose Protocol, EIDMA Report 95-1 (1995), 1--15. ISBN 90-75332-02-5.

• A.J. Han Vinck, Packet Synchronization Aspects, IEE Colloquium on New Synchronisation Techniques for Radio Systems, London, UK (1995), p. 1.

• A.J. Han Vinck, J. Keuning und Sang Wu Kim, On the Capacity for the T-User M-Frequency Noiseless Multiple Access Channel without Intensity Information, IEEE International Symposium on Information Theory, Whistler, Canada (1995), 444.

• A.J. Han Vinck and Feng Wen Sun, An Algorithm for Identifying Rate Catastrophic Punctured Convolutional Encoders, IEEE International Symposium on Information Theory, Whistler, Canada (1995), 161.

• A.J. Han Vinck, F. Swarts, H.C. Ferreira and I. Broere, On Linear Block Codes, Graphs and Weight Distributions, Proceedings IEEE COMSIG '95, Pretoria, South Africa, 103--106

• A.J. Han Vinck, Adriaan van Wijngaarden and Hiroyoshi Morita, Maximal Prefix Synchronized Codes by Means of Enumerative Coding, IEEE International Symposium on Information Theory, Whistler, Canada (1995), 466.

• P.A.J. Volf and F.M.J. Willems, A Study of the Context-Tree Maximizing Method, Proceedings 16th Symposium on Information Theory in the Benelux, Nieuwerkerk a/d IJssel, The Netherlands (1995), 3--9.

• P.A.J. Volf and F.M.J. Willems, On the Context Tree Maximizing Algorithm, Proceedings IEEE 1995 International Symposium on Information Theory, Whistler, BC, Canada (1995), 20.

• F.M.J. Willems, Weighting Algorithms, Proceedings IEEE 1995 Information Theory Workshop, Rydzyna, Poland (1995), 7.3.1--7.3.2.

• F. Willems and F. Casadei, Weighted Coding Methods for Binary Piecewise Memoryless Sources, Proceedings IEEE 1995 International Symposium on Information Theory, Whistler, BC, Canada (1995), 323.

• F.M.J. Willems, Yu.M. Shtarkov and Tj.J. Tjalkens, The Context-Tree Weighting Method: Basic Properties, IEEE Transactions on Information Theory 41 (1995), 653--664.

• G.J. Woeginger, On the rate of taxation in a cooperative bin packing game, ZOR -- Mathematical Methods of Operations Research 42 (1995), 313--324.

• G.J. Woeginger, Scheduling with time-dependent execution times, Information Processing Letters 54 (1995), 155--156.

• G.J. Woeginger, On the Rate of Taxation in a Cooperative Bin Packing Game, ZOR -- Mathematical Methods of Operations Research 42 (1995), 313--324.

• G.J. Woeginger, Scheduling with Time-dependent Execution Times, Information Processing Letters 54 (1995), 155--156.

• G.J. Woeginger, P. Auer, P.M. Long and W. Maass, On the Complexity of Function Learning, Machine Learning 18 (1995), 187--230.

• G.J. Woeginger, R.E. Burkard and E. Ģela, A Minmax Assignment Problem in Treelike Communication Networks, European Journal of Operational Research 87 (1995), 670--684.

• G.J. Woeginger and B. Chen, A Study of On-line Shop Scheduling Problems on Two Machines, in Minmax Problems and Applications, Kluwer (1995), 97--107.

• G.J. Woeginger, B. Chen and A. van Vliet, An Optimal Algorithm for Preemptive On-line Scheduling, Operation Research Letters 18 (1995), 127--131.

• G.J. Woeginger, V.G. Deineko and R. Rüdiger, Sometimes Travelling is Easy: The Master Tour Problem, Proceedings of the Third Annual European Symposium on Algorithms, LNCS 979, Springer Verlag (1995), 128--141.

• G.J. Woeginger and G. Galambos, Minimizing the Weighted Number of Tardy Jobs in UET Open Shops, ZOR -- Mathematical Methods of Operations Research 41 (1995), 109--114.

• G.J. Woeginger and G. Galambos, Online Bin-Packing -- A Restricted Survey, ZOR -- Mathematical Methods of Operations Research 42 (1995), 25--45.

• G.J. Woeginger, H. Kellerer and T. Tautenhahn, Open Shop Scheduling with Release Dates to Minimize Maximum Lateness, Naval Res. Log. 42 (1995), 141--145.

• G.J. Woeginger and B. Klinz, Minimum Cost Dynamic Flows: The Series-Parallel Case, Proceedings of IPCO IV, LNCS 920, Springer Verlag (1995), 329--343.

• G.J. Woeginger, B. Klinz and R. Rüdiger, On the Recognition of Permuted Bottleneck Monge Matrices, Discrete Applied Mathematics 63 (1995), 43--74.

• G.J. Woeginger, B. Klinz and R. Rüdiger, Permuting Matrices to Avoid Forbidden Submatrices, Discrete Applied Mathematics 60 (1995), 223--248.

• G.J. Woeginger, J.S.B. Mitchell, G. Rote and G. Sundaram, Counting Convex Polygons in Planar Point Sets, Information Processing Letters 56 (1995), 45--49.

• G.J. Woeginger and R. Rüdiger, The Cone of Monge Matrices: Extremal Rays and Applications, ZOR -- Mathematical Methods of Operations Research 42 (1995), 161--168.

• G.J. Woeginger, F. Spieksma and Z. Yu, Scheduling with Safety Distances, Annals of Operations Research 57 (1995), 251--264.

• W. Yu, On decomposition of the total tardiness problem, Operations Research Letters 17 (1995), 221--229.

• A.J. van Zanten, The ranking problem of a Gray code for compositions, Ars Combinatoria 41 (1995), 257--268.

• A.J. van Zanten, Ramsey-theorie of het gegeneraliseerde duivenhokprincipe, Caleidoscoop van de Wiskunde, Delftse Universitaire Pers, Delft (1995).