Independent set of intersection graphs of convex objects in 2D

Article Properties
Cite
Agarwal, Pankaj K., and Nabil H. Mustafa. “Independent Set of Intersection Graphs of Convex Objects in 2D”. Computational Geometry, vol. 34, no. 2, 2006, pp. 83-95, https://doi.org/10.1016/j.comgeo.2005.12.001.
Agarwal, P. K., & Mustafa, N. H. (2006). Independent set of intersection graphs of convex objects in 2D. Computational Geometry, 34(2), 83-95. https://doi.org/10.1016/j.comgeo.2005.12.001
Agarwal, Pankaj K., and Nabil H. Mustafa. “Independent Set of Intersection Graphs of Convex Objects in 2D”. Computational Geometry 34, no. 2 (2006): 83-95. https://doi.org/10.1016/j.comgeo.2005.12.001.
Agarwal PK, Mustafa NH. Independent set of intersection graphs of convex objects in 2D. Computational Geometry. 2006;34(2):83-95.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
Title Journal Journal Categories Citations Publication Date
A note on maximum independent sets in rectangle intersection graphs Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
13 2004
Polynomial-time approximation schemes for packing and piercing fat objects Journal of Algorithms 2003
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles Journal of Algorithms 20 2001
Cutting Glass Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
7 2000
Clique is hard to approximate within n1−ϵ Acta Mathematica
  • Science: Mathematics
1999
Citations
Title Journal Journal Categories Citations Publication Date
A Survey on Variant Domination Problems in Geometric Intersection Graphs

Parallel Processing Letters
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2024
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
3 2023
A Tight Analysis of Geometric Local Search Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
2022
Computing maximum independent set on outerstring graphs and their relatives Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
1 2022
Stochastic makespan minimization in structured set systems Mathematical Programming
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2021
Citations Analysis
The category Science: Mathematics 19 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A bipartite analogue of Dilworth’s theorem for multiple partial orders and was published in 2009. The most recent citation comes from a 2024 study titled A Survey on Variant Domination Problems in Geometric Intersection Graphs. This article reached its peak citation in 2017, with 3 citations. It has been cited in 12 different journals. Among related journals, the Discrete & Computational Geometry cited this research the most, with 7 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year