Paper Citation Record · LEDGER

Parameterized Complexity of the Star Decomposition Problem

As of 13 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2411.13348.

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

pith.paper-citation-record.v1
2411.13348 v2

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T16:53:52.376554Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

29 of 29 outbound references displayed

verified exact1
verified fuzzy23
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 56442670-6896-4421-8f86-ecef1b8c1911 · outbound

This paper cites Domination in convex bipartite and convex-round graphs.

Parameterized Complexity of the Star Decomposition Problem Domination in convex bipartite and convex-round graphs

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.820679Z

Source-reported events for the cited work

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

Observation 6e085a19-e2e5-4acf-813e-8e86da84aaa5 · outbound

This paper cites On the restriction of some NP-complete graph problems to permutation graphs.

Parameterized Complexity of the Star Decomposition Problem On the restriction of some NP-complete graph problems to permutation graphs

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.806781Z

Source-reported events for the cited work

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

Observation ff5122fd-fdaa-4eed-9e85-467d18370072 · outbound

This paper cites Decompositions of complete multigraphs into stars of varying sizes.

Parameterized Complexity of the Star Decomposition Problem Decompositions of complete multigraphs into stars of varying sizes

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.792357Z

Source-reported events for the cited work

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

Observation 8ddac6c6-7020-4f1c-a30b-d77a455a356f · outbound

This paper cites On the star decomposition of a graph: Hardness results and approximation for the max--min optimization problem.

Parameterized Complexity of the Star Decomposition Problem On the star decomposition of a graph: Hardness results and approximation for the max--min optimization problem

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.778137Z

Source-reported events for the cited work

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

Observation b3820a3e-9323-4fdc-afd3-15ac7805c3f1 · outbound

This paper cites Parameterized algorithms , volume 5.

Parameterized Complexity of the Star Decomposition Problem Parameterized algorithms , volume 5

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-12T16:53:52.267552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8eee7eae-2abe-4ea3-b7de-d60e7e97b460 · outbound

This paper cites Domination in convex and chordal bipartite graphs.

Parameterized Complexity of the Star Decomposition Problem Domination in convex and chordal bipartite graphs

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.754213Z

Source-reported events for the cited work

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

Observation 48f4bf91-f9d1-4f3c-8717-9b8b1d74404e · outbound

This paper cites On star partition of split graphs.

Parameterized Complexity of the Star Decomposition Problem On star partition of split graphs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.740867Z

Source-reported events for the cited work

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

Observation 1ba35951-cc50-4459-9b0e-379c4c1b87ab · outbound

This paper cites Graph decomposition is np-complete: A complete proof of holyer's conjecture.

Parameterized Complexity of the Star Decomposition Problem Graph decomposition is np-complete: A complete proof of holyer's conjecture

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.726823Z

Source-reported events for the cited work

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

Observation 2a143406-49c7-451c-b1c2-01f7eae8c9d7 · outbound

This paper cites Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs.

Parameterized Complexity of the Star Decomposition Problem Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.713006Z

Source-reported events for the cited work

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

Observation d546425d-e12e-42e8-92ee-ab6ce20718e1 · outbound

This paper cites On the complexity of partitioning graphs into connected subgraphs.

Parameterized Complexity of the Star Decomposition Problem On the complexity of partitioning graphs into connected subgraphs

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.698847Z

Source-reported events for the cited work

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

Observation f9345fb7-6994-4bb9-ad82-b5d5c684150f · outbound

This paper cites Integer programming and incidence treedepth.

Parameterized Complexity of the Star Decomposition Problem Integer programming and incidence treedepth

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.684042Z

Source-reported events for the cited work

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

Observation d443c60e-e5fe-4e75-9c6a-1c24ef807651 · outbound

This paper cites An Algorithmic Theory of Integer Programming.

Parameterized Complexity of the Star Decomposition Problem An Algorithmic Theory of Integer Programming

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-12T16:53:52.300235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aef6ad71-370b-4cc0-9aa8-cc5eda8cfeed · outbound

This paper cites Domination in permutation graphs.

Parameterized Complexity of the Star Decomposition Problem Domination in permutation graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.668046Z

Source-reported events for the cited work

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

Observation 82cf48f8-307d-469a-ad9e-c365821c6d71 · outbound

This paper cites Maximum independent sets in 3-and 4-regular hamiltonian graphs.

Parameterized Complexity of the Star Decomposition Problem Maximum independent sets in 3-and 4-regular hamiltonian graphs

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.653524Z

Source-reported events for the cited work

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

Observation 64c6f19c-8918-4817-9ea2-bb3a5d7593d9 · outbound

This paper cites Computers and intractability: A guide to the theory of np-completeness, 1979.

Parameterized Complexity of the Star Decomposition Problem Computers and intractability: A guide to the theory of np-completeness, 1979

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.638673Z

Source-reported events for the cited work

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

Observation 2653ec87-9aac-46d3-b8db-016ffd78e7d5 · outbound

This paper cites A linear al-gorithm for the domination number of a tree.

Parameterized Complexity of the Star Decomposition Problem A linear al-gorithm for the domination number of a tree

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.623181Z

Source-reported events for the cited work

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

Observation 4436b11c-732f-43af-803f-f05cd506d102 · outbound

This paper cites The np-completeness of some edge-partition problems.

Parameterized Complexity of the Star Decomposition Problem The np-completeness of some edge-partition problems

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.606952Z

Source-reported events for the cited work

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

Observation 3740e0de-f55e-4cac-9ea2-6c58556811a2 · outbound

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

Parameterized Complexity of the Star Decomposition Problem Bin packing with fixed number of bins revisited

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-12T16:53:52.327228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 954ef9f0-596f-49db-adf5-d06841cd91a4 · outbound

This paper cites Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.

Parameterized Complexity of the Star Decomposition Problem Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-12T16:53:52.420532Z

Source-reported events for the cited work

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

Observation 90e41f36-e560-40e0-81a5-721690cb5996 · outbound

This paper cites Structural Graph Parameters, Fine-Grained Complexity, and Approximation.

Parameterized Complexity of the Star Decomposition Problem Structural Graph Parameters, Fine-Grained Complexity, and Approximation

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.582648Z

Source-reported events for the cited work

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

Observation ce57af88-b6d1-45dc-9c2c-7b21fb210041 · outbound

This paper cites Integer programming with a fixed number of variables.

Parameterized Complexity of the Star Decomposition Problem Integer programming with a fixed number of variables

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-12T16:53:52.341093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8d5580f-0988-439b-9dd8-d118970886c0 · outbound

This paper cites u ller and Andreas Brandst \.

Parameterized Complexity of the Star Decomposition Problem u ller and Andreas Brandst \

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.558423Z

Source-reported events for the cited work

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

Observation e176591b-b889-41cb-be51-84f5e667d90a · outbound

This paper cites an unresolved cited work.

Parameterized Complexity of the Star Decomposition Problem Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:53:52.544239Z

Source-reported events for the cited work

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

Observation 09d30cb2-4b00-4cc7-b084-787ee5f55a8a · outbound

This paper cites Short cycles make w-hard problems hard: Fpt algorithms for w-hard problems in graphs with no short cycles.

Parameterized Complexity of the Star Decomposition Problem Short cycles make w-hard problems hard: Fpt algorithms for w-hard problems in graphs with no short cycles

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.529168Z

Source-reported events for the cited work

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

Observation ba42a673-6a18-4d02-b4e5-d8c7c75da7ff · outbound

This paper cites Induced star partition of graphs.

Parameterized Complexity of the Star Decomposition Problem Induced star partition of graphs

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.512341Z

Source-reported events for the cited work

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

Observation 345d3595-e3c9-444a-8118-f3b139295eb7 · outbound

This paper cites Decomposition of complete multigraphs into stars.

Parameterized Complexity of the Star Decomposition Problem Decomposition of complete multigraphs into stars

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.496854Z

Source-reported events for the cited work

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

Observation b808fcba-c515-44b2-82d6-68404dcdea77 · outbound

This paper cites On the decomposition of a graph into stars.

Parameterized Complexity of the Star Decomposition Problem On the decomposition of a graph into stars

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.481703Z

Source-reported events for the cited work

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

Observation 2cd1665e-b508-47f5-8c61-7b852024ec78 · outbound

This paper cites On claw-decomposition of a complete multipartite graph.

Parameterized Complexity of the Star Decomposition Problem On claw-decomposition of a complete multipartite graph

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.466791Z

Source-reported events for the cited work

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

Observation 41d9fea9-2fdf-4882-aa07-3308aa2bae16 · outbound

This paper cites On claw-decomposition of complete graphs and complete bigraphs.

Parameterized Complexity of the Star Decomposition Problem On claw-decomposition of complete graphs and complete bigraphs

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:53:52.452081Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.