| 2009 |
| 32 | EE | Martin Aigner,
Bert Jüttler,
Laureano González-Vega,
Josef Schicho:
Parameterizing surfaces with certain special support functions, including offsets of quadrics and rationally supported surfaces.
J. Symb. Comput. 44(2): 180-191 (2009) |
| 2008 |
| 31 | EE | Martin Aigner,
Bert Jüttler:
Gauss-Newton-type techniques for robustly fitting implicitly defined curves and surfaces to unorganized data points.
Shape Modeling International 2008: 121-130 |
| 30 | EE | Martin Aigner:
Enumeration via ballot numbers.
Discrete Mathematics 308(12): 2544-2563 (2008) |
| 2007 |
| 29 | EE | Martin Aigner,
Zbynek Sír,
Bert Jüttler:
Evolution-based least-squares fitting using Pythagorean hodograph spline curves.
Computer Aided Geometric Design 24(6): 310-322 (2007) |
| 28 | EE | Martin Aigner,
Bert Jüttler:
Hybrid curve fitting.
Computing 79(2-4): 237-247 (2007) |
| 2006 |
| 27 | EE | Martin Aigner,
Zbynek Sír,
Bert Jüttler:
Least-Squares Approximation by Pythagorean Hodograph Spline Curves Via an Evolution Process.
GMP 2006: 45-58 |
| 2005 |
| 26 | EE | Martin Aigner:
The $k$-Equal Problem.
Combinatorics, Probability & Computing 14(1-2): 17-24 (2005) |
| 25 | EE | Martin Aigner,
Gianluca De Marco,
Manuela Montangero:
The plurality problem with three colors and more.
Theor. Comput. Sci. 337(1-3): 319-330 (2005) |
| 2004 |
| 24 | EE | Martin Aigner,
Bert Jüttler,
Myung-Soo Kim:
Analyzing and Enhancing the Robustness of Implicit Representations.
GMP 2004: 131-142 |
| 23 | EE | Martin Aigner,
Gianluca De Marco,
Manuela Montangero:
The Plurality Problem with Three Colors.
STACS 2004: 513-521 |
| 22 | EE | Martin Aigner:
Variants of the majority problem.
Discrete Applied Mathematics 137(1): 3-25 (2004) |
| 2001 |
| 21 | EE | Martin Aigner:
Lattice Paths and Determinants.
Computational Discrete Mathematics 2001: 1-12 |
| 1999 |
| 20 | EE | Martin Aigner:
A Characterization of the bell numbers.
Discrete Mathematics 205(1-3): 207-210 (1999) |
| 19 | EE | Martin Aigner:
Catalan-like Numbers and Determinants.
J. Comb. Theory, Ser. A 87(1): 33-51 (1999) |
| 1998 |
| 18 | EE | Martin Aigner:
Motzkin Numbers.
Eur. J. Comb. 19(6): 663-675 (1998) |
| 1997 |
| 17 | EE | Martin Aigner:
Finding the Maximum and Minimum.
Discrete Applied Mathematics 74(1): 1-12 (1997) |
| 1996 |
| 16 | EE | Martin Aigner:
Searching with Lies.
J. Comb. Theory, Ser. A 74(1): 43-56 (1996) |
| 1995 |
| 15 | EE | Martin Aigner,
Otfried Schwarzkopf:
Bounds on the Size of Merging Networks.
Discrete Applied Mathematics 61(3): 187-194 (1995) |
| 14 | EE | Martin Aigner,
Rudolf Wille:
Preface.
Discrete Mathematics 144(1-3): 1 (1995) |
| 13 | EE | Martin Aigner,
Eberhard Triesch,
Zsolt Tuza:
Searching for acyclic orientations of graphs.
Discrete Mathematics 144(1-3): 3-10 (1995) |
| 1994 |
| 12 | | Martin Aigner,
Regina Klimmek:
Matchings in Lattice Graphs and Hamming Graphs.
Combinatorics, Probability & Computing 3: 157-165 (1994) |
| 11 | EE | Martin Aigner,
Eberhard Triesch:
Realizability and uniqueness in graphs.
Discrete Mathematics 136(1-3): 3-20 (1994) |
| 1993 |
| 10 | | Martin Aigner,
Eberhard Triesch:
Reconstructing a Graph from its Neighborhood Lists.
Combinatorics, Probability & Computing 2: 103-113 (1993) |
| 1991 |
| 9 | EE | Martin Aigner,
Rudolf Wille:
Preface.
Discrete Mathematics 88(2-3): 111 (1991) |
| 8 | EE | Martin Aigner,
Dwight Duffus,
Daniel J. Kleitman:
Partitioning a power set into union-free classes.
Discrete Mathematics 88(2-3): 113-119 (1991) |
| 1990 |
| 7 | | Martin Aigner,
Eberhard Triesch:
Irregular Assignments of Trees and Forests.
SIAM J. Discrete Math. 3(4): 439-449 (1990) |
| 1989 |
| 6 | EE | Thomas Andreae,
Martin Aigner:
The total interval number of a graph.
J. Comb. Theory, Ser. B 46(1): 7-21 (1989) |
| 1988 |
| 5 | | Martin Aigner,
D. Grieser:
Hook-free coloring and a problem of Hanson.
Combinatorica 8(2): 143-148 (1988) |
| 1987 |
| 4 | | Martin Aigner,
Rudolf Wille:
Preface.
Discrete Mathematics 63(2-3): 115 (1987) |
| 3 | EE | Martin Aigner,
Douglas B. West:
Sorting by insertion of leading elements.
J. Comb. Theory, Ser. A 45(2): 306-309 (1987) |
| 1982 |
| 2 | | Martin Aigner:
Parallel Complexity of Sorting Problems.
J. Algorithms 3(1): 79-88 (1982) |
| 1981 |
| 1 | EE | Martin Aigner:
Producing posets.
Discrete Mathematics 35(1-3): 1-15 (1981) |