On the public citation graph

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11538462_15openalex-snapshot
Finding Graph Matchings in Data Streams
inferredcites →https://doi.org/10.1007/3-540-57899-4_44openalex-snapshot
Fully dynamic maintenance of vertex cover
inferredcites →https://doi.org/10.1007/978-0-387-39940-9_184openalex-snapshot
Graph Mining on Streams
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4614-8265-9openalex-snapshot
Encyclopedia of Database Systems
inferredcites →https://doi.org/10.1007/978-3-540-69311-6_19openalex-snapshot
Matching for Graphs of Bounded Degree
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_44openalex-snapshot
Bipartite Graph Matchings in the Semi-streaming Model
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_42openalex-snapshot
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
inferredcites →https://doi.org/10.1007/978-3-642-32512-0_20openalex-snapshot
Maximum Matching in Semi-streaming with Few Passes
inferredcites →https://doi.org/10.1007/bf02579141openalex-snapshot
Lower bound of the hadwiger number of graphs by their average degree
inferredcites →https://doi.org/10.1007/s00453-010-9438-5openalex-snapshot
Weighted Matching in the Semi-Streaming Model
inferredcites →https://doi.org/10.1007/s00453-011-9556-8openalex-snapshot
Bipartite Matching in the Semi-streaming Model
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/j.tcs.2007.04.040openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
inferredcites →https://doi.org/10.1109/ccc.2013.37openalex-snapshot
Superlinear Lower Bounds for Multipass Graph Processing
inferredcites →https://doi.org/10.1109/focs.2008.81openalex-snapshot
Constant-Time Approximation Algorithms via Local Improvements
inferredcites →https://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferredcites →https://doi.org/10.1109/focs.2011.89openalex-snapshot
Fully Dynamic Maximal Matching in O (log n) Update Time
inferredcites →https://doi.org/10.1109/focs.2013.65openalex-snapshot
Fully Dynamic (1+ e)-Approximate Matchings
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1137/070683155openalex-snapshot
Graph Distances in the Data-Stream Model
inferredcites →https://doi.org/10.1137/070706550openalex-snapshot
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
inferredcites →https://doi.org/10.1137/1.9781611973099.41openalex-snapshot
On the communication and streaming complexity of maximum bipartite matching
inferredcites →https://doi.org/10.1137/100801901openalex-snapshot
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
inferredcites →https://doi.org/10.1137/s0097539793250767openalex-snapshot
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
inferredcites →https://doi.org/10.1145/100216.100262openalex-snapshot
An optimal algorithm for on-line bipartite matching
inferredcites →https://doi.org/10.1145/1007352.1007379openalex-snapshot
Exponential separation of quantum and classical one-way communication complexity
inferredcites →https://doi.org/10.1145/1536414.1536447openalex-snapshot
An improved constant-time approximation algorithm for maximum~matchings
inferredcites →https://doi.org/10.1145/1806689.1806753openalex-snapshot
Maintaining a large matching and a small vertex cover
inferredcites →https://doi.org/10.1145/2488608.2488703openalex-snapshot
Simple deterministic algorithms for fully dynamic maximal matching
inferredcites →https://doi.org/10.5555/1280283.1280327openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
inferredcites →https://doi.org/10.5555/2095116.2095204openalex-snapshot
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
inferredcites →https://doi.org/10.5555/2627817.2627938openalex-snapshot
Better bounds for matchings in the streaming model

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_53openalex-snapshot
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
inferred← citeshttps://doi.org/10.1007/s00224-023-10155-7openalex-snapshot
Improved Bounds for Matching in Random-Order Streams
inferred← citeshttps://doi.org/10.1007/s00453-018-0449-yopenalex-snapshot
Structural Results on Matching Estimation with Applications to Streaming
inferred← citeshttps://doi.org/10.1007/s00453-022-00988-yopenalex-snapshot
Almost-Smooth Histograms and Sliding-Window Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-023-01190-4openalex-snapshot
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104951openalex-snapshot
Linear-time parameterized algorithms with limited local resources
inferred← citeshttps://doi.org/10.1109/tpds.2021.3131677openalex-snapshot
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
inferred← citeshttps://doi.org/10.1109/tpds.2021.3134336openalex-snapshot
An Accurate and Efficient Large-scale Regression Method through Best Friend Clustering
inferred← citeshttps://doi.org/10.1145/3375395.3387665openalex-snapshot
How the Degeneracy Helps for Triangle Counting in Graph Streams
inferred← citeshttps://doi.org/10.1145/3461837.3464514openalex-snapshot
Position paper
inferred← citeshttps://doi.org/10.1145/3519935.3520039openalex-snapshot
Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond
inferred← citeshttps://doi.org/10.1145/3694906.3743312openalex-snapshot
A framework for boosting matching approximation: parallel, distributed, and dynamic
inferred← citeshttps://doi.org/10.13052/jwe1540-9589.19781openalex-snapshot
Information Flow Control with Decentralized Labeling Model in Information Security
inferred← citeshttps://doi.org/10.18100/ijamec.797074openalex-snapshot
Distributed Environment Modeling using Path Compression Algorithm
inferred← citeshttps://doi.org/10.35193/bseufbd.592542openalex-snapshot
Dağıtık etiketleme modeli ile bilgi akış denetimi
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00417openalex-snapshot
Improved Bound for Matching in Random-Order Streams
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.