On the public citation graph
Primal-dual approximation algorithms for integral flow and multicut in trees
0 signed · 383 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.3230210106openalex-snapshot
On the multiway cut polyhedron
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/3-540-57273-2_71openalex-snapshot
Integer multicommodity flows with reduced demands
inferredcites →https://doi.org/10.1007/3-540-58201-0_92openalex-snapshot
Multiway cuts in directed and node weighted graphs
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01226062openalex-snapshot
�ber die Maximalzahl kantendisjunkterA- Wege
inferredcites →https://doi.org/10.1007/bf01581198openalex-snapshot
Tight integral duality gap in the Chinese Postman problem
inferredcites →https://doi.org/10.1007/bf01902503openalex-snapshot
On some connectivity properties of Eulerian graphs
inferredcites →https://doi.org/10.1007/bfb0036950openalex-snapshot
Cutting and partitioning a graph after a fixed pattern
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0196-6774(81)90020-1openalex-snapshot
A linear-time approximation algorithm for the weighted vertex cover problem
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferredcites →https://doi.org/10.1109/fscs.1990.89595openalex-snapshot
Approximation through multicommodity flow
inferredcites →https://doi.org/10.1109/sfcs.1988.21958openalex-snapshot
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1145/129712.129736openalex-snapshot
The complexity of multiway cuts (extended abstract)
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/167088.167266openalex-snapshot
Approximate max-flow min-(multi)cut theorems and their applications
inferredcites →https://doi.org/10.1145/167088.167268openalex-snapshot
A primal-dual approximation algorithm for generalized Steiner network problems
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
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.1287/moor.13.1.99openalex-snapshot
An Almost Linear-Time Algorithm for Graph Realization
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.20341openalex-snapshot
Algorithms for the minimum partitioning problems in graphs
inferred← citeshttps://doi.org/10.1002/net.20066openalex-snapshot
Greedy approximation algorithms for directed multicuts
inferred← citeshttps://doi.org/10.1002/net.20081openalex-snapshot
Fixed‐parameter tractability and data reduction for multicut in trees
inferred← citeshttps://doi.org/10.1002/net.20345openalex-snapshot
Wavelength assignment in multifiber star networks
inferred← citeshttps://doi.org/10.1002/net.20386openalex-snapshot
Line planning, path constrained network flow and inapproximability
inferred← citeshttps://doi.org/10.1002/net.21534openalex-snapshot
Complexity and approximability of the k‐way vertex cut
inferred← citeshttps://doi.org/10.1002/net.21731openalex-snapshot
Zone‐based tariff design in public transportation networks
inferred← citeshttps://doi.org/10.1007/11422778_139openalex-snapshot
Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks
inferred← citeshttps://doi.org/10.1007/11496199_35openalex-snapshot
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
inferred← citeshttps://doi.org/10.1007/11600930_15openalex-snapshot
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
inferred← citeshttps://doi.org/10.1007/11611257_28openalex-snapshot
Complexity and Exact Algorithms for Multicut
inferred← citeshttps://doi.org/10.1007/11671541_4openalex-snapshot
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
inferred← citeshttps://doi.org/10.1007/11682462_41openalex-snapshot
Cut Problems in Graphs with a Budget Constraint
inferred← citeshttps://doi.org/10.1007/11751595_78openalex-snapshot
The Maximum Integer Multiterminal Flow Problem
inferred← citeshttps://doi.org/10.1007/11785293_32openalex-snapshot
Minimum Membership Set Covering and the Consecutive Ones Property
inferred← citeshttps://doi.org/10.1007/11841036_43openalex-snapshot
A Unified Approach to Approximating Partial Covering Problems
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_31openalex-snapshot
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_34openalex-snapshot
Multicommodity Demand Flow in a Tree
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_32openalex-snapshot
Call Control with k Rejections
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_42openalex-snapshot
Approximation of a Geometric Set Covering Problem
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_44openalex-snapshot
On 2-Coverings and 2-Packings of Laminar Families
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_25openalex-snapshot
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_44openalex-snapshot
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_12openalex-snapshot
Primal-dual approximation algorithms for feedback problems in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_11openalex-snapshot
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_12openalex-snapshot
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-4109-0_2openalex-snapshot
Selected Topics in Critical Element Detection
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_15openalex-snapshot
Removing Undesirable Flows by Edge Deletion
inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_19openalex-snapshot
A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_15openalex-snapshot
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6openalex-snapshot
Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_12openalex-snapshot
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_23openalex-snapshot
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_19openalex-snapshot
Parameterized Complexity of Weighted Multicut in Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_21openalex-snapshot
An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_14openalex-snapshot
Online Interval Scheduling with Predictions
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_16openalex-snapshot
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_19openalex-snapshot
Covering Problems in Edge- and Node-Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_22openalex-snapshot
Algorithms for Cut Problems on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-16549-3_14openalex-snapshot
An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_10openalex-snapshot
Constant-Time Local Computation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_27openalex-snapshot
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_4openalex-snapshot
Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_7openalex-snapshot
Parameterized Graph Separation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_7openalex-snapshot
Approximation Algorithm for Directed Multicuts
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_54openalex-snapshot
The Minimum Shift Design Problem: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_13openalex-snapshot
Greedy Edge-Disjoint Paths in Complete Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_19openalex-snapshot
Resource Allocation Problems in Multifiber WDM Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_17openalex-snapshot
Routing and Call Control Algorithms for Ring Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_29openalex-snapshot
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_68openalex-snapshot
Truthful Unification Framework for Packing Integer Programs with Choices
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_85openalex-snapshot
Approximating Generalized Multicut on Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_39openalex-snapshot
Approximation Algorithms for k-Hurdle Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_1openalex-snapshot
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_48openalex-snapshot
Approximation and Hardness Results for Label Cut and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_4openalex-snapshot
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_16openalex-snapshot
Multicut Algorithms via Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_19openalex-snapshot
Throughput Maximization for Periodic Packet Routing on Trees and Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_20openalex-snapshot
k-Edge-Connectivity: Approximation and LP Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_20openalex-snapshot
How to Cut a Graph into Many Pieces
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_19openalex-snapshot
Multicut in Trees Viewed through the Eyes of Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_19openalex-snapshot
Parameterized Maximum Path Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_5openalex-snapshot
Partitioning into Colorful Components by Minimum Edge Deletions
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_52openalex-snapshot
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_11openalex-snapshot
Multicut on Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_14openalex-snapshot
On the Generalized Multiway Cut in Trees Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_12openalex-snapshot
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_28openalex-snapshot
Maximum Edge-Disjoint Paths in k-Sums of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-04565-7_18openalex-snapshot
Multicut and Integer Multicommodity Flow in Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_23openalex-snapshot
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_55openalex-snapshot
Solving Multicut Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_32openalex-snapshot
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_54openalex-snapshot
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
inferred← citeshttps://doi.org/10.1007/978-4-431-55756-2_9openalex-snapshot
Some Recent Progress for Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-15-0138-8_6openalex-snapshot
The Deployment of Large-Scale Data Synchronization System for Cross-DC Networks
inferred← citeshttps://doi.org/10.1007/978-981-97-0669-3_15openalex-snapshot
Continuous Length-Bounded Paths Interdiction
inferred← citeshttps://doi.org/10.1007/s00224-012-9436-xopenalex-snapshot
Unbalanced Graph Partitioning
inferred← citeshttps://doi.org/10.1007/s00224-017-9788-3openalex-snapshot
Constant-Time Local Computation Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-006-1210-5openalex-snapshot
Approximation Algorithms for the Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/s00453-007-9087-5openalex-snapshot
Path Hitting in Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9103-9openalex-snapshot
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
inferred← citeshttps://doi.org/10.1007/s00453-007-9129-zopenalex-snapshot
A Note on Multiflows and Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-009-9278-3openalex-snapshot
Fractional Path Coloring in Bounded Degree Trees with Applications
inferred← citeshttps://doi.org/10.1007/s00453-009-9305-4openalex-snapshot
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
inferred← citeshttps://doi.org/10.1007/s00453-009-9317-0openalex-snapshot
A Unified Approach to Approximating Partial Covering Problems
inferred← citeshttps://doi.org/10.1007/s00453-010-9408-yopenalex-snapshot
Approximation Algorithms for k-hurdle Problems
inferred← citeshttps://doi.org/10.1007/s00453-010-9431-zopenalex-snapshot
Approximability of Sparse Integer Programs
inferred← citeshttps://doi.org/10.1007/s00453-012-9701-zopenalex-snapshot
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
inferred← citeshttps://doi.org/10.1007/s00453-013-9761-8openalex-snapshot
On the Advantage of Overlapping Clusters for Minimizing Conductance
inferred← citeshttps://doi.org/10.1007/s00453-016-0258-0openalex-snapshot
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
inferred← citeshttps://doi.org/10.1007/s00453-018-0443-4openalex-snapshot
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
inferred← citeshttps://doi.org/10.1007/s00453-020-00795-3openalex-snapshot
On Structural Parameterizations of the Edge Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/s00453-022-01043-6openalex-snapshot
Improved Algorithms for Scheduling Unsplittable Flows on Paths
inferred← citeshttps://doi.org/10.1007/s00453-024-01266-9openalex-snapshot
Connected k-Center and k-Diameter Clustering
inferred← citeshttps://doi.org/10.1007/s00454-023-00552-7openalex-snapshot
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
inferred← citeshttps://doi.org/10.1007/s00454-024-00646-wopenalex-snapshot
On the Dominant of the Multicut Polytope
inferred← citeshttps://doi.org/10.1007/s00493-010-2455-9openalex-snapshot
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
inferred← citeshttps://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferred← citeshttps://doi.org/10.1007/s10107-013-0713-5openalex-snapshot
Tree metrics and edge-disjoint $$S$$ S -paths
inferred← citeshttps://doi.org/10.1007/s10107-014-0856-zopenalex-snapshot
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
inferred← citeshttps://doi.org/10.1007/s10107-017-1199-3openalex-snapshot
New algorithms for maximum disjoint paths based on tree-likeness
inferred← citeshttps://doi.org/10.1007/s10107-020-01513-1openalex-snapshot
Maximum edge-disjoint paths in planar graphs with congestion 2
inferred← citeshttps://doi.org/10.1007/s10107-021-01700-8openalex-snapshot
Integer plane multiflow maximisation: one-quarter-approximation and gaps
inferred← citeshttps://doi.org/10.1007/s10107-022-01780-0openalex-snapshot
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
inferred← citeshttps://doi.org/10.1007/s101070100262openalex-snapshot
The primal-dual method for approximation algorithms
inferred← citeshttps://doi.org/10.1007/s10288-007-0040-xopenalex-snapshot
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
inferred← citeshttps://doi.org/10.1007/s10288-010-0150-8openalex-snapshot
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
inferred← citeshttps://doi.org/10.1007/s10288-022-00518-0openalex-snapshot
Critical node/edge detection problems on trees
inferred← citeshttps://doi.org/10.1007/s10479-013-1372-xopenalex-snapshot
Evader interdiction: algorithms, complexity and collateral damage
inferred← citeshttps://doi.org/10.1007/s10852-007-9060-yopenalex-snapshot
Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/s10852-013-9221-0openalex-snapshot
Designing WDM Optical Networks Using Branch-and-Price
inferred← citeshttps://doi.org/10.1007/s10878-006-8906-yopenalex-snapshot
Finding disjoint paths with related path costs
inferred← citeshttps://doi.org/10.1007/s10878-009-9222-0openalex-snapshot
Approximation and hardness results for label cut and related problems
inferred← citeshttps://doi.org/10.1007/s10878-012-9565-9openalex-snapshot
On the generalized multiway cut in trees problem
inferred← citeshttps://doi.org/10.1007/s10878-020-00568-2openalex-snapshot
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
inferred← citeshttps://doi.org/10.1007/s11590-020-01665-1openalex-snapshot
An approximation algorithm for the submodular multicut problem in trees with linear penalties
inferred← citeshttps://doi.org/10.1007/s11704-020-0368-3openalex-snapshot
The LP-rounding plus greed approach for partial optimization revisited
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.1007/s12469-018-0177-3openalex-snapshot
Aggregation techniques for frequency assignment in public transportation
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.01.007openalex-snapshot
Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2018.10.008openalex-snapshot
VNF placement for service chaining in a distributed cloud environment with multiple stakeholders
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.08.006openalex-snapshot
Spare capacity provisioning for quasi-static traffic
inferred← citeshttps://doi.org/10.1016/j.cor.2011.02.016openalex-snapshot
Complexity of the critical node problem over trees
inferred← citeshttps://doi.org/10.1016/j.cor.2013.09.012openalex-snapshot
A derandomized approximation algorithm for the critical node detection problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.02.003openalex-snapshot
A randomized algorithm with local search for containment of pandemic disease spread
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.02.002openalex-snapshot
The Critical Node Detection Problem in networks: A survey
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.017openalex-snapshot
Path problems in generalized stars, complete graphs, and brick wall graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.013openalex-snapshot
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.010openalex-snapshot
A simple algorithm for multicuts in planar graphs with outer terminals
inferred← citeshttps://doi.org/10.1016/j.dam.2009.03.009openalex-snapshot
Disjoint paths in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.016openalex-snapshot
An approximation algorithm for the Generalized k -Multicut problem
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.021openalex-snapshot
Restricted vertex multicut on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.025openalex-snapshot
Max-multiflow/min-multicut for G+H series-parallel
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.03.001openalex-snapshot
Covering problems in edge- and node-weighted graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.10.037openalex-snapshot
Minimal multicut and maximal integer multiflow: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.02.014openalex-snapshot
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.05.006openalex-snapshot
Multicuts and integral multiflows in rings
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.045openalex-snapshot
Packing and covering with linear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.053openalex-snapshot
The bi-objective critical node detection problem
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.016openalex-snapshot
Multiway cut and integer flow problems in trees
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.010openalex-snapshot
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.034openalex-snapshot
New results on planar and directed multicuts
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.097openalex-snapshot
Routing Concurrent Video Signals over SDH Networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.09.457openalex-snapshot
Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network
inferred← citeshttps://doi.org/10.1016/j.inffus.2008.08.005openalex-snapshot
The maximum weight hierarchy matching problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.006openalex-snapshot
Vertex covering by paths on trees with its applications in machine translation
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.10.004openalex-snapshot
A fixed-parameter tractability result for multicommodity demand flow in trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.03.005openalex-snapshot
A logical approach to multicut problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.012openalex-snapshot
Clustering with qualitative information
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.03.001openalex-snapshot
Multicut in trees viewed through the eyes of vertex cover
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103715openalex-snapshot
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103753openalex-snapshot
Routing few robots in a crowded network
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103795openalex-snapshot
Online interval scheduling with predictions
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.007openalex-snapshot
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor
inferred← citeshttps://doi.org/10.1016/j.jda.2005.07.005openalex-snapshot
Exact algorithms and applications for Tree-like Weighted Set Cover
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.009openalex-snapshot
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.05.002openalex-snapshot
Cut problems in graphs with a budget constraint
inferred← citeshttps://doi.org/10.1016/j.jda.2008.04.004openalex-snapshot
Cardinality constrained and multicriteria (multi)cut problems
inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.005openalex-snapshot
The maximum integer multiterminal flow problem in directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.008openalex-snapshot
Correlation clustering in general weighted graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.003openalex-snapshot
On the hardness of finding near-optimal multicuts in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.012openalex-snapshot
Parameterized maximum path coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.010openalex-snapshot
Improved parameterized and exact algorithms for cut problems on trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.025openalex-snapshot
Query-competitive algorithms for cheapest set problems under uncertainty
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.044openalex-snapshot
Parameterized complexity and approximation issues for the colorful components problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.015openalex-snapshot
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.014openalex-snapshot
An approximation algorithm for the k-prize-collecting multicut on a tree problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.009openalex-snapshot
A simple rounding scheme for multistage optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.011openalex-snapshot
The Connected Critical Node Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114174openalex-snapshot
Parameterized complexity of multicut in weighted trees
inferred← citeshttps://doi.org/10.1016/j.trb.2024.102926openalex-snapshot
Keep on moving: Optimized placement of moving walkways in airport terminals
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00066-7openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00076-xopenalex-snapshot
Call control with k rejections
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00223-2openalex-snapshot
The edge-disjoint paths problem is NP-complete for series–parallel graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00133-xopenalex-snapshot
On complexity, representation and approximation of integral multicommodity flows
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00184-0openalex-snapshot
A greedy algorithm for multicut and integral multiflow in rooted trees
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00073-7openalex-snapshot
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00071-1openalex-snapshot
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1017/s0960129524000124openalex-snapshot
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties
inferred← citeshttps://doi.org/10.1038/s41598-019-53585-5openalex-snapshot
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
inferred← citeshttps://doi.org/10.1038/s42005-020-0318-2openalex-snapshot
Linear programs for entanglement and key distribution in the quantum internet
inferred← citeshttps://doi.org/10.1049/cmu2.70028openalex-snapshot
Network Performance Assessment via Length‐Bounded Paths in Continuous Domain
inferred← citeshttps://doi.org/10.1051/ro:2002005openalex-snapshot
Primal-dual approximation algorithms for a packing-covering pair of problems
showing the first 200 of 353 · page through all 353
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.