On the public citation graph
Structural properties of greedoids
0 signed · 60 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.1016/0012-365x(79)90092-xopenalex-snapshot
The greedy algorithm for partially ordered sets
inferredcites →https://doi.org/10.1016/0095-8956(80)90054-4openalex-snapshot
Geometries on partially ordered sets
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50019-2openalex-snapshot
Greedoids - A Structural Framework for the Greedy Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-2670-3_4openalex-snapshot
A GSMP Framework for the Analysis of Production Lines
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_1openalex-snapshot
Origins and basic concepts
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_9openalex-snapshot
Reading, Drawing, and Order
inferred← citeshttps://doi.org/10.1007/bf01918757openalex-snapshot
Relations between subclasses of greedoids
inferred← citeshttps://doi.org/10.1007/bf02122803openalex-snapshot
Branchings in rooted graphs and the diameter of greedoids
inferred← citeshttps://doi.org/10.1007/bfb0055050openalex-snapshot
Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees
inferred← citeshttps://doi.org/10.1007/bfb0083463openalex-snapshot
Examples and algorithmic properties of greedoids
inferred← citeshttps://doi.org/10.1007/bfb0121049openalex-snapshot
Basis graphs of greedoids and two-connectivity
inferred← citeshttps://doi.org/10.1007/s00012-014-0282-3openalex-snapshot
Coordinatization of finite join-distributive lattices
inferred← citeshttps://doi.org/10.1007/s00026-007-0307-0openalex-snapshot
A Characterization of Mixed Branching Greedoids
inferred← citeshttps://doi.org/10.1007/s43069-021-00092-xopenalex-snapshot
Secretary Problem: Graphs, Matroids and Greedoids
inferred← citeshttps://doi.org/10.1016/0001-8708(84)90042-2openalex-snapshot
Selectors: A theory of formal languages, semimodular lattices, and branching and shelling processes
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90176-7openalex-snapshot
Non-interval greedoids and the transposition property
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90142-2openalex-snapshot
The intersection of matroids and antimatroids
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90180-5openalex-snapshot
Matroids and antimatroids—a survey
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90048-mopenalex-snapshot
Minor characterization of undirected branching greedoids—a short proof
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90218-qopenalex-snapshot
Greedoids and searches in directed graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90007-4openalex-snapshot
A circuit set characterization of antimatroids
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90067-6openalex-snapshot
A characterization of undirected branching greedoids
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90070-gopenalex-snapshot
An intersection theorem for supermatroids
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90003-xopenalex-snapshot
Linear objective functions on certain classes of greedoids
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90049-1openalex-snapshot
Homomorphisms and Ramsey properties of antimatroids
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50011-7openalex-snapshot
10.1016/b978-044488002-4/50011-7
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104123openalex-snapshot
A combinatorial characterization of S2 binomial edge ideals
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.09.029openalex-snapshot
Cohen-Macaulay binomial edge ideals of small graphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.10.031openalex-snapshot
Categorical interpretations of cryptomorphisms and maps arising from matroidal and combinatorial contexts
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114318openalex-snapshot
Advice complexity of adaptive priority algorithms
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80111-4openalex-snapshot
Chip-firing Games on Graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80022-6openalex-snapshot
A Note on Selectors and Greedoids
inferred← citeshttps://doi.org/10.1080/02522667.1995.10699207openalex-snapshot
Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
inferred← citeshttps://doi.org/10.1080/17509653.2016.1172993openalex-snapshot
Fuzzy greedy search heuristic for combinatorial optimization with specific application to machine scheduling
inferred← citeshttps://doi.org/10.1109/cdc.1992.371620openalex-snapshot
Monotone rate control of permutable GSMPs
inferred← citeshttps://doi.org/10.1112/s0024609303002443openalex-snapshot
AUBREY WILLIAM INGLETON (1920–2000)
inferred← citeshttps://doi.org/10.1117/12.526740openalex-snapshot
Some properties of topological grayscale watersheds
inferred← citeshttps://doi.org/10.1137/0605024openalex-snapshot
Greedoids and Linear Objective Functions
inferred← citeshttps://doi.org/10.1145/4221.4998openalex-snapshot
On ordered languages and the optimization of linear functions by greedy algorithms
inferred← citeshttps://doi.org/10.1287/moor.17.2.444openalex-snapshot
Generalized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties
inferred← citeshttps://doi.org/10.1287/moor.19.2.449openalex-snapshot
Monotone Optimal Control of Permutable GSMPs
inferred← citeshttps://doi.org/10.17951/ai.2016.16.2.48openalex-snapshot
Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid
inferred← citeshttps://doi.org/10.2139/ssrn.6428479openalex-snapshot
A Mathematical Theory of Understanding
inferred← citeshttps://doi.org/10.3390/info11090418openalex-snapshot
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
inferred← citeshttps://doi.org/10.4018/978-1-6684-2339-4.ch001openalex-snapshot
An Integrated Intelligent Computation for Complex Problems in Engineering Management
inferred← citeshttps://doi.org/10.4018/ijaec.2017040104openalex-snapshot
An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management
inferred← citeshttps://doi.org/10.4018/ijoris.2018070104openalex-snapshot
A Very Fast Heuristic for Combinatorial Optimization With Specific Application to Priority Rule Sequencing in Operations Management
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2401openalex-snapshot
A Combinatorial Study of Linear Deterministic Relay Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1612.01453openalex-snapshot
A note and a short survey on supporting lines of compact convex sets in the plane
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.