On the public citation graph

Graph Classes: A Survey

https://doi.org/10.1137/1.9780898719796
0 signed · 1636 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1579634openalex-extracted
Power and Core-Periphery Networks
inferred← citeshttps://doi.org/10.5281/zenodo.6106753openalex-extracted
Finding the Most Vital Edges for Shortest Paths: Algorithms and Complexity for Special Graph Classes
inferred← citeshttps://doi.org/10.5281/zenodo.9051openalex-extracted
Smarandache-Zagreb Index On Three Graph Operators
inferred← citeshttps://doi.org/10.1002/9780470611098.ch16openalex-snapshot
The Complexity of the Exact Weighted Independent Set Problem
inferred← citeshttps://doi.org/10.1002/bies.201000044openalex-snapshot
Protein‐protein interactions: Making sense of networks via graph‐theoretic modeling
inferred← citeshttps://doi.org/10.1002/jgt.10160openalex-snapshot
Complexity of approximating the oriented diameter of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.20005openalex-snapshot
On the interval number of special graphs
inferred← citeshttps://doi.org/10.1002/jgt.20029openalex-snapshot
Star coloring of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20057openalex-snapshot
Disjoint clique cutsets in graphs without long holes
inferred← citeshttps://doi.org/10.1002/jgt.20244openalex-snapshot
Tough spiders
inferred← citeshttps://doi.org/10.1002/jgt.20352openalex-snapshot
The n‐ordered graphs: A new graph class
inferred← citeshttps://doi.org/10.1002/jgt.20501openalex-snapshot
Bounds on vertex colorings with restrictions on the union of color classes
inferred← citeshttps://doi.org/10.1002/jgt.20528openalex-snapshot
Bipartite induced subgraphs and well-quasi-ordering
inferred← citeshttps://doi.org/10.1002/jgt.20539openalex-snapshot
On partitioning interval graphs into proper interval subgraphs and related problems
inferred← citeshttps://doi.org/10.1002/jgt.20543openalex-snapshot
Characterizing directed path graphs by forbidden asteroids
inferred← citeshttps://doi.org/10.1002/jgt.20547openalex-snapshot
When every k-cycle has at least f(k) chords
inferred← citeshttps://doi.org/10.1002/jgt.21650openalex-snapshot
Unit Interval Graphs of Open and Closed Intervals
inferred← citeshttps://doi.org/10.1002/jgt.21666openalex-snapshot
On the Iterated Biclique Operator
inferred← citeshttps://doi.org/10.1002/jgt.21832openalex-snapshot
Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22022openalex-snapshot
Graphs with No Induced Five‐Vertex Path or Antipath
inferred← citeshttps://doi.org/10.1002/jgt.22037openalex-snapshot
Linear Clique‐Width for Hereditary Classes of Cographs
inferred← citeshttps://doi.org/10.1002/jgt.22062openalex-snapshot
Partitioning Perfect Graphs into Stars
inferred← citeshttps://doi.org/10.1002/jgt.22067openalex-snapshot
Partial Characterizations of 1‐Perfectly Orientable Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22142openalex-snapshot
A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture
inferred← citeshttps://doi.org/10.1002/jgt.22775openalex-snapshot
On the edge‐biclique graph and the iterated edge‐biclique operator
inferred← citeshttps://doi.org/10.1002/jgt.22895openalex-snapshot
Erdős–Pósa property of obstructions to interval graphs
inferred← citeshttps://doi.org/10.1002/jgt.23058openalex-snapshot
Monochromatic spanning trees and matchings in ordered complete graphs
inferred← citeshttps://doi.org/10.1002/jgt.23065openalex-snapshot
Classes of intersection digraphs with good algorithmic properties
inferred← citeshttps://doi.org/10.1002/jgt.23102openalex-snapshot
Graphs with at most two moplexes
inferred← citeshttps://doi.org/10.1002/jgt.70126openalex-snapshot
Representation and Obstruction Characterization of Co‐TT Graphs
inferred← citeshttps://doi.org/10.1002/net.1openalex-snapshot
Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs
inferred← citeshttps://doi.org/10.1002/net.20154openalex-snapshot
ApproximateL(δ1,δ2,…,δt)‐coloring of trees and interval graphs
inferred← citeshttps://doi.org/10.1002/net.20200openalex-snapshot
A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
inferred← citeshttps://doi.org/10.1002/net.20359openalex-snapshot
The degree‐preserving spanning tree problem in strongly chordal and directed path graphs
inferred← citeshttps://doi.org/10.1002/net.21502openalex-snapshot
Complexity and approximability of the maximum flow problem with minimum quantities
inferred← citeshttps://doi.org/10.1002/net.21724openalex-snapshot
The budgeted minimum cost flow problem with unit upgrading cost
inferred← citeshttps://doi.org/10.1002/net.70023openalex-snapshot
Tractable but Hard to Approximate: The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities
inferred← citeshttps://doi.org/10.1002/num.22551openalex-snapshot
Leverage centrality analysis of infrastructure networks
inferred← citeshttps://doi.org/10.1002/num.22709openalex-snapshot
Global and local structure‐based influential nodes identification in wheel‐type networks
inferred← citeshttps://doi.org/10.1002/rsa.20806openalex-snapshot
Patterns in random permutations avoiding the pattern 321
inferred← citeshttps://doi.org/10.1002/rsa.21003openalex-snapshot
Counting independent sets in graphs with bounded bipartite pathwidth
inferred← citeshttps://doi.org/10.1006/eujc.2002.0591openalex-snapshot
Hyperbolic Bridged Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1728openalex-snapshot
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_3openalex-snapshot
Algorithmic Graph Theory and Its Applications
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_18openalex-snapshot
Scheduling With Release Times and Deadlines on A Minimum Number of Machines
inferred← citeshttps://doi.org/10.1007/11496915_20openalex-snapshot
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
inferred← citeshttps://doi.org/10.1007/11533719_77openalex-snapshot
Bounded Degree Closest k-Tree Power Is NP-Complete
inferred← citeshttps://doi.org/10.1007/11533719_82openalex-snapshot
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs
inferred← citeshttps://doi.org/10.1007/11534273_26openalex-snapshot
A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs
inferred← citeshttps://doi.org/10.1007/11537311_16openalex-snapshot
Improved Algorithms and Complexity Results for Power Domination in Graphs
inferred← citeshttps://doi.org/10.1007/11537311_17openalex-snapshot
Clique-Width for Four-Vertex Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1007/11537311_45openalex-snapshot
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem
inferred← citeshttps://doi.org/10.1007/11561071_69openalex-snapshot
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
inferred← citeshttps://doi.org/10.1007/11573036_7openalex-snapshot
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
inferred← citeshttps://doi.org/10.1007/11602613_111openalex-snapshot
Localized and Compact Data-Structure for Comparability Graphs
inferred← citeshttps://doi.org/10.1007/11602613_20openalex-snapshot
Laminar Structure of Ptolemaic Graphs and Its Applications
inferred← citeshttps://doi.org/10.1007/11602613_74openalex-snapshot
5-th Phylogenetic Root Construction for Strictly Chordal Graphs
inferred← citeshttps://doi.org/10.1007/11604686_10openalex-snapshot
Roman Domination over Some Graph Classes
inferred← citeshttps://doi.org/10.1007/11604686_19openalex-snapshot
Adding an Edge in a Cograph
inferred← citeshttps://doi.org/10.1007/11604686_34openalex-snapshot
Algorithms Based on the Treewidth of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/11604686_35openalex-snapshot
Extending the Tractability Border for Closest Leaf Powers
inferred← citeshttps://doi.org/10.1007/11604686_38openalex-snapshot
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/11604686_39openalex-snapshot
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
inferred← citeshttps://doi.org/10.1007/11604686_4openalex-snapshot
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/11604686_40openalex-snapshot
Recognizing HHDS-Free Graphs
inferred← citeshttps://doi.org/10.1007/11618058_31openalex-snapshot
Drawing Graphs Using Modular Decomposition
inferred← citeshttps://doi.org/10.1007/11775096_25openalex-snapshot
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/11785293_16openalex-snapshot
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
inferred← citeshttps://doi.org/10.1007/11785293_38openalex-snapshot
Linear-Time Algorithms for Tree Root Problems
inferred← citeshttps://doi.org/10.1007/11785293_39openalex-snapshot
Generalized Powers of Graphs and Their Algorithmic Use
inferred← citeshttps://doi.org/10.1007/11821069_24openalex-snapshot
Optimal Linear Arrangement of Interval Graphs
inferred← citeshttps://doi.org/10.1007/11841036_52openalex-snapshot
Minimum Transversals in Posi-modular Systems
inferred← citeshttps://doi.org/10.1007/11847366_10openalex-snapshot
Distributed Resource Allocation for Stream Data Processing
inferred← citeshttps://doi.org/10.1007/11917496_23openalex-snapshot
A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
inferred← citeshttps://doi.org/10.1007/11917496_24openalex-snapshot
Clique Graph Recognition Is NP-Complete
inferred← citeshttps://doi.org/10.1007/11925231_2openalex-snapshot
Properties of Markovian Subgraphs of a Decomposable Graph
inferred← citeshttps://doi.org/10.1007/11940128_16openalex-snapshot
Algorithms on Graphs with Small Dominating Targets
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_2openalex-snapshot
Foundations of Computer Science and Mathematics
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_3openalex-snapshot
Foundations of Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_15openalex-snapshot
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_43openalex-snapshot
On the Clique Problem in Intersection Graphs of Ellipses
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_14openalex-snapshot
An Additive Stretched Routing Scheme for Chordal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_31openalex-snapshot
On the Recognition of P 4-Comparability Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_35openalex-snapshot
Connected and Loosely Connected List Homomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_6openalex-snapshot
New Graph Classes of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_7openalex-snapshot
More about Subcolorings
inferred← citeshttps://doi.org/10.1007/3-540-36385-8_12openalex-snapshot
On the Radiocoloring Problem
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_10openalex-snapshot
Networks with Small Stretch Number (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_16openalex-snapshot
On the Domination Search Number
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_8openalex-snapshot
Split-Perfect Graphs: Characterizations and Algorithmic Use
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_21openalex-snapshot
Efficient Minus and Signed Domination in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_46openalex-snapshot
Phylogenetic k-Root and Steiner k-Root
inferred← citeshttps://doi.org/10.1007/3-540-44503-x_3openalex-snapshot
Scalar Aggregation in FD-Inconsistent Databases
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_35openalex-snapshot
Computing Phylogenetic Roots with Bounded Degrees and Errors
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_13openalex-snapshot
Approximating Minimum Cocolourings
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_51openalex-snapshot
On Robust Algorithms for the Maximum Weight Stable Set Problem
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_30openalex-snapshot
Space Efficient Algorithms for Series-Parallel 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-45465-9_85openalex-snapshot
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
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-45477-2_11openalex-snapshot
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_14openalex-snapshot
On Star Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_5openalex-snapshot
Maximum Clique Transversals
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_6openalex-snapshot
On the Tree-Degree of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_8openalex-snapshot
(k+) -Disatance- Herediatry Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_4openalex-snapshot
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_25openalex-snapshot
On the Number of Minimum Cuts in a Graph
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_54openalex-snapshot
Partially-Ordered Knapsack and Applications to Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_52openalex-snapshot
Improved Tree Decomposition Based Algorithms for Domination-like Problems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_33openalex-snapshot
λ-Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_17openalex-snapshot
LexBFS-Ordering in Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_8openalex-snapshot
Complexity Classification of Some Edge Modification Problems
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_34openalex-snapshot
Dominating cliques in distance-hereditary graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_12openalex-snapshot
On tractability of Cops and Robbers game
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_1openalex-snapshot
A Brief Introduction to Complex Networks and Their Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4302-3238-4_2openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_25openalex-snapshot
Equitable Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0320-3_2openalex-snapshot
Topological Characteristics of Molecular Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_25-1openalex-snapshot
Equitable Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_2openalex-snapshot
Invariants
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_3openalex-snapshot
Graph Operations
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_4openalex-snapshot
Boundary Sets
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_5openalex-snapshot
Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_6openalex-snapshot
Oriented Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8699-2_7openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_685openalex-snapshot
Unified View of Graph Searching and LDFS-Based Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_689openalex-snapshot
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_721openalex-snapshot
Minimal Dominating Set Enumeration
inferred← citeshttps://doi.org/10.1007/978-1-84996-396-1_3openalex-snapshot
From Topology to Phenotype in Protein–Protein Interaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_20openalex-snapshot
On the Relation of Strong Triadic Closure and Cluster Deletion
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_15openalex-snapshot
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_23openalex-snapshot
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_19openalex-snapshot
Network Decontamination
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_5openalex-snapshot
Parameterized Complexity of Diameter
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_17openalex-snapshot
Destroying Bicolored $$P_3$$s by Deleting Few Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_10openalex-snapshot
Avoidable Vertices and Edges in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_22openalex-snapshot
Kernelization of Graph Hamiltonicity: Proper H-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_28openalex-snapshot
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_18openalex-snapshot
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_18openalex-snapshot
Imbalance, Cutwidth, and the Structure of Optimal Orderings
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_26openalex-snapshot
Incremental Optimization of Independent Sets Under the Reconfiguration Framework
inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_25openalex-snapshot
A General Framework for Path Convexities
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_52openalex-snapshot
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_18openalex-snapshot
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_25openalex-snapshot
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_12openalex-snapshot
A Survey on Spanning Tree Congestion
inferred← citeshttps://doi.org/10.1007/978-3-030-43736-7_2openalex-snapshot
The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_12openalex-snapshot
Fair Packing of Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_3openalex-snapshot
The Micro-world of Cographs
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_1openalex-snapshot
Glossary of Common Terms
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_5openalex-snapshot
End-Vertices of AT-free Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_11openalex-snapshot
Edge Elimination and Weighted Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_12openalex-snapshot
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths
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-60440-0_22openalex-snapshot
Recognizing k-Clique Extendible Orderings
inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_2openalex-snapshot
On List k-Coloring Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-63092-8_36openalex-snapshot
Use of High Mobility Nodes to Improve Connectivity in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_52openalex-snapshot
Computing Imbalance-Minimal Orderings for Bipartite Permutation Graphs and Threshold Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_12openalex-snapshot
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_15openalex-snapshot
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_23openalex-snapshot
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_3openalex-snapshot
Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_15openalex-snapshot
Solving Problems on Generalized Convex Graphs via Mim-Width
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_27openalex-snapshot
On Finding Separators in Temporal Split and Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_12openalex-snapshot
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_6openalex-snapshot
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_48openalex-snapshot
Disconnected Matchings
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_26openalex-snapshot
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_12openalex-snapshot
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-030-96470-2_6openalex-snapshot
Transportation Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_9openalex-snapshot
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars
inferred← citeshttps://doi.org/10.1007/978-3-031-08623-6_16openalex-snapshot
Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_12openalex-snapshot
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-11698-8_4openalex-snapshot
Graph Classes and Graph Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-031-11698-8_7openalex-snapshot
Locating Eigenvalues Using Slick Clique Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_4openalex-snapshot
Weighted Connected Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_8openalex-snapshot
Two Generalizations of Proper Coloring: Hardness and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_14openalex-snapshot
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_10openalex-snapshot
Enumeration of Minimal Tropical Connected Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_31openalex-snapshot
Upper Clique Transversals in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_10openalex-snapshot
Multicore Graphs: Characterization and Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-57840-3_3openalex-snapshot
Mutual-Visibility in Fibonacci Cubes
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_11openalex-snapshot
Mutual Visibility in Hypercube-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_17openalex-snapshot
Characterizing s-Strongly Chordal Graphs Using 2-Paths and k-Chords
inferred← citeshttps://doi.org/10.1007/978-3-031-62776-7_9openalex-snapshot
Intersection Graphs of Spherical Caps
inferred← citeshttps://doi.org/10.1007/978-3-031-62792-7_10openalex-snapshot
On 1-Skeleton of the Cut Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_15openalex-snapshot
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
inferred← citeshttps://doi.org/10.1007/978-3-031-84128-6_4openalex-snapshot
Convex Geometries in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-91357-0_3openalex-snapshot
On Variants of PCGs: A Survey of Current Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_1openalex-snapshot
Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_22openalex-snapshot
Simultaneous Contact Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-08381-4_10openalex-snapshot
A Study on Dominating Set: NP-Hardness and Polynomial Results
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_29openalex-snapshot
Interval k-graphs : Recognition and Forbidden Obstructions
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_10openalex-snapshot
Breadth-First Search Trees with Many or Few Leaves
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_9openalex-snapshot
Vertex-Critical Graphs in Subfamilies of $$(P_4+\ell P_1)$$-Free Graphs
showing the first 200 of 1636
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.