Algorithmen für kombinatorische Optimierungsprobleme mit Partitionsbeschränkungen. - Matthias Leclerc (1987)

Eine Sicherheitsarchitektur für PC-Netze. - Matthias Leclerc; Michael Steinacker (GI Jahrestagung (1), 1989)

Optimizing over a slice of the bipartite matching polytope. - Matthias Leclerc (Discret. Math., 1989)

A multiply constrained matroid optimization problem. - Franz Rendl; Matthias Leclerc (Discret. Math., 1989)

The 2-matching lattice of a graph. - Dieter Jungnickel; Matthias Leclerc (J. Comb. Theory B, 1989)

Authentication and Access Control in a Distributed System. - Gerhard Hoffmann; Stephan Lechner; Matthias Leclerc; Ferdinand Steiner (ESORICS, 1990)

Sichere Kommunikationsnetze und deren Protokolle / Secure Communication Networks und Protocols. - Matthias Leclerc; Michael Steinacker (it Inf. Technol., 1990)

k-Best constrained bases of a matroid. - Matthias Leclerc; Franz Rendl (ZOR Methods Model. Oper. Res., 1990)

Realizing a Security Architecture. - Matthias Leclerc; Klaus Lukas (Open Distributed Processing, 1991)

Placement of Cryptographic Key Distribution Within OSI: Design Alternatives and Assessment. - Walter Fumy; Matthias Leclerc (Comput. Networks ISDN Syst., 1993)

Efficient algorithms for the clearing of interbank payments. - Michael M. Güntzer; Dieter Jungnickel; Matthias Leclerc (Eur. J. Oper. Res., 1998)