Pith. sign in

Paper Citation Record · LEDGER

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

As of 21 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2508.16319.

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

pith.paper-citation-record.v1
2508.16319 v1

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T17:26:02.148189Z

measured 46 of 46 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-26T15:21:33.592018Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T05:49:37.830819Z

Reference resolution

45 of 45 outbound references displayed

  • verified exact14
  • verified fuzzy5
  • unresolved24
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e8e8f75a-7fcd-429b-8dc3-808c4332a6f2 · outbound

This paper cites E liminating C rossings in O rdered G raphs.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms E liminating C rossings in O rdered G raphs

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.146610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.146610Z digest=sha256:68ebc72647be25c879266a90c46c2b9e02e6a6dea20f06c719f7ef2852bf1aaf

Observation 6e14a8c8-dbec-4e17-bcea-b7a5447c5be0 · outbound

This paper cites Asymptotically tight bounds for some multicolored ramsey numbers.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Asymptotically tight bounds for some multicolored ramsey numbers

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T17:26:02.914155Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:01.194584Z digest=sha256:c2c30eb6f8ab028fda58e395194615e3b617d421b8057d36d567621bcb81ac9c

Observation 7618537b-e499-47c9-9b93-314e84cf0f7e · outbound

This paper cites Bekos, Philipp Kindermann, and Tamara Mchedlidze.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Bekos, Philipp Kindermann, and Tamara Mchedlidze

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.278547Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.278547Z digest=sha256:fea25438b585b3e27091b8afa7891328bf36adf67f3b336a76d5b2a8d01ded85

Observation 2804ee02-de53-4f24-88c0-d795174d3769 · outbound

This paper cites C rossing M inimization for 1-page and 2-page D rawings of G raphs with B ounded T reewidth.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms C rossing M inimization for 1-page and 2-page D rawings of G raphs with B ounded T reewidth

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.422367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.422367Z digest=sha256:49e188d284d58067fb88a093986512d15d5d2e17cdbcca004134298dfd078192

Observation 7de4403f-2d27-4740-abd9-afb6d58cf671 · outbound

This paper cites Bekos, Martin Gronemann, and Chrysanthi N.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Bekos, Martin Gronemann, and Chrysanthi N

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.528399Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.528399Z digest=sha256:1f0a834823940de759bf3ee52179284d9edb5b32f330ea1a050a899ec6cdaf64

Observation d167ee64-9946-4f0d-8eb2-79b758341367 · outbound

This paper cites On the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms On the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.603557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.603557Z digest=sha256:85a34b3ae5fe8eb65130ac36a52e11d3ae855083920da5e7647ab17bc5627c22

Observation 056ae69e-709e-419d-a7f2-7695f9005c84 · outbound

This paper cites Parameterized A lgorithms for B ook E mbedding P roblems.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Parameterized A lgorithms for B ook E mbedding P roblems

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.697570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.697570Z digest=sha256:adc7dcb775b3ad28ca17d68f83c61c842187172b5143343f33f4218d4a14c880

Observation ab73d21a-e503-41df-a422-a2cb38a193bb · outbound

This paper cites Parameterized A lgorithms for Q ueue L ayouts.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Parameterized A lgorithms for Q ueue L ayouts

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.778095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.778095Z digest=sha256:7ba5e71085062ef9113837a94ad8de24439adfd4b6205a6147fd5c21d554736a

Observation 6a2a8637-8b56-4820-99fd-12d9a6fffaab · outbound

This paper cites Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Tom C.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Tom C

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.874001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.874001Z digest=sha256:da1c42d6ca5455bf2c3d7b0f0dd67c9303f79ac14a55dfdc66de9b2d04944079

Observation e19931f1-d3ae-4de8-a1e9-eac14c3bd4e0 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.970529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.970529Z digest=sha256:8b61767cb5a4d68889ce5fb4b93ec9b14cdd5b05dc142f9bb090b88f80131bb9

Observation d97cf97a-d3a4-42a2-979b-87ecf989d7ee · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:01.995677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:01.995677Z digest=sha256:462ff8da60d3c6c5f962d2013b15b900154df9cb581ac1cb3213daf900902ef5

Observation 42bcd441-4926-42be-94cc-23fa099aee3d · outbound

This paper cites Fink, Robert Ganian, and Martin N \"o llenburg.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Fink, Robert Ganian, and Martin N \"o llenburg

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.065189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.065189Z digest=sha256:54473eecce0af08090560bd1573788399fc5372d322fbd7062899a076a2268d8

Observation 5be33f47-c052-4f90-9092-9ff4fc9b1b93 · outbound

This paper cites Fink, Robert Ganian, and Martin N \" o llenburg.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Fink, Robert Ganian, and Martin N \" o llenburg

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T17:26:02.905099Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.067765Z digest=sha256:080c08d80af0acea0ba0cf4168286b07da5cdb85d9ce6e7d62c6b5733469b239

Observation cdf3c9ea-952d-4649-a4a9-8303d00bdcb6 · outbound

This paper cites G raph T heory, 4th E dition , volume 173 of Graduate T exts in M athematics.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms G raph T heory, 4th E dition , volume 173 of Graduate T exts in M athematics

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T17:26:02.895504Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.070239Z digest=sha256:d1b4b5b019593387226a9526e5115a7ed403bac26308388f3193a923e98e8c20

Observation 6fc90729-2212-401f-bd50-c4648f7dc6ae · outbound

This paper cites Dregi, and Pim van 't Hof.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Dregi, and Pim van 't Hof

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.072601Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.072601Z digest=sha256:fc9401d1704901624d03ce8d919b65f939f7c774739093baeeb5fa5c28807511

Observation f6b784ca-7db6-4036-8a62-5a0fb28144e4 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.074959Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.074959Z digest=sha256:6ee68529a2198b7acd7f6f634db5df7641d8911f554e6fe914a5e71787df94c9

Observation 90770004-efe9-4349-9374-6dccfd251617 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.077343Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.077343Z digest=sha256:f07e28f2b7cc3153ac2580d49f92b73b71723f15ea33eba9c75480dbb53581a8

Observation 2d850752-9bec-44a3-82da-2ab75d23bb72 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.079817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.079817Z digest=sha256:88005b957c6e92f92ee255fad44431702602f53a164264f6263b996f8dfff3c1

Observation 8f200083-5716-471c-aba6-b0cbc9cb751f · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.082270Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.082270Z digest=sha256:22396ffb6d9ef34f5ca5046177540a5f8682fd1e276eefdc3231fba28ef23e5c

Observation ee0f09e8-8bb8-4f29-9faa-dc7e9c379512 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 20

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.321274Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.085062Z digest=sha256:00dc0dde9823980e215e69970a69aaaf5848a8e776a5beb4deb5f825e5444a51

Observation bc54d10a-32e5-4557-996f-880ccc5607df · outbound

This paper cites Solving I nteger L inear P rograms with a S mall N umber of G lobal V ariables and C onstraints.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Solving I nteger L inear P rograms with a S mall N umber of G lobal V ariables and C onstraints

Reference 21

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.313586Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.087552Z digest=sha256:3658caab16f9324f1e43d0ad431bf792278b5eee905a566895dcabda78c9f6a2

Observation ec5cdfe0-5ed0-4884-a6b5-fd649ca1b2d3 · outbound

This paper cites he complexity landscape of decompositional parameters for ILP: P rograms with few global variables and constraints.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms he complexity landscape of decompositional parameters for ILP: P rograms with few global variables and constraints

Reference 22

Resolution
metadata mismatch
raw_fallback, observed 2026-08-05T17:26:02.789890Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.090288Z digest=sha256:470905e42b3687c28ce6184bb98577788cac38e7e83effe8ccc7cf1a5157b3af

Observation 598de0b9-f12d-433c-ba24-4097be856275 · outbound

This paper cites On S tructural P arameterizations of the B ounded- D egree V ertex D eletion P roblem.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms On S tructural P arameterizations of the B ounded- D egree V ertex D eletion P roblem

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.092762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.092762Z digest=sha256:fa225d5b804f6425db7aa8fb540c4442cde31784aee6d4a494c0d275289a1880

Observation 245f5cd7-d14f-4960-844e-6276bafa5a06 · outbound

This paper cites Parameterized C omplexity in G raph D rawing ( D agstuhl S eminar 21293).

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Parameterized C omplexity in G raph D rawing ( D agstuhl S eminar 21293)

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.095279Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.095279Z digest=sha256:c320caf58f7f2e6cbfb5725e4cea69b0911e536227b145fd214cb7aee80537ee

Observation a441bf53-91db-4b43-9c42-7fc02ed270f3 · outbound

This paper cites A T ight S ubexponential- T ime A lgorithm for T wo- P age B ook E mbedding.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms A T ight S ubexponential- T ime A lgorithm for T wo- P age B ook E mbedding

Reference 25

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.294876Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.097872Z digest=sha256:623c954227d773809e5cd04b6f267d741fcb284090f626c07ce89a38d746aadf

Observation edf314ec-aaec-4004-ba94-5d5327712921 · outbound

This paper cites On S tructural P arameterizations of the E dge D isjoint P aths P roblem.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms On S tructural P arameterizations of the E dge D isjoint P aths P roblem

Reference 26

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.287024Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.100206Z digest=sha256:35895205e5acfec0b76914b4c9baaab19ea3e16fbcfdccc7c925fab6ad20888c

Observation 8174923b-77b8-4203-98e8-a9cf6c2e272c · outbound

This paper cites Garey and David S.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Garey and David S

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T17:26:02.885954Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.102527Z digest=sha256:4259dd2008d16297cbc80d36de4a8d68b352304aa8de8f15ddb76b4d41e787f8

Observation 52788f22-61a8-4b1e-b72c-7711dba2cf4f · outbound

This paper cites Exploring the gap between treedepth and vertex cover through vertex integrity.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Exploring the gap between treedepth and vertex cover through vertex integrity

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.105070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.105070Z digest=sha256:8fc9a6488914aa496c6146433e5bf0d70059001200c9fc7dc13ef7c9445b1e9b

Observation c8bf8c7b-5dfb-4c46-80b6-5e858ff7568c · outbound

This paper cites Parameterized V ertex I ntegrity R evisited.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Parameterized V ertex I ntegrity R evisited

Reference 29

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.273593Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.107487Z digest=sha256:9085e92da5983c3bcda166c5bc2eeef1105e81dd476fcb44bd50fa8ccf8b6a1e

Observation 8ae5a67c-d3b0-4c36-97ec-9462ad03d34b · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 30

Resolution
verified exact
raw_fallback, observed 2026-08-05T17:26:02.581174Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.109855Z digest=sha256:7a851ce60861a4967a0b0f3c2d2cb0ae658fc26f5ffebc9bb17fa3a0ab3da228

Observation 9dea536e-1b6e-4b2b-a93d-d8dc4603f274 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 31

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.264845Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.112771Z digest=sha256:ad2dbe1b1e1cd12935221593cbcecb5b55b6194a670ba8ad12b093637a3da1d1

Observation f383b5a3-54de-4a1d-9dd7-bbf32bd9baaf · outbound

This paper cites Heath and Sriram V.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Heath and Sriram V

Reference 32

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.256912Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.115168Z digest=sha256:414e728d4e89c5059e2e5ef2242e051e72594d0228ee20685ef2f92f8475a643

Observation ccc8b9d0-c4fb-49a3-ba6b-c9c7cd40f51e · outbound

This paper cites Heath and Arnold L.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Heath and Arnold L

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.117487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.117487Z digest=sha256:ea44d72dcdeacb701dec06f01f5b073c731bd39e7b56f0098ab1280e24cab727

Observation 3c7f388f-a904-4606-a0d3-c959a627c4b7 · outbound

This paper cites L evel P lanar E mbedding in L inear T ime.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms L evel P lanar E mbedding in L inear T ime

Reference 34

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.243502Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.120289Z digest=sha256:e7d8045ea695c0d43b33d9de116197b72a4cc5059465241ca8fb6c9d5afe6b2a

Observation a3e96bd1-185c-4575-9569-759b7b071d54 · outbound

This paper cites L evel P lanar E mbedding in L inear T ime.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms L evel P lanar E mbedding in L inear T ime

Reference 35

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.234860Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.122800Z digest=sha256:e41100b6e398238ff5f4f451d2a9f60f9e8abc88eff39f6b237eaee2858463ea

Observation 0a97a45b-4b30-4aaa-8657-950449d954b0 · outbound

This paper cites Level P lanarity T esting in L inear T ime.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Level P lanarity T esting in L inear T ime

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.126143Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.126143Z digest=sha256:5e4bcc572f5699fadfd222b95eda0f7c5aba1c58a02fda32e5527f30ff21e24f

Observation 5d4ca769-e679-41fe-9862-65ec8a347323 · outbound

This paper cites Transforming S tacks into Q ueues: M ixed and S eparated L ayouts of G raphs.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Transforming S tacks into Q ueues: M ixed and S eparated L ayouts of G raphs

Reference 37

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.221837Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.128627Z digest=sha256:9d611fc7ea814643762ca4a08c59b6888e64e37bb1e8612bd0cbdc142ad9b278

Observation 36b32585-8c04-49ee-903a-85c548dc85d5 · outbound

This paper cites Fine-grained M eta- T heorems for V ertex I ntegrity.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Fine-grained M eta- T heorems for V ertex I ntegrity

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.130962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.130962Z digest=sha256:25549e60b1d8ffc9e3f967fe2a8b59efea820ed9dd0441de3abb49f49f5d6505

Observation bc4c0c87-71a3-4fbe-9bd5-998232dd62d1 · outbound

This paper cites On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering

Reference 39

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.208133Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.133383Z digest=sha256:82dc6a0501cc61d44aefa95fc3e6c2043a16a4dcd729d05e1142632d6d1c598f

Observation 9bf6d86e-8f71-4f64-a7e5-6340a72b18c7 · outbound

This paper cites Rosenberg.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Rosenberg

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T17:26:02.877676Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.135686Z digest=sha256:48fee24d0dc1e47a8df43daf0b04e8e747b373ea6b7dd34f603ca0644d462b2a

Observation a0154f07-c1d6-4117-a2c9-1fb5975d7f32 · outbound

This paper cites an unresolved cited work.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Unresolved cited work

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.137995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.137995Z digest=sha256:0e61876b7093b944cfe0ae4da471a4102adf1b9ed13b1fb22a8656462e1a677f

Observation a6a7604f-e4f6-49bb-9685-cc0922c37f7a · outbound

This paper cites A T rade-off between P age N umber and P age W idth of B ook E mbeddings of G raphs.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms A T rade-off between P age N umber and P age W idth of B ook E mbeddings of G raphs

Reference 42

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.194392Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.140396Z digest=sha256:d3743e3a92a550cfd070561538a91c5196bb5d3431b7097f2c21744bf4458575

Observation 2f6f965b-be5e-48d9-95a3-9a27d9dc046b · outbound

This paper cites The pagewidth of trivalent planar graphs.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms The pagewidth of trivalent planar graphs

Reference 43

Resolution
verified exact
doi, observed 2026-08-05T17:26:02.185633Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-05T17:26:02.143021Z digest=sha256:05ecdb86f670c1759084a4d70858daef32e61b89e9c417b4a3f416ef557ddabf

Observation f150c490-4b9e-48d5-a303-f8a372e75be3 · outbound

This paper cites On the queue-number of graphs with bounded tree-width.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms On the queue-number of graphs with bounded tree-width

Reference 44

Resolution
malformed identifier
no resolver link, observed 2026-08-05T17:26:02.145569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.145569Z digest=sha256:7d9cd45d758583b42858f4980a8c990b137f9f31a68fc5f0f66f8eaec5cfd9b5

Observation 5ae5e6a5-10c2-4d21-8205-cf3f3541305b · outbound

This paper cites Embedding P lanar G raphs in F our P ages.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Embedding P lanar G raphs in F our P ages

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-05T17:26:02.148189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T17:26:02.148189Z digest=sha256:524fe08e16849b9d81abcd872abc18be722aa7b2bc2b37fc045d5d607db1074a

Pith citing papers

Observation 2d2566b4-3893-4289-b729-1f986965d621 · inbound

Computing Twin-Width via Treedepth and Vertex Integrity cites this paper.

Computing Twin-Width via Treedepth and Vertex Integrity Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Reference 10

Resolution
verified exact
arxiv_id, observed 2026-07-04T05:49:37.833825Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-06-26T15:21:33.592018Z digest=sha256:4a437a2a787ac8d426cebfc1286f4f290153a2d8b7520ddc9e2205cfa39bf041