On the public citation graph
Examples and algorithmic properties of greedoids
0 signed · 43 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10854-8_22openalex-snapshot
Mathematical structures underlying greedy algorithms
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-11110-5openalex-snapshot
Matroid Theory and its Applications
inferredcites →https://doi.org/10.1007/bf01918757openalex-snapshot
Relations between subclasses of greedoids
inferredcites →https://doi.org/10.1007/bf02482912openalex-snapshot
Meet-distributive lattices and the anti-exchange closure
inferredcites →https://doi.org/10.1007/bf02579192openalex-snapshot
Structural properties of greedoids
inferredcites →https://doi.org/10.1007/bfb0121049openalex-snapshot
Basis graphs of greedoids and two-connectivity
inferredcites →https://doi.org/10.1016/0001-8708(84)90042-2openalex-snapshot
Selectors: A theory of formal languages, semimodular lattices, and branching and shelling processes
inferredcites →https://doi.org/10.1016/0012-365x(79)90092-xopenalex-snapshot
The greedy algorithm for partially ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(86)90176-7openalex-snapshot
Non-interval greedoids and the transposition property
inferredcites →https://doi.org/10.1016/0012-365x(90)90048-mopenalex-snapshot
Minor characterization of undirected branching greedoids—a short proof
inferredcites →https://doi.org/10.1016/0095-8956(77)90055-7openalex-snapshot
A combinatorial abstraction of linear programming
inferredcites →https://doi.org/10.1016/0095-8956(80)90054-4openalex-snapshot
Geometries on partially ordered sets
inferredcites →https://doi.org/10.1016/0166-218x(86)90049-1openalex-snapshot
Homomorphisms and Ramsey properties of antimatroids
inferredcites →https://doi.org/10.1016/0166-218x(88)90040-6openalex-snapshot
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
inferredcites →https://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50019-2openalex-snapshot
Greedoids - A Structural Framework for the Greedy Algorithm
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80054-7openalex-snapshot
Strong maps of geometries
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0195-6698(85)80022-6openalex-snapshot
A Note on Selectors and Greedoids
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22462.xopenalex-snapshot
Polyhedral Results for Antimatroidsa
inferredcites →https://doi.org/10.1137/0605024openalex-snapshot
Greedoids and Linear Objective Functions
inferredcites →https://doi.org/10.1287/mnsc.19.5.544openalex-snapshot
Optimal Sequencing of a Single Machine Subject to Precedence Constraints
inferredcites →https://doi.org/10.2307/2008156openalex-snapshot
Progress in Combinatorial Optimization.
inferredcites →https://doi.org/10.2307/2320942openalex-snapshot
Old and New Problems in Combinatorial Number Theory.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aama.2000.0704openalex-snapshot
The Computational Complexity of Antimatroid Properties
inferred← citeshttps://doi.org/10.1007/s10479-005-2251-xopenalex-snapshot
Values for Interior Operator Games
inferred← citeshttps://doi.org/10.1007/s10479-007-0244-7openalex-snapshot
Convexity properties for interior operator games
inferred← citeshttps://doi.org/10.1007/s43069-021-00092-xopenalex-snapshot
Secretary Problem: Graphs, Matroids and Greedoids
inferred← citeshttps://doi.org/10.1016/j.jmp.2017.02.002openalex-snapshot
Compressed representation of Learning Spaces
inferred← citeshttps://doi.org/10.1016/j.orl.2004.07.009openalex-snapshot
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00311-6openalex-snapshot
A greedy algorithm for maximizing a linear objective function
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00435-9openalex-snapshot
A greedy algorithm for some classes of integer programs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.