A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems | Paper Citation Record

Observation dc6e63ed-4d64-48fc-98ad-ef038422f4c8 · outbound

This paper cites Improved approximation algorithms and lower bounds for search-diversification problems.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Improved approximation algorithms and lower bounds for search-diversification problems

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.782969Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 90387761-80dc-4482-bcab-5616ef59de44 · outbound

This paper cites Geometric knapsack problems.Algorithmica, 10(5):399–427, 1993.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Geometric knapsack problems.Algorithmica, 10(5):399–427, 1993

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.771571Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4801d8d7-6d02-4e1d-8176-cbb954b31841 · outbound

This paper cites Fair near neighbor search: Independent range sampling in high dimensions.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Fair near neighbor search: Independent range sampling in high dimensions

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.760315Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 97a9cac9-a242-4d0d-9b66-0a367ce52458 · outbound

This paper cites Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.748151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2e488209-51df-4601-a449-76ef0dc0bb4a · outbound

This paper cites Approximation algorithms for NP-complete problems on planar graphs.Journal of the ACM (JACM), 41(1):153–180, 1994.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Approximation algorithms for NP-complete problems on planar graphs.Journal of the ACM (JACM), 41(1):153–180, 1994

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.737371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 6c22df8e-4ddc-40ad-bbd0-ee00f8e5340a · outbound

This paper cites Diversity of solutions: An exploration through the lens of fixed- parameter tractability theory.Artificial Intelligence, 303:103644, 2022.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Diversity of solutions: An exploration through the lens of fixed- parameter tractability theory.Artificial Intelligence, 303:103644, 2022

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.726680Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7289ac0b-9c1f-4063-b802-f469abf8a238 · outbound

This paper cites FPT algorithms for diverse collections of hitting sets.Algorithms, 12(12):254, 2019.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems FPT algorithms for diverse collections of hitting sets.Algorithms, 12(12):254, 2019

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.715279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 8c58ffe5-2a8c-46a0-9ad4-8e16bcb7030e · outbound

This paper cites Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.704749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c941feda-95a0-4fbd-ba27-47db29509e68 · outbound

This paper cites Bodlaender.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Bodlaender

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.694109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 52e4c7ac-486a-44b0-b08e-17ee3a079c92 · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 10

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.684092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2c9276c9-7979-48bb-830c-60cee7f5af7f · outbound

This paper cites Brouwer, J.B.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Brouwer, J.B

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.673925Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a3d0bd66-6861-433e-9f1c-ace3e1db56b5 · outbound

This paper cites An improved analysis of local search for MAX-SUM diversification.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems An improved analysis of local search for MAX-SUM diversification

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.662895Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 602c7057-4b3d-48e1-b7bf-e2849b310e51 · outbound

This paper cites Springer, 2015.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Springer, 2015

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.651234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 852a27ef-05ad-4d52-8acb-744fefa2507e · outbound

This paper cites Finding diverse minimum s-t cuts.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Finding diverse minimum s-t cuts

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.638556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ffb6da01-9e91-4ad7-98e5-fda78b33de12 · outbound

This paper cites The bidimensionality theory and its algorithmic applications.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems The bidimensionality theory and its algorithmic applications

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.625653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f6aed6a2-035e-403b-ad61-8ebe0bfc9ccc · outbound

This paper cites Analysis of evolutionary diversity optimization for permutation problems.ACM Transactions on Evolutionary Learning, 2(3):1–27, 2022.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Analysis of evolutionary diversity optimization for permutation problems.ACM Transactions on Evolutionary Learning, 2(3):1–27, 2022

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.614010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e9c9cebd-6683-416f-9896-c03d66565ed9 · outbound

This paper cites Evolving diverse sets of tours for the travelling salesperson problem.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Evolving diverse sets of tours for the travelling salesperson problem

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.602254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ca839684-f733-4bd5-96b9-2ac98958eb1c · outbound

This paper cites Data-driven solution portfolios.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Data-driven solution portfolios

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.589660Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c868fca7-cefe-40e6-84c5-0b775b7b103f · outbound

This paper cites Determinantal sieving.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Determinantal sieving

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.575835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2eee75e1-04a2-4abf-a4a8-92e267c441a4 · outbound

This paper cites Diverse pairs of matchings.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Diverse pairs of matchings

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.564152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 341c39ae-ba8a-4dde-9494-10a847a78fe0 · outbound

This paper cites Diverse collections in matroids and graphs.Mathematical Programming, pages 1–33, 2023.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Diverse collections in matroids and graphs.Mathematical Programming, pages 1–33, 2023

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.553547Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4d8b462e-6fb5-4041-812d-3cdf2f4ad38a · outbound

This paper cites Parameterized Complexity of Finding Dissimilar Shortest Paths.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Parameterized Complexity of Finding Dissimilar Shortest Paths

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-10T17:31:58.897642Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 162006d5-7abe-44f7-b9de-a25c0543f4ac · outbound

This paper cites Approximation schemes for packing problems withℓp-norm diversity constraints.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Approximation schemes for packing problems withℓp-norm diversity constraints

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.541502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5b763a03-9584-488f-9902-11bb26e53ae0 · outbound

This paper cites Obtaining approximately optimal and diverse solutions via dispersion.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Obtaining approximately optimal and diverse solutions via dispersion

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.529112Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d903a2bf-9a1d-49f8-843d-805b80527955 · outbound

This paper cites freeman San Francisco, 1979.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems freeman San Francisco, 1979

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-10T17:31:58.907288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4768ba2-2a5a-49c4-b7d4-f7adb390d33a · outbound

This paper cites Approximating geometric knapsack via l-packings.ACM Trans.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Approximating geometric knapsack via l-packings.ACM Trans

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.508851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 3904dfce-2bb8-48ae-86a2-c67071bd3d07 · outbound

This paper cites A framework to design approximation algorithms for finding diverse solutions in combinatorial problems.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems A framework to design approximation algorithms for finding diverse solutions in combinatorial problems

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.496770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a24328da-8867-4818-ae27-f72a962cad54 · outbound

This paper cites Computing diverse shortest paths efficiently: A theoretical and experimental study.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Computing diverse shortest paths efficiently: A theoretical and experimental study

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.484932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a725327d-3bda-4a34-9311-df5a9d41e74b · outbound

This paper cites Finding diverse trees, paths, and more.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Finding diverse trees, paths, and more

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.472585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 621c0ebb-38c8-4dcd-85d7-fda0f6eca48f · outbound

This paper cites A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.460377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 014988f5-cbb0-4068-ac00-8aaa7fe10b42 · outbound

This paper cites Efficient planarity testing.Journal of the ACM (JACM), 21(4):549–568, 1974.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Efficient planarity testing.Journal of the ACM (JACM), 21(4):549–568, 1974

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-10T17:31:58.926434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0162a9e-dc49-47b5-8618-1912b5727b1a · outbound

This paper cites Ibarra and Chul E.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Ibarra and Chul E

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-10T17:31:58.930026Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61564f57-bb71-4431-86fa-bf280f54f7d7 · outbound

This paper cites Maximizing the lifetime of wireless sensor networks through domatic partition.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Maximizing the lifetime of wireless sensor networks through domatic partition

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.432071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c476a2f9-0341-4037-8b08-72cf1413f4e9 · outbound

This paper cites Coffman Jr., M.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Coffman Jr., M

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.419113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7c31a19f-0c7f-47e4-a727-37946d602a66 · outbound

This paper cites Pearson, 2005.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Pearson, 2005

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.407537Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 9be22951-d06e-4e27-92ca-fdfbfd2599df · outbound

This paper cites Max-Distance Sparsification for Diversification and Clustering.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Max-Distance Sparsification for Diversification and Clustering

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-10T17:31:59.084423Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c0319f7c-ded9-498a-af74-ea02f6e0380d · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 38

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.396311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a228e97a-4ecf-4d09-8326-92d986a29454 · outbound

This paper cites A separator theorem for planar graphs.SIAM Journal on Applied Mathematics, 36(2):177–189, 1979.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems A separator theorem for planar graphs.SIAM Journal on Applied Mathematics, 36(2):177–189, 1979

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.384951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 689bf130-306b-4b6a-8333-0c3b1876609f · outbound

This paper cites On the parameterized complexity of diverse sat.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems On the parameterized complexity of diverse sat

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.374195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 24fb05e6-e55d-4c44-9df5-caf8a0d07077 · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-10T17:31:58.966024Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1171da1-5fd2-4171-8f1b-0e60a2a10c9f · outbound

This paper cites Finding multiple optimal solutions to an integer linear program by random perturbations of its objective function.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Finding multiple optimal solutions to an integer linear program by random perturbations of its objective function

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.354641Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e927a42d-a788-4c41-8adf-96bdbb463d5e · outbound

This paper cites Finding diverse strings and longest common subsequences in a graph.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Finding diverse strings and longest common subsequences in a graph

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.341865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 47a5dead-51f2-4436-b85d-dc0977037454 · outbound

This paper cites Complexity of two perfect matchings with minimum shared edges? URL: https://cstheory.stackexchange.com/questions/1278/ complexity-of-two-perfect-matchings-with-minimum-shared-edges.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Complexity of two perfect matchings with minimum shared edges? URL: https://cstheory.stackexchange.com/questions/1278/ complexity-of-two-perfect-matchings-with-minimum-shared-edges

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.330471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7fcf8694-9cc5-48f0-a839-93a7fc550ab7 · outbound

This paper cites Dominating set, independent set, discretek-center, dispersion, and related problems for planar points in convex position.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Dominating set, independent set, discretek-center, dispersion, and related problems for planar points in convex position

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.318761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f6e45372-261f-441b-b4d7-b2393d4e6f7b · outbound

This paper cites Springer, 2001.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Springer, 2001

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.306244Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b0f0c228-16d9-4b1a-b0a9-66bfd2df3186 · outbound

This paper cites Linear degree extractors and the inapproximability of max clique and chromatic number.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Linear degree extractors and the inapproximability of max clique and chromatic number

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.294368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 79bb5779-e82f-44e3-a5f7-a67894fe587e · outbound

This paper cites algorithm with(1 − δ)-RA.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems algorithm with(1 − δ)-RA

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.282716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ddb91ccc-2e87-4944-b62e-03c0f4711c45 · outbound

This paper cites algorithm with (1 − δ)-RA.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems algorithm with (1 − δ)-RA

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.270383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b0e4e6b3-fa1e-47dc-97d8-d447144c06ee · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 50

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.258406Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 6dd452a6-53d2-4121-aaa7-41af5b98788a · outbound

This paper cites Definition 22.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Definition 22

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.245889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 0ab01e61-a712-40e2-a6ba-ff0ed55a302c · outbound

This paper cites The values ofH and W belong to a set that can be efficiently computed just by knowing the instance.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems The values ofH and W belong to a set that can be efficiently computed just by knowing the instance

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.234028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d194f1ad-92bd-46a5-99cf-5cb77774d4bd · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 53

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.223449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 3ef3453c-25ea-460e-a161-20eed41f3eb1 · outbound

This paper cites See Figure 4 for examples of container-based andL&C-based packings.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems See Figure 4 for examples of container-based andL&C-based packings

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.213618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 50cfbf4a-d305-44db-8843-3cffcb1167cc · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 55

Resolution: parse uncertain; raw_fallback, observed 2026-08-10T17:31:59.201740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 78a5bf19-9a0c-4ea5-93d8-dd808ef8fd90 · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.190123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4f720647-f40a-43e5-84e0-e16424f29f4c · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 57

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.178611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 304b53d2-061d-4a60-9752-ad21f36c5634 · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 58

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.165427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4b1662d8-3778-485b-b4ac-98a83d33c719 · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 59

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.152327Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c602f380-03d1-4762-acc8-65754418e6fa · outbound

This paper cites an unresolved cited work.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Unresolved cited work

Reference 60

Resolution: unresolved; raw_fallback, observed 2026-08-10T17:31:59.139183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d8a61cb2-2ec4-4d66-8570-bf3a8bd0a6a3 · outbound

This paper cites We computemini̸=j ℓ(s, pi, pj, ˜V ) in order of increasing˜v and s, for ˜v = 1,.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems We computemini̸=j ℓ(s, pi, pj, ˜V ) in order of increasing˜v and s, for ˜v = 1,

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.126168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5f12cc9b-1f94-4cb3-976d-d3995065c19d · outbound

This paper cites If there are less thank such tours, the rest of the components ofLk(W ′, i, S) is filled with∞.

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems If there are less thank such tours, the rest of the components ofLk(W ′, i, S) is filled with∞

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T17:31:59.112820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers