Layered tree-independence number and clique-based separators | Paper Citation Record

Observation ff4dbb72-2f21-4a68-96b5-78c57869fe15 · outbound

This paper cites Halldórsson.

Layered tree-independence number and clique-based separators Halldórsson

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:47.820049Z

Source-reported events for the cited work

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

Observation d9af7599-fd78-4f01-862a-1a498d21d4d1 · outbound

This paper cites Opportunity cost algorithms for combinatorial auctions.

Layered tree-independence number and clique-based separators Opportunity cost algorithms for combinatorial auctions

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:47.521546Z

Source-reported events for the cited work

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

Observation cb867947-ea86-4db6-aa7e-f1c1829b32ca · outbound

This paper cites Faster Algorithms for Cycle Hitting Problems on Disk Graphs.

Layered tree-independence number and clique-based separators Faster Algorithms for Cycle Hitting Problems on Disk Graphs

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-07T01:10:38.538553Z

Source-reported events for the cited work

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

Observation 94fe335c-5d97-460a-9dd0-5deb37f1a19f · outbound

This paper cites On forbidden induced subgraphs for unit disk graphs.

Layered tree-independence number and clique-based separators On forbidden induced subgraphs for unit disk graphs

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:47.179919Z

Source-reported events for the cited work

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

Observation 6acf080f-b93e-4eb2-8bde-a2457685c556 · outbound

This paper cites On approximation properties of the independent set problem for low degree graphs.Theory of Computing Systems, 32(2):115–132, 1999.

Layered tree-independence number and clique-based separators On approximation properties of the independent set problem for low degree graphs.Theory of Computing Systems, 32(2):115–132, 1999

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:47.073897Z

Source-reported events for the cited work

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

Observation 79cdc0d9-4f17-42a9-aacb-d4ba1018dbc5 · outbound

This paper cites Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time.

Layered tree-independence number and clique-based separators Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-08-07T01:10:38.348040Z

Source-reported events for the cited work

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

Observation 143c5e16-962c-415c-9220-79e0123bb709 · outbound

This paper cites Recognizing Unit Disk Graphs in Hyperbolic Geometry is $\exists\mathbb{R}$-Complete.

Layered tree-independence number and clique-based separators Recognizing Unit Disk Graphs in Hyperbolic Geometry is $\exists\mathbb{R}$-Complete

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-07T01:10:38.176714Z

Source-reported events for the cited work

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

Observation 84758c80-822b-4378-8aad-4a87a033ea75 · outbound

This paper cites Structure and Independence in Hyperbolic Uniform Disk Graphs.

Layered tree-independence number and clique-based separators Structure and Independence in Hyperbolic Uniform Disk Graphs

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-08-07T01:10:38.027734Z

Source-reported events for the cited work

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

Observation fcc4cf6c-de58-4b0b-928f-0aa9e8b16a05 · outbound

This paper cites https://formal.kastel.kit.edu/teaching/ projektgruppe/themen/WiSe2324/hyperbolicUnitDiskGraphs.pdf, 2023.

Layered tree-independence number and clique-based separators https://formal.kastel.kit.edu/teaching/ projektgruppe/themen/WiSe2324/hyperbolicUnitDiskGraphs.pdf, 2023

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.968999Z

Source-reported events for the cited work

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

Observation 7ab774b3-97f7-43e0-9866-7f5338e9a618 · outbound

This paper cites Bodlaender.

Layered tree-independence number and clique-based separators Bodlaender

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.867950Z

Source-reported events for the cited work

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

Observation acff8014-14eb-471c-a967-b941e0b34209 · outbound

This paper cites Bodlaender, Thomas Wolle, and Arie M.

Layered tree-independence number and clique-based separators Bodlaender, Thomas Wolle, and Arie M

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.779862Z

Source-reported events for the cited work

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

Observation c155ee21-30f9-4663-a5c2-ba5b253b00c9 · outbound

This paper cites Comparing width parame- ters on graph classes.European Journal of Combinatorics, 127:104163, 2025.

Layered tree-independence number and clique-based separators Comparing width parame- ters on graph classes.European Journal of Combinatorics, 127:104163, 2025

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.658454Z

Source-reported events for the cited work

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

Observation 3ecff4df-cb79-4f29-8894-93957559b168 · outbound

This paper cites Separating polynomialχ-boundedness from χ-boundedness.

Layered tree-independence number and clique-based separators Separating polynomialχ-boundedness from χ-boundedness

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.546823Z

Source-reported events for the cited work

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

Observation abfb3e4c-35f3-4133-9194-7fa45ac01658 · outbound

This paper cites Sunil Chandran and C.

Layered tree-independence number and clique-based separators Sunil Chandran and C

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.416101Z

Source-reported events for the cited work

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

Observation 76ac1af4-a774-4755-9be3-37d801e0fcc8 · outbound

This paper cites Independent sets in elimination graphs with a submodular objective.

Layered tree-independence number and clique-based separators Independent sets in elimination graphs with a submodular objective

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.233133Z

Source-reported events for the cited work

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

Observation ee106afa-7705-4762-9530-11556dc6355f · outbound

This paper cites Papadimitriou.

Layered tree-independence number and clique-based separators Papadimitriou

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:46.108733Z

Source-reported events for the cited work

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

Observation f41fff1a-7866-4a9d-8b0e-0c6167714039 · outbound

This paper cites On treewidth and maximum cliques.

Layered tree-independence number and clique-based separators On treewidth and maximum cliques

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-07T01:10:34.102661Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4192e19-4d17-4256-81e5-bf24e634bfe0 · outbound

This paper cites Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Layered tree-independence number and clique-based separators Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T01:10:34.215575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0305e0d-d2f9-4248-8d48-64549d5c632f · outbound

This paper cites Treewidth versus clique number.

Layered tree-independence number and clique-based separators Treewidth versus clique number

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:45.992566Z

Source-reported events for the cited work

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

Observation ade5a604-73e4-425d-96b4-c850bbc47b43 · outbound

This paper cites Lower bounds for dominating set in ball graphs and for weighted dominating set in unit-ball graphs.

Layered tree-independence number and clique-based separators Lower bounds for dominating set in ball graphs and for weighted dominating set in unit-ball graphs

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:45.859085Z

Source-reported events for the cited work

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

Observation 9ecb1938-4955-4982-95b7-9d28a52ba809 · outbound

This paper cites Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C.

Layered tree-independence number and clique-based separators Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:45.781652Z

Source-reported events for the cited work

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

Observation a767872f-8b1e-49a3-b75a-9b89a1bbdeb0 · outbound

This paper cites Clique- based separators for geometric intersection graphs.Algorithmica, 85(6):1652–1678, 2023.

Layered tree-independence number and clique-based separators Clique- based separators for geometric intersection graphs.Algorithmica, 85(6):1652–1678, 2023

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:45.575279Z

Source-reported events for the cited work

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

Observation 727d9dd0-4526-4f63-9099-7fed3bfb3825 · outbound

This paper cites Representations by contact and intersection of segments.Algorithmica, 47(4):453–463, 2007.

Layered tree-independence number and clique-based separators Representations by contact and intersection of segments.Algorithmica, 47(4):453–463, 2007

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:45.301027Z

Source-reported events for the cited work

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

Observation 9d18d42d-5b77-4773-b004-9458c0432fbf · outbound

This paper cites On contact graphs of paths on a grid.

Layered tree-independence number and clique-based separators On contact graphs of paths on a grid

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:44.999969Z

Source-reported events for the cited work

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

Observation f2c32e98-5ca4-472a-8abf-94dae04f41f0 · outbound

This paper cites A survey of degree-boundedness.European Journal of Combina- torics, page 104092, 2024.

Layered tree-independence number and clique-based separators A survey of degree-boundedness.European Journal of Combina- torics, page 104092, 2024

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:44.703591Z

Source-reported events for the cited work

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

Observation b1c5739d-04b2-4041-9620-c92dd9aee84b · outbound

This paper cites an unresolved cited work.

Layered tree-independence number and clique-based separators Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-07T01:10:44.446270Z

Source-reported events for the cited work

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

Observation a3eb0d14-3d3d-463c-b97d-d28c1c5557b9 · outbound

This paper cites an unresolved cited work.

Layered tree-independence number and clique-based separators Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T01:10:35.074858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b052d83-ff31-4417-902b-15a5d3d4693f · outbound

This paper cites an unresolved cited work.

Layered tree-independence number and clique-based separators Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-08-07T01:10:44.233699Z

Source-reported events for the cited work

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

Observation a09801cd-c4ad-44ad-be23-7496f358bd9e · outbound

This paper cites an unresolved cited work.

Layered tree-independence number and clique-based separators Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-08-07T01:10:43.993692Z

Source-reported events for the cited work

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

Observation 22a55d8a-3f43-4f6f-b187-e645fa421c6c · outbound

This paper cites Sublinear separators, fragility and subexponential expansion.European Journal of Combinatorics, 52:103–119, 2016.

Layered tree-independence number and clique-based separators Sublinear separators, fragility and subexponential expansion.European Journal of Combinatorics, 52:103–119, 2016

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-07T01:10:35.398741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da9cdea1-0f72-4e1e-8db6-153ba546439e · outbound

This paper cites Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs.

Layered tree-independence number and clique-based separators Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:43.757488Z

Source-reported events for the cited work

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

Observation ffb21350-756c-49a5-a6b7-f3d51d37f9b0 · outbound

This paper cites Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs.

Layered tree-independence number and clique-based separators Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-07T01:10:35.607683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35f7f25a-5d6d-4bfb-9ab4-fe2f253a4463 · outbound

This paper cites Problems from the world surrounding perfect graphs.Zastosowania Matematyki, 19(3-4):413–441, 1987.

Layered tree-independence number and clique-based separators Problems from the world surrounding perfect graphs.Zastosowania Matematyki, 19(3-4):413–441, 1987

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:43.437582Z

Source-reported events for the cited work

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

Observation 862189cc-602e-4605-b260-7f54f7e363c5 · outbound

This paper cites Contact graphs of curves.

Layered tree-independence number and clique-based separators Contact graphs of curves

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:43.173081Z

Source-reported events for the cited work

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

Observation f141b773-1150-40df-8b07-fdb557c62d42 · outbound

This paper cites The maximal clique and colourability of curve contact graphs.Discrete Applied Mathematics, 81(1-3):59–68, 1998.

Layered tree-independence number and clique-based separators The maximal clique and colourability of curve contact graphs.Discrete Applied Mathematics, 81(1-3):59–68, 1998

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:42.932817Z

Source-reported events for the cited work

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

Observation 08e7085d-fd2e-45c5-9d3d-697ddd8b1df4 · outbound

This paper cites Classes and recognition of curve contact graphs.Journal of Combinatorial Theory, Series B, 74(1):87–103, 1998.

Layered tree-independence number and clique-based separators Classes and recognition of curve contact graphs.Journal of Combinatorial Theory, Series B, 74(1):87–103, 1998

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:42.646405Z

Source-reported events for the cited work

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

Observation e29da127-60f1-48c4-a406-10bc51a403c2 · outbound

This paper cites What graphs are 2-dot product graphs? International Journal of Computational Geometry & Applications, 31(1):1–16, 2021.

Layered tree-independence number and clique-based separators What graphs are 2-dot product graphs? International Journal of Computational Geometry & Applications, 31(1):1–16, 2021

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:42.366374Z

Source-reported events for the cited work

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

Observation 28d33f89-dea5-405e-94f8-cb77c107caf9 · outbound

This paper cites Approximation algorithms for intersection graphs.Algo- rithmica, 68(2):312–336, 2014.

Layered tree-independence number and clique-based separators Approximation algorithms for intersection graphs.Algo- rithmica, 68(2):312–336, 2014

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:42.112497Z

Source-reported events for the cited work

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

Observation 6b4797d4-a6df-4bb3-8286-119ef8b600ea · outbound

This paper cites Hyperbolic intersection graphs and (quasi)-polynomial time.

Layered tree-independence number and clique-based separators Hyperbolic intersection graphs and (quasi)-polynomial time

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:41.886180Z

Source-reported events for the cited work

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

Observation c50b13b6-49d4-4d72-9670-35293f85678e · outbound

This paper cites Coloring powers of chordal graphs.SIAM Journal on Discrete Mathematics, 18(3): 451–461, 2004.

Layered tree-independence number and clique-based separators Coloring powers of chordal graphs.SIAM Journal on Discrete Mathematics, 18(3): 451–461, 2004

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:41.709598Z

Source-reported events for the cited work

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

Observation a09c9b40-77be-4c50-a2e5-276ec1a3721d · outbound

This paper cites Leiserson.

Layered tree-independence number and clique-based separators Leiserson

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:41.564765Z

Source-reported events for the cited work

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

Observation 2c1231d6-f694-4f1c-bea7-874ffcae0c61 · outbound

This paper cites Lee.Riemannian Manifolds: An Introduction to Curvature.

Layered tree-independence number and clique-based separators Lee.Riemannian Manifolds: An Introduction to Curvature

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:41.383850Z

Source-reported events for the cited work

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

Observation de691649-0b03-4641-b3ba-14ca7a1e7870 · outbound

This paper cites Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel.

Layered tree-independence number and clique-based separators Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:41.166389Z

Source-reported events for the cited work

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

Observation 762aa6f5-c658-4765-96e5-bd3e7eb2e02f · outbound

This paper cites Bipartizing (pseudo-)disk graphs: Approximation with a ratio better than 3.

Layered tree-independence number and clique-based separators Bipartizing (pseudo-)disk graphs: Approximation with a ratio better than 3

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:40.989189Z

Source-reported events for the cited work

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

Observation be057abb-e866-4cc9-b298-0d5034bd4211 · outbound

This paper cites On a condition for the union of spherical caps to be connected.Journal of Combinatorial Theory, Series A, 101(2):264–270, 2003.

Layered tree-independence number and clique-based separators On a condition for the union of spherical caps to be connected.Journal of Combinatorial Theory, Series A, 101(2):264–270, 2003

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:40.746642Z

Source-reported events for the cited work

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

Observation d10ebabb-965f-4a20-9441-db0e1dfd31c6 · outbound

This paper cites On the intersection graph of random caps on a sphere.European Journal of Combinatorics, 25(5):707–718, 2004.

Layered tree-independence number and clique-based separators On the intersection graph of random caps on a sphere.European Journal of Combinatorics, 25(5):707–718, 2004

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:40.515806Z

Source-reported events for the cited work

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

Observation 221ef497-9887-4010-9f43-ce6439317487 · outbound

This paper cites Geometric probability on the sphere.Jahresbericht der Deutschen Mathematiker-Vereinigung, 119:93–132, 2017.

Layered tree-independence number and clique-based separators Geometric probability on the sphere.Jahresbericht der Deutschen Mathematiker-Vereinigung, 119:93–132, 2017

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:40.306344Z

Source-reported events for the cited work

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

Observation a7f7c465-d81d-41a3-bbe8-f1754c29aa0a · outbound

This paper cites Birkhäuser, 2024.

Layered tree-independence number and clique-based separators Birkhäuser, 2024

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:40.066422Z

Source-reported events for the cited work

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

Observation 595fde1c-b16b-4fab-b54d-cbc8863258b2 · outbound

This paper cites Springer, 2012.

Layered tree-independence number and clique-based separators Springer, 2012

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:39.866248Z

Source-reported events for the cited work

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

Observation 4dc2a18f-cb01-4581-9993-d70834637d1c · outbound

This paper cites On coloringj-unit sphere graphs.

Layered tree-independence number and clique-based separators On coloringj-unit sphere graphs

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:39.684208Z

Source-reported events for the cited work

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

Observation b7bc91b5-bb61-43e9-8192-50d1440f5836 · outbound

This paper cites A finite family of pseudodiscs must include a “small” pseudodisc.SIAM Journal on Discrete Mathematics, 28(4):1930–1934, 2014.

Layered tree-independence number and clique-based separators A finite family of pseudodiscs must include a “small” pseudodisc.SIAM Journal on Discrete Mathematics, 28(4):1930–1934, 2014

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:39.450606Z

Source-reported events for the cited work

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

Observation 6b2e43ac-6c26-4301-a653-febac0974d93 · outbound

This paper cites Richtmyer.Introduction to Hyperbolic Geometry.

Layered tree-independence number and clique-based separators Richtmyer.Introduction to Hyperbolic Geometry

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:39.280507Z

Source-reported events for the cited work

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

Observation f9a37ddd-cb4d-43c0-8031-10ec8ff2668f · outbound

This paper cites an unresolved cited work.

Layered tree-independence number and clique-based separators Unresolved cited work

Reference 53

Resolution: unresolved; raw_fallback, observed 2026-08-07T01:10:39.121938Z

Source-reported events for the cited work

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

Observation f67984db-0ae5-41b2-90b3-0ecfbbbb59cf · outbound

This paper cites A survey ofχ-boundedness.

Layered tree-independence number and clique-based separators A survey ofχ-boundedness

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:38.927557Z

Source-reported events for the cited work

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

Observation 3881f11f-a5c5-44d2-9a22-3eb8dc460a28 · outbound

This paper cites Elimination graphs.

Layered tree-independence number and clique-based separators Elimination graphs

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T01:10:38.728349Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers