The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem | Paper Citation Record

Observation 0dfc811b-9c6c-41d6-80fd-ecdf0985e4f2 · outbound

This paper cites The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree , booktitle =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree , booktitle =

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.750899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5760e58c-d8ca-48e4-9d49-4f486b0ca321 · outbound

This paper cites and Leskovec, Jure , year =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem and Leskovec, Jure , year =

Reference 3

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.729707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 63d0aa3e-83ca-43a7-b8b5-4a27ddebcee3 · outbound

This paper cites IEEE Transactions on Knowledge and Data Engineering , volume=.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem IEEE Transactions on Knowledge and Data Engineering , volume=

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.886370Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 710f9ada-1577-4327-885c-c166c4e96840 · outbound

This paper cites Discover Data , volume=.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Discover Data , volume=

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.890720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8b5c9134-2736-441f-8cbc-41a1c9d7cf17 · outbound

This paper cites The complexity of counting homomorphisms seen from the other side , journal =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem The complexity of counting homomorphisms seen from the other side , journal =

Reference 6

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.717981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f6b5d88f-3d2a-4331-a700-9127f72b74c3 · outbound

This paper cites Can You Beat Treewidth? , journal =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Can You Beat Treewidth? , journal =

Reference 7

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.734791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation aec3adab-8e45-4764-a40b-6e9a7e25907c · outbound

This paper cites Complexity of.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Complexity of

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.895416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dea0197e-4684-420c-81a4-3801aa7522c7 · outbound

This paper cites https://doi.org/10.1145/3055399.3055501 Area-convexity, l\( _ \( \) \) regularization, and undirected multicommodity flow.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem https://doi.org/10.1145/3055399.3055501 Area-convexity, l\( _ \( \) \) regularization, and undirected multicommodity flow

Reference 9

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T04:46:45.721214Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 787295ec-adfe-452b-8dcd-f63297eddde4 · outbound

This paper cites 2024 , url =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem 2024 , url =

Reference 10

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.723823Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1c41964a-6156-4061-aaed-2a4e62c49e08 · outbound

This paper cites [GPAM+20] Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing X u, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem [GPAM+20] Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing X u, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio

Reference 11

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T04:46:45.759620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a718230b-71ae-4f14-9e48-98b254ecf5b9 · outbound

This paper cites ISBN 9781450359405.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem ISBN 9781450359405

Reference 12

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T04:46:45.729108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b23c2556-9416-445f-b034-c36cbe0f96cf · outbound

This paper cites Casteigts, P.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Casteigts, P

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.755088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 25c8bcc9-5e16-4927-abb0-df8f689c104f · outbound

This paper cites Finding Temporal Paths Under Waiting Time Constraints.Algorithmica, 83(9):2754–2802, September 2021.doi:10.1007/s00453-021-00831-w.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Finding Temporal Paths Under Waiting Time Constraints.Algorithmica, 83(9):2754–2802, September 2021.doi:10.1007/s00453-021-00831-w

Reference 14

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.744070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ed65b251-b742-442d-b600-db10203dabf9 · outbound

This paper cites Upper bounds to the clique width of graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Upper bounds to the clique width of graphs

Reference 15

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.693162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b3dd94d5-8ed0-459d-8201-bbdcd1941a5c · outbound

This paper cites Kanj, and Ge Xia.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Kanj, and Ge Xia

Reference 16

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.686677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 299eb7f3-ae64-4097-b262-6741c8f3c8aa · outbound

This paper cites Kanj and Ge Xia , title =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Kanj and Ge Xia , title =

Reference 17

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.684634Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ce299931-b529-408e-b2a0-073cb1dc3b47 · outbound

This paper cites On the compl exity of k-sat.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On the compl exity of k-sat

Reference 18

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.673639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 11866081-b4e2-463e-b7f3-05b9cda8eb3f · outbound

This paper cites On recognizing graphs by numbers of homomorphisms.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On recognizing graphs by numbers of homomorphisms

Reference 19

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.705879Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4b294f1d-a138-469d-a9e5-b804c186c2f9 · outbound

This paper cites Lovász Meets Weisfeiler and Leman.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Lovász Meets Weisfeiler and Leman

Reference 20

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.704093Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fccbaf2c-270f-4e8f-ae71-bf6e2397d6bc · outbound

This paper cites Parameterized Complexity Theory , series =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Parameterized Complexity Theory , series =

Reference 21

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.718914Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f3a96976-4599-4cb6-9637-f74081e4b455 · outbound

This paper cites Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe

Reference 22

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.747050Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fa6948b1-fc36-4fe2-836c-f4b127893028 · outbound

This paper cites As Time Goes By: Reflections on Treewidth for Temporal Graphs , booktitle =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem As Time Goes By: Reflections on Treewidth for Temporal Graphs , booktitle =

Reference 23

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.723623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bf9a39b4-f5e0-40f5-9cb4-309734e93c59 · outbound

This paper cites an unresolved cited work.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Unresolved cited work

Reference 24

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.712580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d8447655-f28a-4dfb-80ae-9aa9ff7be79b · outbound

This paper cites Dabrowski and Matthew Johnson and Dani.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Dabrowski and Matthew Johnson and Dani

Reference 25

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.708151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 74aadbd5-9990-4b2f-91ce-7917648ca646 · outbound

This paper cites 2012 , url =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem 2012 , url =

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.831524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation df941448-8724-4ebd-8f77-dba1fd8939b6 · outbound

This paper cites Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-07-10T04:46:45.740945Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bd90695f-83a9-4410-b36c-67d2475b3977 · outbound

This paper cites Weisfeiler-Lehman goes dynamic: An analysis of the expressive power of Graph Neural Networks for attributed and dynamic graphs , journal =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Weisfeiler-Lehman goes dynamic: An analysis of the expressive power of Graph Neural Networks for attributed and dynamic graphs , journal =

Reference 28

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.705902Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation cf00b471-c40f-4c2c-92d5-4fce7efd3b17 · outbound

This paper cites an unresolved cited work.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Unresolved cited work

Reference 29

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.737931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2cd63910-2123-4b88-ba76-fb8238a8d27f · outbound

This paper cites Applied Network Science , volume =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Applied Network Science , volume =

Reference 30

Resolution: metadata mismatch; doi, observed 2026-07-10T04:46:45.682570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4cb01973-4813-4d91-b855-86172d7db7b3 · outbound

This paper cites On the Equivalence Between Temporal and Static Equivariant Graph Representations , booktitle =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On the Equivalence Between Temporal and Static Equivariant Graph Representations , booktitle =

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.827719Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e62e49ed-0830-44cc-a6c4-a86730d72794 · outbound

This paper cites an unresolved cited work.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Unresolved cited work

Reference 32

Resolution: unresolved; raw_fallback, observed 2026-07-10T04:46:46.825453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a6e5c82e-0952-4022-80c5-49c9ca960609 · outbound

This paper cites Counting.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Counting

Reference 33

Resolution: metadata mismatch; doi, observed 2026-07-10T04:46:45.732122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation beef0ede-1d06-4a6e-837e-a2ed2e2f7843 · outbound

This paper cites 2012 Temporal networks.Physics Reports519, 97–125.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem 2012 Temporal networks.Physics Reports519, 97–125

Reference 34

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.733932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ec6fd1aa-b554-4977-9e06-f14988646e4f · outbound

This paper cites Expressive Power of Temporal Message Passing , booktitle =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Expressive Power of Temporal Message Passing , booktitle =

Reference 35

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.721585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 893763bb-d65f-4675-8bdc-65417e099319 · outbound

This paper cites and Bertin, Nicolas and Hao, Tong and Goldberg, Debra S.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem and Bertin, Nicolas and Hao, Tong and Goldberg, Debra S

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.833956Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4ec4321a-d64d-408a-8784-a292280c0a46 · outbound

This paper cites Communication motifs: a tool to characterize social communications , booktitle =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Communication motifs: a tool to characterize social communications , booktitle =

Reference 37

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.732308Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 37d9222b-804d-45d7-9aaa-6e04d26e1752 · outbound

This paper cites Kleinberg and Amit Kumar , title =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Kleinberg and Amit Kumar , title =

Reference 38

Resolution: verified exact; arxiv_id, observed 2026-07-10T04:46:45.726842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5e1b90d4-b62a-4c9f-a9c2-568c1ad51278 · outbound

This paper cites 2019 , url =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem 2019 , url =

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.817934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 22c48cf5-d18b-4e0c-814b-425aac687829 · outbound

This paper cites Large Networks and Graph Limits , series =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Large Networks and Graph Limits , series =

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.819560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 70ef8324-0f06-402e-9e87-9462dc4f497c · outbound

This paper cites Tight algorithms for connectivity problems parameterized by clique-width.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Tight algorithms for connectivity problems parameterized by clique-width

Reference 41

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.761919Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 502791f1-6785-48a2-9d7c-3361051d30d2 · outbound

This paper cites Fast exact algorithms for some connectivity problems parameterized by clique-width , journal =.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Fast exact algorithms for some connectivity problems parameterized by clique-width , journal =

Reference 42

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.702333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8192edde-191a-434b-affd-39be87dedefd · outbound

This paper cites Weisfeiler-lehman goes dynamic: An analysis of the expressive power of graph neural networks for attributed and dynamic graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Weisfeiler-lehman goes dynamic: An analysis of the expressive power of graph neural networks for attributed and dynamic graphs

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.912671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 15094a1f-f91f-49b3-8d59-706e9a1c2e26 · outbound

This paper cites Efficient computation of optimal temporal walks under waiting-time constraints.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Efficient computation of optimal temporal walks under waiting-time constraints

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.886649Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ca6535b5-3152-4c99-b499-0bb7cec6a16c · outbound

This paper cites Fast exact algorithms for some connectivity problems parameterized by clique-width.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Fast exact algorithms for some connectivity problems parameterized by clique-width

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.894989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 319a7ea3-c713-49f5-a42d-22cf3ef5ef4a · outbound

This paper cites Time-varying graphs and dynamic networks.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Time-varying graphs and dynamic networks

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.808386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation da16a4a5-dff1-4111-80dd-45eefaf08d1e · outbound

This paper cites Finding temporal paths under waiting time constraints.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Finding temporal paths under waiting time constraints

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.810579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5186d0b7-efee-4d21-9a0d-27e1cb6e03c0 · outbound

This paper cites Juedes, Iyad A.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Juedes, Iyad A

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.814338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 356fae25-a295-4c28-8fa9-e1acc07e217e · outbound

This paper cites Kanj, and Ge Xia.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Kanj, and Ge Xia

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.810796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 608e8bdc-6a37-4de8-97d1-e29a257747f2 · outbound

This paper cites Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , volume 138 of Encyclopedia of mathematics and its applications.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , volume 138 of Encyclopedia of mathematics and its applications

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.890254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 80be82e5-fbe1-4ab1-9a7f-7eca9ccb8d19 · outbound

This paper cites Upper bounds to the clique width of graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Upper bounds to the clique width of graphs

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.893014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 72406803-9f9b-4b5e-b4bf-21cb5e1cf633 · outbound

This paper cites Homomorphisms are a good basis for counting small subgraphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Homomorphisms are a good basis for counting small subgraphs

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.806330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a6ab5a6f-762c-438a-820e-156b49fc2ab7 · outbound

This paper cites Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.797423Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 88880290-7119-4314-a321-8f884bb0ebf7 · outbound

This paper cites Dabrowski, Matthew Johnson, and Dani \" e l Paulusma.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Dabrowski, Matthew Johnson, and Dani \" e l Paulusma

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.823426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3c33a356-3ea6-4d54-8bd2-59d1efbcbeab · outbound

This paper cites The complexity of counting homomorphisms seen from the other side.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem The complexity of counting homomorphisms seen from the other side

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.836154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 680b06f2-19fc-47a2-baa1-8cbee3a80f9b · outbound

This paper cites Lov \' a sz meets weisfeiler and leman.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Lov \' a sz meets weisfeiler and leman

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.841039Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ba0ab347-b5f2-49e3-90eb-5919eaaa0151 · outbound

This paper cites Counting small induced subgraphs with edge-monotone properties.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Counting small induced subgraphs with edge-monotone properties

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.915500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 870c63e8-1367-4801-bd48-b33f0aa231d0 · outbound

This paper cites On recognizing graphs by numbers of homomorphisms.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On recognizing graphs by numbers of homomorphisms

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.903824Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e1c5a399-10ed-4392-8d9b-d1b26c58a5c6 · outbound

This paper cites Enright, Kitty Meeks, and Hendrik Molter.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Enright, Kitty Meeks, and Hendrik Molter

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.892893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 34b6e0cc-ae22-4360-b918-f8198e1ccf40 · outbound

This paper cites Parameterized Complexity Theory.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Parameterized Complexity Theory

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.878245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c674052f-2c21-4be3-8f2c-fa92143852a8 · outbound

This paper cites As time goes by: Reflections on treewidth for temporal graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem As time goes by: Reflections on treewidth for temporal graphs

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.880283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 65618678-122f-4f19-983b-b0214037f62b · outbound

This paper cites Counting small induced subgraphs with hereditary properties.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Counting small induced subgraphs with hereditary properties

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.884448Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c47490db-dbd2-457e-b3c8-934b3432a29b · outbound

This paper cites On the equivalence between temporal and static equivariant graph representations.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On the equivalence between temporal and static equivariant graph representations

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.874847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7b7d96d9-920a-49ed-9ac7-21085ab00e9e · outbound

This paper cites Line graphs of bounded clique-width.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Line graphs of bounded clique-width

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.871709Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e37196e8-072c-4241-8c02-7496c4077a36 · outbound

This paper cites Han, Nicolas Bertin, Tong Hao, Debra S.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Han, Nicolas Bertin, Tong Hao, Debra S

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.876601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4316af52-d7ea-4dab-a91f-d9ff0884d8ed · outbound

This paper cites Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs

Reference 66

Resolution: verified exact; local_arxiv, observed 2026-07-10T04:46:46.504710Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5d42b345-7369-47c1-a756-affa079b1fb8 · outbound

This paper cites Tight algorithms for connectivity problems parameterized by clique-width.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Tight algorithms for connectivity problems parameterized by clique-width

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.888603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9e4e0ef6-977d-4f4c-aa6b-946d2306db13 · outbound

This paper cites Temporal networks.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Temporal networks

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.907189Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1a6e0026-774f-4df8-a5ba-57d5aee9835e · outbound

This paper cites On the complexity of k- SAT.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem On the complexity of k- SAT

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.862230Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4aca515d-98a0-40df-aba6-8bd7f00ef1e8 · outbound

This paper cites Kleinberg, and Amit Kumar.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Kleinberg, and Amit Kumar

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.871366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 53678f9a-840b-4993-a6ba-3626a00043cc · outbound

This paper cites Benson, and Moses Charikar.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Benson, and Moses Charikar

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.888399Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a87d50f8-e596-487a-acaa-7f1eeade067a · outbound

This paper cites Temporal network motifs: Models, limitations, evaluation.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Temporal network motifs: Models, limitations, evaluation

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.869865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 97a54ae2-2342-4c1a-8c46-5b525f15e8f2 · outbound

This paper cites Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.853750Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 854532fe-c410-44f9-b0fd-948fccb23604 · outbound

This paper cites Large Networks and Graph Limits , volume 60 of Colloquium Publications.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Large Networks and Graph Limits , volume 60 of Colloquium Publications

Reference 74

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.856447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a205c337-a4b4-4a3f-bdaa-f5c4d3f81b2c · outbound

This paper cites Can you beat treewidth? Theory Comput.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Can you beat treewidth? Theory Comput

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.851884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 20498cd9-199b-49d9-ab98-ee0a27c7dfee · outbound

This paper cites Science , author=.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Science , author=

Reference 76

Resolution: verified exact; doi, observed 2026-07-10T04:46:45.694792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 52e4e8a1-a94c-4a5b-9d0b-21ace37f072c · outbound

This paper cites Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.858443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fd43fdc1-5676-4e18-add1-f58043cc9e51 · outbound

This paper cites Benson, and Jure Leskovec.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Benson, and Jure Leskovec

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.867917Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c698a81c-ff47-4105-8607-8839960f4281 · outbound

This paper cites Counting problems on quantum graphs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Counting problems on quantum graphs

Reference 79

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.849842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation edbe2db2-0a9f-4cc8-a8c9-8c21ab3029d4 · outbound

This paper cites Parameterised counting complexity theory.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Parameterised counting complexity theory

Reference 80

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.838349Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1d86169c-3a0c-4d2f-bb68-de1027e77454 · outbound

This paper cites A powerful lens for temporal network analysis: temporal motifs.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem A powerful lens for temporal network analysis: temporal motifs

Reference 81

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.845435Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a390d326-a21b-4832-900c-a7dd52715678 · outbound

This paper cites Expressive power of temporal message passing.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Expressive power of temporal message passing

Reference 82

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.847888Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c41ef635-21b3-4bc0-9393-3035c7637089 · outbound

This paper cites Communication motifs: a tool to characterize social communications.

The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem Communication motifs: a tool to characterize social communications

Reference 83

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T04:46:46.852091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers