Conjunto disjunto máximo (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Conjunto disjunto máximo" in Spanish language version.

refsWebsite

Global rank Spanish rank

14doi.org

2^nd place

6semanticscholar.org

11^th place

79^th place

5arxiv.org

69^th place

148^th place

2siam.org

low place

9,443^rd place

1monash.edu.au

8,084^th place

9,394^th place

1handle.net

102^nd place

516^th place

1uni-konstanz.de

low place

8,738^th place

arxiv.org

Marathe, M. V.; Breu, H.; Hunt, H. B.; Ravi, S. S.; Rosenkrantz, D. J. (1995). «Simple heuristics for unit disk graphs». Networks 25 (2): 59. arXiv:math/9409226. doi:10.1002/net.3230250205.
Chalermsook, Parinya; Walczak, Bartosz (1 de enero de 2021), «Coloring and Maximum Weight Independent Set of Rectangles», Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 860-868, ISBN 978-1-61197-646-5, S2CID 220525811, arXiv:2007.07880, doi:10.1137/1.9781611976465.54, consultado el 29 de septiembre de 2022 .
Mitchell, Joseph S. B. (2021-06-25). «Approximating Maximum Independent Set for Rectangles in the Plane». arXiv:2101.00326 [cs.CG].
Gálvez, Waldo; Khan, Arindam; Mari, Mathieu; Mömke, Tobias; Reddy, Madhusudhan; Wiese, Andreas (2021-09-26). «A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles». arXiv:2106.00623 [cs.CG].
Chan, T. M.; Har-Peled, S. (2012). «Approximation Algorithms for Maximum Independent Set of Pseudo-Disks». Discrete & Computational Geometry 48 (2): 373. S2CID 38183751. arXiv:1103.1431. doi:10.1007/s00454-012-9417-5.

doi.org

dx.doi.org

Ravi, S. S.; Hunt, H. B. (1987). «An application of the planar separator theorem to counting problems». Information Processing Letters 25 (5): 317. doi:10.1016/0020-0190(87)90206-7. , Smith, W. D.; Wormald, N. C. (1998). «Geometric separator theorems and applications». Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). p. 232. ISBN 978-0-8186-9172-0. S2CID 17962961. doi:10.1109/sfcs.1998.743449.
Agarwal, P. K.; Van Kreveld, M.; Suri, S. (1998). «Label placement by maximum independent set in rectangles». Computational Geometry 11 (3–4): 209. doi:10.1016/s0925-7721(98)00028-5. hdl:1874/18908.
Marathe, M. V.; Breu, H.; Hunt, H. B.; Ravi, S. S.; Rosenkrantz, D. J. (1995). «Simple heuristics for unit disk graphs». Networks 25 (2): 59. arXiv:math/9409226. doi:10.1002/net.3230250205.
Hochbaum, D. S.; Maass, W. (1985). «Approximation schemes for covering and packing problems in image processing and VLSI». Journal of the ACM 32: 130-136. S2CID 2383627. doi:10.1145/2455.214106.
Chan, T. M. (2003). «Polynomial-time approximation schemes for packing and piercing fat objects». Journal of Algorithms 46 (2): 178-189. doi:10.1016/s0196-6774(02)00294-8. «citeseerx: 10.1.1.21.5344».
Chalermsook, P.; Chuzhoy, J. (2009). «Maximum Independent Set of Rectangles». Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 892. ISBN 978-0-89871-680-1. doi:10.1137/1.9781611973068.97.
Chalermsook, Parinya; Walczak, Bartosz (1 de enero de 2021), «Coloring and Maximum Weight Independent Set of Rectangles», Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 860-868, ISBN 978-1-61197-646-5, S2CID 220525811, arXiv:2007.07880, doi:10.1137/1.9781611976465.54, consultado el 29 de septiembre de 2022 .
Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas (2015). On Guillotine Cutting Sequences. pp. 1-19. ISBN 978-3-939897-89-7. doi:10.4230/LIPIcs.APPROX-RANDOM.2015.1.
Gálvez, Waldo; Khan, Arindam; Mari, Mathieu; Mömke, Tobias; Pittu, Madhusudhan Reddy; Wiese, Andreas (1 de enero de 2022), «A 3-Approximation Algorithm for Maximum Independent Set of Rectangles», Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 894-905, ISBN 978-1-61197-707-3, S2CID 235265867, doi:10.1137/1.9781611977073.38, consultado el 29 de septiembre de 2022 .
Erlebach, T.; Jansen, K.; Seidel, E. (2005). «Polynomial-Time Approximation Schemes for Geometric Intersection Graphs». SIAM Journal on Computing 34 (6): 1302. doi:10.1137/s0097539702402676.
Fu, B. (2011). «Theory and application of width bounded geometric separators». Journal of Computer and System Sciences 77 (2): 379-392. doi:10.1016/j.jcss.2010.05.003.
Chan, T. M.; Har-Peled, S. (2012). «Approximation Algorithms for Maximum Independent Set of Pseudo-Disks». Discrete & Computational Geometry 48 (2): 373. S2CID 38183751. arXiv:1103.1431. doi:10.1007/s00454-012-9417-5.
Agarwal, P. K.; Mustafa, N. H. (2006). «Independent set of intersection graphs of convex objects in 2D». Computational Geometry 34 (2): 83. doi:10.1016/j.comgeo.2005.12.001.
Fox, J.; Pach, J. N. (2011). «Computing the Independence Number of Intersection Graphs». Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1161. ISBN 978-0-89871-993-2. S2CID 15850862. doi:10.1137/1.9781611973082.87. «citeseerx: 10.1.1.700.4445».

handle.net

hdl.handle.net

Agarwal, P. K.; Van Kreveld, M.; Suri, S. (1998). «Label placement by maximum independent set in rectangles». Computational Geometry 11 (3–4): 209. doi:10.1016/s0925-7721(98)00028-5. hdl:1874/18908.

monash.edu.au

users.monash.edu.au

Ravi, S. S.; Hunt, H. B. (1987). «An application of the planar separator theorem to counting problems». Information Processing Letters 25 (5): 317. doi:10.1016/0020-0190(87)90206-7. , Smith, W. D.; Wormald, N. C. (1998). «Geometric separator theorems and applications». Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). p. 232. ISBN 978-0-8186-9172-0. S2CID 17962961. doi:10.1109/sfcs.1998.743449.

semanticscholar.org

api.semanticscholar.org

Ravi, S. S.; Hunt, H. B. (1987). «An application of the planar separator theorem to counting problems». Information Processing Letters 25 (5): 317. doi:10.1016/0020-0190(87)90206-7. , Smith, W. D.; Wormald, N. C. (1998). «Geometric separator theorems and applications». Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). p. 232. ISBN 978-0-8186-9172-0. S2CID 17962961. doi:10.1109/sfcs.1998.743449.
Hochbaum, D. S.; Maass, W. (1985). «Approximation schemes for covering and packing problems in image processing and VLSI». Journal of the ACM 32: 130-136. S2CID 2383627. doi:10.1145/2455.214106.
Chalermsook, Parinya; Walczak, Bartosz (1 de enero de 2021), «Coloring and Maximum Weight Independent Set of Rectangles», Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 860-868, ISBN 978-1-61197-646-5, S2CID 220525811, arXiv:2007.07880, doi:10.1137/1.9781611976465.54, consultado el 29 de septiembre de 2022 .
Gálvez, Waldo; Khan, Arindam; Mari, Mathieu; Mömke, Tobias; Pittu, Madhusudhan Reddy; Wiese, Andreas (1 de enero de 2022), «A 3-Approximation Algorithm for Maximum Independent Set of Rectangles», Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 894-905, ISBN 978-1-61197-707-3, S2CID 235265867, doi:10.1137/1.9781611977073.38, consultado el 29 de septiembre de 2022 .
Chan, T. M.; Har-Peled, S. (2012). «Approximation Algorithms for Maximum Independent Set of Pseudo-Disks». Discrete & Computational Geometry 48 (2): 373. S2CID 38183751. arXiv:1103.1431. doi:10.1007/s00454-012-9417-5.
Fox, J.; Pach, J. N. (2011). «Computing the Independence Number of Intersection Graphs». Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1161. ISBN 978-0-89871-993-2. S2CID 15850862. doi:10.1137/1.9781611973082.87. «citeseerx: 10.1.1.700.4445».

siam.org

epubs.siam.org

Chalermsook, Parinya; Walczak, Bartosz (1 de enero de 2021), «Coloring and Maximum Weight Independent Set of Rectangles», Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 860-868, ISBN 978-1-61197-646-5, S2CID 220525811, arXiv:2007.07880, doi:10.1137/1.9781611976465.54, consultado el 29 de septiembre de 2022 .
Gálvez, Waldo; Khan, Arindam; Mari, Mathieu; Mömke, Tobias; Pittu, Madhusudhan Reddy; Wiese, Andreas (1 de enero de 2022), «A 3-Approximation Algorithm for Maximum Independent Set of Rectangles», Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings (Society for Industrial and Applied Mathematics): 894-905, ISBN 978-1-61197-707-3, S2CID 235265867, doi:10.1137/1.9781611977073.38, consultado el 29 de septiembre de 2022 .

uni-konstanz.de

kops.uni-konstanz.de

Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas (2015). On Guillotine Cutting Sequences. pp. 1-19. ISBN 978-3-939897-89-7. doi:10.4230/LIPIcs.APPROX-RANDOM.2015.1.