Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Korte, B.
and
Schrader, R.
1981.
Mathematical Foundations of Computer Science 1981.
Vol. 118,
Issue. ,
p.
61.
Hausmann, D.
and
Korte, B.
1981.
Mathematical Programming at Oberwolfach.
Vol. 14,
Issue. ,
p.
98.
Truemper, K.
1982.
On the Efficiency of Representability Tests for Matroids.
European Journal of Combinatorics,
Vol. 3,
Issue. 3,
p.
275.
Jensen, Per M.
and
Korte, Bernhard
1982.
Complexity of Matroid Property Algorithms.
SIAM Journal on Computing,
Vol. 11,
Issue. 1,
p.
184.
Whitney, Hassler
Birkhoff, Garrett
Mac Lane, Saunders
and
Higgs, D. A.
1986.
A Source Book in Matroid Theory.
p.
15.
Jaeger, F.
Vertigan, D. L.
and
Welsh, D. J. A.
1990.
On the computational complexity of the Jones and Tutte polynomials.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 108,
Issue. 1,
p.
35.
Oxley, J.G.
and
Welsh, D.J.A.
1992.
Tutte polynomials computable in polynomial time.
Discrete Mathematics,
Vol. 109,
Issue. 1-3,
p.
185.
Truemper, K.
1992.
Matroid Decomposition.
p.
350.
Vertigan, Dirk
and
Whittle, Geoff
1993.
Recognizing Polymatroids Associated with Hypergraphs.
Combinatorics, Probability and Computing,
Vol. 2,
Issue. 4,
p.
519.
Azar, Y.
Broder, A.Z.
and
Frieze, A.M.
1994.
On the problem of approximating the number of bases of a matriod.
Information Processing Letters,
Vol. 50,
Issue. 1,
p.
9.
Welsh, D.J.A.
1994.
The computational complexity of knot and matroid polynomials.
Discrete Mathematics,
Vol. 124,
Issue. 1-3,
p.
251.
Kung, Joseph P.S.
1996.
Vol. 1,
Issue. ,
p.
157.
Enright, Jamas
2001.
The Computational Complexity of Antimatroid Properties.
Advances in Applied Mathematics,
Vol. 26,
Issue. 1,
p.
23.
Makowsky, J.A.
2004.
Algorithmic uses of the Feferman–Vaught Theorem.
Annals of Pure and Applied Logic,
Vol. 126,
Issue. 1-3,
p.
159.
Mayhew, Dillon
2008.
Matroid Complexity and Nonsuccinct Descriptions.
SIAM Journal on Discrete Mathematics,
Vol. 22,
Issue. 2,
p.
455.
Welsh, Dominic
2009.
Research Trends in Combinatorial Optimization.
p.
523.
Welsh, D. J. A.
2010.
Matroid Theory and its Applications.
p.
323.
Snook, Michael
2013.
The Complexity of Deletion Problems for Matroids.
SIAM Journal on Discrete Mathematics,
Vol. 27,
Issue. 1,
p.
402.
Dütting, Paul
Talgam-Cohen, Inbal
and
Roughgarden, Tim
2017.
Modularity and greed in double auctions.
Games and Economic Behavior,
Vol. 105,
Issue. ,
p.
59.
Kardoš, František
Král’, Daniel
Liebenau, Anita
and
Mach, Lukáš
2017.
First order convergence of matroids.
European Journal of Combinatorics,
Vol. 59,
Issue. ,
p.
150.