Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
22 | V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh |
Hardness of Set Cover with Intersection 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 624-635, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 242-257, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Anureet Saxena, Vineet Goyal, Miguel A. Lejeune |
MIP reformulations of the probabilistic set covering problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 121(1), pp. 1-31, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C15, 90-08, 90C10 |
21 | Taiga Takata, Yusuke Matsunaga |
A heuristic algorithm for LUT-based FPGA technology mapping using the lower bound for DAG covering problem (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 18th International Symposium on Field Programmable Gate Arrays, FPGA 2010, Monterey, California, USA, February 21-23, 2010, pp. 289, 2010, ACM, 978-1-60558-911-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
fpga, technology mapping |
21 | Michael Navon, Alex Samorodnitsky |
Linear Programming Bounds for Codes via a Covering Argument. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 199-207, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Linear programming bounds for codes, Discrete Fourier transform |
21 | Tae-Seok Lee, Jeong-Sik Choi, Jeong Hee Lee, Beom Hee Lee 0001 |
3-D terrain covering and map building algorithm for an AUV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 11-15, 2009, St. Louis, MO, USA, pp. 4420-4425, 2009, IEEE, 978-1-4244-3803-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Andrew L. Burrow |
Algorithm Design Using Traversals of the Covering Relation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Leveraging Semantic Technologies, 17th International Conference on Conceptual Structures, ICCS 2009, Moscow, Russia, July 26-31, 2009. Proceedings, pp. 114-127, 2009, Springer, 978-3-642-03078-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Gerzson Kéri |
The covering radius of extreme binary 2-surjective codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 46(2), pp. 191-198, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 94B75, 05C70, 05C65, 94B25 |
21 | Moshe Laifenfeld, Ari Trachtenberg |
Identifying Codes and Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(9), pp. 3929-3950, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens |
Covering Arrays Avoiding Forbidden Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 296-308, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Claude Carlet, Sihem Mesnager |
Improving the Upper Bounds on the Covering Radii of Binary Reed-Muller Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(1), pp. 162-173, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Florian Diedrich, Klaus Jansen |
An Approximation Algorithm for the General Mixed Packing and Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 128-139, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Chandan Saha 0001, Sandip Das 0001 |
Covering a Set of Points in a Plane Using Two Parallel Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCTA ![In: 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 5-7 March 2007, Kolkata, India, pp. 214-218, 2007, IEEE Computer Society, 978-0-7695-2770-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Dorit S. Hochbaum, Asaf Levin |
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers, pp. 116-127, 2007, Springer, 978-3-540-77917-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, set cover |
21 | William Zhu 0001, Fei-Yue Wang 0001 |
Topological Properties in Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 1, pp. 289-293, 2007, IEEE Computer Society, 0-7695-2874-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Bin Fu, Zhixiang Chen 0001, Mahdi Abdelguerfi |
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 317-326, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Ian Cloete, Jacobus van Zyl |
Fuzzy rule induction in a set covering framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 14(1), pp. 93-110, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Mingen Lin, Yang Yang 0012, Jinhui Xu 0001 |
Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 567-577, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Jochen Könemann, Ojas Parekh, Danny Segev |
A Unified Approach to Approximating Partial Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 468-479, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Érick Alphonse, Aomar Osmani |
On the Connection Between the Phase Transition of the Covering Test and the Learning Success Rate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers, pp. 27-29, 2006, Springer, 978-3-540-73846-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Alexander N. Dolia, Tijl De Bie, Christopher J. Harris 0001, John Shawe-Taylor, D. M. Titterington |
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 630-637, 2006, Springer, 3-540-45375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Nysret Musliu |
Local Search Algorithm for Unicost Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 302-311, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Su Yang, Jianning Liang, Yuanyuan Wang 0001, Adam C. Winstanley |
Feature Selection Based on Run Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PSIVT ![In: Advances in Image and Video Technology, First Pacific Rim Symposium, PSIVT 2006, Hsinchu, Taiwan, December 10-13, 2006, Proceedings, pp. 208-217, 2006, Springer, 3-540-68297-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Iwona Cieslik |
On-line coloring and cliques covering for KKs, t-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 42(1), pp. 1-20, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel |
On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(3), pp. 1182-1189, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Jean-Louis Verger-Gaugry |
Covering a Ball with Smaller Equal Balls in Rn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 33(1), pp. 143-155, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | S. Muthukrishnan 0001, Gopal Pandurangan |
The bin-covering technique for thresholding random geometric graph properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 989-998, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
21 | Dimitri P. Solomatine |
Adaptive cluster covering and evolutionary approach: comparison, differences and similarities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, 2-4 September 2005, Edinburgh, UK, pp. 1959-1966, 2005, IEEE, 0-7803-9363-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Kedar Dhamdhere, Vineet Goyal, R. Ravi 0001, Mohit Singh |
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 367-378, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Parameterized Counting Algorithms for General Graph Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 99-109, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | John H. Holmes, Jennifer A. Sager, Warren B. Bilker |
Three Methods for Covering Missing Input Data in XCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWLCS ![In: Learning Classifier Systems, International Workshops, IWLCS 2003-2005, Revised Selected Papers, pp. 181-192, 2005, Springer, 978-3-540-71230-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Guoli Li, Shuang Hou, Hans-Arno Jacobsen |
A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 25th International Conference on Distributed Computing Systems (ICDCS 2005), 6-10 June 2005, Columbus, OH, USA, pp. 447-457, 2005, IEEE Computer Society, 0-7695-2331-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Junping Zhang, Stan Z. Li, Jue Wang 0004 |
Geometrical Probability Covering Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 223-231, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin |
Covering sharing trees: a compact data structure for parameterized verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 5(2-3), pp. 268-297, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Efficient data structures, Heuristics, Static analysis, Constraints, Symbolic model checking, Infinite-state systems |
21 | Michael G. Dimopoulos, Panagiotis Linardis |
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2004 Design, Automation and Test in Europe Conference and Exposition (DATE 2004), 16-20 February 2004, Paris, France, pp. 194-201, 2004, IEEE Computer Society, 0-7695-2085-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Ian Cloete, Jacobus van Zyl |
A machine learning framework for fuzzy set covering algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC (4) ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 3199-3203, 2004, IEEE, 0-7803-8566-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Hadas Shachnai, Oded Shmueli, Robert Sayegh |
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 111-125, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Porschen |
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 137-146, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
rectangular set cover, integer lattice, NP-completeness, discrete plane |
21 | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters |
A graph covering algorithm for a coarse grain reconfigurable system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2003 Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'03). San Diego, California, USA, June 11-13, 2003, pp. 199-208, 2003, ACM, 1-58113-647-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
template generation, compiler, reconfigurable system |
21 | Rolly Intan, Masao Mukaidono |
Generating Fuzzy Thesaurus by Degree of Similarity in Fuzzy Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 14th International Symposium, ISMIS 2003, Maebashi City, Japan, October 28-31, 2003, Proceedings, pp. 427-432, 2003, Springer, 3-540-20256-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Ralf Franken, Stephen D. Cohen |
The Covering Radius of Some Primitive Ternary BCH Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Finite Fields and Applications ![In: Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, pp. 166-180, 2003, Springer, 3-540-21324-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Vasco M. Manquinho, João P. Marques Silva |
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(5), pp. 505-516, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Jansen, Roberto Solis-Oba |
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 175-186, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Roberto Esposito, Lorenza Saitta |
Is a Greedy Covering Strategy an Extreme Boosting? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 13th International Symposium, ISMIS 2002, Lyon, France, June 27-29, 2002, Proceedings, pp. 94-102, 2002, Springer, 3-540-43785-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
Generalized H-Coloring and H-Covering of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 198-210, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Christian Plessl, Marco Platzner |
Custom Computing Machines for the Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCCM ![In: 10th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2002), 22-24 April 2002, Napa, CA, USA, Proceedings, pp. 163-172, 2002, IEEE Computer Society, 0-7695-1801-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Markus Finger, Thomas Stützle, Helena R. Lourenço |
Exploiting Fitness Distance Correlation of Set Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, pp. 61-71, 2002, Springer, 3-540-43432-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Aravind Srinivasan |
New approaches to covering and packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 567-576, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Negative thinking in branch-and-bound: the case of unate covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(3), pp. 281-294, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Yossi Azar, Leah Epstein |
Approximation Schemes for Covering and Scheduling on Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 39-47, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Tiziano Villa, Timothy Kam, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Explicit and implicit algorithms for binate covering problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(7), pp. 677-691, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | François Vernadat 0001, Pierre Azéma, François Michel |
Covering Step Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1996, 17th International Conference, Osaka, Japan, June 24-28, 1996, Proceedings, pp. 516-535, 1996, Springer, 3-540-61363-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
partial-order, concurrent systems, state space exploration, verification methods |
21 | E. Kolev, Ivan N. Landgev |
On Some Mixed Covering Codes of Small Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic Coding ![In: Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings, pp. 38-50, 1993, Springer, 3-540-57843-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Alain Finkel, Laure Petrucci |
Avoiding State Exposion by Composition of Minimal Covering Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 3rd International Workshop, CAV '91, Aalborg, Denmark, July, 1-4, 1991, Proceedings, pp. 169-180, 1991, Springer, 3-540-55179-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Dorit S. Hochbaum, Wolfgang Maass 0001 |
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(1), pp. 130-136, January 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
21 | Heeralal Janwa, H. F. Mattson Jr. |
Covering Radii of Even Subcodes of t-dense Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Algebraic Algorithms and Error-Correcting Codes, 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985, Proceedings, pp. 120-130, 1985, Springer, 3-540-16776-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
21 | H. F. Mattson Jr. |
An improved upper bound on covering radius. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algorithms and Error-Correcting Codes, 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984, Proceedings, pp. 90-106, 1984, Springer, 3-540-16767-6. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
21 | Gerard Salton |
Covering the computer field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 10(1), pp. 2, 1967. The full citation details ...](Pics/full.jpeg) |
1967 |
DBLP DOI BibTeX RDF |
|
20 | Arijit Bishnu, Mathew C. Francis, Pritam Majumder |
Geometric Covering Number: Covering Points with Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings, pp. 88-102, 2024, Springer, 978-3-031-52212-3. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco |
Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Math. Commun. ![In: Adv. Math. Commun. 17(1), pp. 98-118, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Xiao Shang, Pei Wang, Ronghuo Wu, Hanyu E |
Continuous Mapping of Covering Approximation Spaces and Topologies Induced by Arbitrary Covering Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(10), pp. 1808, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Liang Chen, Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Tao Quan, Juan Chen |
Efficient presolving methods for solving maximal covering and partial set covering location problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 311(1), pp. 73-87, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens |
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.01412, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens |
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.01410, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Lei Yu, Xinmin Hou, Yue Ma, Boyuan Liu |
Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(3), pp. 3, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Liting Xu, Jinjin Li 0001, Peiqiu Yu |
Updating reducts in fuzzy $$\beta $$-covering via matrix approaches while coarsening and refining a covering element. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. Comput. ![In: J. Appl. Math. Comput. 63(1-2), pp. 717-737, June 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez |
Improved covering arrays using covering perfect hash families with groups of restricted entries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 369, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Aditya Potukuchi, Yihan Zhang 0001 |
Improved efficiency for covering codes matching the sphere-covering bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, pp. 102-107, 2020, IEEE, 978-1-7281-6432-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Sang-Eon Han |
Covering rough set structures for a locally finite covering approximation space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 480, pp. 420-437, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Zhengang Zhao |
Maps between covering approximation spaces and the product space of two covering approximation spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 115, pp. 144-156, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Aditya Potukuchi, Yihan Zhang 0001 |
Improved efficiency for explicit covering codes matching the sphere-covering bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.07408, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Jean-François Cordeau, Fabio Furini, Ivana Ljubic |
Benders decomposition for very large scale partial set covering and maximal covering location problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 275(3), pp. 882-896, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens |
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAI ![In: Algebraic Informatics - 8th International Conference, CAI 2019, Niš, Serbia, June 30 - July 4, 2019, Proceedings, pp. 100-111, 2019, Springer, 978-3-030-21362-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Charles J. Colbourn, Erin Lanus, Kaushik Sarkar |
Asymptotic and constructive methods for covering perfect hash families and covering arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 86(4), pp. 907-937, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Zhongzheng Tang, Zhuo Diao |
Approximation algorithms on k-cycle covering and k-clique covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.06867, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(4), pp. 2626-2646, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Guangming Lang, Duoqian Miao, Tian Yang, Mingjie Cai |
Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 346-347, pp. 236-260, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Ali Shakiba, Mohammad Reza Hooshmandasl |
Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 75, pp. 13-38, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Hua Yao, William Zhu 0001 |
Condition for neighbourhoods induced by a covering to be equal to the covering itself. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Granul. Comput. Rough Sets Intell. Syst. ![In: Int. J. Granul. Comput. Rough Sets Intell. Syst. 3(3), pp. 195-205, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Bin Yang 0004, William Zhu 0001 |
Covering-based rough sets on covering-circuit matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: 11th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2014, Xiamen, China, August 19-21, 2014, pp. 49-54, 2014, IEEE, 978-1-4799-5147-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Oded Berman, Zvi Drezner, Dmitry Krass |
Continuous covering and cooperative covering problems with a general decay function on networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 64(11), pp. 1644-1653, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Aymeric Hervieu |
Approche à contraintes pour la sélection de Covering Array. (Covering Array generation using constraint programming). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
20 | Xun Ge, Xiaole Bai, Ziqiu Yun |
Topological characterizations of covering for special covering-based upper approximation operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 204, pp. 70-81, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Yanfang Liu, William Zhu 0001 |
The role of covering matroid in covering-based rough set and matroid ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1209.4978, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Hua Yao, William Zhu 0001 |
Condition for neighborhoods induced by a covering to be equal to the covering itself ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1209.5484, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Qiu Jin, Lingqiang Li, Shoubin Sun |
On covering generalized rough set: Covering rough membership function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012, 29-31 May 2012, Chongqing, China, pp. 239-242, 2012, IEEE, 978-1-4673-0025-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Shiping Wang, Fan Min 0001, William Zhu 0001 |
Covering Numbers in Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC ![In: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 13th International Conference, RSFDGrC 2011, Moscow, Russia, June 25-27, 2011. Proceedings, pp. 72-78, 2011, Springer, 978-3-642-21880-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta |
Covering and radius-covering arrays: Constructions and classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(11), pp. 1158-1180, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | José R. Correa, Asaf Levin |
Monotone Covering Problems with an Additional Covering Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 34(1), pp. 238-248, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Degang Chen 0002, Changzhong Wang, Qinghua Hu |
A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 177(17), pp. 3500-3518, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Tínaz Ekim, Vangelis Th. Paschos |
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 81(5), pp. 569-582, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Maria Madonia, Sergio Salemi, Tecla Sportelli |
Covering Submonoids and Covering Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Lang. Comb. ![In: J. Autom. Lang. Comb. 4(4), pp. 333-350, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Yair Caro, Raphael Yuster |
Covering Graphs: The Covering Problem Solved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 83(2), pp. 273-282, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Zhen Zhang 0010, Chiaming Lo |
Linear inequalities for covering codes: Part II: Triple covering inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 38(6), pp. 1648-1662, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | Charles Delorme, Patrick Solé |
Diameter, Covering Index, Covering Radius and Eigenvalues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 12(2), pp. 95-108, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Ernst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak |
Linear codes with covering radius 2 and other new covering codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 37(1), pp. 219-224, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Zhen Zhang 0010 |
Linear inequalities for covering codes: Part I: Pair covering inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 37(3), pp. 573-582, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Byunghyun Lee, Ki-Seok Chung, Bontae Koo, Nak-Woong Eum, Taewhan Kim |
Thermal sensor allocation and placement for reconfigurable systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 14(4), pp. 50:1-50:23, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
optimal placement, unate-covering problem, reconfigurable system, Thermal sensor |
19 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 348-362, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Geometric hypergraphs, Decompositions, Coloring, Covering |
19 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 231-243, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |