| 2022 | ISAIM | Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions. | Endre Boros, Joonhee Lee |
| 2020 | ISAIM | Approximating minimum representations of key Horn functions. | Kristf Brczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino |
| 2020 | ISAIM | Bounds for the Probability of the Union of Events. | Joonhee Lee, Endre Boros |
| 2018 | ISAIM | Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. | Endre Boros, Yves Crama, Elisabeth Rodrguez-Heck |
| 2017 | FCT | Strong Duality in Horn Minimization. | Endre Boros, Ondrej Cepek, Kazuhisa Makino |
| 2016 | ISAIM | A combinatorial min-max theorem and minimization of pure-Horn functions. | Endre Boros, Ondrej Cepek, Kazuhisa Makino |
| 2015 | STACS | Markov Decision Processes and Stochastic Games with Total Effective Payoff. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2014 | COCOA | A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2014 | ICORES | A Case of the Container-Vessel Scheduling Problem. | Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei |
| 2014 | ICORES | A Vessel Scheduling Problem with Special Cases. | Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei |
| 2014 | ISAIM | Cones of Nonnegative Quadratic Pseudo-Boolean Functions. | Endre Boros, Isabella Lari |
| 2013 | ICALP | A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2013 | TAMC | Vector Connectivity in Graphs. | Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2012 | ECCV | Approximate MRF Inference Using Bounded Treewidth Subgraphs. | Alexander Fix, Joyce Chen, Endre Boros, Ramin Zabih |
| 2012 | ISAIM | On quadratization of pseudo-Boolean functions. | Endre Boros, Aritanan Gruber |
| 2012 | ISAIM | Hardness Results for Approximate Pure Horn CNF Formulae Minimization. | Aritanan Gruber, Endre Boros |
| 2011 | ICALP | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey |
| 2011 | ICCV | A graph cut algorithm for higher-order Markov Random Fields. | Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih |
| 2010 | IPCO | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2009 | ICALP | A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. | Endre Boros, Kazuhisa Makino |
| 2008 | CSR | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 22 Subgames. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov |
| 2008 | ICALP | On Berge Multiplication for Monotone Boolean Dualization. | Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino |
| 2007 | COCOON | Generating Minimal k-Vertex Connected Spanning Subgraphs. | Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gbor Rudolf |
| 2006 | ESA | Enumerating Spanning and Connected Subsets in Graphs and Matroids. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2006 | SODA | Generating all vertices of a polyhedron is hard. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich |
| 2005 | COCOON | A New Algorithm for the Hypergraph Transversal Problem. | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2005 | ISAAC | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2005 | MFCS | Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2004 | ESA | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2004 | IPCO | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2004 | LATIN | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2004 | MFCS | Generating Paths and Cuts in Multi-pole (Di)graphs. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2003 | ESA | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2003 | ICALP | An Intersection Inequality for Discrete Distributions and Related Generation Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2003 | ISAAC | Algorithms for Enumerating Circuits in Matroids. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | MFCS | Matroid Intersections, Polymatroid Inequalities, and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | STACS | On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2001 | ICALP | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2000 | ICALP | Generating Partial and Multiple Transversals of a Hypergraph. | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2000 | IDEAL | Finding Essential Attributes in Binary Data. | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
| 1999 | SIGIR | Ant World (demonstration abstract). | Paul B. Kantor, Endre Boros, Benjamin Melamed, David J. Neu, Vladimir Menkov, Qin Shi, Myung Ho Kim |
| 1997 | ALT | Monotone Extensions of Boolean Data Sets. | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
| 1992 | IPCO | A Complexity Index for Satisfiability Problems. | Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks |