On the public citation graph
Algorithmic Applications of Baur-Strassen’s Theorem
0 signed · 70 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140209openalex-snapshot
A quick method for finding shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1007/11561071_68openalex-snapshot
Shortest Paths in Matrix Multiplication Time
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/3-540-48481-7_38openalex-snapshot
A Decomposition Theorem for MaximumWeight Bipartite Matchings with Applications to Evolutionary Trees
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/j.ipl.2011.07.019openalex-snapshot
A shortest cycle for each vertex of a graph
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.028openalex-snapshot
Maximum weight bipartite matching in matrix multiplication time
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.024openalex-snapshot
A combinatoric interpretation of dual variables for weighted matching and f -factors
inferredcites →https://doi.org/10.1016/s0304-3975(03)00402-xopenalex-snapshot
A new approach to all-pairs shortest paths on real-weighted graphs
inferredcites →https://doi.org/10.1016/s0747-7171(03)00097-xopenalex-snapshot
High-order lifting and integrality certification
inferredcites →https://doi.org/10.1109/focs.2004.40openalex-snapshot
Maximum Matchings via Gaussian Elimination
inferredcites →https://doi.org/10.1109/focs.2006.8openalex-snapshot
Algebraic Structures and Algorithms for Matching and Matroid Problems
inferredcites →https://doi.org/10.1109/focs.2010.24openalex-snapshot
Determinant Sums for Undirected Hamiltonicity
inferredcites →https://doi.org/10.1109/focs.2011.27openalex-snapshot
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
inferredcites →https://doi.org/10.1109/focs.2012.72openalex-snapshot
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
inferredcites →https://doi.org/10.1109/sfcs.1985.3openalex-snapshot
A scaling algorithm for weighted matching on general graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.20openalex-snapshot
Answering distance queries in directed graphs using fast matrix multiplication
inferredcites →https://doi.org/10.1109/sffcs.1999.814635openalex-snapshot
All pairs shortest paths in undirected graphs with integer weights
inferredcites →https://doi.org/10.1137/0215009openalex-snapshot
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
inferredcites →https://doi.org/10.1137/110839229openalex-snapshot
Determinant Sums for Undirected Hamiltonicity
inferredcites →https://doi.org/10.1145/1073970.1073994openalex-snapshot
Processor efficient parallel matching
inferredcites →https://doi.org/10.1145/115234.115366openalex-snapshot
Faster scaling algorithms for general graph matching problems
inferredcites →https://doi.org/10.1145/1250790.1250877openalex-snapshot
More algorithms for all-pairs shortest paths in weighted graphs
inferredcites →https://doi.org/10.1145/321941.321942openalex-snapshot
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/382242.382836openalex-snapshot
How to compute fast a function and all its derivatives
inferredcites →https://doi.org/10.1145/567112.567114openalex-snapshot
All pairs shortest paths using bridging sets and rectangular matrix multiplication
inferredcites →https://doi.org/10.1145/65950.65954openalex-snapshot
Efficient implementation of graph algorithms using contraction
inferredcites →https://doi.org/10.1145/800061.808776openalex-snapshot
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems
inferredcites →https://doi.org/10.1145/800105.803390openalex-snapshot
Finding a minimum circuit in a graph
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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-1-4939-2864-4_566openalex-snapshot
Approximating the Diameter
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_28openalex-snapshot
Temporal Matching on Geometric Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-031-43418-1_40openalex-snapshot
propagate: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_31openalex-snapshot
The Complexity of Diameter on H-free Graphs
inferred← citeshttps://doi.org/10.1007/s00224-018-9894-xopenalex-snapshot
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
inferred← citeshttps://doi.org/10.1016/j.orl.2022.02.008openalex-snapshot
Two dimensional maximum weight matching using Manhattan topology
inferred← citeshttps://doi.org/10.1109/access.2022.3179113openalex-snapshot
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization
inferred← citeshttps://doi.org/10.1109/focs.2012.72openalex-snapshot
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
inferred← citeshttps://doi.org/10.1109/focs.2013.23openalex-snapshot
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors
inferred← citeshttps://doi.org/10.1109/focs.2019.00035openalex-snapshot
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796921openalex-snapshot
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
inferred← citeshttps://doi.org/10.1137/1.9781611975031.80openalex-snapshot
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
inferred← citeshttps://doi.org/10.1137/16m1106195openalex-snapshot
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b -matching, and Unweighted f -factors
inferred← citeshttps://doi.org/10.1137/18m1226737openalex-snapshot
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
inferred← citeshttps://doi.org/10.1137/24m1677885openalex-snapshot
The Complexity of Diameter on \({H}\)-Free Graphs
inferred← citeshttps://doi.org/10.1145/2488608.2488673openalex-snapshot
Fast approximation algorithms for the diameter and radius of sparse graphs
inferred← citeshttps://doi.org/10.1145/3155301openalex-snapshot
Scaling Algorithms for Weighted Matching in General Graphs
inferred← citeshttps://doi.org/10.1145/3188745.3188950openalex-snapshot
Towards tight approximation bounds for graph diameter and eccentricities
inferred← citeshttps://doi.org/10.1145/3406325.3451045openalex-snapshot
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)
inferred← citeshttps://doi.org/10.1145/3406325.3451130openalex-snapshot
Tight conditional lower bounds for approximating diameter in directed graphs
inferred← citeshttps://doi.org/10.1145/3798129.3800819openalex-snapshot
On the Computational Hardness of Transformers
inferred← citeshttps://doi.org/10.1287/moor.2016.0806openalex-snapshot
New Algorithms for Maximum Weight Matching and a Decomposition Theorem
inferred← citeshttps://doi.org/10.3390/e25010146openalex-snapshot
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.48openalex-snapshot
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.97openalex-snapshot
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.35openalex-snapshot
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.83openalex-snapshot
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.11openalex-snapshot
Decremental Matching in General Graphs
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.54openalex-snapshot
Matching Is as Easy as the Decision Problem, in the NC Model
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.41openalex-snapshot
On the Complexity Landscape of Connected f-Factor Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2415openalex-snapshot
Finding the Minimum-Weight k-Path
inferred← citeshttps://doi.org/10.48550/arxiv.1808.08494openalex-snapshot
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
inferred← citeshttps://doi.org/10.48550/arxiv.1812.01602openalex-snapshot
Diameter Spanners, Eccentricity Spanners, and Approximating Extremal Distances
inferred← citeshttps://doi.org/10.70675/2f03bed2z4920z4795zbb20zae9669395a5dopenalex-snapshot
Etude d’un code correcteur linéaire pour le canal à effacements de paquets et optimisation par comptage de forêts et calcul modulaire
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.