The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Computational Complexity
SIAM Journal on Discrete Mathematics
Tolerance intersection graphs on binary trees with constant tolerance
Discrete Mathematics
Improvements in throughout maximization for real-time scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Simple approximation algorithm for nonoverlapping local alignments
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
Mathematical Structures Underlying Greedy Algorithms
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Finding a minimum circuit in a graph
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Optimizing Bull-Free Perfect Graphs
SIAM Journal on Discrete Mathematics
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
Approximation algorithms for the weighted independent set problem in sparse graphs
Discrete Applied Mathematics
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
Discrete Applied Mathematics
Approximations of weighted independent set and hereditary subset problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A robust PTAS for maximum weight independent sets in unit disk graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = (V, E) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ordering of vertices v1, &dots;, vn such that the property P holds on the induced subgraph G[N(vi)∩ Vi], where N(vi) is the neighborhood of vi and Vi = {vi, &dots;, vn}. It turns out that if we take P as a graph with maximum independent set size no greater than k, then this definition gives a natural generalization of both chordal graphs and (k + 1)-claw-free graphs. We refer to such graphs as inductive k-independent graphs. We study properties of such families of graphs, and we show that several natural classes of graphs are inductive k-independent for small k. In particular, any intersection graph of translates of a convex object in a two dimensional plane is an inductive 3-independent graph; furthermore, any planar graph is an inductive 3-independent graph. For any fixed constant k, we develop simple, polynomial time approximation algorithms for inductive k-independent graphs with respect to several well-studied NP-complete problems. Our generalized formulation unifies and extends several previously known results.