Discrete Applied Mathematics · 2017 · 13 citations · 17 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsOptimizationComputational ComplexityConvex AnalysisConvex GeometryDirected Acyclic GraphsShortest Path AlgorithmsStructural ComplexityComplexityHamiltonian Path AlgorithmsHamiltonian Path Problem
17
Planar Formulae and Their Uses
David Lichtenstein · SIAM Journal on Computing · 1982 · 754 citations
The Complexity of Multiterminal Cuts
Elias Dahlhaus, D. S. Johnson, Christos H. Papadimitriou et al. · SIAM Journal on Computing · 1994 · 666 citations
Irreversible conversion of graphs
Carmen C. Centeno, Mitre C. Dourado, Lúcia Draque Penso et al. · Theoretical Computer Science · 2011 · 131 citations
A tree representation for P4-sparse graphs
B. Jamison, Stephan Olariu · Discrete Applied Mathematics · 1992 · 131 citations