Keyword

hitting sets

Description: Hitting sets are collections of elements that intersect every set in a specified family, studied in combinatorics and computational complexity.
OpenAlex ID: keywords/hitting-sets
2012 · Kichard Rarp · 1,389
2006 · Jianer Chen, Xiuzhen Huang, et al. · Journal of Computer and System Sciences · 354
2005 · James Bailey, Peter J. Stuckey · Lecture notes in computer science · 228
2005 · Jianer Chen, Benny Chor, et al. · Information and Computation · 217
2009 · Michael Dom, Daniel Lokshtanov, et al. · Lecture notes in computer science · 215
2016 · Marek Cygan, Holger Dell, et al. · ACM Transactions on Algorithms · 209
2011 · A. Felfernig, M. Schubert, et al. · Artificial intelligence for engineering design analysis and manufacturing · 202
2014 · Michael Dom, Daniel Lokshtanov, et al. · ACM Transactions on Algorithms · 176
2015 · Rajesh Chitnis, Graham Cormode, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 149
2004 · Jianer Chen, Xiuzhen Huang, et al. · ACM Symposium on Theory of Computing (STOC) · 127
2013 · Michael A. Forbes, Amir Shpilka · Annual Symposium on Foundations of Computer Science · 126
2012 · Timothy M. Chan, Elyot Grant, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 126
2009 · Michael Dom, Jiong Guo, et al. · Journal of Discrete Algorithms · 118
1993 · J. F. Le Gall · Probability Theory and Related Fields · 105
2005 · Peter Bro Miltersen, N. V. Vinodchandran · Computational Complexity · 98
2000 · V. S. Anil Kumar, Sunil Arya, et al. · Lecture notes in computer science · 98
2021 · Roni Stern, Meir Kalech, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 96
2016 · Fedor V. Fomin, Serge Gaspers, et al. · Journal of the ACM · 93
2016 · Amer E. Mouawad, Naomi Nishimura, et al. · Algorithmica · 93
2021 · Emanuele La Malfa, Rhiannon Michelmore, et al. · International Joint Conference on Artificial Intelligence · 92
2012 · Timothy M. Chan, Elyot Grant, et al. · Symposium on Discrete Algorithms · 90
2011 · Daniel Lokshtanov, Daniel Marx, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 90
2014 · Michael A. Forbes, Ramprasad Saptharishi, et al. · ACM Symposium on Theory of Computing (STOC) · 83
2013 · Michael A. Forbes, Amir Shpilka · Lecture notes in computer science · 83
Works count: 530
Citation count: 9,412
Year
Topic
Type