On the public citation graph

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

0 signed · 68 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.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferredcites →https://doi.org/10.1006/jctb.2000.2031openalex-snapshot
Directed Tree-Width
inferredcites →https://doi.org/10.1007/11427186_20openalex-snapshot
New Upper Bound Heuristics for Treewidth
inferredcites →https://doi.org/10.1007/11775096_24openalex-snapshot
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
inferredcites →https://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferredcites →https://doi.org/10.1007/978-3-319-03841-4_40openalex-snapshot
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_33openalex-snapshot
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_5openalex-snapshot
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-74839-7_25openalex-snapshot
Pathwidth of Circular-Arc Graphs
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_27openalex-snapshot
Computing Pathwidth Faster Than 2 n
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_19openalex-snapshot
An Experimental Evaluation of Treewidth at Most Four Reductions
inferredcites →https://doi.org/10.1007/978-3-642-31155-0_31openalex-snapshot
Kernel Bounds for Structural Parameterizations of Pathwidth
inferredcites →https://doi.org/10.1007/978-3-642-33293-7_18openalex-snapshot
Computing Directed Pathwidth in O(1.89 n ) Time
inferredcites →https://doi.org/10.1007/bf01215352openalex-snapshot
Call routing and the ratcatcher
inferredcites →https://doi.org/10.1007/s00224-011-9312-0openalex-snapshot
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
inferredcites →https://doi.org/10.1007/s00373-005-0627-yopenalex-snapshot
Directed Path-width and Monotonicity in Digraph Searching
inferredcites →https://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0166-218x(93)90012-dopenalex-snapshot
On the pathwidth of chordal graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferredcites →https://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferredcites →https://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1016/j.cor.2012.04.017openalex-snapshot
Variable neighborhood search for the Vertex Separation Problem
inferredcites →https://doi.org/10.1016/j.cor.2013.11.008openalex-snapshot
Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem
inferredcites →https://doi.org/10.1016/j.dam.2007.02.004openalex-snapshot
On the maximum cardinality search lower bound for treewidth
inferredcites →https://doi.org/10.1016/j.dam.2007.08.045openalex-snapshot
Digraph searching, directed vertex separation and directed pathwidth
inferredcites →https://doi.org/10.1016/j.dam.2011.03.010openalex-snapshot
Characterization of graphs and digraphs with small process numbers
inferredcites →https://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferredcites →https://doi.org/10.1016/j.ic.2011.04.003openalex-snapshot
Treewidth computations II. Lower bounds
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jctb.2012.04.004openalex-snapshot
The dag-width of directed graphs
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.038openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferredcites →https://doi.org/10.1016/j.tcs.2008.08.025openalex-snapshot
Monotonicity in digraph search problems
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.002openalex-snapshot
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
inferredcites →https://doi.org/10.1016/s0196-6774(02)00225-0openalex-snapshot
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1090/dimacs/005/02openalex-snapshot
Graph searching, path-width, tree-width and related problems (A survey)
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1109/focs.2013.60openalex-snapshot
An O(c^k n) 5-Approximation Algorithm for Treewidth
inferredcites →https://doi.org/10.1109/tcad.1987.1270248openalex-snapshot
Exact and Approximate Solutions for the Gate Matrix Layout Problem
inferredcites →https://doi.org/10.1137/0405010openalex-snapshot
On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
inferredcites →https://doi.org/10.1137/0406014openalex-snapshot
The Pathwidth and Treewidth of Cographs
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s089548019223992xopenalex-snapshot
Treewidth and Pathwidth of Permutation Graphs
inferredcites →https://doi.org/10.1145/1060590.1060674openalex-snapshot
Improved approximation algorithms for minimum-weight vertex separators
inferredcites →https://doi.org/10.1145/129712.129734openalex-snapshot
Finding approximate separators and computing tree width quickly
inferredcites →https://doi.org/10.1145/2390176.2390188openalex-snapshot
On exact algorithms for treewidth
inferredcites →https://doi.org/10.1145/42267.42268openalex-snapshot
The complexity of searching a graph
inferredcites →https://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferredcites →https://doi.org/10.1364/jocn.2.001010openalex-snapshot
Lightpath Reconfiguration in WDM Networks
inferredcites →https://doi.org/10.5555/1036843.1036868openalex-snapshot
A complete anytime algorithm for treewidth
inferredcites →https://doi.org/10.5555/314613.314994openalex-snapshot
Linear-time register allocation for a fixed number of registers

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-319-78825-8_27openalex-snapshot
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem
inferred← citeshttps://doi.org/10.1007/s00453-026-01371-xopenalex-snapshot
Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-026-01404-5openalex-snapshot
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
inferred← citeshttps://doi.org/10.1016/j.jda.2018.11.012openalex-snapshot
Linear ordering based MIP formulations for the vertex separation or pathwidth problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.039openalex-snapshot
Finding small-width connected path decompositions in polynomial time
inferred← citeshttps://doi.org/10.1109/access.2017.2740418openalex-snapshot
A quality and distance guided metaheuristic algorithm for vertex separation problem
inferred← citeshttps://doi.org/10.1109/hpsr.2018.8850754openalex-snapshot
Efficient Make Before Break Capacity Defragmentation
inferred← citeshttps://doi.org/10.1109/tnet.2021.3078581openalex-snapshot
Efficient Make-Before-Break Layer 2 Reoptimization
inferred← citeshttps://doi.org/10.1145/3569169openalex-snapshot
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
inferred← citeshttps://doi.org/10.23919/ondm65745.2025.11029336openalex-snapshot
Proactive Reconfiguration of Optical Transport Networks with Minimum Service Disruption Time
inferred← citeshttps://doi.org/10.3390/a15020042openalex-snapshot
Recent Advances in Positive-Instance Driven Graph Searching
inferred← citeshttps://doi.org/10.70675/03c138dezf306z4f6cz913ez53d66dced624openalex-snapshot
Exact parameterized algorithmics for structural RNAbioinformatics
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.