Publications (in reverse chronological order)

  1. E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan. Generating All Minimal Integral Solutions to AND-OR Systems of Monotone Inequalities: Conjunctions are Easier than Disjunctions. RUTCOR Research Report 41-2004, Rutgers University.
  2. E. Boros, K. Elbassioni and V. Gurvich. Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. In: Algorithms - ESA 2004, 12th Annual European Symposium. (Susanne Albers and Tomasz Radzik, eds., Bergen, Norway, September 14-17, 2004), Lecture Notes in Computer Science 3221 (2004) pp. 122-133, (Springer Verlag, Berlin, Heidelberg, New York).
  3. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, and K. Makino. Generating Paths and Cuts in Multi-Pole (Di)Graphs. In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004. (Fiala, Jirí, Koubek, Václav, and Kratochvíl, Jan, eds., Prague, Czech Republic, August 22-27, 2004), Lecture Notes in Computer Science 3153 (2004) pp. 298-309, (Springer Verlag, Berlin, Heidelberg, New York).
  4. E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan. A Global Parallel Algorithm for Finding All Minimal Transversals of Hypergraphs of Bounded Edge-size. DIMACS Technical Report 2004-31.
  5. E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan. Computing Many Maximal Independent Sets for Sparse Hypergraphs in Parallel. DIMACS Technical Report 2004-44.
  6. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. An Efficient Implementation of a Quasi-Polynomial Algorithm for Generating Hypergraph Transversals and its Application in Joint Generation. Invited contribution, special issue of Discrete Applied Mathematics (ed., H. Ito)
  7. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference. (Bienstock, D. and Nemhauser, G., eds., New York, NY, USA, June 7-11, 2004), Lecture Notes in Computer Science 3064 (2004) pp. 152-162, (Springer Verlag, Berlin, Heidelberg, New York).
  8. E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan. An Efficient Implementation of a Joint Generation Algorithm. In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004. (Ribeiro, Celso C. and Martins, Simone L., eds., Angra dos Reis, Brazil, May 25-28, 2004), Lecture Notes in Computer Science 3059 (2004) pp. 114-128, (Springer Verlag, Berlin, Heidelberg, New York).
  9. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. On Dualization of Hypergraphs with Bounded Edge-Intersections and Other related Classes of Hypergraphs. Invited contribution, special issue of Theoretical Computer Science (ed., M. Farach-Colton).
  10. E. Boros, V. Gurvich and R. Meshulam. Difference Graphs. Discrete Applied Mathematics, 276(1-3) (2004) pp. 59-64.
  11. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. In: 6th Latin American Symposium on Theoretical Informatics (LATIN 2004) (Farach-Colton, Martin, ed., Buenos Aires, Argentina, April 5-8, 2004), Lecture Notes in Computer Science 2976 (2004) pp. 488-498, (Springer Verlag, Berlin, Heidelberg, New York).
  12. E. Boros and V. Meñkov. Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discrete Applied Mathematics, 144 (1-2) (2004) pp. 43-58.
  13. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. DIMACS Technical Report 2003-35, Rutgers University.
  14. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. On the Complexity of Some Enumeration Problems for Matroids. RUTCOR Research Report 15-2003, Rutgers University.
  15. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Generating Problems: Efficient and Inefficient points for Discrete Probability Distributions and Sparse Boxes for Multidimensional Data. Invited contribution, special issue of Theoretical Computer Science (ed., G. Woeginger).
  16. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Algorithms for Enumerating Cycles in Matroids. In: 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003) (T. Ibaraki, N. Katoh and H. Ono, eds., Kyoto, Japan, December 15-17, 2003), Lecture Notes in Computer Science 2906 (2003) pp. 485-494, (Springer Verlag, Berlin, Heidelberg, New York).
  17. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. An Efficient Implementation of a Quasi-Polynomial Algorithm for Generating Hypergraph Transversals. In: 11th Annual European Symposium on Algorithms (ESA 2003), (G. D. Battista and U. Zwick, eds.), Lecture Notes in Computer Science 2832 (2003) pp. 556-567. (Springer Verlag, Berlin, Heidelberg, New York)
  18. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. An Intersection Inequality for Discrete Distributions and Related Generation Problems. In: 30th International Colloquium on Automata, Languages and Programming (ICALP 2003). (J.C.M. Baeten and J.K. Lenstra and J. Parrow and G.J. Woeginger, eds.) Lecture Notes in Computer Science 2719 (2003) pp. 543-555.
  19. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Extending the Balas-Yu Inequality on the Number of Maximal Independent Sets of Graphs to Hypergraphs and Lattice Products with Applications. Mathematical Programming (B), 98(1-3) (2003) pp. 355-368.
  20. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence 39(3) (2003) pp. 211-221.
  21. E. Boros, T. Horiyama, T. Ibaraki, K. Makino and M. Yagiura. Finding Essential Attributes from Binary Data. Annals of Mathematics and Artificial Intelligence 39(3) (2003) pp. 223-257.
  22. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2) (2003) pp. 255-281.
  23. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Generating Problems: Weighted Transversals of a Hypergraph, Discrete Applied Mathematics, 142(1-3) (2004) pp. 1-15.
  24. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Generating Dual-Bounded Hypergraphs. Optimization Methods and Software, 17(5) (2002) pp. 749 - 781.
  25. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM Journal on Computing, 31(1-3) (2002) pp. 1624-1643.
  26. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Matroid Intersections, Polymatroid Inequalities, and Related Problems. In: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), (K. Diks and W. Rytter, eds.), Lecture Notes in Computer Science 2420 (2002) pp. 143-154.
  27. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Hypergraphs: A Survey. In: Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, Arlington, VA, April 11-13, 2002, pp. 87-98.
  28. K. Elbassioni. On dualization in products of forests. In: Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002). (H. Alt and A. Ferreira, eds.), Lecture Notes in Computer Science 2285 (2002) pp. 142-153.
  29. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. On the complexity of generating maximal frequent and minimal infrequent sets in binary matrices. In: Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002). (H. Alt and A. Ferreira, eds.), Lecture Notes in Computer Science 2285 (2002) pp. 133-141.
  30. K. Elbassioni. An algorithm for dualization in products of lattices. In: Proc. 10th Annual European Symposium on Algorithms (ESA 2002). (Rolf H. Möhring and Rajeev Raman, eds.), Lecture Notes in Computer Science, 2461, (2002) pp. 424-435.
  31. T. Imielinski, L. Khachiyan, A. Abdulghani. Cubegrades: Generalizing Association Rules. Data Mining and Knowledge Discovery 6 (2002) pp. 219-256.
  32. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. Generating all minimal integer solutions to a monotone system of linear inequalities. In: Automata, Languanges and Programming, 28th International Colloquium (ICALP 2001). (F. Orejas, P.G. Spirakis and Jan van Leeuwen, eds.), Lecture Notes in Computer Science 2076 (2001) pp. 92-103.
  33. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM Journal on Computing 30(6) (2001) pp. 2036-2050.
  34. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. Weighted Transversals of a Hypergraph. In: Proceedings of 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2001) pp. 13-22.
  35. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Processing Letters 10(4) (2000) pp. 253-266.
  36. E. Boros, V. Gurvich, L. Khachiyan and K. Makino. Generating Partial and Multiple Transversals of a Hypergraph. In: Automata, Languanges and Programming, 27th International Colloquium (ICALP 2000). (Montanari, J.D.P. Rolim and E. Welzl, eds.) Lecture Notes in Computer Science 1853 (2000) pp. 588-599.