Producing posets. - Martin Aigner 001 (Discret. Math., 1981)

Selecting the top three elements. - Martin Aigner 001 (Discret. Appl. Math., 1982)

Parallel Complexity of Sorting Problems. - Martin Aigner 001 (J. Algorithms, 1982)

A game of cops and robbers. - Martin Aigner 001; M. Fromme (Discret. Appl. Math., 1984)

Search problems on graphs. - Martin Aigner 001 (Discret. Appl. Math., 1986)

Preface. - Martin Aigner 001; Rudolf Wille (Discret. Math., 1987)

Sorting by insertion of leading elements. - Martin Aigner 001; Douglas B. West (J. Comb. Theory A, 1987)

Hook-free coloring and a problem of Hanson. - Martin Aigner 001; D. Grieser (Comb., 1988)

Searching for an edge in a graph. - Martin Aigner 001; Eberhard Triesch (J. Graph Theory, 1988)

The double selection problem. - Martin Aigner 001 (Discret. Math., 1989)

The total interval number of a graph. - Thomas Andreae; Martin Aigner 001 (J. Comb. Theory B, 1989)

Irregular Assignments of Trees and Forests. - Martin Aigner 001; Eberhard Triesch (SIAM J. Discret. Math., 1990)

Partitioning a power set into union-free classes. - Martin Aigner 001; Dwight Duffus; Daniel J. Kleitman (Discret. Math., 1991)

Diskrete Mathematik. - Martin Aigner 001 (Vieweg, 1993)

Reconstructing a Graph from its Neighborhood Lists. - Martin Aigner 001; Eberhard Triesch (Comb. Probab. Comput., 1993)

Matchings in Lattice Graphs and Hamming Graphs. - Martin Aigner 001; Regina Klimmek (Comb. Probab. Comput., 1994)

Realizability and uniqueness in graphs. - Martin Aigner 001; Eberhard Triesch (Discret. Math., 1994)

Codings of graphs with binary edge labels. - Martin Aigner 001; Eberhard Triesch (Graphs Comb., 1994)

Bounds on the Size of Merging Networks. - Martin Aigner 001; Otfried Schwarzkopf (Discret. Appl. Math., 1995)

Searching for acyclic orientations of graphs. - Martin Aigner 001; Eberhard Triesch; Zsolt Tuza (Discret. Math., 1995)

Searching with Lies. - Martin Aigner 001 (J. Comb. Theory A, 1996)

Finding the Maximum and Minimum. - Martin Aigner 001 (Discret. Appl. Math., 1997)

Searching for counterfeit coins. - Martin Aigner 001; Anping Li (Graphs Comb., 1997)

Motzkin Numbers. - Martin Aigner 001 (Eur. J. Comb., 1998)

Geometrische Darstellungen von Graphen und der 4-Farbensatz. - Martin Aigner 001 (Angewandte Mathematik, insbesondere Informatik, 1999)

A Characterization of the bell numbers. - Martin Aigner 001 (Discret. Math., 1999)

Catalan-like Numbers and Determinants. - Martin Aigner 001 (J. Comb. Theory A, 1999)

Lattice Paths and Determinants. - Martin Aigner 001 (Computational Discrete Mathematics, 2001)

Proofs from THE BOOK (3. ed.). - Martin Aigner 001; Günter M. Ziegler (Springer, 2004)

The Plurality Problem with Three Colors. - Martin Aigner 001; Gianluca De Marco; Manuela Montangero (STACS, 2004)

Variants of the majority problem. - Martin Aigner 001 (Discret. Appl. Math., 2004)

The $k$-Equal Problem. - Martin Aigner 001 (Comb. Probab. Comput., 2005)

The plurality problem with three colors and more. - Martin Aigner 001; Gianluca De Marco; Manuela Montangero (Theor. Comput. Sci., 2005)

Enumeration via ballot numbers. - Martin Aigner 001 (Discret. Math., 2008)

Reconstruction Problems for Digraphs. - Martin Aigner 001; Eberhard Triesch (The Mathematics of Paul Erdős II, 2013)