Finding irrelevant vertices in linear time on bounded-genus graphs | Paper Citation Record

Observation 46a754f0-0363-452c-94b7-d0b91d0d6f2e · outbound

This paper cites Fomin, Ignasi Sau, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin, Ignasi Sau, and Dimitrios M

Reference 1

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.386268Z

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 5cf8b4cf-0e8e-4aae-a025-7397ae75248a · outbound

This paper cites Computing excluded minors.

Finding irrelevant vertices in linear time on bounded-genus graphs Computing excluded minors

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.373209Z

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 0ed63e6f-5436-4554-963f-c9b0ef387f79 · outbound

This paper cites Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M

Reference 3

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.214887Z

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 37f746d8-e5a3-450a-aa40-213b1e352db5 · outbound

This paper cites Alowerboundonthetree-widthofgraphswithirrelevantvertices.

Finding irrelevant vertices in linear time on bounded-genus graphs Alowerboundonthetree-widthofgraphswithirrelevantvertices

Reference 4

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.171276Z

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 29de32d2-0111-4cd2-b2f6-02bc4608f893 · outbound

This paper cites Easy problems for tree-decomposable graphs.

Finding irrelevant vertices in linear time on bounded-genus graphs Easy problems for tree-decomposable graphs

Reference 5

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.313645Z

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 7301d266-b47e-40ae-82e8-1b2962340a74 · outbound

This paper cites Thilikos.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos

Reference 6

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.317622Z

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 a502d7df-f52a-41e0-96cd-d1e753d7aef0 · outbound

This paper cites Thilikos.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos

Reference 7

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.300574Z

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 8ba62eb9-5e46-4312-9456-bf5bb7546b52 · outbound

This paper cites Some classes of graphs with bounded treewidth.Bulletin of the EATCS, 36:116–125.

Finding irrelevant vertices in linear time on bounded-genus graphs Some classes of graphs with bounded treewidth.Bulletin of the EATCS, 36:116–125

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T22:10:01.230624Z

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 31db5030-7f94-4228-96de-cc66840cefb6 · outbound

This paper cites Borie, R.

Finding irrelevant vertices in linear time on bounded-genus graphs Borie, R

Reference 9

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.324403Z

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 96631381-48b7-42b9-b629-bf355cc9e621 · outbound

This paper cites Graph isomorphism parameterized by elimination distance to bounded degree.Algorithmica, 75(2):363–382, 2016.doi:10.1007/s00453-015-0045-3.

Finding irrelevant vertices in linear time on bounded-genus graphs Graph isomorphism parameterized by elimination distance to bounded degree.Algorithmica, 75(2):363–382, 2016.doi:10.1007/s00453-015-0045-3

Reference 10

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.394950Z

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 a037ef6f-8e74-4b3e-b152-cdad1564478b · outbound

This paper cites Fixed-parameter tractable distances to sparse graph classes.Algorith- mica, 79(1):139–158, 2017.doi:10.1007/s00453-016-0235-7.

Finding irrelevant vertices in linear time on bounded-genus graphs Fixed-parameter tractable distances to sparse graph classes.Algorith- mica, 79(1):139–158, 2017.doi:10.1007/s00453-016-0235-7

Reference 11

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.167784Z

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 0e612ae8-8b1a-43ae-a07f-0ad278ac6195 · outbound

This paper cites Algorithms for the edge-width of an embedded graph.Computational Geometry, 45(5):215–224, 2012.doi:10.1016/j.comgeo.2011.12.

Finding irrelevant vertices in linear time on bounded-genus graphs Algorithms for the edge-width of an embedded graph.Computational Geometry, 45(5):215–224, 2012.doi:10.1016/j.comgeo.2011.12

Reference 12

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.423674Z

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 a6f14889-49d1-4502-92e2-1e1541c56808 · outbound

This paper cites Papadimitriou.

Finding irrelevant vertices in linear time on bounded-genus graphs Papadimitriou

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.297287Z

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 29c5d392-cd44-4b11-b596-33277a57128f · outbound

This paper cites Parameterized algorithm for the disjoint path problem on planar graphs: Exponential ink2 and linear in n.

Finding irrelevant vertices in linear time on bounded-genus graphs Parameterized algorithm for the disjoint path problem on planar graphs: Exponential ink2 and linear in n

Reference 14

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.320914Z

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 61a83e91-2dae-4964-97d7-fb27cb0e462c · outbound

This paper cites Towards tight(er) bounds for the excluded grid theorem.Journal of Combinatorial Theory, Series B, 146:219–265, 2021.doi:10.1016/J.JCTB.2020.09.010.

Finding irrelevant vertices in linear time on bounded-genus graphs Towards tight(er) bounds for the excluded grid theorem.Journal of Combinatorial Theory, Series B, 146:219–265, 2021.doi:10.1016/J.JCTB.2020.09.010

Reference 15

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.349622Z

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 f6f9fe11-67d2-4ad1-8cbe-e06421c96e69 · outbound

This paper cites The monadic second-order logic of graphs.

Finding irrelevant vertices in linear time on bounded-genus graphs The monadic second-order logic of graphs

Reference 16

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.338986Z

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 f7033049-8a85-4cc6-bb8d-82127da26a53 · outbound

This paper cites The monadic second-order logic of graphs III: tree-decompositions, minors and complexity issues.RAIRO - Theoretical Informatics and Applications, 26:257–286, 1992.doi:10.

Finding irrelevant vertices in linear time on bounded-genus graphs The monadic second-order logic of graphs III: tree-decompositions, minors and complexity issues.RAIRO - Theoretical Informatics and Applications, 26:257–286, 1992.doi:10

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.476823Z

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 462cbbfa-c6ca-4d27-a04d-748e77b56e55 · outbound

This paper cites The expression of graph properties and graph transformations in monadic second- order logic.

Finding irrelevant vertices in linear time on bounded-genus graphs The expression of graph properties and graph transformations in monadic second- order logic

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T22:10:01.222361Z

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 f7384d70-58ee-46ab-b1e6-e717b2b9ea5d · outbound

This paper cites Demaine and MohammadTaghi Hajiaghayi.

Finding irrelevant vertices in linear time on bounded-genus graphs Demaine and MohammadTaghi Hajiaghayi

Reference 19

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.268029Z

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 49806c11-b72e-40a1-ae04-8fc069332312 · outbound

This paper cites Demaine, MohammadTaghi Hajiaghayi, and Ken ichi Kawarabayashi.

Finding irrelevant vertices in linear time on bounded-genus graphs Demaine, MohammadTaghi Hajiaghayi, and Ken ichi Kawarabayashi

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.272835Z

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 30e5249e-4189-45db-a996-2e346a851792 · outbound

This paper cites Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M

Reference 21

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.345747Z

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 ad980fc0-88ac-4ea0-aa99-daa16f43fd61 · outbound

This paper cites Diameter and treewidth in minor-closed graph families.Algorithmica, 27:275–291, 2000.doi:10.1007/s004530010020.

Finding irrelevant vertices in linear time on bounded-genus graphs Diameter and treewidth in minor-closed graph families.Algorithmica, 27:275–291, 2000.doi:10.1007/s004530010020

Reference 22

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.230582Z

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 2ad722cc-a62d-4b65-bbdf-b36f81e85df8 · outbound

This paper cites Dynamic generators of topologically embedded graphs.

Finding irrelevant vertices in linear time on bounded-genus graphs Dynamic generators of topologically embedded graphs

Reference 23

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.236091Z

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 b70d70ac-484b-4fdd-9076-1ad4abd528c3 · outbound

This paper cites Fellows, Jan Kratochvíl, Matthias Middendorf, and Frank Pfeiffer.

Finding irrelevant vertices in linear time on bounded-genus graphs Fellows, Jan Kratochvíl, Matthias Middendorf, and Frank Pfeiffer

Reference 24

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.380498Z

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 42c0a245-6678-48cc-a496-0331b77938c2 · outbound

This paper cites Fomin, Petr A.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin, Petr A

Reference 25

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.309275Z

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 aa2c1eb1-cdb1-4d78-8c3a-f632bdf84285 · outbound

This paper cites Compound logics for modification problems.ACM Transactions on Computational Logic, 26(1):2:1–2:57, December.

Finding irrelevant vertices in linear time on bounded-genus graphs Compound logics for modification problems.ACM Transactions on Computational Logic, 26(1):2:1–2:57, December

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T22:10:01.237843Z

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 7b1409e0-3fca-4639-8510-3598ac372cd1 · outbound

This paper cites 1, 2, 30.

Finding irrelevant vertices in linear time on bounded-genus graphs 1, 2, 30

Reference 27

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.218686Z

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 8f0a55b1-f69f-4512-97a7-28b1bf2f82a3 · outbound

This paper cites Fomin, Petr A.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin, Petr A

Reference 28

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.288338Z

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 c2d009c0-aa93-4475-a827-4c178ba83348 · outbound

This paper cites Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi

Reference 29

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.250043Z

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 dad662f8-c916-4831-b4e8-60310cc1be20 · outbound

This paper cites Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M

Reference 30

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.256558Z

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 72d5bbe2-0170-403f-8624-63191a252fa7 · outbound

This paper cites Fomin and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Fomin and Dimitrios M

Reference 31

Resolution: malformed identifier; raw_fallback, observed 2026-05-24T22:10:01.240967Z

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 f75662bc-5bf1-43c5-8c6e-b1fcaa7580aa · outbound

This paper cites (Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs.

Finding irrelevant vertices in linear time on bounded-genus graphs (Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs

Reference 32

Resolution: malformed identifier; doi_truncated, observed 2026-05-24T22:10:00.357032Z

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 50c50d8e-768a-4dbd-a147-1578b1e7157c · outbound

This paper cites Geelen, R.

Finding irrelevant vertices in linear time on bounded-genus graphs Geelen, R

Reference 33

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.416586Z

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 0bdd3ec8-ee3a-465f-aea8-9a41c519ffed · outbound

This paper cites Golovach, Marcin Kamiński, Spyridon Maniatis, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Golovach, Marcin Kamiński, Spyridon Maniatis, and Dimitrios M

Reference 34

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.413332Z

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 e767d103-e110-471e-b74d-881fbe7fe500 · outbound

This paper cites Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno.

Finding irrelevant vertices in linear time on bounded-genus graphs Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno

Reference 35

Resolution: malformed identifier; doi_truncated, observed 2026-05-24T22:10:00.284990Z

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 7b420ba0-633b-4bb5-af36-f1d83a2b20ba · outbound

This paper cites Golovach, Giannos Stamoulis, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Golovach, Giannos Stamoulis, and Dimitrios M

Reference 36

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.204922Z

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 6b30f214-680c-4141-bb0c-cac35bdc52c6 · outbound

This paper cites Golovach, Giannos Stamoulis, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Golovach, Giannos Stamoulis, and Dimitrios M

Reference 37

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.222237Z

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 4e865391-b63f-4183-9979-e711882187c6 · outbound

This paper cites Golovach, Giannos Stamoulis, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Golovach, Giannos Stamoulis, and Dimitrios M

Reference 38

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.280631Z

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 fcfa049f-7861-41dd-b2e6-176bba93fd2a · outbound

This paper cites Quickly excluding an annotated planar graph, 2026.arXiv:2602.06516,doi:10.48550/arXiv.2602.06516.

Finding irrelevant vertices in linear time on bounded-genus graphs Quickly excluding an annotated planar graph, 2026.arXiv:2602.06516,doi:10.48550/arXiv.2602.06516

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.201445Z

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 fbad89ab-49a7-49fe-8739-e12a5ed7c75b · outbound

This paper cites 2011 , isbn =.

Finding irrelevant vertices in linear time on bounded-genus graphs 2011 , isbn =

Reference 40

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.192870Z

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 4cf69c86-0a35-4761-9530-72b25ed75aeb · outbound

This paper cites A Geometric Heuristic for Rectilinear Crossing Minimization.

Finding irrelevant vertices in linear time on bounded-genus graphs A Geometric Heuristic for Rectilinear Crossing Minimization

Reference 41

Resolution: malformed identifier; doi_truncated, observed 2026-05-24T22:10:00.184278Z

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 67778d9f-53f9-4eb0-9b30-69c69b3a017b · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 42

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.409231Z

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 ac948274-e6ab-4fd2-8415-75ca22155210 · outbound

This paper cites Planarity allowing few error vertices in linear time.

Finding irrelevant vertices in linear time on bounded-genus graphs Planarity allowing few error vertices in linear time

Reference 43

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.353140Z

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 9ba70b97-069d-4baf-9209-deea5f6bc703 · outbound

This paper cites Algorithms for finding an induced cycle in planar graphs and bounded genus graphs.

Finding irrelevant vertices in linear time on bounded-genus graphs Algorithms for finding an induced cycle in planar graphs and bounded genus graphs

Reference 44

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.175491Z

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 9506c451-3294-4702-9329-03763eb1e977 · outbound

This paper cites Algorithms for finding an induced cycle in planar graphs.Combinatorica, 30(6):715–734, 2010.doi:10.1007/S00493-010-2499-X.

Finding irrelevant vertices in linear time on bounded-genus graphs Algorithms for finding an induced cycle in planar graphs.Combinatorica, 30(6):715–734, 2010.doi:10.1007/S00493-010-2499-X

Reference 45

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.277033Z

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 4cf063d2-8548-4c72-97ed-420e44ae60a8 · outbound

This paper cites The induced disjoint paths problem.

Finding irrelevant vertices in linear time on bounded-genus graphs The induced disjoint paths problem

Reference 46

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.180511Z

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 23e4a37c-2b9c-4a63-aad0-dc4dd4312ef5 · outbound

This paper cites The disjoint paths problem in quadratic time.Journal of Combinatorial Theory, Series B, 102(2):424–435, 2012.doi:10.1016/j.jctb.2011.

Finding irrelevant vertices in linear time on bounded-genus graphs The disjoint paths problem in quadratic time.Journal of Combinatorial Theory, Series B, 102(2):424–435, 2012.doi:10.1016/j.jctb.2011

Reference 47

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.264844Z

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 b648b1a5-38b4-4c1d-bb38-4d10f99176f9 · outbound

This paper cites Linkless and flat embeddings in 3-space.

Finding irrelevant vertices in linear time on bounded-genus graphs Linkless and flat embeddings in 3-space

Reference 48

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.291969Z

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 9d159e31-0c63-4871-b4af-09685da4fca9 · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 49

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.244158Z

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 d69be071-232e-44b8-adf6-3940cb547cb2 · outbound

This paper cites Proportional Response Dynamics Leads to Market Equilibrium.

Finding irrelevant vertices in linear time on bounded-genus graphs Proportional Response Dynamics Leads to Market Equilibrium

Reference 50

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.343106Z

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 d3771b52-2cc3-469d-8a28-c2cc74ebf8ec · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 51

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.162549Z

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 dcf931cf-63b7-42c3-aca1-dccc8155ac61 · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 52

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.240548Z

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 a55f85c3-ac7c-4f92-9ea9-b4d836216eb2 · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 53

Resolution: malformed identifier; raw_fallback, observed 2026-05-24T22:10:01.225994Z

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 2187813c-a343-4a27-b902-a85ee7f147f1 · outbound

This paper cites Thilikos.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos

Reference 54

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.405500Z

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 61b1fdd5-682c-411f-9536-fdcaae2f9c47 · outbound

This paper cites Deleting vertices to graphs of bounded genus.Algorithmica, 81(9):3655–3691, 2019.doi:10.1007/s00453-019-00592-7.

Finding irrelevant vertices in linear time on bounded-genus graphs Deleting vertices to graphs of bounded genus.Algorithmica, 81(9):3655–3691, 2019.doi:10.1007/s00453-019-00592-7

Reference 55

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.303783Z

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 bdb473cf-43a2-45c4-8c7f-038da96ee725 · outbound

This paper cites IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =.

Finding irrelevant vertices in linear time on bounded-genus graphs IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Reference 56

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.377732Z

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 7ab31d1d-3047-448f-8752-3aa23366d62c · outbound

This paper cites Minor containment and disjoint paths in almost-linear time.

Finding irrelevant vertices in linear time on bounded-genus graphs Minor containment and disjoint paths in almost-linear time

Reference 57

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.391513Z

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 d3ee1f83-da7a-4d65-9c8e-ef9f884e3bae · outbound

This paper cites Crossing number in slightly superexponential time.

Finding irrelevant vertices in linear time on bounded-genus graphs Crossing number in slightly superexponential time

Reference 58

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.383594Z

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 09da5a6c-51de-4534-a55a-26180bf8e687 · outbound

This paper cites Obtaining a planar graph by vertex deletion.Algorithmica, 62(3–4):807–822, 2012.doi:10.1007/s00453-010-9484-z.

Finding irrelevant vertices in linear time on bounded-genus graphs Obtaining a planar graph by vertex deletion.Algorithmica, 62(3–4):807–822, 2012.doi:10.1007/s00453-010-9484-z

Reference 59

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.360429Z

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 cd67d29f-e573-46b4-b290-a63f4dafe4fd · outbound

This paper cites A single exponential bound for the redundant vertex Theorem on surfaces.

Finding irrelevant vertices in linear time on bounded-genus graphs A single exponential bound for the redundant vertex Theorem on surfaces

Reference 60

Resolution: verified exact; local_arxiv, observed 2026-05-24T22:10:00.470763Z

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 a0688731-fdb8-4880-a88f-31ee05ef7962 · outbound

This paper cites A linear time algorithm for embedding graphs in an arbitrary surface.SIAM Journal on Discrete Mathematics, 12(1):6–26, 1999.doi:10.1137/S089548019529248X.

Finding irrelevant vertices in linear time on bounded-genus graphs A linear time algorithm for embedding graphs in an arbitrary surface.SIAM Journal on Discrete Mathematics, 12(1):6–26, 1999.doi:10.1137/S089548019529248X

Reference 61

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.402023Z

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 7f4630ab-59af-45b0-a722-4dd5d8976558 · outbound

This paper cites Johns Hopkins Series in the Mathematical Sciences.

Finding irrelevant vertices in linear time on bounded-genus graphs Johns Hopkins Series in the Mathematical Sciences

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T22:10:01.215478Z

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 f4ab8f46-1a10-4c4e-97ac-ebfb100be3ba · outbound

This paper cites Thilikos.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos

Reference 63

Resolution: malformed identifier; raw_fallback, observed 2026-05-24T22:10:01.218227Z

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 b15ab71a-2a7f-48c4-be7c-fb586a6108ac · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 64

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.430156Z

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 05035ba6-d3c5-4d19-9648-e7a7a3202683 · outbound

This paper cites Reed, Neil Robertson, Alexander Schrijver, and Paul D.

Finding irrelevant vertices in linear time on bounded-genus graphs Reed, Neil Robertson, Alexander Schrijver, and Paul D

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T22:10:01.212356Z

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 46e8deb5-dd23-431d-b00e-ab0d1de4e1c6 · outbound

This paper cites Graph minors.

Finding irrelevant vertices in linear time on bounded-genus graphs Graph minors

Reference 66

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.252958Z

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 9c422a48-1943-449e-a21c-1c3d911ac154 · outbound

This paper cites Graph minors.

Finding irrelevant vertices in linear time on bounded-genus graphs Graph minors

Reference 67

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.426715Z

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 df1e5060-c603-4028-b984-64dfcb7663ab · outbound

This paper cites Graph minors.

Finding irrelevant vertices in linear time on bounded-genus graphs Graph minors

Reference 68

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.211200Z

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 225512ff-a86b-4f0f-aa69-4ee88bb71d11 · outbound

This paper cites an unresolved cited work.

Finding irrelevant vertices in linear time on bounded-genus graphs Unresolved cited work

Reference 69

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.397928Z

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 d7932d50-c9dc-4e94-b69e-0f93dc4ff7c4 · outbound

This paper cites Robertson and P.D.

Finding irrelevant vertices in linear time on bounded-genus graphs Robertson and P.D

Reference 70

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.369021Z

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 6d314de5-f1ec-4d8f-bbe3-e5004b267aa2 · outbound

This paper cites [RS04] Neil Robertson and P.

Finding irrelevant vertices in linear time on bounded-genus graphs [RS04] Neil Robertson and P

Reference 71

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.331067Z

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 fe701712-6d14-4ae6-a058-b355dd6a774f · outbound

This paper cites Seymour, and Robin Thomas.

Finding irrelevant vertices in linear time on bounded-genus graphs Seymour, and Robin Thomas

Reference 72

Resolution: verified exact; arxiv_id, observed 2026-05-24T22:10:00.335799Z

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 38aba39a-e439-4e9b-857e-41f88145c9be · outbound

This paper cites Thilikos.Parameterizing the quantification of CMSO: model checking on minor-closed graph classes, pages 3728–3742.doi:10.1137/1.9781611978322.124.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos.Parameterizing the quantification of CMSO: model checking on minor-closed graph classes, pages 3728–3742.doi:10.1137/1.9781611978322.124

Reference 73

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.420448Z

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 08afd224-e22c-4259-88b7-6053cb577364 · outbound

This paper cites Thilikos.k-apices of minor-closed graph classes.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos.k-apices of minor-closed graph classes

Reference 74

Resolution: malformed identifier; raw_fallback, observed 2026-05-24T22:10:01.234137Z

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 7272c8cb-5e4d-4d09-979f-f43166a9ef8d · outbound

This paper cites An FPT-Algorithm for Recognizingk-Apices of Minor-Closed Graph Classes.

Finding irrelevant vertices in linear time on bounded-genus graphs An FPT-Algorithm for Recognizingk-Apices of Minor-Closed Graph Classes

Reference 75

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.327694Z

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 82c0438c-94d9-46e5-b3ae-21a92edf303d · outbound

This paper cites Thilikos.k-apices of minor-closed graph classes.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos.k-apices of minor-closed graph classes

Reference 76

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.260481Z

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 8f6c3d28-0b6d-417e-88d2-c6b22b2ec4ed · outbound

This paper cites Thilikos, and Alexandre Vigny.

Finding irrelevant vertices in linear time on bounded-genus graphs Thilikos, and Alexandre Vigny

Reference 77

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.364909Z

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 c6206d53-2aec-432f-bba7-7276a43626ed · outbound

This paper cites IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =.

Finding irrelevant vertices in linear time on bounded-genus graphs IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Reference 78

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T22:10:00.227184Z

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 15c7b952-dac0-4b60-8c8e-b4f19afa4c2c · outbound

This paper cites Bodlaender, Babette de Fluiter, and Dimitrios M.

Finding irrelevant vertices in linear time on bounded-genus graphs Bodlaender, Babette de Fluiter, and Dimitrios M

Reference 79

Resolution: verified exact; doi, observed 2026-05-24T22:10:00.208094Z

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.

Coverage vector

Reference resolution

Outbound references

Pith citing papers