The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Martin Aigner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Aigner
    Lattice Paths and Determinants. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:1-12 [Conf]
  2. Martin Aigner, Bert Jüttler, Myung-Soo Kim
    Analyzing and Enhancing the Robustness of Implicit Representations. [Citation Graph (0, 0)][DBLP]
    GMP, 2004, pp:131-142 [Conf]
  3. Martin Aigner, Zbynek Sír, Bert Jüttler
    Least-Squares Approximation by Pythagorean Hodograph Spline Curves Via an Evolution Process. [Citation Graph (0, 0)][DBLP]
    GMP, 2006, pp:45-58 [Conf]
  4. Martin Aigner, Gianluca De Marco, Manuela Montangero
    The Plurality Problem with Three Colors. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:513-521 [Conf]
  5. Martin Aigner, D. Grieser
    Hook-free coloring and a problem of Hanson. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:2, pp:143-148 [Journal]
  6. Martin Aigner
    The $k$-Equal Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:17-24 [Journal]
  7. Martin Aigner, Regina Klimmek
    Matchings in Lattice Graphs and Hamming Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:157-165 [Journal]
  8. Martin Aigner, Eberhard Triesch
    Reconstructing a Graph from its Neighborhood Lists. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:103-113 [Journal]
  9. Martin Aigner
    Variants of the majority problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:1, pp:3-25 [Journal]
  10. Martin Aigner
    Finding the Maximum and Minimum. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:1, pp:1-12 [Journal]
  11. Martin Aigner, Otfried Schwarzkopf
    Bounds on the Size of Merging Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:3, pp:187-194 [Journal]
  12. Martin Aigner
    Motzkin Numbers. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:6, pp:663-675 [Journal]
  13. Martin Aigner
    Parallel Complexity of Sorting Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:1, pp:79-88 [Journal]
  14. Martin Aigner
    Searching with Lies. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:43-56 [Journal]
  15. Martin Aigner
    Catalan-like Numbers and Determinants. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:33-51 [Journal]
  16. Martin Aigner, Douglas B. West
    Sorting by insertion of leading elements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:45, n:2, pp:306-309 [Journal]
  17. Thomas Andreae, Martin Aigner
    The total interval number of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:7-21 [Journal]
  18. Martin Aigner, Eberhard Triesch
    Irregular Assignments of Trees and Forests. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:439-449 [Journal]
  19. Martin Aigner, Gianluca De Marco, Manuela Montangero
    The plurality problem with three colors and more. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:319-330 [Journal]
  20. Martin Aigner, Bert Jüttler
    Hybrid curve fitting. [Citation Graph (0, 0)][DBLP]
    Computing, 2007, v:79, n:2-4, pp:237-247 [Journal]
  21. Martin Aigner
    Producing posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:1-15 [Journal]
  22. Martin Aigner, Rudolf Wille
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:115- [Journal]
  23. Martin Aigner
    A Characterization of the bell numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:207-210 [Journal]
  24. Martin Aigner, Dwight Duffus, Daniel J. Kleitman
    Partitioning a power set into union-free classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:113-119 [Journal]
  25. Martin Aigner, Rudolf Wille
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:111- [Journal]
  26. Martin Aigner, Eberhard Triesch, Zsolt Tuza
    Searching for acyclic orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:3-10 [Journal]
  27. Martin Aigner, Rudolf Wille
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:1- [Journal]
  28. Martin Aigner, Eberhard Triesch
    Realizability and uniqueness in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:3-20 [Journal]

  29. Swept Volume Parameterization for Isogeometric Analysis. [Citation Graph (, )][DBLP]


  30. Computing Isophotes on Free-Form Surfaces Based on Support Function Approximation. [Citation Graph (, )][DBLP]


  31. Gauss-Newton-type techniques for robustly fitting implicitly defined curves and surfaces to unorganized data points. [Citation Graph (, )][DBLP]


  32. Evolution-based least-squares fitting using Pythagorean hodograph spline curves. [Citation Graph (, )][DBLP]


  33. Distance regression by Gauss-Newton-type methods and iteratively re-weighted least-squares. [Citation Graph (, )][DBLP]


  34. Enumeration via ballot numbers. [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002