On the public citation graph
Domination on Cocomparability Graphs
0 signed · 158 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.3230150109openalex-snapshot
Steiner trees, connected domination and strongly chordal graphs
inferredcites →https://doi.org/10.1007/978-3-642-46908-4_25openalex-snapshot
Forbidden Ordered Subgraphs
inferredcites →https://doi.org/10.1007/bf00571188openalex-snapshot
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
inferredcites →https://doi.org/10.1007/bfb0028791openalex-snapshot
On the restriction of some NP-complete graph problems to permutation graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90357-nopenalex-snapshot
Dominating sets in perfect graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90359-popenalex-snapshot
Permutation graphs: Connected domination and Steiner trees
inferredcites →https://doi.org/10.1016/0020-0190(86)90022-0openalex-snapshot
Total domination in interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(86)90112-2openalex-snapshot
Total domination in interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90076-2openalex-snapshot
Total domination in interval graphs revisited
inferredcites →https://doi.org/10.1016/0166-218x(84)90061-1openalex-snapshot
Domination, independent domination, and duality in strongly chordal graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90088-xopenalex-snapshot
Clustering and domination in perfect graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90168-aopenalex-snapshot
Hamiltonian cycle is polynomial on cocomparability graphs
inferredcites →https://doi.org/10.1016/0167-6377(82)90015-3openalex-snapshot
Independent domination in chordal graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90001-xopenalex-snapshot
Domination in permutation graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(87)90128-9openalex-snapshot
On domination problems for permutation and other graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/s0097539791200375openalex-snapshot
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<26::aid-net3>3.0.co;2-mopenalex-snapshot
Degree-preserving trees
inferred← citeshttps://doi.org/10.1002/jgt.21795openalex-snapshot
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
inferred← citeshttps://doi.org/10.1002/jgt.22929openalex-snapshot
A new graph parameter to measure linearity
inferred← citeshttps://doi.org/10.1002/net.20257openalex-snapshot
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
inferred← citeshttps://doi.org/10.1007/10692760_27openalex-snapshot
Domination and Steiner Tree Problems on Graphs with Few P 4s
inferred← citeshttps://doi.org/10.1007/11917496_8openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_13openalex-snapshot
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_10openalex-snapshot
Fixed Parameter Algorithms for Planar Dominating Set and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_22openalex-snapshot
On Subfamilies of AT-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_7openalex-snapshot
Hardness of Approximating Independent Domination in Circle Graphs
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_282openalex-snapshot
Weighted independent perfect domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_54openalex-snapshot
Asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_82openalex-snapshot
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_76openalex-snapshot
Computing a dominating pair in an asteroidal triple-free graph in linear time
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_37openalex-snapshot
Dynamic programming on distance-hereditary graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_81openalex-snapshot
Variations of Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_12openalex-snapshot
Total Domination and Graph Products
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_13openalex-snapshot
Graphs with Disjoint Total Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_14openalex-snapshot
Total Domination in Graphs with Diameter Two
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_15openalex-snapshot
Nordhaus–Gaddum Bounds for Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_17openalex-snapshot
Variations of Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_2openalex-snapshot
Properties of Total Dominating Sets and General Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_3openalex-snapshot
Complexity and Algorithmic Results
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_4openalex-snapshot
Total Domination in Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_5openalex-snapshot
Total Domination and Minimum Degree
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_6openalex-snapshot
Total Domination in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_7openalex-snapshot
Total Domination and Forbidden Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_81-1openalex-snapshot
Variations of Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_13openalex-snapshot
The k-power Domination Problem in Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_13openalex-snapshot
Fast Diameter Computation Within Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_16openalex-snapshot
Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_13openalex-snapshot
Happy Set Problem on Subclasses of Co-comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_4openalex-snapshot
Independent Set Under a Change Constraint from an Initial Solution
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_42openalex-snapshot
Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_28openalex-snapshot
Linear Time LexDFS on Cocomparability Graphs.
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_25openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_1openalex-snapshot
Lexicographic Breadth First Search – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_33openalex-snapshot
Core Stability of Minimum Coloring Games
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_11openalex-snapshot
On the L(h,k)-Labeling of Co-comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_29openalex-snapshot
Graphs of Linear Clique-Width at Most 3
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_15openalex-snapshot
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_3openalex-snapshot
Algorithms on Subtree Filament Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_22openalex-snapshot
On the Intersection of Tolerance and Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_13openalex-snapshot
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
inferred← citeshttps://doi.org/10.1007/bf00571188openalex-snapshot
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
inferred← citeshttps://doi.org/10.1007/bfb0015415openalex-snapshot
Weighted domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1007/s00373-002-0507-7openalex-snapshot
Locally Well-Dominated and Locally Independent Well-Dominated Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1782-7openalex-snapshot
Complexity of the Improper Twin Edge Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-00538-5openalex-snapshot
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
inferred← citeshttps://doi.org/10.1007/s00453-022-01010-1openalex-snapshot
On the Kernel and Related Problems in Interval Digraphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01081-0openalex-snapshot
Happy Set Problem on Subclasses of Co-comparability Graphs
inferred← citeshttps://doi.org/10.1007/s11083-021-09589-wopenalex-snapshot
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets
inferred← citeshttps://doi.org/10.1007/s11083-023-09641-xopenalex-snapshot
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s11590-017-1213-yopenalex-snapshot
Perfect elimination orderings for symmetric matrices
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00159-6openalex-snapshot
Dominations in trapezoid graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00021-4openalex-snapshot
A linear time algorithm to compute a dominating path in an AT-free graph
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00118-vopenalex-snapshot
Steiner set and connected domination in trapezoid graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90178-qopenalex-snapshot
The complexity of domination problems in circle graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00067-3openalex-snapshot
Weighted independent perfect domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2011.01.011openalex-snapshot
Nordhaus–Gaddum bounds for total domination
inferred← citeshttps://doi.org/10.1016/j.dam.2004.10.001openalex-snapshot
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.02.003openalex-snapshot
Improved bottleneck domination algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.001openalex-snapshot
On end-vertices of Lexicographic Breadth First Searches
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.005openalex-snapshot
Some advances on the set covering polyhedron of circulant matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.025openalex-snapshot
On the intersection of tolerance and cocomparability graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.016openalex-snapshot
A new LBFS-based algorithm for cocomparability graph recognition
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.001openalex-snapshot
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.021openalex-snapshot
On total f -domination: Polyhedral and algorithmic results
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.003openalex-snapshot
Minimal triangulations of graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.044openalex-snapshot
A survey of selected recent results on total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.031openalex-snapshot
Independent domination in graphs: A survey and recent results
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.013openalex-snapshot
Graphs vertex-partitionable into strong cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.009openalex-snapshot
A vertex ordering characterization of simple-triangle graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112283openalex-snapshot
On dominating set polyhedra of circular interval graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.07.015openalex-snapshot
On the independent dominating set polytope
inferred← citeshttps://doi.org/10.1016/j.ins.2007.02.001openalex-snapshot
Efficient algorithms for the minimum connected domination on trapezoid graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.02.009openalex-snapshot
Hardness and approximation of minimum distortion embeddings
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.12.001openalex-snapshot
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.003openalex-snapshot
Small k-pyramids and the complexity of determining k
inferred← citeshttps://doi.org/10.1016/j.socnet.2015.01.001openalex-snapshot
Algorithms for diversity and clustering in social networks through dot product graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.016openalex-snapshot
Graphs of linear clique-width at most 3
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.002openalex-snapshot
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.011openalex-snapshot
The hub number of co-comparability graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.013openalex-snapshot
The k-power domination problem in weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115547openalex-snapshot
Hop domination on subclasses of perfect graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00164-1openalex-snapshot
One-node cutsets and the dominating set polytope
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00043-5openalex-snapshot
Proper and unit bitolerance orders and graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00571-1openalex-snapshot
On linear and circular structure of (claw, net)-free graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00052-2openalex-snapshot
Parallel algorithms for the domination problems in trapezoid graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)80001-7openalex-snapshot
Weighted domination of cocomparability graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00147-4openalex-snapshot
On the algorithmic complexity of twelve covering and independence parameters of graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00127-4openalex-snapshot
Connected domination and dominating clique in trapezoid graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00128-6openalex-snapshot
Domination and total domination on asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00225-5openalex-snapshot
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00586-8openalex-snapshot
Independent domination in finitely defined classes of graphs
inferred← citeshttps://doi.org/10.1109/padsw.2000.884511openalex-snapshot
Domination in bounded interval tolerance graphs
inferred← citeshttps://doi.org/10.1137/100793529openalex-snapshot
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/11083856xopenalex-snapshot
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/15m1012396openalex-snapshot
On the Power of Graph Searching for Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/15m1039468openalex-snapshot
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
inferred← citeshttps://doi.org/10.1137/17m1120920openalex-snapshot
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/19m1280399openalex-snapshot
Graph Classes and Forbidden Patterns on Three Vertices
inferred← citeshttps://doi.org/10.1137/22m153238xopenalex-snapshot
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
inferred← citeshttps://doi.org/10.1137/s0097539791200375openalex-snapshot
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/s0097539795282377openalex-snapshot
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
inferred← citeshttps://doi.org/10.1137/s0895480100373455openalex-snapshot
The LBFS Structure and Recognition of Interval Graphs
inferred← citeshttps://doi.org/10.1137/s0895480104445307openalex-snapshot
Linear Orderings of Subfamilies of AT‐Free Graphs
inferred← citeshttps://doi.org/10.1137/s0895480193250125openalex-snapshot
Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1142/s1793830920500937openalex-snapshot
Coloring squares of graphs via vertex orderings
inferred← citeshttps://doi.org/10.1287/moor.1060.0187openalex-snapshot
Core Stability of Minimum Coloring Games
inferred← citeshttps://doi.org/10.1587/essfr.16.1_17openalex-snapshot
Simple-Triangle Graphs and Related Classes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3050067/v1openalex-snapshot
Computing Independent Dominating Sets in Hypercube Graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-13openalex-snapshot
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2018.37openalex-snapshot
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames
inferred← citeshttps://doi.org/10.46298/dmtcs.2082openalex-snapshot
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.563openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1009.1381openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4005openalex-snapshot
Cactus Graphs and Some Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1601.02267openalex-snapshot
Improper Twin Edge Coloring of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02002openalex-snapshot
Maximal cliques structure for cocomparability graphs and applications
inferred← citeshttps://doi.org/10.48550/arxiv.1705.01465openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.48550/arxiv.1907.07845openalex-snapshot
Linear-semiorders and their incomparability graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2109.14108openalex-snapshot
Connected domination in grid graphs
inferred← citeshttps://doi.org/10.5802/crmath.210openalex-snapshot
Worpitzky-compatible subarrangements of braid arrangements and cocomparability 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.