On the public citation graph
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
0 signed · 91 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.1006/jagm.1999.1042openalex-snapshot
Approximation Algorithms for Directed Steiner Problems
inferredcites →https://doi.org/10.1006/jagm.2000.1086openalex-snapshot
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-3-319-03898-8_11openalex-snapshot
Fixed-Parameter and Approximation Algorithms: A New Look
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_4openalex-snapshot
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_57openalex-snapshot
A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_72openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferredcites →https://doi.org/10.1007/bf01187035openalex-snapshot
An 11/6-approximation algorithm for the network steiner problem
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1007/s00224-007-1324-4openalex-snapshot
Dynamic Programming for Minimum Steiner Trees
inferredcites →https://doi.org/10.1007/s00453-012-9630-xopenalex-snapshot
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
inferredcites →https://doi.org/10.1007/s10107-016-0987-5openalex-snapshot
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
inferredcites →https://doi.org/10.1007/s10878-013-9637-5openalex-snapshot
Dual power assignment optimization and fault tolerance in WSNs
inferredcites →https://doi.org/10.1016/j.ic.2012.10.007openalex-snapshot
Approximation algorithms for spanner problems and Directed Steiner Forest
inferredcites →https://doi.org/10.1016/j.ipl.2011.08.005openalex-snapshot
Faster algorithm for optimum Steiner trees
inferredcites →https://doi.org/10.1016/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1016/j.jcss.2011.05.009openalex-snapshot
Improved approximation algorithms for Directed Steiner Forest
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.029openalex-snapshot
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
inferredcites →https://doi.org/10.1016/j.tcs.2008.06.046openalex-snapshot
The Steiner tree problem on graphs: Inapproximability results
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/s0022-0000(03)00078-3openalex-snapshot
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
inferredcites →https://doi.org/10.1023/a:1009758919736openalex-snapshot
New Approximation Algorithms for the Steiner Tree Problems
inferredcites →https://doi.org/10.1109/26.20105openalex-snapshot
The strongly connecting problem on multihop packet radio networks
inferredcites →https://doi.org/10.1109/focs.2007.26openalex-snapshot
On the Optimality of Planar and Geometric Approximation Schemes
inferredcites →https://doi.org/10.1109/focs.2007.50openalex-snapshot
Space-Efficient Identity Based EncryptionWithout Pairings
inferredcites →https://doi.org/10.1109/focs.2016.62openalex-snapshot
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
inferredcites →https://doi.org/10.1109/focs.2017.82openalex-snapshot
Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions
inferredcites →https://doi.org/10.1109/focs.2018.00052openalex-snapshot
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
inferredcites →https://doi.org/10.1109/infcom.2000.832213openalex-snapshot
Topology control of multihop wireless networks using transmit power adjustment
inferredcites →https://doi.org/10.1109/sfcs.1991.185402openalex-snapshot
On better heuristic for Euclidean Steiner minimum trees
inferredcites →https://doi.org/10.1109/sfcs.1995.492475openalex-snapshot
Splitters and near-optimal derandomization
inferredcites →https://doi.org/10.1137/0210019openalex-snapshot
Approximation Algorithms for Several Graph Augmentation Problems
inferredcites →https://doi.org/10.1137/1.9781611973099.53openalex-snapshot
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
inferredcites →https://doi.org/10.1137/1.9781611975994.134openalex-snapshot
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
inferredcites →https://doi.org/10.1137/100794560openalex-snapshot
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
inferredcites →https://doi.org/10.1137/110855247openalex-snapshot
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
inferredcites →https://doi.org/10.1137/18m1166869openalex-snapshot
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
inferredcites →https://doi.org/10.1137/18m122371xopenalex-snapshot
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
inferredcites →https://doi.org/10.1137/s0097539704441241openalex-snapshot
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
inferredcites →https://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1137/s0097539795281086openalex-snapshot
Thek-Steiner Ratio in Graphs
inferredcites →https://doi.org/10.1137/s0895480101393155openalex-snapshot
Tighter Bounds for Graph Steiner Tree Approximation
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
inferredcites →https://doi.org/10.1145/1250790.1250801openalex-snapshot
Fourier meets möbius: fast subset convolution
inferredcites →https://doi.org/10.1145/1502793.1502795openalex-snapshot
Polynomial flow-cut gaps and hardness of directed cut problems
inferredcites →https://doi.org/10.1145/167088.167261openalex-snapshot
Excluded minors, network decomposition, and multicommodity flow
inferredcites →https://doi.org/10.1145/1921659.1921664openalex-snapshot
Set connectivity problems in undirected graphs and the directed steiner network problem
inferredcites →https://doi.org/10.1145/1993636.1993679openalex-snapshot
Improved algorithms for min cut and max flow in undirected planar graphs
inferredcites →https://doi.org/10.1145/2027216.2027219openalex-snapshot
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
inferredcites →https://doi.org/10.1145/2432622.2432628openalex-snapshot
Steiner Tree Approximation via Iterative Randomized Rounding
inferredcites →https://doi.org/10.1145/2650261openalex-snapshot
Kernelization Lower Bounds Through Colors and IDs
inferredcites →https://doi.org/10.1145/301250.301447openalex-snapshot
Design networks with bounded pairwise distance
inferredcites →https://doi.org/10.1145/3055399.3055412openalex-snapshot
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
inferredcites →https://doi.org/10.1145/3201775openalex-snapshot
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs
inferredcites →https://doi.org/10.1145/3239560openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferredcites →https://doi.org/10.1145/3313276.3316349openalex-snapshot
O (log 2 k / log log k )-approximation algorithm for directed Steiner tree
inferredcites →https://doi.org/10.1145/3580376openalex-snapshot
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
inferredcites →https://doi.org/10.1145/780542.780628openalex-snapshot
Polylogarithmic inapproximability
inferredcites →https://doi.org/10.4230/lipics.esa.2018.20openalex-snapshot
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2012.424openalex-snapshot
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.27openalex-snapshot
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.78openalex-snapshot
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
inferredcites →https://doi.org/10.4230/lipics.ipec.2019.8openalex-snapshot
FPT Inapproximability of Directed Cut and Connectivity Problems
inferredcites →https://doi.org/10.4230/lipics.itcs.2018.36openalex-snapshot
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
inferredcites →https://doi.org/10.4230/lipics.stacs.2013.353openalex-snapshot
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
inferredcites →https://doi.org/10.4230/lipics.stacs.2019.25openalex-snapshot
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
inferredcites →https://doi.org/10.48550/arxiv.1707.06499openalex-snapshot
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
inferredcites →https://doi.org/10.5555/1071747.1071750openalex-snapshot
Design of Survivable Networks: A survey
inferredcites →https://doi.org/10.5555/365411.365493openalex-snapshot
Approximating the minimum strongly connected subgraph via a matching lower bound
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-031-38906-1_39openalex-snapshot
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_3openalex-snapshot
On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands
inferred← citeshttps://doi.org/10.1007/s00453-025-01338-4openalex-snapshot
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
inferred← citeshttps://doi.org/10.1007/s00454-025-00782-xopenalex-snapshot
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
inferred← citeshttps://doi.org/10.1007/s43069-021-00076-xopenalex-snapshot
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103604openalex-snapshot
The parameterized complexity of the survivable network design problem
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671926openalex-snapshot
Approximate High Dimensional Graph Mining With Matrix Polar Factorization: A Twitter Application
inferred← citeshttps://doi.org/10.1137/1.9781611977066.4openalex-snapshot
The Parameterized Complexity of the Survivable Network Design Problem
inferred← citeshttps://doi.org/10.1145/3717823.3718257openalex-snapshot
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity
inferred← citeshttps://doi.org/10.1145/3748724openalex-snapshot
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25729openalex-snapshot
Truthful Mechanisms for Steiner Tree Problems
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.