On the public citation graph
The Pathwidth and Treewidth of Cographs
0 signed · 175 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/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-54233-7_162openalex-snapshot
Better algorithms for the pathwidth and treewidth of graphs
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
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(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
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/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/44483.44491openalex-snapshot
Nonconstructive tools for proving polynomial-time decidability
inferredcites →https://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0025openalex-snapshot
Layout Permutation Problems and Well-Partially-Ordered Sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4673490openalex-extracted
Parameterized Problems Complete for Nondeterministic Fpt Time and Logarithmic Space
inferred← citeshttps://doi.org/10.1006/inco.1997.2669openalex-snapshot
On Interval Routing Schemes and Treewidth
inferred← citeshttps://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1996.0013openalex-snapshot
Finite Languages for the Representation of Finite Graphs
inferred← citeshttps://doi.org/10.1007/11604686_9openalex-snapshot
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/11917496_1openalex-snapshot
Treewidth: Characterizations, Applications, and Computations
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_24openalex-snapshot
Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_16openalex-snapshot
Safe Reduction Rules for Weighted Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_6openalex-snapshot
New Lower and Upper Bounds for Graph Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_37openalex-snapshot
Computing Optimal Linear Layouts of Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_39openalex-snapshot
Tree Decompositions with Small Cost
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_40openalex-snapshot
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_16openalex-snapshot
Efficient Analy sis of Graphs with Small Minimal Separators
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_35openalex-snapshot
Tree-width and path-width of comparability graphs of interval orders
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_59openalex-snapshot
Fugitive-search games on graphs and related parameters
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_68openalex-snapshot
How to use the minimal separators of a graph for its chordal triangulation
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_75openalex-snapshot
On Interval Routing Schemes and treewidth
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_32openalex-snapshot
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_529openalex-snapshot
Kernelization, Preprocessing for Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_20openalex-snapshot
Computing Digraph Width Measures on Directed Co-graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_20openalex-snapshot
Characterizations for Special Directed Co-graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_6openalex-snapshot
As Time Goes By: Reflections on Treewidth for Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_17openalex-snapshot
Breaking Symmetries with RootClique and LexTopSort
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_15openalex-snapshot
Computing Subset Transversals in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_17openalex-snapshot
Computing Weighted Subset Transversals in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_14openalex-snapshot
Contraction Blockers for Graphs with Forbidden Induced Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-47054-2_44openalex-snapshot
Integer Linear Programming Formulation and Exact Algorithm for Computing Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_22openalex-snapshot
Directed Path-Width and Directed Tree-Width of Directed Co-graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_8openalex-snapshot
An SMT Approach to Fractional Hypertree Width
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_22openalex-snapshot
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_10openalex-snapshot
A Characterisation of the Minimal Triangulations of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_27openalex-snapshot
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-75256-1_45openalex-snapshot
Inference and Learning in Multi-dimensional Bayesian Network Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-04500-4_10openalex-snapshot
Baumweitebeschränkte Graphen
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_37openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_12openalex-snapshot
Fixed-Parameter Tractability of Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_31openalex-snapshot
Kernel Bounds for Structural Parameterizations of Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_18openalex-snapshot
Computing Directed Pathwidth in O(1.89 n ) Time
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_4openalex-snapshot
Probabilistic Inference and Monadic Second Order Logic
inferred← citeshttps://doi.org/10.1007/bf01462229openalex-snapshot
Treewidth of cocomparability graphs and a new order-theoretic parameter
inferred← citeshttps://doi.org/10.1007/bfb0024492openalex-snapshot
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/bfb0045095openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1007/bfb0055807openalex-snapshot
Representing hyper-graphs by regular languages
inferred← citeshttps://doi.org/10.1007/s00224-016-9714-0openalex-snapshot
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-003-1026-5openalex-snapshot
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition
inferred← citeshttps://doi.org/10.1007/s00453-004-1125-yopenalex-snapshot
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors
inferred← citeshttps://doi.org/10.1007/s00453-006-1226-xopenalex-snapshot
Safe Reduction Rules for Weighted Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-014-9871-yopenalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-015-0015-9openalex-snapshot
Computing Directed Pathwidth in $$O(1.89^{n})$$ O ( 1 . 89 n ) Time
inferred← citeshttps://doi.org/10.1007/s004530010026openalex-snapshot
Graph Searching on Some Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s10514-011-9255-yopenalex-snapshot
Algorithms and complexity results for graph-based pursuit evasion
inferred← citeshttps://doi.org/10.1007/s10844-013-0294-zopenalex-snapshot
A method for reduction of examples in relational learning
inferred← citeshttps://doi.org/10.1007/s10878-020-00670-5openalex-snapshot
On characterizations for subclasses of directed co-graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00095-9openalex-snapshot
Triangulating graphs without asteroidal triples
inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.008openalex-snapshot
Tree decompositions with small cost
inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.012openalex-snapshot
Tree-decompositions of small pathwidth
inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.014openalex-snapshot
Chordal co-gem-free and ( P5 ,gem)-free graphs have bounded clique-width
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.004openalex-snapshot
Efficient parallel recognition of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.007openalex-snapshot
Node-searching problem on block graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.011openalex-snapshot
Dynamic programming and planarity: Improved tree-decomposition based algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.011openalex-snapshot
Acyclic and star colorings of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.020openalex-snapshot
Edge search number of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.020openalex-snapshot
Comparing the metric and strong dimensions of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.042openalex-snapshot
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.002openalex-snapshot
A vertex incremental approach for maintaining chordality
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.048openalex-snapshot
Linear layouts measuring neighbourhoods in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.001openalex-snapshot
Two characterisations of minimal triangulations of 2K2 -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.06.004openalex-snapshot
Two characterisations of the minimal triangulations of permutation graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.024openalex-snapshot
On the spectrum and number of convex sets in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.015openalex-snapshot
Neighbourhood-width of trees
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100795openalex-snapshot
Principled deep neural network training through linear programming
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.007openalex-snapshot
Exclusive graph searching vs. pathwidth
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105195openalex-snapshot
Parameterized problems complete for nondeterministic FPT time and logarithmic space
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.12.001openalex-snapshot
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.06.011openalex-snapshot
The complexity of minimum-length path decompositions
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.003openalex-snapshot
Parameterized complexity dichotomy for Steiner Multicut
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.006openalex-snapshot
Treewidth versus clique number. II. Tree-independence number
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.08.004openalex-snapshot
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.021openalex-snapshot
Approximating the maximum clique minor and some subgraph homeomorphism problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.017openalex-snapshot
Treewidth and minimum fill-in on permutation graphs in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.013openalex-snapshot
A revisit of the scheme for computing treewidth and minimum fill-in
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.023openalex-snapshot
Contraction and deletion blockers for perfect graphs and H-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.047openalex-snapshot
How to compute digraph width measures on directed co-graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.006openalex-snapshot
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.010openalex-snapshot
Computing subset transversals in H-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115910openalex-snapshot
Covering and partitioning of split, chain and cographs with isometric paths
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00057-1openalex-snapshot
On intervalizing k-colored graphs for DNA physical mapping
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00031-0openalex-snapshot
Treewidth for graphs with small chordality
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00041-3openalex-snapshot
Characterizations and algorithmic applications of chordal graph embeddings
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00026-2openalex-snapshot
Triangulating multitolerance graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00056-0openalex-snapshot
An optimal parallel algorithm for node ranking of cographs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00101-2openalex-snapshot
Partial and perfect path covers of cographs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00115-2openalex-snapshot
Triangulating graphs with few P4's
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00241-8openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80054-xopenalex-snapshot
Quickly Excluding K2,r from Planar Graphs
inferred← citeshttps://doi.org/10.1023/a:1027320705349openalex-snapshot
Necessary Edges in k-Chordalisations of Graphs
inferred← citeshttps://doi.org/10.1051/ita:2001122openalex-snapshot
Automata-based Representations for Infinite Graphs
inferred← citeshttps://doi.org/10.1080/00207160.2010.539681openalex-snapshot
Linear-time algorithm for the matched-domination problem in cographs
inferred← citeshttps://doi.org/10.1080/15427951.2016.1182952openalex-snapshot
Tree decompositions and social graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferred← citeshttps://doi.org/10.1093/comjnl/bxm037openalex-snapshot
Combinatorial Optimization on Graphs of Bounded Treewidth
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/focs52979.2021.00027openalex-snapshot
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
inferred← citeshttps://doi.org/10.1137/1.9781611976007openalex-snapshot
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX)
inferred← citeshttps://doi.org/10.1137/120903518openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferred← citeshttps://doi.org/10.1137/20m1320870openalex-snapshot
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferred← citeshttps://doi.org/10.1137/s089548019223992xopenalex-snapshot
Treewidth and Pathwidth of Permutation Graphs
inferred← citeshttps://doi.org/10.1137/s0895480199350477openalex-snapshot
Graph Searching and Interval Completion
inferred← citeshttps://doi.org/10.1142/9789812777638_0008openalex-snapshot
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
inferred← citeshttps://doi.org/10.1145/1456650.1456654openalex-snapshot
Solving problems on recursively constructed graphs
inferred← citeshttps://doi.org/10.1145/2635820openalex-snapshot
FPT is characterized by useful obstruction sets
inferred← citeshttps://doi.org/10.1145/2851494openalex-snapshot
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
inferred← citeshttps://doi.org/10.1145/3188745.3188854openalex-snapshot
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16508openalex-snapshot
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
inferred← citeshttps://doi.org/10.1609/aaai.v36i7.20750openalex-snapshot
Learning Bayesian Networks in the Presence of Structural Side Information
inferred← citeshttps://doi.org/10.22215/etd/2005-10780openalex-snapshot
Intruder capture by mobile agents in mesh topologies
inferred← citeshttps://doi.org/10.2298/fil1702413copenalex-snapshot
On perfect and quasiperfect dominations in graphs
inferred← citeshttps://doi.org/10.26481/dis.20120405lmopenalex-snapshot
Treewidth : structural properties and algorithmic insights
inferred← citeshttps://doi.org/10.30108/jcut.200809.0021openalex-snapshot
A Linear-Time Algorithm for the Terminal Path Cover Problem in Trees
inferred← citeshttps://doi.org/10.3390/a18070386openalex-snapshot
The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations
inferred← citeshttps://doi.org/10.3390/axioms15040278openalex-snapshot
Complement Reducible Uniform Hypergraphs
inferred← citeshttps://doi.org/10.3390/info7010005openalex-snapshot
The Treewidth of Induced Graphs of Conditional Preference Networks Is Small
inferred← citeshttps://doi.org/10.3390/math11153325openalex-snapshot
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
inferred← citeshttps://doi.org/10.3390/sym14040676openalex-snapshot
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2025.35openalex-snapshot
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4073openalex-snapshot
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1121openalex-snapshot
A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4217openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.1305.3102openalex-snapshot
FPT is Characterized by Useful Obstruction Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3829openalex-snapshot
On OBDDs for CNFs of bounded treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1404.7006openalex-snapshot
Parameterized Complexity Dichotomy for Steiner Multicut
inferred← citeshttps://doi.org/10.48550/arxiv.1604.04509openalex-snapshot
Bounding the search number of graph products
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04457openalex-snapshot
Computing directed path-width and directed tree-width of recursively defined digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11280openalex-snapshot
Virtual Network Embedding via Decomposable LP Formulations: Orientations of Small Extraction Width and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2111.02200openalex-snapshot
The Algorithmic Complexity of Tree-Clique Width
inferred← citeshttps://doi.org/10.5402/2011/540834openalex-snapshot
Weighted Maximum-Clique Transversal Sets of Graphs
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.