Paper Citation Record · LEDGER

Fair Vertex Problems Parameterized by Cluster Vertex Deletion

As of 4 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2502.01400.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.01400 v2

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-23T04:31:59.019614Z

measured 27 of 27 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

27 of 27 outbound references displayed

verified exact23
verified fuzzy3
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c29974e0-b61a-4587-9113-f40802ae2e4b · outbound

This paper cites Dominator coloring and CD coloring in almost cluster graphs.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Dominator coloring and CD coloring in almost cluster graphs

Reference 1

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.355892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 9e64dfd5-6c33-45a5-9338-84e25786fcb5 · outbound

This paper cites On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension

Reference 2

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.350481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 2e14dfc1-8e59-494b-be80-b16a9a621e4d · outbound

This paper cites Graph structure and monadic second-order logic, a language theoretic approach, Cambridge University Press.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Graph structure and monadic second-order logic, a language theoretic approach, Cambridge University Press

Reference 3

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.415339Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 3d5d9b12-89c3-4293-8f28-8258f937b490 · outbound

This paper cites Makowsky, and Udi Rotics.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Makowsky, and Udi Rotics

Reference 4

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.379040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 5077987a-3343-42bc-86ee-eeb028255c0f · outbound

This paper cites o hler, Nikolaos Melissinos, and Manolis Vasilakis. Bandwidth Parameterized by Cluster Vertex Deletion Number . In Neeldhara Misra and Magnus Wahlstr\.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion o hler, Nikolaos Melissinos, and Manolis Vasilakis. Bandwidth Parameterized by Cluster Vertex Deletion Number . In Neeldhara Misra and Magnus Wahlstr\

Reference 5

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.362047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation e7e99c61-9b67-451e-a6c4-5266afa4aadb · outbound

This paper cites Extended MSO model checking via small vertex integrity.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Extended MSO model checking via small vertex integrity

Reference 6

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.454853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 3237723a-7c85-4d42-bf52-26ab5e89dd5e · outbound

This paper cites Tight algorithms for connectivity problems parameterized by clique-width.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Tight algorithms for connectivity problems parameterized by clique-width

Reference 7

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.444085Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 7f4408a4-78a3-41ec-9b16-7b8f84571b70 · outbound

This paper cites Fixed-parameter algorithms for fair hitting set problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Fixed-parameter algorithms for fair hitting set problems

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-23T04:32:31.370343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 4ace4398-12a2-4230-869f-46c3644dc204 · outbound

This paper cites Italiano, Athanasios L.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Italiano, Athanasios L

Reference 9

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.393675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation fb8d3d1f-de35-46fe-90d6-7e93c7af888d · outbound

This paper cites Deconstructing parameterized hardness of fair vertex deletion problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Deconstructing parameterized hardness of fair vertex deletion problems

Reference 10

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.409097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation bf08456f-219b-4874-a933-2fd9a17e2538 · outbound

This paper cites Bin packing with fixed number of bins revisited.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Bin packing with fixed number of bins revisited

Reference 11

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.431097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 24c83f81-fafe-4b0d-8b6e-401017ca2420 · outbound

This paper cites Parameterized complexity of fair feedback vertex set problem.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Parameterized complexity of fair feedback vertex set problem

Reference 12

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.339195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation fe682899-226e-4756-b788-78de53511cc7 · outbound

This paper cites Local linear set on graphs with bounded twin cover number.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Local linear set on graphs with bounded twin cover number

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-23T04:32:31.438599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 0aa22a6d-0277-4517-8f84-8e1a9905a522 · outbound

This paper cites Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

Reference 14

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.425432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 76a1bca9-2dfd-432c-83ce-29edb8f53c5e · outbound

This paper cites Parameterized Complexity of Fair Vertex Evaluation Problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Parameterized Complexity of Fair Vertex Evaluation Problems

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-05-23T04:32:32.445119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 70ef74d7-ba9a-47b7-87b4-aaef02c62de4 · outbound

This paper cites Parameterized complexity of fair vertex evaluation problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Parameterized complexity of fair vertex evaluation problems

Reference 16

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.403775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation a8b922ce-b6a0-4139-b0ff-d4c266aa042f · outbound

This paper cites Fair edge deletion problems on treedecomposable graphs and improper colorings.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Fair edge deletion problems on treedecomposable graphs and improper colorings

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-23T04:37:32.728755Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 8eb64e97-e194-4e8c-8673-dc03adacb62e · outbound

This paper cites On minimum fair odd cycle transversal.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion On minimum fair odd cycle transversal

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-23T04:37:32.732091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 5dddc435-ec8e-47cc-be7f-647c89a46fda · outbound

This paper cites Minimum eccentricity shortest path problem with respect to structural parameters.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Minimum eccentricity shortest path problem with respect to structural parameters

Reference 19

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.449155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation d79c4bb2-2385-4f1e-af01-6ff16d2f8440 · outbound

This paper cites Algorithmic meta-theorems for restrictions of treewidth.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Algorithmic meta-theorems for restrictions of treewidth

Reference 20

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.420260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 1a61468a-68f5-4b51-91d4-6b5e4ed6f323 · outbound

This paper cites Model checking lower bounds for simple graphs.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Model checking lower bounds for simple graphs

Reference 21

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.318707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 726d1b3e-befc-428d-9f66-6ec4b918023c · outbound

This paper cites Lenstra, Jr.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Lenstra, Jr

Reference 22

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.344548Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 09b81933-492b-4960-ab48-af17a3bf877c · outbound

This paper cites Fair edge deletion problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Fair edge deletion problems

Reference 23

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.304262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation c33e35dd-2c39-4738-8220-31df625e7011 · outbound

This paper cites Parameterized complexity of fair deletion problems.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Parameterized complexity of fair deletion problems

Reference 24

Resolution: verified exact; doi, observed 2026-05-23T04:32:31.385095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation de76a7b7-7fbd-46cf-b6a9-6efd0a4da8fe · outbound

This paper cites IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Reference 25

Resolution: metadata mismatch; arxiv_id, observed 2026-05-23T04:32:31.332822Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 5a2afa55-ab27-4a90-be52-3341bdd97edc · outbound

This paper cites Monadic second order logic on graphs with local cardinality constraints.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Monadic second order logic on graphs with local cardinality constraints

Reference 26

Resolution: verified exact; arxiv_id, observed 2026-05-23T04:32:31.290202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation f7949b93-6ba6-4dac-b1c8-219053b656f3 · outbound

This paper cites Complexity of domination-type problems in graphs.

Fair Vertex Problems Parameterized by Cluster Vertex Deletion Complexity of domination-type problems in graphs

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-05-23T04:37:32.735202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Pith citing papers

No inbound Pith citation observations are available.