On the public citation graph

On the Complexity of Query Result Diversification

0 signed · 61 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/978-3-031-42209-6_2openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/s11704-012-2014-1openalex-snapshot
Composite recommendations: from items to packages
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/j.dam.2009.03.003openalex-snapshot
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P -complete
inferredcites →https://doi.org/10.1016/j.ejor.2008.06.005openalex-snapshot
The equitable dispersion problem
inferredcites →https://doi.org/10.1016/j.tsc.2005.03.012openalex-snapshot
Subtractive reductions and complete problems for counting complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1109/icde.2008.4497431openalex-snapshot
Efficient Computation of Diverse Query Results
inferredcites →https://doi.org/10.1109/icde.2009.225openalex-snapshot
Recommendation Diversification Using Explanations
inferredcites →https://doi.org/10.1109/icde.2011.5767846openalex-snapshot
On query result diversification
inferredcites →https://doi.org/10.1109/la-web.2007.42openalex-snapshot
New Stochastic Algorithms for Scheduling Ads in Sponsored Search
inferredcites →https://doi.org/10.1109/tkde.2005.99openalex-snapshot
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
inferredcites →https://doi.org/10.1137/0218073openalex-snapshot
Polynomial Space Counting Problems
inferredcites →https://doi.org/10.1145/1060745.1060754openalex-snapshot
Improving recommendation lists through topic diversification
inferredcites →https://doi.org/10.1145/1247480.1247551openalex-snapshot
Addressing diverse user preferences in SQL-query-result navigation
inferredcites →https://doi.org/10.1145/1282480openalex-snapshot
Proceedings of the 1st International Conference on Very Large Data Bases - VLDB '75
inferredcites →https://doi.org/10.1145/1376916.1376924openalex-snapshot
Evaluating rank joins with optimal cost
inferredcites →https://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferredcites →https://doi.org/10.1145/1454008.1454030openalex-snapshot
Avoiding monotony
inferredcites →https://doi.org/10.1145/1498759.1498766openalex-snapshot
Diversifying search results
inferredcites →https://doi.org/10.1145/1516360.1516404openalex-snapshot
It takes variety to make a world
inferredcites →https://doi.org/10.1145/1526709.1526761openalex-snapshot
An axiomatic approach for result diversification
inferredcites →https://doi.org/10.1145/1557019.1557074openalex-snapshot
Finding a team of experts in social networks
inferredcites →https://doi.org/10.1145/1559845.1559923openalex-snapshot
FlexRecs
inferredcites →https://doi.org/10.1145/1739041.1739111openalex-snapshot
PerK
inferredcites →https://doi.org/10.1145/1835449.1835506openalex-snapshot
DivQ
inferredcites →https://doi.org/10.1145/1860702.1860709openalex-snapshot
Search result diversification
inferredcites →https://doi.org/10.1145/1871437.1871555openalex-snapshot
Evaluating, combining and generalizing recommendations with prerequisites
inferredcites →https://doi.org/10.1145/1989323.1989386openalex-snapshot
Efficient and generic evaluation of ranked queries
inferredcites →https://doi.org/10.1145/203610.203611openalex-snapshot
The satanic notations
inferredcites →https://doi.org/10.1145/2037661.2037665openalex-snapshot
Recommendation systems with complex constraints
inferredcites →https://doi.org/10.1145/2213556.2213580openalex-snapshot
Max-Sum diversification, monotone submodular functions and dynamic updates
inferredcites →https://doi.org/10.1145/2213556.2213592openalex-snapshot
On the complexity of package recommendation problems
inferredcites →https://doi.org/10.1145/2213836.2213884openalex-snapshot
Top-k bounded diversification
inferredcites →https://doi.org/10.1145/2487788.2487822openalex-snapshot
Complexity and algorithms for composite retrieval
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.14778/1687627.1687663openalex-snapshot
Structured search result differentiation
inferredcites →https://doi.org/10.14778/1988776.1988781openalex-snapshot
Efficient diversification of web search results
inferredcites →https://doi.org/10.14778/2536354.2536358openalex-snapshot
On the complexity of query result diversification

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-3-030-18579-4_28openalex-snapshot
Towards both Local and Global Query Result Diversification
inferred← citeshttps://doi.org/10.1007/978-3-319-91458-9_10openalex-snapshot
Coverage-Oriented Diversification of Keyword Search Results on Graphs
inferred← citeshttps://doi.org/10.1007/s00778-015-0408-zopenalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1007/s10115-016-0990-4openalex-snapshot
A survey of query result diversification
inferred← citeshttps://doi.org/10.1007/s41019-016-0025-xopenalex-snapshot
Big Graph Analyses: From Queries to Dependencies and Association Rules
inferred← citeshttps://doi.org/10.1016/j.inffus.2018.01.006openalex-snapshot
Fusion-based methods for result diversification in web search
inferred← citeshttps://doi.org/10.1016/j.ipm.2018.03.003openalex-snapshot
Revisiting the cluster-based paradigm for implicit search result diversification
inferred← citeshttps://doi.org/10.1109/icde.2015.7113300openalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1109/ictai.2017.00190openalex-snapshot
Pseudo-Based Relevance Analysis for Information Retrieval
inferred← citeshttps://doi.org/10.1109/tkde.2026.3650879openalex-snapshot
Fast Diversified Top-k Rule Discovery via User-Guided Embeddings
inferred← citeshttps://doi.org/10.1145/3018661.3018710openalex-snapshot
A Concise Integer Linear Programming Formulation for Implicit Search Result Diversification
inferred← citeshttps://doi.org/10.1145/3183673openalex-snapshot
Bounded Query Rewriting Using Views
inferred← citeshttps://doi.org/10.1145/3269206.3269220openalex-snapshot
Exploring Diversified Similarity with Kundaha
inferred← citeshttps://doi.org/10.1145/3514221.3517858openalex-snapshot
Representative Query Results by Voting
inferred← citeshttps://doi.org/10.1145/3654969openalex-snapshot
Query Refinement for Diverse Top-k Selection
inferred← citeshttps://doi.org/10.1145/3677131openalex-snapshot
Discovering Top-k Relevant and Diversified Rules
inferred← citeshttps://doi.org/10.1145/3695833openalex-snapshot
Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
inferred← citeshttps://doi.org/10.1145/3725312openalex-snapshot
Incremental Rule Discovery in Response to Parameter Updates
inferred← citeshttps://doi.org/10.14778/3192965.3192969openalex-snapshot
RC-index
inferred← citeshttps://doi.org/10.14778/3275366.3284965openalex-snapshot
Interactive summarization and exploration of top aggregate query answers
inferred← citeshttps://doi.org/10.14778/3785297.3785310openalex-snapshot
Efficient Partition-Based Approaches for Diversified Top- k Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3836663.3836679openalex-snapshot
Fast and Private Max-Sum Diversification
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.