Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-08T01:57:09.797119Z
Paper Citation Record · LEDGER
Polynomial Kernels for Spanning Tree with Diversity Requirements
As of 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2604.24571.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
44 of 44 outbound references displayed
- verified exact25
- verified fuzzy16
- unresolved1
- parse uncertain0
- malformed identifier0
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 9d0f1c95-2406-43f5-b5ac-33d01f96643d · outbound
This paper cites Fomin, Gregory Z.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Gregory Z
Reference 1
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.347528Z
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 7379a117-9e31-48cf-9de5-d61bd66fcaf7 · outbound
This paper cites Fellows, Lars Jaffke, Tom \' a s Masar \' k, Mateus de Oliveira Oliveira, Geevarghese Philip, and Frances A.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fellows, Lars Jaffke, Tom \' a s Masar \' k, Mateus de Oliveira Oliveira, Geevarghese Philip, and Frances A
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.968937Z
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 35e42ba3-bcdb-4ace-a00a-adb439bc77ee · outbound
This paper cites FPT algorithms for diverse collections of hitting sets.
Polynomial Kernels for Spanning Tree with Diversity Requirements FPT algorithms for diverse collections of hitting sets
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.961674Z
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 316cf002-146a-44f7-83ec-2341c7ee5453 · outbound
This paper cites Spotting trees with few leaves.
Polynomial Kernels for Spanning Tree with Diversity Requirements Spotting trees with few leaves
Reference 4
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.362567Z
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 3b8fbce0-a272-48a0-81d4-d21791997995 · outbound
This paper cites Random graphs.
Polynomial Kernels for Spanning Tree with Diversity Requirements Random graphs
Reference 5
- Resolution
- metadata mismatch
- doi, observed 2026-05-09T01:09:32.351457Z
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 f3a8b5c0-5a49-42ee-b050-52aaa671e96c · outbound
This paper cites In: Rovan, B., V ojt´aˇa, P.
Polynomial Kernels for Spanning Tree with Diversity Requirements In: Rovan, B., V ojt´aˇa, P
Reference 6
- Resolution
- metadata mismatch
- doi, observed 2026-05-09T01:09:32.344636Z
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 e9c43944-74c2-476b-982d-1e20adeef8a4 · outbound
This paper cites Bonsma and Frederic Dorn.
Polynomial Kernels for Spanning Tree with Diversity Requirements Bonsma and Frederic Dorn
Reference 7
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T01:09:32.341867Z
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 74aaf39c-3103-4c0d-9c9b-d35bc6f67fe0 · outbound
This paper cites An approximation algorithm for maximum internal spanning tree.
Polynomial Kernels for Spanning Tree with Diversity Requirements An approximation algorithm for maximum internal spanning tree
Reference 8
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.445514Z
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 69691095-3d1d-4c6b-82f4-693195696ef0 · outbound
This paper cites Fomin, Gregory Z.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Gregory Z
Reference 9
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.337032Z
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 3be00a58-9e9a-4aa1-8a0f-5479b000775f · outbound
This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.998701Z
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 4fd63b38-1683-4e45-9a0a-25c46c64ae43 · outbound
This paper cites FPT Algorithms and Kernels for the Directed $k$-Leaf Problem.
Polynomial Kernels for Spanning Tree with Diversity Requirements FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
Reference 11
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T15:47:59.232027Z
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 d5316e8b-b684-4cc4-a8b0-42e4d0160ebc · outbound
This paper cites On finding directed trees with many leaves.
Polynomial Kernels for Spanning Tree with Diversity Requirements On finding directed trees with many leaves
Reference 12
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.376412Z
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 2d451471-199a-4038-bc5a-4484cd35ce20 · outbound
This paper cites Gutin, and Eun Jung Kim.
Polynomial Kernels for Spanning Tree with Diversity Requirements Gutin, and Eun Jung Kim
Reference 13
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.379534Z
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 830fe41f-5806-4ce7-8cdd-cc8140dfa7dd · outbound
This paper cites Woodruff.
Polynomial Kernels for Spanning Tree with Diversity Requirements Woodruff
Reference 14
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.422158Z
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 1f7d04bb-75f0-4e3f-ab8d-194265c7b3a0 · outbound
This paper cites an unresolved cited work.
Polynomial Kernels for Spanning Tree with Diversity Requirements Unresolved cited work
Reference 15
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.441416Z
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 c24bd531-e508-4918-a27f-5b7a32edf97d · outbound
This paper cites Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics.
Polynomial Kernels for Spanning Tree with Diversity Requirements Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.987650Z
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 f5a919e1-7a1b-40cb-aaf8-cfd0c211616c · outbound
This paper cites Downey and Michael R.
Polynomial Kernels for Spanning Tree with Diversity Requirements Downey and Michael R
Reference 17
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.355351Z
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 20a0ab7e-b82b-4325-bb7b-776f7a12ea75 · outbound
This paper cites Downey and Michael R.
Polynomial Kernels for Spanning Tree with Diversity Requirements Downey and Michael R
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.992059Z
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 cbedd0dc-1928-433f-ab85-ed785eb66a53 · outbound
This paper cites Finding diverse solutions parameterized by cliquewidth.
Polynomial Kernels for Spanning Tree with Diversity Requirements Finding diverse solutions parameterized by cliquewidth
Reference 19
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T23:01:16.522153Z
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 a6325247-a026-457b-a2aa-c803258f5ea1 · outbound
This paper cites Minimum partition of a matroid into independent subsets.
Polynomial Kernels for Spanning Tree with Diversity Requirements Minimum partition of a matroid into independent subsets
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.983382Z
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 bacbf115-d5e1-4cd7-b212-92915696189f · outbound
This paper cites Fellows, Michael A.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fellows, Michael A
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.018591Z
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 562e93bc-a26d-4314-8a97-c42a3af1b9fa · outbound
This paper cites Golovach, and Marie - France Sagot.
Polynomial Kernels for Spanning Tree with Diversity Requirements Golovach, and Marie - France Sagot
Reference 22
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.358910Z
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 566d1445-1b83-49ca-8e46-317a8fe0f853 · outbound
This paper cites Fomin, Serge Gaspers, Saket Saurabh, and St \' e phan Thomass \' e.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Serge Gaspers, Saket Saurabh, and St \' e phan Thomass \' e
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.965335Z
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 f9a4597d-a948-45d7-876d-eb74509bdca0 · outbound
This paper cites Fomin, Petr A.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Petr A
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.012122Z
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 29b731ae-ec6c-40a1-bd94-60e087c907ad · outbound
This paper cites Fomin, Petr A.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Petr A
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.008528Z
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 088ae94b-20c2-4a43-9583-7b9d05f5ea82 · outbound
This paper cites Fomin, Fabrizio Grandoni, Daniel Lokshtanov, and Saket Saurabh.
Polynomial Kernels for Spanning Tree with Diversity Requirements Fomin, Fabrizio Grandoni, Daniel Lokshtanov, and Saket Saurabh
Reference 26
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.449108Z
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 eced10c4-0e51-4a34-8692-551ec8c90e03 · outbound
This paper cites Kernelization: Theory of Parameterized Preprocessing.
Polynomial Kernels for Spanning Tree with Diversity Requirements Kernelization: Theory of Parameterized Preprocessing
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.979749Z
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 4660e0d8-5a20-47b8-aeab-87e456e59b6c · outbound
This paper cites an unresolved cited work.
Polynomial Kernels for Spanning Tree with Diversity Requirements Unresolved cited work
Reference 28
- Resolution
- unresolved
- raw_fallback, observed 2026-05-26T23:53:13.995260Z
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 0c47bfdf-0d35-4875-8116-7c319d3c548f · outbound
This paper cites Gutin, Igor Razgon, and Eun Jung Kim.
Polynomial Kernels for Spanning Tree with Diversity Requirements Gutin, Igor Razgon, and Eun Jung Kim
Reference 29
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.393340Z
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 69b85153-06d3-49d6-9cae-1cb4ebaa9562 · outbound
This paper cites A framework to design approximation algorithms for finding diverse solutions in combinatorial problems.
Polynomial Kernels for Spanning Tree with Diversity Requirements A framework to design approximation algorithms for finding diverse solutions in combinatorial problems
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.972640Z
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 3db1de57-0272-4a9b-88e0-e847921bbd08 · outbound
This paper cites Finding a minimum spanning tree with a small non-terminal set.
Polynomial Kernels for Spanning Tree with Diversity Requirements Finding a minimum spanning tree with a small non-terminal set
Reference 31
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T01:09:32.372416Z
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 f1bffb3f-2b01-46b7-8955-a380582191ad · outbound
This paper cites Computing diverse shortest paths efficiently: A theoretical and experimental study.
Polynomial Kernels for Spanning Tree with Diversity Requirements Computing diverse shortest paths efficiently: A theoretical and experimental study
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.002095Z
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 518394b9-77b3-450a-99c3-2f5ba980b134 · outbound
This paper cites Finding diverse trees, paths, and more.
Polynomial Kernels for Spanning Tree with Diversity Requirements Finding diverse trees, paths, and more
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.005423Z
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 1a66b9be-f390-4cb2-9732-fee2bc051833 · outbound
This paper cites an unresolved cited work.
Polynomial Kernels for Spanning Tree with Diversity Requirements Unresolved cited work
Reference 34
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.455123Z
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 4ca08c2b-3b14-42d6-b4fd-d10d13ca2899 · outbound
This paper cites Better approximation algorithms for the maximum internal spanning tree problem.
Polynomial Kernels for Spanning Tree with Diversity Requirements Better approximation algorithms for the maximum internal spanning tree problem
Reference 35
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.425988Z
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 5e242e00-a73f-410d-a4e6-f5c6f1b6aef8 · outbound
This paper cites A new algorithm for finding trees with many leaves.
Polynomial Kernels for Spanning Tree with Diversity Requirements A new algorithm for finding trees with many leaves
Reference 36
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.430050Z
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 24eed929-5e5f-4a95-98c4-b5f6a16fdb51 · outbound
This paper cites Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.
Polynomial Kernels for Spanning Tree with Diversity Requirements Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
Reference 37
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.411252Z
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 4dfec0a8-0890-4165-af5c-0692c2e1586b · outbound
This paper cites A 4/3-approximation algorithm for the maximum internal spanning tree problem.
Polynomial Kernels for Spanning Tree with Diversity Requirements A 4/3-approximation algorithm for the maximum internal spanning tree problem
Reference 38
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.405215Z
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 b0d2de20-aad0-4b5e-b8ba-3aaec0620bc6 · outbound
This paper cites an unresolved cited work.
Polynomial Kernels for Spanning Tree with Diversity Requirements Unresolved cited work
Reference 39
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T01:09:32.461960Z
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 b30351aa-a345-42f8-8f9e-cf53049655b1 · outbound
This paper cites On the parameterized complexity of diverse SAT.
Polynomial Kernels for Spanning Tree with Diversity Requirements On the parameterized complexity of diverse SAT
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:14.015303Z
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 5e6fbef2-aaba-48b2-986d-b941180b9e74 · outbound
This paper cites an unresolved cited work.
Polynomial Kernels for Spanning Tree with Diversity Requirements Unresolved cited work
Reference 41
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.415114Z
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 7b945e6b-b070-4c37-bfaa-2d252da1bca9 · outbound
This paper cites o rg - R \.
Polynomial Kernels for Spanning Tree with Diversity Requirements o rg - R \
Reference 42
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.384101Z
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 0f0f56e8-7216-4b43-bdcf-2c424e4b921f · outbound
This paper cites Reducing to independent set structure -- the case of k-internal spanning tree.
Polynomial Kernels for Spanning Tree with Diversity Requirements Reducing to independent set structure -- the case of k-internal spanning tree
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-26T23:53:13.976058Z
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 ca77b84a-58d9-4615-a941-3cc9fb876de8 · outbound
This paper cites Bonsma, and Stefanie Lowski.
Polynomial Kernels for Spanning Tree with Diversity Requirements Bonsma, and Stefanie Lowski
Reference 44
- Resolution
- verified exact
- doi, observed 2026-05-09T01:09:32.400049Z
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.