Martin Aigner

Publication Activity (10 Years)

Years Active: 1981-2008
Publications (10 Years): 0

Publications

Martin Aigner
Enumeration via ballot numbers. Discret. Math. 308 (12) (2008)
Martin Aigner, Gianluca De Marco, Manuela Montangero
The plurality problem with three colors and more. Theor. Comput. Sci. 337 (1-3) (2005)
Martin Aigner
The $k$-Equal Problem. Comb. Probab. Comput. 14 (1-2) (2005)
Martin Aigner, Gianluca De Marco, Manuela Montangero
The Plurality Problem with Three Colors. STACS (2004)
Martin Aigner
Variants of the majority problem. Discret. Appl. Math. 137 (1) (2004)
Martin Aigner
Lattice Paths and Determinants. Computational Discrete Mathematics (2001)
Martin Aigner
A Characterization of the bell numbers. Discret. Math. 205 (1-3) (1999)
Martin Aigner
Catalan-like Numbers and Determinants. J. Comb. Theory, Ser. A 87 (1) (1999)
Martin Aigner
Motzkin Numbers. Eur. J. Comb. 19 (6) (1998)
Martin Aigner
Finding the Maximum and Minimum. Discret. Appl. Math. 74 (1) (1997)
Martin Aigner, Anping Li
Searching for counterfeit coins. Graphs Comb. 13 (1) (1997)
Martin Aigner
Searching with Lies. J. Comb. Theory, Ser. A 74 (1) (1996)
Martin Aigner, Rudolf Wille
Preface. Discret. Math. 144 (1-3) (1995)
Martin Aigner, Otfried Schwarzkopf
Bounds on the Size of Merging Networks. Discret. Appl. Math. 61 (3) (1995)
Martin Aigner, Eberhard Triesch, Zsolt Tuza
Searching for acyclic orientations of graphs. Discret. Math. 144 (1-3) (1995)
Martin Aigner, Eberhard Triesch
Codings of graphs with binary edge labels. Graphs Comb. 10 (1) (1994)
Martin Aigner, Regina Klimmek
Matchings in Lattice Graphs and Hamming Graphs. Comb. Probab. Comput. 3 (1994)
Martin Aigner, Eberhard Triesch
Realizability and uniqueness in graphs. Discret. Math. 136 (1-3) (1994)
Martin Aigner, Eberhard Triesch
Reconstructing a Graph from its Neighborhood Lists. Comb. Probab. Comput. 2 (1993)
Martin Aigner, Rudolf Wille
Preface. Discret. Math. 88 (2-3) (1991)
Martin Aigner, Dwight Duffus, Daniel J. Kleitman
Partitioning a power set into union-free classes. Discret. Math. 88 (2-3) (1991)
Martin Aigner, Eberhard Triesch
Irregular Assignments of Trees and Forests. SIAM J. Discret. Math. 3 (4) (1990)
Thomas Andreae, Martin Aigner
The total interval number of a graph. J. Comb. Theory, Ser. B 46 (1) (1989)
Martin Aigner
The double selection problem. Discret. Math. 73 (1-2) (1989)
Martin Aigner, D. Grieser
Hook-free coloring and a problem of Hanson. Comb. 8 (2) (1988)
Martin Aigner, Eberhard Triesch
Searching for an edge in a graph. J. Graph Theory 12 (1) (1988)
Martin Aigner, Douglas B. West
Sorting by insertion of leading elements. J. Comb. Theory, Ser. A 45 (2) (1987)
Martin Aigner, Rudolf Wille
Preface. Discret. Math. 63 (2-3) (1987)
Martin Aigner
Search problems on graphs. Discret. Appl. Math. 14 (3) (1986)
Martin Aigner, M. Fromme
A game of cops and robbers. Discret. Appl. Math. 8 (1) (1984)
Martin Aigner
Selecting the top three elements. Discret. Appl. Math. 4 (4) (1982)
Martin Aigner
Parallel Complexity of Sorting Problems. J. Algorithms 3 (1) (1982)
Martin Aigner
Producing posets. Discret. Math. 35 (1-3) (1981)