default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Aigner 0001
Person information
- affiliation: Freie Universität Berlin, Germany
Other persons with the same name
- Martin Aigner 0002 — Johannes Kepler University, Linz
- Martin Aigner 0003 — University of Salzburg, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[p2]Martin Aigner, Eberhard Triesch:
Reconstruction Problems for Digraphs. The Mathematics of Paul Erdős II 2013: 5-13
2000 – 2009
- 2008
- [j31]Martin Aigner:
Enumeration via ballot numbers. Discret. Math. 308(12): 2544-2563 (2008) - 2005
- [j30]Martin Aigner:
The $k$-Equal Problem. Comb. Probab. Comput. 14(1-2): 17-24 (2005) - [j29]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
- [b2]Martin Aigner, Günter M. Ziegler:
Proofs from THE BOOK (3. ed.). Springer 2004, ISBN 978-3-540-40460-6, pp. I-VIII, 1-239 - [j28]Martin Aigner:
Variants of the majority problem. Discret. Appl. Math. 137(1): 3-25 (2004) - [c2]Martin Aigner, Gianluca De Marco, Manuela Montangero:
The Plurality Problem with Three Colors. STACS 2004: 513-521 - 2001
- [c1]Martin Aigner:
Lattice Paths and Determinants. Computational Discrete Mathematics 2001: 1-12
1990 – 1999
- 1999
- [j27]Martin Aigner:
A Characterization of the bell numbers. Discret. Math. 205(1-3): 207-210 (1999) - [j26]Martin Aigner:
Catalan-like Numbers and Determinants. J. Comb. Theory A 87(1): 33-51 (1999) - [p1]Martin Aigner:
Geometrische Darstellungen von Graphen und der 4-Farbensatz. Angewandte Mathematik, insbesondere Informatik 1999: 5-14 - 1998
- [j25]Martin Aigner:
Motzkin Numbers. Eur. J. Comb. 19(6): 663-675 (1998) - 1997
- [j24]Martin Aigner:
Finding the Maximum and Minimum. Discret. Appl. Math. 74(1): 1-12 (1997) - [j23]Martin Aigner, Anping Li:
Searching for counterfeit coins. Graphs Comb. 13(1): 9-20 (1997) - 1996
- [j22]Martin Aigner:
Searching with Lies. J. Comb. Theory A 74(1): 43-56 (1996) - 1995
- [j21]Martin Aigner, Otfried Schwarzkopf:
Bounds on the Size of Merging Networks. Discret. Appl. Math. 61(3): 187-194 (1995) - [j20]Martin Aigner, Rudolf Wille:
Preface. Discret. Math. 144(1-3): 1 (1995) - [j19]Martin Aigner, Eberhard Triesch, Zsolt Tuza:
Searching for acyclic orientations of graphs. Discret. Math. 144(1-3): 3-10 (1995) - 1994
- [j18]Martin Aigner, Regina Klimmek:
Matchings in Lattice Graphs and Hamming Graphs. Comb. Probab. Comput. 3: 157-165 (1994) - [j17]Martin Aigner, Eberhard Triesch:
Realizability and uniqueness in graphs. Discret. Math. 136(1-3): 3-20 (1994) - [j16]Martin Aigner, Eberhard Triesch:
Codings of graphs with binary edge labels. Graphs Comb. 10(1): 1-10 (1994) - 1993
- [b1]Martin Aigner:
Diskrete Mathematik. Vieweg Studium Aufbaukurs Mathematik = Advanced lectures in mathematics, Vieweg 1993, ISBN 978-3-528-07268-1, pp. I-IX, 1-316 - [j15]Martin Aigner, Eberhard Triesch:
Reconstructing a Graph from its Neighborhood Lists. Comb. Probab. Comput. 2: 103-113 (1993) - 1991
- [j14]Martin Aigner, Rudolf Wille:
Preface. Discret. Math. 88(2-3): 111 (1991) - [j13]Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
Partitioning a power set into union-free classes. Discret. Math. 88(2-3): 113-119 (1991) - 1990
- [j12]Martin Aigner, Eberhard Triesch:
Irregular Assignments of Trees and Forests. SIAM J. Discret. Math. 3(4): 439-449 (1990)
1980 – 1989
- 1989
- [j11]Martin Aigner:
The double selection problem. Discret. Math. 73(1-2): 3-12 (1989) - [j10]Thomas Andreae, Martin Aigner:
The total interval number of a graph. J. Comb. Theory B 46(1): 7-21 (1989) - 1988
- [j9]Martin Aigner, D. Grieser:
Hook-free coloring and a problem of Hanson. Comb. 8(2): 143-148 (1988) - [j8]Martin Aigner, Eberhard Triesch:
Searching for an edge in a graph. J. Graph Theory 12(1): 45-57 (1988) - 1987
- [j7]Martin Aigner, Rudolf Wille:
Preface. Discret. Math. 63(2-3): 115 (1987) - [j6]Martin Aigner, Douglas B. West:
Sorting by insertion of leading elements. J. Comb. Theory A 45(2): 306-309 (1987) - 1986
- [j5]Martin Aigner:
Search problems on graphs. Discret. Appl. Math. 14(3): 215-230 (1986) - 1984
- [j4]Martin Aigner, M. Fromme:
A game of cops and robbers. Discret. Appl. Math. 8(1): 1-12 (1984) - 1982
- [j3]Martin Aigner:
Selecting the top three elements. Discret. Appl. Math. 4(4): 247-267 (1982) - [j2]Martin Aigner:
Parallel Complexity of Sorting Problems. J. Algorithms 3(1): 79-88 (1982) - 1981
- [j1]Martin Aigner:
Producing posets. Discret. Math. 35(1-3): 1-15 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
