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:8acf5d2393d08ded171674b540867df9c2b23c9252eab9e157641a04a85075a2

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:6b3028c69f06c6c0dd773cea25bcce3ae13846a4922a2e2ddd3a8603d036421b

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:89d0a52480dad58c566573bdbf886a0c14f76da7b128727339144e8605eefd35

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:0d687748020f1ac6e80f197827139321dcdbba9196412b683329c8265b05a5f4

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:9e13f5aa10cc652efa1d703baa00bc077117bfd883fbdf4f44d7772e034e55c9

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:3f651878d121900a839c501da87bd5df86888eb4c2199e5ed989ed845fe79787

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:30e801ae49c98be8cccff7cce68cbf18c46f0a91bb3a49b4925039f88bc2da2d

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:1d34ea8f9cf84aed52a9f86af6ca734253e6e1f3c29cd2c2c7ae97872b17edd7

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:6a94672fc72c77d59e224b220f734c64e60813e38041215dea9eea3f315064ae

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:23469d25092a6f6c35c8c9ad969e60a8b873d7f45a24b8e30a03b493a30a5211

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:152383c39582d36737929b7692d6c305fdaf2ec42e3e0212b47bccad9415572c

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:2af6b4fa12257876d4614ab8b359cfa9bfde50a69dfac295344fcdd18af0d967

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:68d31ca2b68c50aa966fe98dd799ce74569f951f48da09d72351900ca6813d67

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:df07a21f4f560e5ad56d23beb48adcecf532d09fbe8866094a96ebe811b6397b

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:42cf4ce31bd4e1c7575f8f74f6cfb82a50ec34f72cfac28da4771b2bd7f1368d

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:aa070766a57575a7d54b0ef6dda1140c0803dae50fe0b1fa81636bd203b58dac

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:8c8463719327a2e6cec69aa49c5b22daad2a7b162af96973236322ad499ea7a4

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:b4beb867b9691e0811ab1d8c1a583fda5cca26038806728abe11acd4bcef49a5

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:9a4444903381c82fe56909af5331f10b40a731a7420cfab33fc7cab4f984d62e

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:9fc7cbbc6d808f83f0fef880a51451c837918b76a336cfc8c43d7609bdc132ad

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:55f17864df2a019bab3fd136671ad3dbba04e2a4c529da1d750a66533f5d0f0e

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:68736736f12a719caa9c1014368c5bef1623f56db314992395378302c8645e8e

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:9710bc67b445325e3bf3b0f66020f89b38d07ef55d836b1d8f82968a202043ad

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:692ca8ddf1752eb28d07a61070b6c95fca830cd0eb9a6384f550ddd3d91061bb

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:0822d146a7362f1472c4e2f896bbc782ef8e166e6881438bb454f94ea41be4ef

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:94b58a363effa41a04e2a53b1253f443eee26e6687f2441a8357b6cef90622f0

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:525344abd4c22f8a6e218c1890bdaf2a64a8c2abe09cea6e05bb80f7476660b0

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:1b251d99c13a24dd8d9e8c428a40475392b8823e9c005c4f44629e131b3ceb58

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:6db2b630bf2fafec11749e9d3817e1eb405db97ca7de02ef894458caf02839fb

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:ce832b3b2346abc2b6e7e5b3f3d7495aea397ab371f2c4664f8984a9d6f0ff1c

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:c61fb8fb88cf8f488e1bce68992eb18d4bce70e00e25ebcbb6190167b9dd5d67

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:1acdf8f38a05c40d9b3f00ead8a32658cc2d6f12ce0a7d660e5dc3b1a764c361

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:ccfcb56ae6db91732710a596fd17becd5a9e7d6c326f3dc05e53dd03bc9c69eb

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:5f564845b3b937a756ff82a49619c287813bf560a8dd8befacc5401ea2cbe989

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:90e331b5859d724d27d883d949fad8cd66759a5678668a766c326877d1caea3d

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:bd2d917495e912c85359e74c21e606f4934ddcf92c898e14ccd10e1c1f610744

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:9683de3861addd8fb7b959ac9f0791727f8ef8bd03b2be4a8182e9b534735b31

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:7616cf6e4a352385b42e5ac5b440e908e25b6d7d39c7e288049596bce990f6ad

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:e665163ce4599d3b3dce233ceae32722f3333897aec36b047aaae6589b564440

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:258d11fc02f7d7ac60e47fd1c21b339053a5a87c43adc7dbe510802433f017c0

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:4fd1dcc614f2c52f9c5b4851191d8a921a67e468dfcf6dd1b696476963be7d88

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:54976565539fb906785e9a39c1a1f0a5c3a48ead63457c71a9ed7317f79744cb

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:d8903cf816a7be5ee8f78cf446569f048f6146477e586492bf14d8e522348cf3

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:781bf9cad5a0ca21821766eb812959cdb34cacff9880bfb82f3a124d20d085a0

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:f0fba36cfb717cfcf05ca6d822d4f827e250677beb1aea9ef4edf5e09d2e5d9c

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:0a415526ec34fc7c488acacd83a151be278d954e51808f7e658de3a85f141fb4