On the public citation graph
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
0 signed · 134 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.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01580869openalex-snapshot
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
inferredcites →https://doi.org/10.1007/bf01594940openalex-snapshot
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1007/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferredcites →https://doi.org/10.1016/0020-0190(83)90099-6openalex-snapshot
Updating a balanced search tree in O(1) rotations
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0304-3975(94)90159-7openalex-snapshot
Complexity models for incremental computation
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/225058.225269openalex-snapshot
Randomized dynamic graph algorithms with polylogarithmic time per operation
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferredcites →https://doi.org/10.5555/127787.127805openalex-snapshot
Dynamic expression trees and their applications
inferredcites →https://doi.org/10.5555/320176.320177openalex-snapshot
Maintenance of a minimum spanning forest in a dynamic planar graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.21470openalex-snapshot
Simple linear flow decomposition algorithms on trees, circles, and augmented trees
inferred← citeshttps://doi.org/10.1002/net.21517openalex-snapshot
Fast algorithms for convex cost flow problems on circles, lines, and trees
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_6openalex-snapshot
Maintaining Center and Median in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_861-1openalex-snapshot
Computational Optimal Transport
inferred← citeshttps://doi.org/10.1007/978-3-030-92790-5_22openalex-snapshot
Optimal Multi-robot Perimeter Defense Using Flow Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_13openalex-snapshot
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_7openalex-snapshot
Dynamic Trees in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-04652-0_1openalex-snapshot
Self-adjusting Computation with Delta ML
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_11openalex-snapshot
The Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/s00182-021-00789-7openalex-snapshot
Simplified group activity selection with group size constraints
inferred← citeshttps://doi.org/10.1007/s00224-025-10240-zopenalex-snapshot
On Strings Having the Same Length-k Substrings
inferred← citeshttps://doi.org/10.1007/s00453-020-00774-8openalex-snapshot
The Inverse Voronoi Problem in Graphs II: Trees
inferred← citeshttps://doi.org/10.1007/s11750-007-0037-9openalex-snapshot
Improved algorithms for the multicut and multiflow problems in rooted trees
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106851openalex-snapshot
Exact methods and a variable neighborhood search for the robust capacitated p -median problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.11.024openalex-snapshot
A network simplex method for the budget-constrained minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.08.042openalex-snapshot
Competitive location and pricing on a line with metric transportation costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.018openalex-snapshot
Heuristics for the dynamic facility location problem with modular capacities
inferred← citeshttps://doi.org/10.1016/j.future.2025.108097openalex-snapshot
ContraMST: A unified framework for dynamic MST maintenance
inferred← citeshttps://doi.org/10.1016/j.tust.2025.106623openalex-snapshot
Intelligent self-evacuation path planning for fire emergencies in underground coal mines
inferred← citeshttps://doi.org/10.1051/ro/2012015openalex-snapshot
On a dual network exterior point simplex type algorithm and its computational behavior
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1103/2rds-k4n9openalex-snapshot
Efficient algorithms to solve atom reconfiguration problems. III. The bird and batching algorithms and other parallel implementations on GPUs
inferred← citeshttps://doi.org/10.1103/physrevd.101.034009openalex-snapshot
Exploring the space of jets with CMS open data
inferred← citeshttps://doi.org/10.1103/physreve.88.033303openalex-snapshot
Efficient simulation of the random-cluster model
inferred← citeshttps://doi.org/10.1109/access.2023.3267538openalex-snapshot
Optimizing Resource Allocation Based on Predictive Process Monitoring
inferred← citeshttps://doi.org/10.1109/glocom.2018.8647414openalex-snapshot
Computational Optimal Transport for 5G Massive C-RAN Device Association
inferred← citeshttps://doi.org/10.1109/hpec62836.2024.10938469openalex-snapshot
MST in Incremental Graphs Through Tree Contractions
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00032openalex-snapshot
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/jiot.2022.3197242openalex-snapshot
Multisource–Multidestination Optimal Energy Routing in Static and Time-Varying Vehicular Energy Network
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00065openalex-snapshot
Behavioural Conformances based on Lax Couplings
inferred← citeshttps://doi.org/10.1109/lnet.2023.3286933openalex-snapshot
Less Carbon Footprint in Edge Computing by Joint Task Offloading and Energy Sharing
inferred← citeshttps://doi.org/10.1109/tc.2014.2315631openalex-snapshot
On Nonblocking Multicast Fat-Tree Data Center Networks with Server Redundancy
inferred← citeshttps://doi.org/10.1109/tevc.2011.2173579openalex-snapshot
Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design
inferred← citeshttps://doi.org/10.1109/tevc.2019.2928991openalex-snapshot
Data Structures for Direct Spanning Tree Representations in Mutation-based Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1109/tits.2020.3019791openalex-snapshot
Utility-Based Matching of Vehicles and Hybrid Requests on Rider Demand Responsive Systems
inferred← citeshttps://doi.org/10.1109/tiv.2026.3657409openalex-snapshot
Sink Proximity: A Novel Approach for Online Vehicle Dispatch in Ride-Hailing
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferred← citeshttps://doi.org/10.1137/1.9781611975031.4openalex-snapshot
Incremental DFS algorithms: a theoretical and experimental study
inferred← citeshttps://doi.org/10.1137/1.9781611975499.8openalex-snapshot
Batch-Parallel Euler Tour Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977042.14openalex-snapshot
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
inferred← citeshttps://doi.org/10.1137/1.9781611977929.4openalex-snapshot
Fast and simple unrooted dynamic forests
inferred← citeshttps://doi.org/10.1137/120864271openalex-snapshot
Multiple-Source Shortest Paths in Embedded Graphs
inferred← citeshttps://doi.org/10.1142/s0218202525500113openalex-snapshot
Approximation theory, computing, and deep learning on the Wasserstein space
inferred← citeshttps://doi.org/10.1145/1103963.1103966openalex-snapshot
Maintaining information in fully dynamic trees with top trees
inferred← citeshttps://doi.org/10.1145/1133255.1133993openalex-snapshot
An experimental analysis of self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1596527.1596530openalex-snapshot
An experimental analysis of self-adjusting computation
inferred← citeshttps://doi.org/10.1145/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/338407.338537openalex-snapshot
Parallel algorithm for the routing problem
inferred← citeshttps://doi.org/10.1145/3626183.3659976openalex-snapshot
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
inferred← citeshttps://doi.org/10.1145/3729269openalex-snapshot
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation
inferred← citeshttps://doi.org/10.11606/d.55.2018.tde-03012018-104044openalex-snapshot
Desenvolvimento de um algoritmo paralelo de fase I para o problema de multifluxo: uma aplicação ao problema de roteamento de dados
inferred← citeshttps://doi.org/10.11606/d.55.2018.tde-06032018-104542openalex-snapshot
Implementação do Algoritmo Paralelo para o Problema de Roteamento de Dados no Computador Paralelo IBM-SP2
inferred← citeshttps://doi.org/10.11606/t.55.2019.tde-29082019-141240openalex-snapshot
A data structure for spanning tree optimization problems
inferred← citeshttps://doi.org/10.1184/r1/6603284openalex-snapshot
An Experimental Analysis of Change Propagation in Dynamic Trees
inferred← citeshttps://doi.org/10.1184/r1/6605039openalex-snapshot
Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence
inferred← citeshttps://doi.org/10.1186/s41072-023-00155-8openalex-snapshot
Contemporary challenges and AI solutions in port operations: applying Gale–Shapley algorithm to find best matches
inferred← citeshttps://doi.org/10.1287/ijoo.2018.0004openalex-snapshot
Separable Convex Optimization with Nested Lower and Upper Constraints
inferred← citeshttps://doi.org/10.1287/mnsc.2021.04059openalex-snapshot
The Value of Robust Assortment Optimization Under Ranking-Based Choice Models
inferred← citeshttps://doi.org/10.1287/moor.2023.0055openalex-snapshot
Scarf’s Algorithm and Stable Marriages
inferred← citeshttps://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1007939openalex-snapshot
Iterative point set registration for aligning scRNA-seq data
inferred← citeshttps://doi.org/10.14778/3407790.3407839openalex-snapshot
Fair task assignment in spatial crowdsourcing
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.1561/9781680835519openalex-snapshot
Computational Optimal Transport
inferred← citeshttps://doi.org/10.1609/aaai.v38i14.29444openalex-snapshot
Optimal Transport with Cyclic Symmetry
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30073openalex-snapshot
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
inferred← citeshttps://doi.org/10.18452/23600openalex-snapshot
Decentralized Algorithms for Wasserstein Barycenters
inferred← citeshttps://doi.org/10.22215/etd/2008-08073openalex-snapshot
Algorithms for static and dynamic path problems in trees
inferred← citeshttps://doi.org/10.2298/yjor0901157gopenalex-snapshot
A dual exterior point simplex type algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.4018/978-1-4666-2661-4.ch007openalex-snapshot
Eulerian Trails and Tours
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.65openalex-snapshot
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6381openalex-snapshot
Efficient implementations of minimum-cost flow algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6728openalex-snapshot
Min-Cost Flow Duality in Planar Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3336openalex-snapshot
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01484openalex-snapshot
Separable Convex Optimization with Nested Lower and Upper Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1811.12547openalex-snapshot
The inverse Voronoi problem in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.11885openalex-snapshot
Differentiable Ranks and Sorting using Optimal Transport
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11105openalex-snapshot
FunSeqSet: Towards a Purely Functional Data Structure for the Linearisation Case of Dynamic Trees Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1910.00152openalex-snapshot
On the Complexity of Approximating Multimarginal Optimal Transport
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07057openalex-snapshot
Linear Time Sinkhorn Divergences using Positive Features
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07260openalex-snapshot
Equitable and Optimal Transport with Multiple Agents
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07458openalex-snapshot
Projection Robust Wasserstein Distance and Riemannian Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2109.15030openalex-snapshot
On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport
inferred← citeshttps://doi.org/10.48550/arxiv.2111.06546openalex-snapshot
Approximating Optimal Transport via Low-rank and Sparse Factorization
inferred← citeshttps://doi.org/10.5281/zenodo.3341412openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 800-1000 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341413openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 800-1000 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341418openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 470-600 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341419openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 470-600 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341420openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 600-800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341497openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 300-470 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341498openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 300-470 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341499openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 170-300 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341500openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 170-300 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341769openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 1400-1800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341770openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 1400-1800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3364139openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 600-800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5555/2133036.2133139openalex-snapshot
Computing replacement paths in surface embedded graphs
inferred← citeshttps://doi.org/10.5555/313852.314105openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.70675/1fcd1ce1zc420z4d4cz8af5z266ab03c4ea5openalex-snapshot
Machine Learning Techniques for Online Resource Allocation in Wireless Networks
inferred← citeshttps://doi.org/10.70675/47c63da2zae73z4885z97e6z036715c1c184openalex-snapshot
Advances in Optimal Transport : Low-Rank Structures and Applications in Machine Learning
inferred← citeshttps://doi.org/10.70675/67878106zc7daz44a6za35az997426484823openalex-snapshot
Contributions au Transport Optimal pour l'Apprentissage Machine : Métrique de Terrain et Cadre Généralisé
inferred← citeshttps://doi.org/10.70675/c792c77cz8c7bz4930za4fbz79b40c3d10d1openalex-snapshot
Adversarial attacks : a theoretical journey
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.