Martin Aigner - RankMe

37 papers A 1Journal 31Unranked 1

Year	Rank	Type	Title / Venue / Authors
2013	—	`ch.`	Reconstruction Problems for Digraphs. The Mathematics of Paul Erdős II Martin Aigner, Eberhard Triesch
2008	J	`jnl`	Enumeration via ballot numbers. Discret. Math. Martin Aigner
2005	J	`jnl`	The $k$-Equal Problem. Comb. Probab. Comput. Martin Aigner
2005	J	`jnl`	The plurality problem with three colors and more. Theor. Comput. Sci. Martin Aigner, Gianluca De Marco, Manuela Montangero
2004	—	`book`	Proofs from THE BOOK (3. ed.). Martin Aigner, Günter M. Ziegler
2004	A	`conf`	The Plurality Problem with Three Colors. STACS Martin Aigner, Gianluca De Marco, Manuela Montangero
2004	J	`jnl`	Variants of the majority problem. Discret. Appl. Math. Martin Aigner
2001	—	`conf`	Lattice Paths and Determinants. Computational Discrete Mathematics Martin Aigner
1999	J	`jnl`	A Characterization of the bell numbers. Discret. Math. Martin Aigner
1999	J	`jnl`	Catalan-like Numbers and Determinants. J. Comb. Theory A Martin Aigner
1999	—	`ch.`	Geometrische Darstellungen von Graphen und der 4-Farbensatz. Angewandte Mathematik, insbesondere Informatik Martin Aigner
1998	J	`jnl`	Motzkin Numbers. Eur. J. Comb. Martin Aigner
1997	J	`jnl`	Finding the Maximum and Minimum. Discret. Appl. Math. Martin Aigner
1997	J	`jnl`	Searching for counterfeit coins. Graphs Comb. Martin Aigner, Anping Li
1996	J	`jnl`	Searching with Lies. J. Comb. Theory A Martin Aigner
1995	J	`jnl`	Bounds on the Size of Merging Networks. Discret. Appl. Math. Martin Aigner, Otfried Schwarzkopf
1995	J	`jnl`	Preface. Discret. Math. Martin Aigner, Rudolf Wille
1995	J	`jnl`	Searching for acyclic orientations of graphs. Discret. Math. Martin Aigner, Eberhard Triesch, Zsolt Tuza
1994	J	`jnl`	Codings of graphs with binary edge labels. Graphs Comb. Martin Aigner, Eberhard Triesch
1994	J	`jnl`	Matchings in Lattice Graphs and Hamming Graphs. Comb. Probab. Comput. Martin Aigner, Regina Klimmek
1994	J	`jnl`	Realizability and uniqueness in graphs. Discret. Math. Martin Aigner, Eberhard Triesch
1993	—	`book`	Diskrete Mathematik. Martin Aigner
1993	J	`jnl`	Reconstructing a Graph from its Neighborhood Lists. Comb. Probab. Comput. Martin Aigner, Eberhard Triesch
1991	J	`jnl`	Partitioning a power set into union-free classes. Discret. Math. Martin Aigner, Dwight Duffus, Daniel J. Kleitman
1991	J	`jnl`	Preface. Discret. Math. Martin Aigner, Rudolf Wille
1990	J	`jnl`	Irregular Assignments of Trees and Forests. SIAM J. Discret. Math. Martin Aigner, Eberhard Triesch
1989	J	`jnl`	The double selection problem. Discret. Math. Martin Aigner
1989	J	`jnl`	The total interval number of a graph. J. Comb. Theory B Thomas Andreae, Martin Aigner
1988	J	`jnl`	Hook-free coloring and a problem of Hanson. Comb. Martin Aigner, D. Grieser
1988	J	`jnl`	Searching for an edge in a graph. J. Graph Theory Martin Aigner, Eberhard Triesch
1987	J	`jnl`	Preface. Discret. Math. Martin Aigner, Rudolf Wille
1987	J	`jnl`	Sorting by insertion of leading elements. J. Comb. Theory A Martin Aigner, Douglas B. West
1986	J	`jnl`	Search problems on graphs. Discret. Appl. Math. Martin Aigner
1984	J	`jnl`	A game of cops and robbers. Discret. Appl. Math. Martin Aigner, M. Fromme
1982	J	`jnl`	Parallel Complexity of Sorting Problems. J. Algorithms Martin Aigner
1982	J	`jnl`	Selecting the top three elements. Discret. Appl. Math. Martin Aigner
1981	J	`jnl`	Producing posets. Discret. Math. Martin Aigner