Martin Aigner

According to our database, Martin Aigner authored at least 35 papers between 1981 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2013

Reconstruction Problems for Digraphs.

Martin Aigner, Eberhard Triesch

Proceedings of the Mathematics of Paul Erdős II, 2013

2008

Enumeration via ballot numbers.

Martin Aigner

Discret. Math., 2008

2005

The plurality problem with three colors and more.

Martin Aigner, Gianluca De Marco, Manuela Montangero

Theor. Comput. Sci., 2005

The $k$-Equal Problem.

Martin Aigner

Comb. Probab. Comput., 2005

2004

Variants of the majority problem.

Martin Aigner

Discret. Appl. Math., 2004

The Plurality Problem with Three Colors.

Martin Aigner, Gianluca De Marco, Manuela Montangero

Proceedings of the STACS 2004, 2004

Proofs from THE BOOK (3. ed.).

Martin Aigner, Günter M. Ziegler

Springer, ISBN: 978-3-540-40460-6, 2004

2001

Lattice Paths and Determinants.

Martin Aigner

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

1999

Catalan-like Numbers and Determinants.

Martin Aigner

J. Comb. Theory, Ser. A, 1999

A Characterization of the bell numbers.

Martin Aigner

Discret. Math., 1999

Geometrische Darstellungen von Graphen und der 4-Farbensatz.

Martin Aigner

Proceedings of the Angewandte Mathematik, 1999

1998

Motzkin Numbers.

Martin Aigner

Eur. J. Comb., 1998

1997

Searching for counterfeit coins.

Martin Aigner, Anping Li

Graphs Comb., 1997

Finding the Maximum and Minimum.

Martin Aigner

Discret. Appl. Math., 1997

1996

Searching with Lies.

Martin Aigner

J. Comb. Theory, Ser. A, 1996

1995

Preface.

Martin Aigner, Rudolf Wille

Discret. Math., 1995

Searching for acyclic orientations of graphs.

Martin Aigner, Eberhard Triesch, Zsolt Tuza

Discret. Math., 1995

Bounds on the Size of Merging Networks.

Martin Aigner, Otfried Schwarzkopf

Discret. Appl. Math., 1995

1994

Codings of graphs with binary edge labels.

Martin Aigner, Eberhard Triesch

Graphs Comb., 1994

Realizability and uniqueness in graphs.

Martin Aigner, Eberhard Triesch

Discret. Math., 1994

Matchings in Lattice Graphs and Hamming Graphs.

Martin Aigner, Regina Klimmek

Comb. Probab. Comput., 1994

1993

Reconstructing a Graph from its Neighborhood Lists.

Martin Aigner, Eberhard Triesch

Comb. Probab. Comput., 1993

Diskrete Mathematik.

Martin Aigner

Vieweg Studium Aufbaukurs Mathematik = Advanced lectures in mathematics, Vieweg, ISBN: 978-3-528-07268-1, 1993

1991

Partitioning a power set into union-free classes.

Martin Aigner, Dwight Duffus, Daniel J. Kleitman

Discret. Math., 1991

1990

Irregular Assignments of Trees and Forests.

Martin Aigner, Eberhard Triesch

SIAM J. Discret. Math., 1990

1989

The total interval number of a graph.

Thomas Andreae, Martin Aigner

J. Comb. Theory, Ser. B, 1989

The double selection problem.

Martin Aigner

Discret. Math., 1989

1988

Searching for an edge in a graph.

Martin Aigner, Eberhard Triesch

J. Graph Theory, 1988

Hook-free coloring and a problem of Hanson.

Martin Aigner, D. Grieser

Comb., 1988

1987

Sorting by insertion of leading elements.

Martin Aigner, Douglas B. West

J. Comb. Theory, Ser. A, 1987

1986

Search problems on graphs.

Martin Aigner

Discret. Appl. Math., 1986

1984

A game of cops and robbers.

Martin Aigner, M. Fromme

Discret. Appl. Math., 1984

1982

Parallel Complexity of Sorting Problems.

Martin Aigner

J. Algorithms, 1982

Selecting the top three elements.

Martin Aigner

Discret. Appl. Math., 1982

1981

Producing posets.

Martin Aigner

Discret. Math., 1981