Discrete Mathematics
Clique Graphs of Chordal and Path Graphs
SIAM Journal on Discrete Mathematics
Some complexity results about threshold graphs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Journal of Algorithms
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
On intervalizing k-colored graphs for DNA physical mapping
Discrete Applied Mathematics - Special volume on computational molecular biology
Orienting graphs to optimize reachability
Information Processing Letters
Graph classes: a survey
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Combinatorica
Polynomial time recognition of unit circular-arc graphs
Journal of Algorithms
Banded structure in binary matrices
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Discrete Applied Mathematics
Efficient algorithms for Eulerian extension
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Minimum d-blockers and d-transversals in graphs
Journal of Combinatorial Optimization
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Resilience and optimization of identifiable bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs have a lot of applications in different areas, and many polynomial-time algorithms and NP-completeness proofs for this kind of problems are known. In this work we prove new NP-completeness results for these problems in some graph classes, such as interval, circular-arc, permutation, circle, bridged, weakly chordal and clique-Helly graphs.