On the public citation graph

Algorithmic graph theory and perfect graphs

0 signed · 51 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.1007/978-94-009-5315-4openalex-snapshot
Graphs and Order
inferredcites →https://doi.org/10.1016/0012-365x(85)90039-1openalex-snapshot
Interval graphs and related topics
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7148-8openalex-snapshot
Topics on Perfect Graphs
inferredcites →https://doi.org/10.2307/2981909openalex-snapshot
Interval Orders and Interval Graphs: A Study of 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.1002/0470011297.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781118600207.ch10openalex-snapshot
Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/mana.19981930102openalex-snapshot
Extensions of Positive Definite Fredholm Operators with Partially Zero Inverse
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_115openalex-snapshot
Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_89openalex-snapshot
A compact data structure and parallel algorithms for permutation graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-0809-2_2openalex-snapshot
Performance Evaluation of Resource Management Schemes for Non-GSO Satellite Communications
inferred← citeshttps://doi.org/10.1007/bf02253613openalex-snapshot
Hamiltonicity in graphs with fewP 4's
inferred← citeshttps://doi.org/10.1007/s00453-006-0187-4openalex-snapshot
Call Control in Rings
inferred← citeshttps://doi.org/10.1007/s10586-018-02892-zopenalex-snapshot
Optimal interval scheduling with nonidentical given machines
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90355-6openalex-snapshot
Graphs and free partially commutative monoids
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.034openalex-snapshot
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.034openalex-snapshot
One-sided terrain guarding and chordal graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00210-1openalex-snapshot
Parallel N-free order recognition
inferred← citeshttps://doi.org/10.1016/s1380-7323(99)x8057-5openalex-snapshot
Computational Molecular Biology
inferred← citeshttps://doi.org/10.1089/cmb.2010.0251openalex-snapshot
Towards Fully Automated Structure-Based NMR Resonance Assignment of 15 N-Labeled Proteins From Automatically Picked Peaks
inferred← citeshttps://doi.org/10.1109/dac.2005.193801openalex-snapshot
Leakage power optimization with dual-V/sub th/ library in high-level synthesis
inferred← citeshttps://doi.org/10.1109/icci.1992.227709openalex-snapshot
Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs
inferred← citeshttps://doi.org/10.1145/127601.127630openalex-snapshot
Logic synthesis for efficient pseudoexhaustive testability
inferred← citeshttps://doi.org/10.1145/160985.161167openalex-snapshot
Decision trees for geometric models
inferred← citeshttps://doi.org/10.1145/2000807.2000810openalex-snapshot
Partial convex recolorings of trees and galled networks
inferred← citeshttps://doi.org/10.1145/375360.375367openalex-snapshot
A software engineering perspective on algorithmics
inferred← citeshttps://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
inferred← citeshttps://doi.org/10.1145/872732.806957openalex-snapshot
Automatic storage optimization
inferred← citeshttps://doi.org/10.1145/989393.989398openalex-snapshot
Automatic storage optimization
inferred← citeshttps://doi.org/10.13001/1081-3810.1510openalex-snapshot
On bipartite graphs which attain minimum rank among bipartite graphs with given diameter
inferred← citeshttps://doi.org/10.14232/phd.10904openalex-snapshot
Network based data oriented methods for application driven problems
inferred← citeshttps://doi.org/10.21608/iceeng.1999.62512openalex-snapshot
A HIGH-LEVEL SYNTHESIS METHODOLOGY FOR DEDICATED DSP ARCHITECTURES
inferred← citeshttps://doi.org/10.21711/231766362012/rmc42openalex-snapshot
Interval Count of Generalizations of Threshold Graphs
inferred← citeshttps://doi.org/10.2172/5217041openalex-snapshot
On finding minimum-diameter clique trees
inferred← citeshttps://doi.org/10.21914/anziamj.v58i0.10993openalex-snapshot
Isolated Scattering Number Can be Computed in Polynomial Time for Interval Graphs
inferred← citeshttps://doi.org/10.29007/c9f6openalex-snapshot
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes
inferred← citeshttps://doi.org/10.32622/ijrat.742019218openalex-snapshot
An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs
inferred← citeshttps://doi.org/10.3384/diss.diva-117503openalex-snapshot
Divide and Conquer: Distributed Optimization and Robustness Analysis
inferred← citeshttps://doi.org/10.37236/219openalex-snapshot
Random Threshold Graphs
inferred← citeshttps://doi.org/10.37236/4050openalex-snapshot
Random Threshold Digraphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2076openalex-snapshot
The graph isomorphism problem on geometric graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2121openalex-snapshot
p-box: a new graph model
inferred← citeshttps://doi.org/10.46298/dmtcs.274openalex-snapshot
Ordered Vertex Partitioning
inferred← citeshttps://doi.org/10.46298/dmtcs.298openalex-snapshot
Graph Decompositions and Factorizing Permutations
inferred← citeshttps://doi.org/10.46298/dmtcs.303openalex-snapshot
Partially complemented representations of digraphs
inferred← citeshttps://doi.org/10.46298/dmtcs.482openalex-snapshot
On edge-intersection graphs of k-bend paths in grids
inferred← citeshttps://doi.org/10.46298/dmtcs.625openalex-snapshot
Isomorphism of graph classes related to the circular-ones property
inferred← citeshttps://doi.org/10.47749/t/unicamp.2012.854855openalex-snapshot
Coloração de arestas em grafos split
inferred← citeshttps://doi.org/10.5540/tema.2019.020.02.323openalex-snapshot
Characterizing Block Graphs in Terms of One-vertex Extensions
inferred← citeshttps://doi.org/10.5614/ejgta.2015.3.1.3openalex-snapshot
A new characterization of trivially perfect graphs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95485openalex-snapshot
Structural and computational aspects of simple and influence games
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.