Endre Boros - RankMe

245 papers A* 6A 5B 11C 5Misc 11Journal 190Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Boole's Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions. Math. Oper. Res. Endre Boros, Joonhee Lee
2026	J	`jnl`	Conformality of minimal transversals of maximal cliques. Discret. Math. Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2025	J	`jnl`	Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem. J. Graph Theory Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2025	J	`jnl`	Markov decision processes and stochastic games with total effective payoff. Ann. Oper. Res. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2025	J	`jnl`	On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games. CoRR Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2025	J	`jnl`	Stochastic modeling and optimization in memory of András Prékopa. Ann. Oper. Res. Endre Boros, Michael N. Katehakis, Andrzej Ruszczynski
2024	J	`jnl`	Computing remoteness functions of Moore, Wythoff, and Euclid's games. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2024	J	`jnl`	Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. Int. J. Game Theory Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Mikhail N. Vyalyi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Generating minimal redundant and maximal irredundant subhypergraphs. Discret. Appl. Math. Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Hypergraph Horn Functions. SIAM J. Discret. Math. Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Impartial games with decreasing Sprague-Grundy function and their hypergraph compound. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2024	J	`jnl`	Matroid Horn functions. J. Comb. Theory A Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	On Minimal Transversals of Maximal Cliques in Graphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2024	J	`jnl`	Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
2024	J	`jnl`	Two-person positive shortest path games have Nash equlibria in pure stationary strategies. CoRR Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Mikhail N. Vyalyi
2023	J	`jnl`	Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2023	J	`jnl`	Dually conformal hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2023	J	`jnl`	Hypergraph Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2023	J	`jnl`	Matroid Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2022	J	`jnl`	Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2022	Misc	`conf`	Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions. ISAIM Endre Boros, Joonhee Lee
2022	J	`jnl`	Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. CoRR Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi
2022	J	`jnl`	Optimal Layered Defense For Site Protection. CoRR Tsvetan Asamov, Emre Yamangil, Endre Boros, Paul B. Kantor, Fred S. Roberts
2022	J	`jnl`	Unique key Horn functions. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	Generating clause sequences of a CNF formula. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino
2020	Misc	`conf`	Approximating minimum representations of key Horn functions. ISAIM Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2020	Misc	`conf`	Bounds for the Probability of the Union of Events. ISAIM Joonhee Lee, Endre Boros
2020	J	`jnl`	Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory Endre Boros, Vladimir Gurvich, Martin Milanic
2020	J	`jnl`	Compact quadratizations for pseudo-Boolean functions. J. Comb. Optim. Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Generating clause sequences of a CNF formula. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	On the degree sequences of dual graphs on surfaces. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic
2020	J	`jnl`	Unique key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2019	J	`jnl`	A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2019	J	`jnl`	Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. Endre Boros, Vladimir Gurvich, Martin Milanic
2019	J	`jnl`	Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt
2019	J	`jnl`	Separable discrete functions: Recognition and sufficient conditions. Discret. Math. Endre Boros, Ondrej Cepek, Vladimir Gurvich
2019	J	`jnl`	Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2019	J	`jnl`	Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory A Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2018	J	`jnl`	A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2018	J	`jnl`	A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2018	J	`jnl`	Approximating minimum representations of key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2018	J	`jnl`	Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2018	J	`jnl`	Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2018	J	`jnl`	On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2018	Misc	`conf`	Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. ISAIM Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck
2017	J	`jnl`	A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017	J	`jnl`	A nested family of $\varvec{k}$ -total effective rewards for positional games. Int. J. Game Theory Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017	J	`jnl`	On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Martin Milanic
2017	J	`jnl`	Quadratic reformulations of nonlinear binary optimization problems. Math. Program. Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber
2017	B	`conf`	Strong Duality in Horn Minimization. FCT Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	J	`jnl`	A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2016	Misc	`conf`	A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	J	`jnl`	A three-person chess-like game without Nash equilibria. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2016	J	`jnl`	Equistarable bipartite graphs. Discret. Math. Endre Boros, Nina Chiarelli, Martin Milanic
2016	J	`jnl`	Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis. Comput. Vis. Image Underst. Chaohui Wang, Nikos Komodakis, Hiroshi Ishikawa, Olga Veksler, Endre Boros
2016	J	`jnl`	Quadratization of symmetric pseudo-Boolean functions. Discret. Appl. Math. Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber
2016	J	`jnl`	Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $2 \times 2$ subgames. Int. J. Game Theory Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2015	J	`jnl`	1-Sperner hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2015	J	`jnl`	A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields. IEEE Trans. Pattern Anal. Mach. Intell. Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih
2015	J	`jnl`	A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	Equistarable bipartite graphs. CoRR Endre Boros, Nina Chiarelli, Martin Milanic
2015	A	`conf`	Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. Discret. Math. Endre Boros, Vladimir Gurvich
2014	C	`conf`	A Case of the Container-Vessel Scheduling Problem. ICORES Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei
2014	C	`conf`	A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014	—	`conf`	A Vessel Scheduling Problem with Special Cases. ICORES (Selected Papers) Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei
2014	Misc	`conf`	Cones of Nonnegative Quadratic Pseudo-Boolean Functions. ISAIM Endre Boros, Isabella Lari
2014	J	`jnl`	Hardness results for approximate pure Horn CNF formulae minimization. Ann. Math. Artif. Intell. Endre Boros, Aritanan Gruber
2014	J	`jnl`	Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014	J	`jnl`	On CIS circulants. Discret. Math. Endre Boros, Vladimir Gurvich, Martin Milanic
2014	J	`jnl`	On Quadratization of Pseudo-Boolean Functions. CoRR Endre Boros, Aritanan Gruber
2014	J	`jnl`	Polynomially Computable Bounds for the Probability of the Union of Events. Math. Oper. Res. Endre Boros, Andrea Scozzari, Fabio Tardella, Pierangela Veneziani
2014	J	`jnl`	Quadratization of Symmetric Pseudo-Boolean Functions. CoRR Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber
2014	J	`jnl`	Vector connectivity in graphs. Networks Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	—	`conf`	A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	J	`jnl`	A decomposition method for CNF minimality proofs. Theor. Comput. Sci. Endre Boros, Ondrej Cepek, Petr Kucera
2013	J	`jnl`	A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Vladimir Oudalov
2013	J	`jnl`	On CIS Circulants CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2013	J	`jnl`	On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	J	`jnl`	On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	C	`conf`	Vector Connectivity in Graphs. TAMC Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2012	—	`conf`	Approximate MRF Inference Using Bounded Treewidth Subgraphs. ECCV (1) Alexander Fix, Joyce Chen, Endre Boros, Ramin Zabih
2012	J	`jnl`	Hardness Results for Approximate Pure Horn CNF Formulae Minimization CoRR Endre Boros, Aritanan Gruber
2012	Misc	`conf`	Hardness Results for Approximate Pure Horn CNF Formulae Minimization. ISAIM Aritanan Gruber, Endre Boros
2012	J	`jnl`	On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2012	Misc	`conf`	On quadratization of pseudo-Boolean functions. ISAIM Endre Boros, Aritanan Gruber
2012	J	`jnl`	Total tightness implies Nash-solvability for three-person game forms. Discret. Math. Endre Boros, Ondrej Cepek, Vladimir Gurvich
2011	A*	`conf`	A graph cut algorithm for higher-order Markov Random Fields. ICCV Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih
2011	C	`conf`	Incompatibility graphs and data mining. CTW Endre Boros, Vincenzo Spinelli, Federica Ricca
2011	J	`jnl`	Logical analysis of data: classification with justification. Ann. Oper. Res. Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2011	J	`jnl`	Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao
2011	J	`jnl`	Optimal sequential inspection policies. Ann. Oper. Res. Endre Boros, Noam Goldberg, Paul B. Kantor, Jonathan Word
2011	—	`conf`	Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2011	J	`jnl`	The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Ann. Oper. Res. Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray
2011	J	`jnl`	The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
2010	B	`conf`	A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010	J	`jnl`	Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp
2010	J	`jnl`	Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
2010	J	`jnl`	Friendship Two-Graphs. Graphs Comb. Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2010	J	`jnl`	Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino
2010	J	`jnl`	Not complementary connected and not CIS d-graphs form weakly monotone families. Discret. Math. Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich
2010	J	`jnl`	On effectivity functions of game forms. Games Econ. Behav. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2009	—	`conf`	A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) Endre Boros, Kazuhisa Makino
2009	J	`jnl`	A note on "Optimal resource allocation for security in reliability systems". Eur. J. Oper. Res. Tonguç Ünlüyurt, Endre Boros
2009	J	`jnl`	A subclass of Horn CNFs optimally compressible in polynomial time. Ann. Math. Artif. Intell. Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
2009	J	`jnl`	Minimal and locally minimal games and game forms. Discret. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2009	J	`jnl`	On split and almost CIS-graphs. Australas. J Comb. Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2009	J	`jnl`	Vertex- and edge-minimal and locally minimal graphs. Discret. Math. Endre Boros, Vladimir Gurvich
2008	Misc	`conf`	A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2008	J	`jnl`	A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
2008	J	`jnl`	A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discret. Optim. Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares
2008	J	`jnl`	Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
2008	J	`jnl`	Foreword. Discret. Appl. Math. Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer
2008	J	`jnl`	Generating 3-vertex connected spanning subgraphs. Discret. Math. Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf
2008	J	`jnl`	Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
2008	J	`jnl`	Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2008	J	`jnl`	Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discret. Appl. Math. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2008	J	`jnl`	Neighborhood hypergraphs of bipartite graphs. J. Graph Theory Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2008	—	`conf`	On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino
2008	J	`jnl`	On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2008	J	`jnl`	On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao
2008	—	`ch.`	Optimization Problems for Port-of-Entry Detection Systems. Intelligence and Security Informatics Endre Boros, Elsayed A. Elsayed, Paul B. Kantor, Fred S. Roberts, Minge Xie
2008	J	`jnl`	Preface. Discret. Appl. Math. Martin Anthony, Endre Boros, Alexander Kogan
2008	J	`jnl`	Scheduling vessels and container-yard operations with conflicting objectives. Ann. Oper. Res. Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
2008	J	`jnl`	Scientific contributions of Leo Khachiyan (a short overview). Discret. Appl. Math. Endre Boros, Vladimir Gurvich
2007	J	`jnl`	A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2007	J	`jnl`	Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Process. Lett. Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni
2007	J	`jnl`	Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007	J	`jnl`	Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007	Misc	`conf`	Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
2007	J	`jnl`	Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). J. Heuristics Endre Boros, Peter L. Hammer, Gabriel Tavares
2007	J	`jnl`	Obituary Peter L. Hammer (1936-2006). Bull. EATCS Endre Boros, Yves Crama, Bruno Simeone
2007	J	`jnl`	On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2007	J	`jnl`	Peter L. Hammer (1936-2006). 4OR Endre Boros, Yves Crama, Bruno Simeone
2007	J	`jnl`	Peter Ladislaw Hammer. Discret. Math. Endre Boros, Yves Crama, Bruno Simeone
2007	J	`jnl`	Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. Discret. Optim. Endre Boros, Yves Crama, Bruno Simeone
2007	J	`jnl`	Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. J. Heuristics Endre Boros, Yves Crama, Bruno Simeone
2006	J	`jnl`	An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discret. Appl. Math. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2006	A	`conf`	Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2006	A*	`conf`	Generating all vertices of a polyhedron is hard. SODA Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
2006	J	`jnl`	Perfect graphs, kernels, and cores of cooperative games. Discret. Math. Endre Boros, Vladimir Gurvich
2006	J	`jnl`	Preface. Discret. Appl. Math. Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan
2006	J	`jnl`	Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. J. Graph Theory Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005	Misc	`conf`	A New Algorithm for the Hypergraph Transversal Problem. COCOON Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005	J	`jnl`	Comparison of Convex Hulls and Box Hulls. Ars Comb. Endre Boros, Vladimir Gurvich, Ying Liu
2005	B	`conf`	Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005	B	`conf`	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2005	J	`jnl`	On defining sets for projective planes. Discret. Math. Endre Boros, Tamás Szonyi, Krisztián Tichler
2005	J	`jnl`	On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2004	A	`conf`	Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2004	—	`conf`	An Efficient Implementation of a Joint Generation Algorithm. WEA Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004	J	`jnl`	Block linear majorants in quadratic 0-1 optimization. Discret. Appl. Math. Endre Boros, Isabella Lari, Bruno Simeone
2004	J	`jnl`	Difference graphs. Discret. Math. Endre Boros, Vladimir Gurvich, Roy Meshulam
2004	J	`jnl`	Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004	B	`conf`	Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004	J	`jnl`	Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discret. Appl. Math. Endre Boros, Vladimir Menkov
2004	B	`conf`	Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004	B	`conf`	Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004	J	`jnl`	Introduction to special volume of Discrete Applied Mathematics. Discret. Appl. Math. Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan
2004	J	`jnl`	On 3-simplicial vertices in planar graphs. Discuss. Math. Graph Theory Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder
2004	J	`jnl`	Stable matchings in three-sided systems with cyclic preferences. Discret. Math. Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner
2003	B	`conf`	Algorithms for Enumerating Circuits in Matroids. ISAAC Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003	A	`conf`	An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003	A*	`conf`	An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003	J	`jnl`	An inequality for polymatroid functions and its applications. Discret. Appl. Math. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003	—	`conf`	Combining First and Second Order Features in the TREC 2003 Robust Track. TREC Endre Boros, Paul B. Kantor, David J. Neu
2003	J	`jnl`	Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Math. Program. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003	J	`jnl`	Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2003	J	`jnl`	On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003	J	`jnl`	On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Math. Soc. Sci. Endre Boros, Vladimir Gurvich
2003	J	`jnl`	Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2002	J	`jnl`	Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002	J	`jnl`	Generating dual-bounded hypergraphs. Optim. Methods Softw. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2002	B	`conf`	Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2002	A	`conf`	On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002	J	`jnl`	On the number of vertices belonging to all maximum stable sets of a graph. Discret. Appl. Math. Endre Boros, Martin Charles Golumbic, Vadim E. Levit
2002	J	`jnl`	Pseudo-Boolean optimization. Discret. Appl. Math. Endre Boros, Peter L. Hammer
2002	J	`jnl`	Recursive generation of partitionable graphs. J. Graph Theory Endre Boros, Vladimir Gurvich, Stefan Hougardy
2002	—	`conf`	Rutgers Filtering Work at TREC 2002: Adaptive and Batch. TREC Andrei Anghelescu, Endre Boros, David D. Lewis, Vladimir Menkov, David J. Neu, Paul B. Kantor
2001	J	`jnl`	A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek
2001	J	`jnl`	Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone
2001	J	`jnl`	Covering Non-uniform Hypergraphs. J. Comb. Theory B Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
2001	A*	`conf`	On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000	J	`jnl`	An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Process. Lett. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2000	J	`jnl`	An Implementation of Logical Analysis of Data. IEEE Trans. Knowl. Data Eng. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
2000	J	`jnl`	Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
2000	J	`jnl`	Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000	J	`jnl`	Enabling technologies: capturing human intelligence in the Net. Commun. ACM Paul B. Kantor, Endre Boros, Benjamin Melamed, Vladimir Menkov, Bracha Shapira, David J. Neu
2000	C	`conf`	Finding Essential Attributes in Binary Data. IDEAL Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2000	—	`conf`	Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2000	A*	`conf`	Generating Partial and Multiple Transversals of a Hypergraph. ICALP Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000	—	`conf`	Logical Analysis of Data in the TREC-9 Filtering Track. TREC Endre Boros, Paul B. Kantor, David J. Neu
2000	J	`jnl`	Stable effectivity functions and perfect graphs. Math. Soc. Sci. Endre Boros, Vladimir Gurvich
1999	A*	`conf`	Ant World (demonstration abstract). SIGIR Paul B. Kantor, Endre Boros, Benjamin Melamed, David J. Neu, Vladimir Menkov, Qin Shi, Myung Ho Kim
1999	J	`jnl`	Diagnosing double regular systems. Ann. Math. Artif. Intell. Endre Boros, Tonguç Ünlüyurt
1999	J	`jnl`	Logical Analysis of Binary Data with Missing Bits. Artif. Intell. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1999	J	`jnl`	Maximum Renamable Horn sub-CNFs. Discret. Appl. Math. Endre Boros
1999	J	`jnl`	Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. Discret. Appl. Math. Endre Boros, Peter L. Hammer, Michel Minoux, David J. Rader Jr.
1999	J	`jnl`	Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. Comput. Artif. Intell. Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl
1998	J	`jnl`	A corrected version of the Duchet kernel conjecture. Discret. Math. Endre Boros, Vladimir Gurvich
1998	J	`jnl`	Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1998	J	`jnl`	Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. Endre Boros, Ondrej Cepek, Alexander Kogan
1998	J	`jnl`	Minimization of Half-Products. Math. Oper. Res. Tamás Badics, Endre Boros
1998	J	`jnl`	On minimal imperfect graphs with circular symmetry. J. Graph Theory Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
1997	—	`conf`	Application of Logical Analysis of Data to the TREC-6 Routing Task. TREC Endre Boros, Paul B. Kantor, Jung Jin Lee, Kwong Bor Ng, Di Zhao
1997	J	`jnl`	Logical analysis of numerical data. Math. Program. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
1997	B	`conf`	Monotone Extensions of Boolean Data Sets. ALT Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1997	J	`jnl`	On perfect 0, +/- 1 matrices Discret. Math. Endre Boros, Ondrej Cepek
1997	J	`jnl`	Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. SIAM J. Comput. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
1996	—	`conf`	Boolean Analysis of Incomplete Examples. SWAT Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1996	J	`jnl`	On the number of flats spanned by a set of points in PG(d, q). Discret. Math. Endre Boros, Roy Meshulam
1996	J	`jnl`	Optimality of Nested Partitions and Its Application to Cluster Analysis. SIAM J. Optim. Endre Boros, Frank K. Hwang
1996	J	`jnl`	Perfect graphs are kernel solvable. Discret. Math. Endre Boros, Vladimir Gurvich
1995	J	`jnl`	Boolean regression. Ann. Oper. Res. Endre Boros, Peter L. Hammer, John N. Hooker
1995	J	`jnl`	Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
1995	J	`jnl`	Preface. Discret. Appl. Math. Endre Boros
1995	J	`jnl`	Unconstrained multilayer switchbox routing. Ann. Oper. Res. Endre Boros, András Recski, Ferenc Wettl
1994	J	`jnl`	A Complexity Index for Satisfiability Problems. SIAM J. Comput. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
1994	J	`jnl`	Balancing Problems in Acyclic Networks. Discret. Appl. Math. Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir
1994	J	`jnl`	Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discret. Math. Endre Boros, Peter L. Hammer, John N. Hooker
1994	J	`jnl`	Recognition of q-Horn Formulae in Linear Time. Discret. Appl. Math. Endre Boros, Peter L. Hammer, Xiaorong Sun
1993	J	`jnl`	Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. Math. Oper. Res. Endre Boros, Peter L. Hammer
1992	B	`conf`	A Complexity Index for Satisfiability Problems. IPCO Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
1992	J	`jnl`	A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. IEEE Trans. Computers Endre Boros, Peter L. Hammer, Ron Shamir
1992	J	`jnl`	Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. SIAM J. Discret. Math. Endre Boros, Yves Crama, Peter L. Hammer
1991	—	`conf`	Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
1991	—	`conf`	Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees. Network Flows And Matching Tamás Badics, Endre Boros
1991	J	`jnl`	On shift stable hypergraphs. Discret. Math. Endre Boros
1991	J	`jnl`	On the Existence of a Feasible Flow in a Stochastic Transportation Network. Oper. Res. András Prékopa, Endre Boros
1991	J	`jnl`	The existence of non-trivial hyperfactorization of K Comb. Endre Boros, Dieter Jungnickel, Scott A. Vanstone
1991	J	`jnl`	The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. Endre Boros, Peter L. Hammer
1990	J	`jnl`	Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. Ann. Math. Artif. Intell. Endre Boros, Yves Crama, Peter L. Hammer
1989	J	`jnl`	Closed Form Two-Sided Bounds for Probabilities that At Least Math. Oper. Res. Endre Boros, András Prékopa
1989	J	`jnl`	Maximal intersecting families and affine regular polygons in J. Comb. Theory A Endre Boros, Zoltán Füredi, Jeff Kahn
1989	J	`jnl`	On Representing Sylvester- Gallai Designs. Discret. Comput. Geom. Endre Boros, Zoltán Füredi, Leroy M. Kelly
1989	J	`jnl`	On clustering problems with connected optima in euclidean spaces. Discret. Math. Endre Boros, Peter L. Hammer
1989	—	`conf`	The Use of Binomial Monments for Bounding Network Reliability. Reliability Of Computer And Communication Networks András Prékopa, Endre Boros, Keh-Wei Lih
1988	J	`jnl`	Rectangular Dissections of a Square. Eur. J. Comb. Endre Boros, Zoltán Füredi
1987	J	`jnl`	On a linear diophantine problem for geometrical type sequences. Discret. Math. Endre Boros
1986	J	`jnl`	On the complexity of the surrogate dual of 0-1 programming. Z. Oper. Research Endre Boros
1986	J	`jnl`	On the sharpness of a theorem of B. Segre. Comb. Endre Boros, Tamás Szonyi