Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T05:11:03.454751Z
Paper Citation Record · LEDGER
Efficient Kernelization Algorithm for Bipartite Graph Matching
As of 14 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2412.00704.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
51 of 51 outbound references displayed
- verified exact2
- verified fuzzy45
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 3c392276-9778-4f64-8033-00a0eb9bfef2 · outbound
This paper cites Controllability of complex networks,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Controllability of complex networks,
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.169926Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e3a87d51-7325-4634-bfc5-8eb5cc062c0c · outbound
This paper cites Minimal control nodes for strong structural observability of discrete-time iterative systems: Explicit formulas and polynomial-time algorithms,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Minimal control nodes for strong structural observability of discrete-time iterative systems: Explicit formulas and polynomial-time algorithms,
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.156753Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a838024b-208f-4923-b90b-099a4fb64a16 · outbound
This paper cites Addressing the minimum fleet problem in on-demand urban mobility,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Addressing the minimum fleet problem in on-demand urban mobility,
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.144231Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ffae96a0-bd0a-4a83-bd27-31a70a464cd6 · outbound
This paper cites Strategic resource selection with homophilic agents,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Strategic resource selection with homophilic agents,
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.131568Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation eea1f072-28a2-42c8-8a6b-dd3810b4480e · outbound
This paper cites The multi-agent transportation problem,.
Efficient Kernelization Algorithm for Bipartite Graph Matching The multi-agent transportation problem,
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.116915Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ecba75e9-4832-476e-be1a-0dd399c78c7e · outbound
This paper cites Ive: Accelerating enumeration-based subgraph matching via exploring isolated vertices,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Ive: Accelerating enumeration-based subgraph matching via exploring isolated vertices,
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.098523Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation eb2ee16e-2d7f-4087-90a7-00640e85b7d2 · outbound
This paper cites Bice: Exploring compact search space by using bipartite matching and cell-wide verification,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Bice: Exploring compact search space by using bipartite matching and cell-wide verification,
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.083060Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 23a123ce-dbfb-4964-890e-19e279616c5f · outbound
This paper cites Efficient and scalable labeled subgraph matching using sgmatch,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Efficient and scalable labeled subgraph matching using sgmatch,
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.069325Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation c97d1a97-b529-4ebb-9f62-37cc36db5059 · outbound
This paper cites Dilation choice sets, dul- mage–mendelsohn decomposition, and structural controllability,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Dilation choice sets, dul- mage–mendelsohn decomposition, and structural controllability,
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.055684Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation b19abed0-b299-405f-92f7-52f8d5186f23 · outbound
This paper cites A survey of direct methods for sparse linear systems,.
Efficient Kernelization Algorithm for Bipartite Graph Matching A survey of direct methods for sparse linear systems,
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.042577Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2bdfe363-ae3c-4ef4-8866-72a26541f03b · outbound
This paper cites Computing the block triangular form of a sparse matrix,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Computing the block triangular form of a sparse matrix,
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.026311Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f132ffe1-e580-4069-b79c-cb915fee1d42 · outbound
This paper cites Efficient cross dynamic task assignment in spatial crowdsourcing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Efficient cross dynamic task assignment in spatial crowdsourcing,
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:04.012922Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ddb4619f-aa61-4fa0-a22a-9b4395302b30 · outbound
This paper cites Loyalty-based task assignment in spatial crowdsourcing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Loyalty-based task assignment in spatial crowdsourcing,
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.999838Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f000b332-73ce-496b-a200-c4bbf376cd17 · outbound
This paper cites Real-time cross online matching in spatial crowdsourcing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Real-time cross online matching in spatial crowdsourcing,
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.986148Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 47f2341d-c333-46db-b547-8f10bb0fb35e · outbound
This paper cites Dynamic pricing in spatial crowdsourcing: A matching-based approach,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Dynamic pricing in spatial crowdsourcing: A matching-based approach,
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.972168Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 6c02a05a-853b-4f7b-a198-4fc3f88a3c54 · outbound
This paper cites Design, implementation, and analysis of maximum transversal algorithms,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Design, implementation, and analysis of maximum transversal algorithms,
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.958163Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 3ce135dc-246c-4761-adf6-c51fe908f52b · outbound
This paper cites Karp-sipser based kernels for bipartite graph matching,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Karp-sipser based kernels for bipartite graph matching,
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.945520Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 3e103761-c579-4338-b2b6-46aa4d47713a · outbound
This paper cites Engineering Fast Almost Optimal Al- gorithms for Bipartite Graph Matching,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Engineering Fast Almost Optimal Al- gorithms for Bipartite Graph Matching,
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.932296Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a38df4ec-4dcc-4855-a530-775ff3850b65 · outbound
This paper cites an unresolved cited work.
Efficient Kernelization Algorithm for Bipartite Graph Matching Unresolved cited work
Reference 19
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T05:11:03.918456Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a9cd8b21-7d19-40dc-9c12-beed0dcdfdd5 · outbound
This paper cites Approximation algorithms in combinatorial scientific computing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Approximation algorithms in combinatorial scientific computing,
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.903051Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 022e51a7-a6dc-4618-9b91-26f680354a5f · outbound
This paper cites Fast parameterized preprocessing for polynomial-time solvable graph problems,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Fast parameterized preprocessing for polynomial-time solvable graph problems,
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.889910Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation cbc710e8-7474-43c9-b235-fc377e32110a · outbound
This paper cites Maximum matching in sparse random graphs,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Maximum matching in sparse random graphs,
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.877463Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a30f4a05-89e0-4498-8cbd-5319a4e494d4 · outbound
This paper cites Brandst ¨adt, V.
Efficient Kernelization Algorithm for Bipartite Graph Matching Brandst ¨adt, V
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.865114Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 81acbed3-9ea4-4431-a46e-d73cb2a954e3 · outbound
This paper cites Fast and efficient graph traversal algorithm for cpus: Maximizing single-node efficiency,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Fast and efficient graph traversal algorithm for cpus: Maximizing single-node efficiency,
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.853247Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 54b00b60-308a-4af4-9e2a-411a21605f11 · outbound
This paper cites Graphscope: a unified engine for big graph processing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Graphscope: a unified engine for big graph processing,
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.839374Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ac5a03a9-b9b2-489c-9b9e-a746e71cd640 · outbound
This paper cites Graphcube: Interconnection hierarchy-aware graph pro- cessing,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Graphcube: Interconnection hierarchy-aware graph pro- cessing,
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.825794Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 841f56f5-5f9b-4320-a3e8-fdb52784bf57 · outbound
This paper cites Dgap: Efficient dynamic graph analysis on persistent memory,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Dgap: Efficient dynamic graph analysis on persistent memory,
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.812818Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation aa924095-44d3-478b-9f02-f440e38093ba · outbound
This paper cites A parallel packed memory array to store dynamic graphs,.
Efficient Kernelization Algorithm for Bipartite Graph Matching A parallel packed memory array to store dynamic graphs,
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.796504Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 4651c791-e71a-4f10-9ddf-0a53b95ea5f2 · outbound
This paper cites Packed memory arrays - rewired,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Packed memory arrays - rewired,
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.785435Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 9500e1ec-95ba-48e2-a94a-9772bbde24ca · outbound
This paper cites Exploiting fine-grained redundancy in set-centric graph pattern mining,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Exploiting fine-grained redundancy in set-centric graph pattern mining,
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.773417Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2b604ad3-4078-4da3-bb71-6eed4c64b135 · outbound
This paper cites Cyclosa: Redundancy-free graph pattern mining via set dataflow,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Cyclosa: Redundancy-free graph pattern mining via set dataflow,
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.760082Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 449bff9c-a04f-4882-85a8-fc24638b629f · outbound
This paper cites an unresolved cited work.
Efficient Kernelization Algorithm for Bipartite Graph Matching Unresolved cited work
Reference 32
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T05:11:03.747317Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2091328d-b0ec-444f-ba09-d07c7fca6ac4 · outbound
This paper cites Data reduction for maximum matching on real-world graphs: Theory and experiments,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Data reduction for maximum matching on real-world graphs: Theory and experiments,
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.734125Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation d7eea751-5543-40b0-b781-4ca446b8dddf · outbound
This paper cites Matchbg: A boundary subgraph-based maximal matching algorithm for bipartite graphs,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Matchbg: A boundary subgraph-based maximal matching algorithm for bipartite graphs,
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.720691Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 05a740f6-eb43-4abe-a85b-69076c43f4f1 · outbound
This paper cites The university of florida sparse matrix collection,.
Efficient Kernelization Algorithm for Bipartite Graph Matching The university of florida sparse matrix collection,
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.708007Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 1e7d24dc-0f63-4dc4-8ba8-c1dc09bf1d4f · outbound
This paper cites SNAP Datasets: Stanford large network dataset collection.
Efficient Kernelization Algorithm for Bipartite Graph Matching SNAP Datasets: Stanford large network dataset collection
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T05:11:03.402075Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0584cbf9-6338-46d7-b5e9-1b9dd61eabca · outbound
This paper cites Shared-memory implementa- tion of the karp-sipser kernelization process,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Shared-memory implementa- tion of the karp-sipser kernelization process,
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.682454Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 175d6d40-316f-4eaf-a328-50362bc0b768 · outbound
This paper cites Heuristic initialization for bipartite matching problems,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Heuristic initialization for bipartite matching problems,
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.666959Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f1105ae5-bae4-426f-be2c-9cdc2b5c0108 · outbound
This paper cites Distributed-memory algorithms for maximum cardinality matching in bipartite graphs,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Distributed-memory algorithms for maximum cardinality matching in bipartite graphs,
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.655084Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a12ecd26-7833-4f1f-be8c-42fc0703f695 · outbound
This paper cites Graphs over time: densification laws, shrinking diameters and possible explanations,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Graphs over time: densification laws, shrinking diameters and possible explanations,
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.644237Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e3ae1a76-98c1-4028-90c2-bf9b06c9e5b0 · outbound
This paper cites Defining and evaluating network communities based on ground-truth,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Defining and evaluating network communities based on ground-truth,
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.631827Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation dddf7065-72d4-41d8-9b61-ea16b2351e6d · outbound
This paper cites The webgraph framework i: compression techniques,.
Efficient Kernelization Algorithm for Bipartite Graph Matching The webgraph framework i: compression techniques,
Reference 42
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.619283Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 0e6f86d0-522b-4dc3-8b1a-a4f70ef4d5c4 · outbound
This paper cites Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks.
Efficient Kernelization Algorithm for Bipartite Graph Matching Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks
Reference 43
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T05:11:03.530767Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e9f15b57-4524-4163-a8e2-3a52256fda01 · outbound
This paper cites Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.608170Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 6cdca52b-c230-43d2-9d9a-8a9eed77b258 · outbound
This paper cites Group formation in large social networks: membership, growth, and evolution,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Group formation in large social networks: membership, growth, and evolution,
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.594528Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a42ac8ef-6b0e-4232-91b4-98eb74b066d4 · outbound
This paper cites Data analysis in public social networks,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Data analysis in public social networks,
Reference 46
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.581178Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 0b3dc699-6199-4797-b88a-06b2c257f397 · outbound
This paper cites Signed networks in social media,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Signed networks in social media,
Reference 47
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.567278Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation cfcdbfc8-6e68-4243-b00f-e2f27304442f · outbound
This paper cites Predicting Positive and Negative Links in Online Social Networks.
Efficient Kernelization Algorithm for Bipartite Graph Matching Predicting Positive and Negative Links in Online Social Networks
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T05:11:03.443464Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 841b4216-2a25-410b-8936-2781eb20a515 · outbound
This paper cites Local higher-order graph clustering,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Local higher-order graph clustering,
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.555333Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation fb841213-ef87-47d5-a5ba-892eae232963 · outbound
This paper cites Using Triangles to Improve Community Detection in Directed Networks.
Efficient Kernelization Algorithm for Bipartite Graph Matching Using Triangles to Improve Community Detection in Directed Networks
Reference 50
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T05:11:03.497086Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 9fb295e7-07dc-4966-9b2e-520eede10cc3 · outbound
This paper cites Randomized greedy algorithms for the maximum matching problem with new analysis,.
Efficient Kernelization Algorithm for Bipartite Graph Matching Randomized greedy algorithms for the maximum matching problem with new analysis,
Reference 51
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T05:11:03.543520Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Pith citing papers
No inbound Pith citation observations are available.