Paper Citation Record · LEDGER

Parameterized Complexity of Fair Coloring Problem

As of 19 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.27004.

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

pith.paper-citation-record.v1
2607.27004 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-30T14:22:54.066676Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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

25 of 25 outbound references displayed

verified exact0
verified fuzzy0
unresolved25
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation af059a64-28b1-4f7d-aca0-7b7c416f7e5d · outbound

This paper cites MIT press, 2023.

Parameterized Complexity of Fair Coloring Problem MIT press, 2023

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:53.993195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb776de6-c28a-43a9-8169-9d05e6e9b9c1 · outbound

This paper cites Parameterized (approximate) defective coloring.SIAM Journal on Discrete Mathematics, 34(2):1084–1106, 2020.

Parameterized Complexity of Fair Coloring Problem Parameterized (approximate) defective coloring.SIAM Journal on Discrete Mathematics, 34(2):1084–1106, 2020

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:53.997524Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee79c593-329a-4f13-a4e1-b058ec817ef1 · outbound

This paper cites The structural complexity landscape of finding balance- fair shortest paths.Theoretical Computer Science, 933:149–162, 2022.

Parameterized Complexity of Fair Coloring Problem The structural complexity landscape of finding balance- fair shortest paths.Theoretical Computer Science, 933:149–162, 2022

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.000646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f2fcac7-a5de-42da-ad37-7c2a6de40a99 · outbound

This paper cites Fair algorithms for clustering.

Parameterized Complexity of Fair Coloring Problem Fair algorithms for clustering

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.003852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f55b00d4-5108-4a82-b896-800927a639f9 · outbound

This paper cites Dynamic programming on graphs with bounded treewidth.

Parameterized Complexity of Fair Coloring Problem Dynamic programming on graphs with bounded treewidth

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.006957Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae898090-3c44-4c68-86db-3962c6802cd0 · outbound

This paper cites The complexity of finding fair many-to-one matchings.ACM Transactions on Algorithms, 20(2):1–37, 2024.

Parameterized Complexity of Fair Coloring Problem The complexity of finding fair many-to-one matchings.ACM Transactions on Algorithms, 20(2):1–37, 2024

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.009766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 574d883e-cf6d-4a26-8353-defb8b243967 · outbound

This paper cites A refined complexity analysis of fair districting over graphs.Autonomous Agents and Multi-Agent Systems, 37(1):13, 2023.

Parameterized Complexity of Fair Coloring Problem A refined complexity analysis of fair districting over graphs.Autonomous Agents and Multi-Agent Systems, 37(1):13, 2023

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.013339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ca9c39a-7b7b-4517-a8e0-b16aac00c235 · outbound

This paper cites On multidimensional packing problems.SIAM journal on computing, 33(4):837–851, 2004.

Parameterized Complexity of Fair Coloring Problem On multidimensional packing problems.SIAM journal on computing, 33(4):837–851, 2004

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.016738Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bd01b4e-d099-47bf-891d-eee1f8d9795b · outbound

This paper cites Multidimensional bin packing and other related problems: A survey.Computer Science Review, 24:34, 2016.

Parameterized Complexity of Fair Coloring Problem Multidimensional bin packing and other related problems: A survey.Computer Science Review, 24:34, 2016

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.019702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6a72b63-6aa1-49e0-b44c-76ce3d6be772 · outbound

This paper cites Springer, 2015.

Parameterized Complexity of Fair Coloring Problem Springer, 2015

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.022457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a868261-f4e7-4b09-be45-07f44ab347cc · outbound

This paper cites Balanced schedules.INFOR: Information Systems and Operational Research, 9(3):230–237, 1971.

Parameterized Complexity of Fair Coloring Problem Balanced schedules.INFOR: Information Systems and Operational Research, 9(3):230–237, 1971

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.026327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbd87434-256d-4644-b5f0-05b65050fac1 · outbound

This paper cites On a particular conference scheduling problem.INFOR: Information Systems and Operational Research, 13(3):308–315, 1975.

Parameterized Complexity of Fair Coloring Problem On a particular conference scheduling problem.INFOR: Information Systems and Operational Research, 13(3):308–315, 1975

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.029268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e14acf38-530a-44df-b46e-d3483f98b6f4 · outbound

This paper cites On the complexity of some colorful problems parameterized by treewidth.Information and Computation, 209(2):143–153, 2011.

Parameterized Complexity of Fair Coloring Problem On the complexity of some colorful problems parameterized by treewidth.Information and Computation, 209(2):143–153, 2011

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.032216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c9a6615-8abc-47b1-9734-2f95422c3e2e · outbound

This paper cites Parameterized complexity of coloring problems: Treewidth versus vertex cover.Theoretical Computer Science, 412(23):2513–2523, 2011.

Parameterized Complexity of Fair Coloring Problem Parameterized complexity of coloring problems: Treewidth versus vertex cover.Theoretical Computer Science, 412(23):2513–2523, 2011

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.035986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a61775f-13a2-4e26-9ec6-eb63da8298bf · outbound

This paper cites Clique-width: on the price of generality.

Parameterized Complexity of Fair Coloring Problem Clique-width: on the price of generality

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.039047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38991b7b-960a-46f4-98cf-4b2f50d9e25a · outbound

This paper cites Using Neighborhood Diversity to Solve Hard Problems.

Parameterized Complexity of Fair Coloring Problem Using Neighborhood Diversity to Solve Hard Problems

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.041636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8cf7398b-73c7-4462-b367-6ca699539db5 · outbound

This paper cites Garey, David S.

Parameterized Complexity of Fair Coloring Problem Garey, David S

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.045456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2e12f48-8288-4685-a889-98a7044bfedb · outbound

This paper cites Parameterized complexity of fair many-to-one matchings.Theoretical Com- puter Science, page 115727, 2025.

Parameterized Complexity of Fair Coloring Problem Parameterized complexity of fair many-to-one matchings.Theoretical Com- puter Science, page 115727, 2025

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.048553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4f90ba6-17a8-4ebc-8ec8-53707bf8a58b · outbound

This paper cites PhD thesis, Uni- versit´ e Paris Dauphine, 2022.

Parameterized Complexity of Fair Coloring Problem PhD thesis, Uni- versit´ e Paris Dauphine, 2022

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.051158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d19d1a5d-6917-4e37-8788-b5f9525e6b97 · outbound

This paper cites Integer programming with a fixed number of variables.Mathematics of operations research, 8(4):538–548, 1983.

Parameterized Complexity of Fair Coloring Problem Integer programming with a fixed number of variables.Mathematics of operations research, 8(4):538–548, 1983

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.053655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54dc5e31-6a07-43a6-bcba-5381215d44fa · outbound

This paper cites On the optimality of planar and geometric approximation schemes.

Parameterized Complexity of Fair Coloring Problem On the optimality of planar and geometric approximation schemes

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.056364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ace74560-b709-4a28-9844-6a1a03e31ab0 · outbound

This paper cites Equitable coloring.The American mathematical monthly, 80(8):920–922, 1973.

Parameterized Complexity of Fair Coloring Problem Equitable coloring.The American mathematical monthly, 80(8):920–922, 1973

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.059088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d751d8a-dab7-41b6-b31e-00f68475cba7 · outbound

This paper cites Msol partitioning problems on graphs of bounded treewidth and clique-width.Theoretical Computer Science, 377(1-3):260–267, 2007.

Parameterized Complexity of Fair Coloring Problem Msol partitioning problems on graphs of bounded treewidth and clique-width.Theoretical Computer Science, 377(1-3):260–267, 2007

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.061660Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1b7a65c-6e18-4af7-b4dc-ccc59c596beb · outbound

This paper cites Minimizing margin of victory for fair political and educational districting.

Parameterized Complexity of Fair Coloring Problem Minimizing margin of victory for fair political and educational districting

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.064234Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf12d851-03b8-4d18-9109-90f770837c60 · outbound

This paper cites There is no asymptotic ptas for two-dimensional vector packing.Information Processing Letters, 64(6):293–297, 1997.

Parameterized Complexity of Fair Coloring Problem There is no asymptotic ptas for two-dimensional vector packing.Information Processing Letters, 64(6):293–297, 1997

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.066676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.