On the public citation graph

Research on the K Representative G-Skyline Query Algorithm

https://doi.org/10.2139/ssrn.4606001
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00778-014-0352-3openalex-extracted
Taking the Big Picture: representative skylines based on significance and diversity
inferredcites →https://doi.org/10.1016/b978-155860869-6/50032-9openalex-extracted
Shooting Stars in the Sky
inferredcites →https://doi.org/10.1016/j.ins.2011.11.014openalex-extracted
Group skyline computation
inferredcites →https://doi.org/10.1016/j.is.2012.10.005openalex-extracted
Efficient computation of combinatorial skyline queries
inferredcites →https://doi.org/10.1109/icde.2007.367854openalex-extracted
Selecting Stars: The k Most Representative Skyline Operator
inferredcites →https://doi.org/10.1109/icde.2009.84openalex-extracted
Distance-Based Representative Skyline
inferredcites →https://doi.org/10.1109/icde.2011.5767873openalex-extracted
Representative skylines using threshold-based preference distributions
inferredcites →https://doi.org/10.1109/icde.2016.7498394openalex-extracted
Top-k dominating queries on incomplete data
inferredcites →https://doi.org/10.1109/tkde.2010.103openalex-extracted
Constrained Skyline Query Processing against Distributed Data Sites
inferredcites →https://doi.org/10.1109/tkde.2013.119openalex-extracted
On Skyline Groups
inferredcites →https://doi.org/10.1109/tkde.2017.2777994openalex-extracted
Efficient Computation of G-Skyline Groups
inferredcites →https://doi.org/10.1109/tkde.2019.2904065openalex-extracted
Top-k Dominating Queries on Skyline Groups
inferredcites →https://doi.org/10.1109/tkde.2019.2905239openalex-extracted
Efficient Contour Computation of Group-Based Skyline
inferredcites →https://doi.org/10.1145/3397503openalex-extracted
Efficient Approaches to k Representative G-Skyline Queries
inferredcites →https://doi.org/10.1145/872757.872814openalex-extracted
An optimal and progressive algorithm for skyline queries
inferredcites →https://doi.org/10.14778/1920841.1920980openalex-extracted
Regret-minimizing representative databases
inferredcites →https://doi.org/10.14778/2732269.2732275openalex-extracted
Computing k-regret minimizing sets
inferredcites →https://doi.org/10.5441/002/edbt.2017.40openalex-extracted
Top-k Skyline Groups Queries
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.