Project Related Activities, Tutorials and Invited Lectures

• Organization of the AI Track at the INFORMS Fall 2004 Meeting (Denver, October 24-27). Talks related to this project:
  • E. Boros: Algorithmic aspects of LAD, Invited tutorial;
  • E. Boros: Justifiable learning, Invited talk.
• V. Gurvich: Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. Presented at the 12th Annual European Symposium on Algorithms (ESA 2004), Bergen, Norway, September 14-17, 2004
• V. Gurvich: Generating Paths and Cuts in Multi-Pole (Di)Graphs. Presented at the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Prague, Czech Republic, August 22-27, 2004
• K. Elbassioni: Geometric generation problems and enumeration of dicuts and strongly connected subgraphs. Presented at the Discrete Algorithm Colloquium, Japanese OR Society, Kyoto University, Kyoto, Japan, June 25, 2004.
• E. Boros: Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. Presented at the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2004), New York, NY, June 9-11, 2004.
• E. Boros: Efficient implementation of a joint generation algorithm. Presented at the 3rd Workshop on Efficient and Experimental Algorithms (WEA 2004), Angra dos Reis, Brazil, May 25-28, 2004.
• V. Gurvich: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. Presented at the 6th Latin American Symposium on Theoretical Informatics (LATIN 2004), Buenos Aires, Argentina, April 5-8, 2004
• K. Elbassioni: On the complexity of some enumeration problems related to data mining. Presented at the Rochester Institute of Technology, March 24, 2004.
• K. Elbassioni: On the complexity of some enumeration problems related to data mining. Presented at the University of Missouri-Rolla, March 18, 2004.
• L.Khachiyan: On enumerating strongly connected subgraphs and dicuts. Presented at McGill University, School of Computer Science, Algorithms Seminar, March 10, 2004
• E. Boros: What can be learned from examples? Invited Plenary Talk at the International Symposium on Discrete Algorithms and Optimization, Kyoto, Japan, March 3-5, 2005.
• V. Gurvich: Algorithms for Enumerating Cycles in Matroids. Presented at the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Kyoto, Japan, December 15-17, 2003.
• V. Gurvich: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. Presented at the 11th Annual European Symposium on Algorithms (ESA 2003), Budapest, Hungary, September 15-20, 2003.
• E. Boros: How to Learn from Examples. Invited plenary talk at JIM 2003, September 3-5, 2003, Metz, France.
• L. Khachiyan: Generating spanning cones and strongly connected digraphs. Presented at Operations Researh 2003, the Annual International Conference of the German Operations Reseach Society, University of Heidelberg, September 3, 2003.
• E. Boros: How to generate many items. Presented at the REU Seminar, DIMACS, Rutgers University, July 30, 2003.
• Organization of a tutorial and three invited sessions at the EURO/INFORMS Joint International Conference, Istanbul, Turkey, July 6-10, 2003. Talks related to the project:
  • E. Boros: Patterns and theories in LAD (tutorial).
  • V. Gurvich: On the complexity of generation.
• K. Elbassioni: An Intersection Inequality for Discrete Distributions and Related Generation Problems. Presented at The 30-th International Colloquium on Automata, Languages and Programming (ICALP 2003), Eindhoven, The Netherlands, June 30 - July 4, 2003.
• E. Boros: Listing all minimal solutions of a monotone system. Presented at the Discrete Algorithm Colloquium, Japanese OR Society, Kyoto University, Kyoto, Japan, May 30, 2003.
• L. Khachiyan: Dual Bounded Monotone Properties. Presented at the Theoretical Computer Science and Discrete Mathematics Seminar, IAS, Princeton, May 5 2003.
• E. Boros: Frequent sets in binary matrices. Presented at the Alfréd Rényi Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary, February 27, 2003.
• E. Boros: Operations Research in Data Analysis. Presented at the Day of Applied Mathematics, Eötvös Loránd University, Budapest, Hungary, February 26, 2003.
• L. Khachiyan: Generating Dual Bounded Hypergraphs. Presented at The First International Conference on Optimization Methods and Software, Hangzhou, China, December 15-18, 2002.
• E. Boros: Justifiable learning. Presented at INFORMS Annual Meeting, San Jose, California, November 17-20, 2002.
• K. Elbassioni: An algorithm for dualization in products of lattices. Presented at 10th European Symposium on Algorithms, University of Rome "La Sapienza", Italy, September 17-21, 2002.
• L. Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. Presented at The 27th International Symposium on Mathematical Foundations of Computer Science, Warszawa - Otwock, Poland, August 26-30, 2002.
• K. Elbassioni: An inequality for polymatroid functions. Presented at Integer Programming Conference in honor of Egon Balas, June 3-5, 2002, Carnegie Mellon University, Pittsburgh, Pennsylvania.
• Organization of a one day workshop on Discrete Mathematics and Data Mining at the 2nd SIAM International Conference on Data Mining, Arlington, Virginia, April 11-13, 2002. Talks related to the project:
  • E. Boros: Strongest patterns in LAD (tutorial).
  • K. Elbassioni: Dual-bounded hypergraphs: a survey.
• E. Boros: On the complexity of generating maximal frequent and minimal infrequent sets. 19th International Symposium on Theoretical Aspects of Computer Science, Antibes Juan-les-Pins, France March 15, 2002.
• K. Elbassioni: On dualization in products of forests. 19th International Symposium on Theoretical Aspects of Computer Science, Antibes Juan-les-Pins, France March 15, 2002.
• Organization of a tutorial and two invited sessions at the 7th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 2-4, 2002. Talks related to the project:
  • E. Boros: Logical analysis of data (tutorial).
  • E. Boros: How to handle categorical variables in machine learning.
  • K. Elbassioni: Learning monotone binary functions in products of lattices.