| Year |
Citation |
Score |
| 2020 |
Boros E, Gurvich V, Ho NB, Makino K. On the Sprague–Grundy function of extensions of proper Nim International Journal of Game Theory. 1-20. DOI: 10.1007/S00182-020-00707-3 |
0.301 |
|
| 2019 |
Boros E, Gurvich V, Milanič M. Decomposing 1-Sperner Hypergraphs The Electronic Journal of Combinatorics. 26. DOI: 10.37236/7890 |
0.366 |
|
| 2019 |
Boros E, Gurvich V, Ho NB, Makino K, Mursic P. Sprague-Grundy function of matroids and related hypergraphs Theoretical Computer Science. 799: 40-58. DOI: 10.1016/J.Tcs.2019.09.041 |
0.335 |
|
| 2019 |
Boros E, Gurvich V, Ho NB, Makino K, Mursic P. Sprague–Grundy function of symmetric hypergraphs Journal of Combinatorial Theory, Series A. 165: 176-186. DOI: 10.1016/J.Jcta.2019.02.006 |
0.313 |
|
| 2019 |
Boros E, Čepek O, Gurvich V. Separable discrete functions: Recognition and sufficient conditions Discrete Mathematics. 342: 1275-1292. DOI: 10.1016/J.Disc.2018.12.026 |
0.336 |
|
| 2019 |
Boros E, Crama Y, Rodríguez-Heck E. Compact quadratizations for pseudo-Boolean functions Journal of Combinatorial Optimization. 39: 687-707. DOI: 10.1007/S10878-019-00511-0 |
0.368 |
|
| 2019 |
Boros E, Gurvich V, Milanič M. Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs Journal of Graph Theory. 94: 364-397. DOI: 10.1002/Jgt.22529 |
0.349 |
|
| 2018 |
Boros E, Elbassioni K, Gurvich V, Makino K. Markov decision processes and stochastic games with total effective payoff Annals of Operations Research. 1-29. DOI: 10.1007/S10479-018-2898-8 |
0.351 |
|
| 2017 |
Boros E, Elbassioni K, Gurvich V, Makino K. A convex programming-based algorithm for mean payoff stochastic games with perfect information Optimization Letters. 11: 1499-1512. DOI: 10.1007/S11590-017-1140-Y |
0.37 |
|
| 2017 |
Boros E, Elbassioni K, Fouz M, Gurvich V, Makino K, Manthey B. Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions Algorithmica. 80: 3132-3157. DOI: 10.1007/S00453-017-0372-7 |
0.309 |
|
| 2016 |
Boros E, Chiarelli N, Milanič M. Equistarable bipartite graphs Discrete Mathematics. 339: 1960-1969. DOI: 10.1016/J.Disc.2015.07.009 |
0.374 |
|
| 2016 |
Boros E, Elbassioni K, Gurvich V, Makino K. A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games Dynamic Games and Applications. 8: 22-41. DOI: 10.1007/S13235-016-0199-X |
0.324 |
|
| 2016 |
Anthony M, Boros E, Crama Y, Gruber A. Quadratic reformulations of nonlinear binary optimization problems Mathematical Programming. 162: 115-144. DOI: 10.1007/S10107-016-1032-4 |
0.379 |
|
| 2016 |
Boros E, Elbassioni K, Gurvich V, Makino K. A nested family of k-total effective rewards for positional games International Journal of Game Theory. 1-31. DOI: 10.1007/S00182-016-0532-Z |
0.31 |
|
| 2015 |
Fix A, Gruber A, Boros E, Zabih R. A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields. Ieee Transactions On Pattern Analysis and Machine Intelligence. 37: 1387-95. PMID 26352447 DOI: 10.1109/Tpami.2014.2382109 |
0.335 |
|
| 2015 |
Boros E, Gurvich V. Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games Discrete Mathematics. 338: 2421-2436. DOI: 10.1016/J.Disc.2015.06.010 |
0.408 |
|
| 2015 |
Boros E, Elbassioni K, Gurvich V, Makino K, Oudalov V. Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$ 2 × 2 subgames International Journal of Game Theory. 45: 1111-1131. DOI: 10.1007/S00182-015-0513-7 |
0.302 |
|
| 2014 |
Boros E, Scozzari A, Tardella F, Veneziani P. Polynomially computable bounds for the probability of the union of events Mathematics of Operations Research. 39: 1311-1329. DOI: 10.1287/Moor.2014.0657 |
0.752 |
|
| 2014 |
Boros E, Gurvich V, Milanič M. On CIS circulants Discrete Mathematics. 318: 78-95. DOI: 10.1016/J.Disc.2013.11.015 |
0.344 |
|
| 2014 |
Boros E, Gurvich V, Milanič M. On equistable, split, CIS, and related classes of graphs Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.07.023 |
0.355 |
|
| 2014 |
Boros E, Heggernes P, Van'T Hof P, Milanič M. Vector connectivity in graphs Networks. 63: 277-285. DOI: 10.1002/Net.21545 |
0.43 |
|
| 2013 |
Boros E, Čepek O, Kučera P. A decomposition method for CNF minimality proofs Theoretical Computer Science. 510: 111-126. DOI: 10.1016/J.Tcs.2013.09.016 |
0.362 |
|
| 2013 |
Boros E, Elbassioni K, Gurvich V, Makino K. On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness Operations Research Letters. 41: 357-362. DOI: 10.1016/J.Orl.2013.04.006 |
0.354 |
|
| 2013 |
Boros E, Elbassioni K, Gurvich V, Makino K. A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 220-231. DOI: 10.1016/J.Ic.2019.03.005 |
0.366 |
|
| 2013 |
Boros E, Elbassioni K, Gurvich V, Makino K. On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games Dynamic Games and Applications. 3: 128-161. DOI: 10.1007/S13235-013-0075-X |
0.336 |
|
| 2013 |
Boros E, Gurvich V, Oudalov V. A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory International Journal of Game Theory. 42: 891-915. DOI: 10.1007/S00182-012-0338-6 |
0.336 |
|
| 2012 |
Boros E, Čepek O, Gurvich V. Total tightness implies Nash-solvability for three-person game forms Discrete Mathematics. 312: 1436-1443. DOI: 10.1016/J.Disc.2011.12.028 |
0.302 |
|
| 2012 |
Boros E, Elbassioni K, Gurvich V, Makino K. On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games Discrete Mathematics. 312: 772-788. DOI: 10.1016/J.Disc.2011.11.011 |
0.308 |
|
| 2012 |
Boros E, Grubery A. Hardness results for approximate pure horn CNF formulae minimization International Symposium On Artificial Intelligence and Mathematics, Isaim 2012. DOI: 10.1007/S10472-014-9415-9 |
0.321 |
|
| 2011 |
Boros E, Gurvich V, Makino K, Shao W. Nash-solvable two-person symmetric cycle game forms Discrete Applied Mathematics. 159: 1461-1487. DOI: 10.1016/J.Dam.2011.05.011 |
0.352 |
|
| 2011 |
Boros E, Crama Y, de Werra D, Hansen P, Maffray F. The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models Annals of Operations Research. 188: 1-18. DOI: 10.1007/S10479-011-0913-4 |
0.338 |
|
| 2010 |
Boros E, Elbassioni K, Makino K. Left-to-right multiplication for monotone Boolean dualization Siam Journal On Computing. 39: 3424-3439. DOI: 10.1137/080734881 |
0.344 |
|
| 2010 |
Boros E, Elbassioni K, Gurvich V, Makino K. On effectivity functions of game forms Games and Economic Behavior. 68: 512-531. DOI: 10.1016/J.Geb.2009.09.002 |
0.333 |
|
| 2010 |
Boros E, Gurvich V, Makino K, Papp D. Acyclic, or totally tight, two-person game forms: Characterization and main properties Discrete Mathematics. 310: 1135-1151. DOI: 10.1016/J.Disc.2009.11.009 |
0.313 |
|
| 2010 |
Andrade DV, Boros E, Gurvich V. Not complementary connected and not CIS d-graphs form weakly monotone families Discrete Mathematics. 310: 1089-1096. DOI: 10.1016/J.Disc.2009.11.006 |
0.348 |
|
| 2010 |
Boros E, Goldberg N, Kantor PB, Word J. Optimal sequential inspection policies Annals of Operations Research. 187: 89-119. DOI: 10.1007/S10479-010-0799-6 |
0.326 |
|
| 2010 |
Boros E, Elbassioni K, Gurvich V, Tiwary HR. The negative cycles polyhedron and hardness of checking some polyhedral properties Annals of Operations Research. 188: 63-76. DOI: 10.1007/S10479-010-0690-5 |
0.362 |
|
| 2010 |
Boros E, Gurvich VA, Zverovich IE. Friendship Two-Graphs Graphs and Combinatorics. 26: 617-628. DOI: 10.1007/S00373-010-0914-0 |
0.377 |
|
| 2009 |
Ünlüyurt T, Boros E. A note on "Optimal resource allocation for security in reliability systems" European Journal of Operational Research. 199: 601-603. DOI: 10.1016/J.Ejor.2008.11.034 |
0.326 |
|
| 2009 |
Boros E, Gurvich V, Makino K. Minimal and locally minimal games and game forms Discrete Mathematics. 309: 4456-4468. DOI: 10.1016/J.Disc.2009.01.024 |
0.321 |
|
| 2009 |
Boros E, Gurvich V. Vertex- and edge-minimal and locally minimal graphs Discrete Mathematics. 309: 3853-3865. DOI: 10.1016/J.Disc.2008.10.020 |
0.381 |
|
| 2009 |
Boros E, Čepek O, Kogan A, Kučera P. A subclass of Horn CNFs optimally compressible in polynomial time Annals of Mathematics and Artificial Intelligence. 57: 249-291. DOI: 10.1007/S10472-010-9197-7 |
0.365 |
|
| 2009 |
Boros E, Fedzhora L, Kantor PB, Saeger K, Stroud P. A large-scale linear programming model for finding optimal container inspection strategies Naval Research Logistics. 56: 404-420. DOI: 10.1002/Nav.20349 |
0.666 |
|
| 2008 |
Boros E, Hammer PL, Sun R, Tavares G. A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) Discrete Optimization. 5: 501-529. DOI: 10.1016/J.Disopt.2007.02.001 |
0.649 |
|
| 2008 |
Boros E, Borys K, Gurvich V, Rudolf G. Generating 3-vertex connected spanning subgraphs Discrete Mathematics. 308: 6285-6297. DOI: 10.1016/J.Disc.2007.11.067 |
0.74 |
|
| 2008 |
Boros E, Gurvich V. Scientific contributions of Leo Khachiyan (a short overview) Discrete Applied Mathematics. 156: 2232-2240. DOI: 10.1016/J.Dam.2008.04.023 |
0.324 |
|
| 2008 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V. Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions Discrete Applied Mathematics. 156: 2020-2034. DOI: 10.1016/J.Dam.2007.04.018 |
0.368 |
|
| 2008 |
Boros E, Lei L, Zhao Y, Zhong H. Scheduling vessels and container-yard operations with conflicting objectives Annals of Operations Research. 161: 149-170. DOI: 10.1007/S10479-007-0260-7 |
0.358 |
|
| 2008 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V. Generating All Vertices of a Polyhedron Is Hard Discrete & Computational Geometry. 39: 174-190. DOI: 10.1007/S00454-008-9050-5 |
0.752 |
|
| 2008 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Makino K. Generating cut conjunctions in graphs and related problems Algorithmica (New York). 51: 239-263. DOI: 10.1007/S00453-007-9111-9 |
0.742 |
|
| 2008 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V. On enumerating minimal dicuts and strongly connected subgraphs Algorithmica (New York). 50: 159-172. DOI: 10.1007/S00453-007-9074-X |
0.423 |
|
| 2008 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, Zhao J. On short paths interdiction problems: Total and node-wise limited interdiction Theory of Computing Systems. 43: 204-233. DOI: 10.1007/S00224-007-9025-6 |
0.739 |
|
| 2008 |
Boros E, Gurvich V, Zverovich I. Neighborhood hypergraphs of bipartite graphs Journal of Graph Theory. 58: 69-95. DOI: 10.1002/Jgt.V58:1 |
0.423 |
|
| 2007 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Makino K. ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan) Journal of the Operations Research Society of Japan. 50: 325-338. DOI: 10.15807/Jorsj.50.325 |
0.71 |
|
| 2007 |
Khachiyan L, Boros E, Gurvich V, Elbassioni K. Computing many maximal independent sets for hypergraphs in parallel Parallel Processing Letters. 17: 141-152. DOI: 10.1142/S0129626407002934 |
0.318 |
|
| 2007 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V. On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs Theoretical Computer Science. 382: 139-150. DOI: 10.1016/J.Tcs.2007.03.005 |
0.346 |
|
| 2007 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V, Makino K. Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data Theoretical Computer Science. 379: 361-376. DOI: 10.1016/J.Tcs.2007.02.044 |
0.375 |
|
| 2007 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V. A global parallel algorithm for the hypergraph transversal problem Information Processing Letters. 101: 148-155. DOI: 10.1016/J.Ipl.2006.09.006 |
0.401 |
|
| 2007 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V, Makino K. Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Discrete Applied Mathematics. 155: 137-149. DOI: 10.1016/j.dam.2006.04.032 |
0.326 |
|
| 2007 |
Boros E, Hammer PL, Tavares G. Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) Journal of Heuristics. 13: 99-132. DOI: 10.1007/S10732-007-9009-3 |
0.607 |
|
| 2006 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V. Generating all vertices of a polyhedron is hard Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 758-765. DOI: 10.1145/1109557.1109640 |
0.741 |
|
| 2006 |
Boros E, Gurvich V. Perfect graphs, kernels, and cores of cooperative games Discrete Mathematics. 306: 2336-2354. DOI: 10.1016/J.Disc.2005.12.031 |
0.381 |
|
| 2006 |
Boros E, Elbassioni K, Gurvich V. Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms Journal of Graph Theory. 53: 209-232. DOI: 10.1002/Jgt.V53:3 |
0.389 |
|
| 2005 |
Khachiyan L, Boros E, Elbassioni K, Gurvich V, Makino K. On the complexity of some enumeration problems for matroids Siam Journal On Discrete Mathematics. 19: 966-984. DOI: 10.1137/S0895480103428338 |
0.421 |
|
| 2005 |
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Makino K. Generating cut conjunctions and bridge avoiding extensions in graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3827: 156-165. DOI: 10.1007/11602613_17 |
0.725 |
|
| 2004 |
Boros E, Jamison RE, Laskar RC, Mulder HM. On 3-simplicial vertices in planar graphs Discussiones Mathematicae Graph Theory. 24: 413. DOI: 10.7151/Dmgt.1240 |
0.348 |
|
| 2004 |
Boros E, Gurvich V, Jaslar S, Krasner D. Stable matchings in three-sided systems with cyclic preferences Discrete Mathematics. 289: 1-10. DOI: 10.1016/J.Disc.2004.08.012 |
0.352 |
|
| 2004 |
Boros E, Menkov V. Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis Discrete Applied Mathematics. 144: 43-58. DOI: 10.1016/J.Dam.2004.06.006 |
0.314 |
|
| 2004 |
Boros E, Lari I, Simeone B. Block linear majorants in quadratic 0-1 optimization Discrete Applied Mathematics. 145: 52-71. DOI: 10.1016/J.Dam.2003.09.007 |
0.399 |
|
| 2004 |
Boros E, Gurvich VA, Khachiyan L, Makino K. Dual-bounded generating problems: Weighted transversals of a hypergraph Discrete Applied Mathematics. 142: 1-15. DOI: 10.1016/J.Dam.2002.12.004 |
0.34 |
|
| 2004 |
Boros E, Elbassioni KM, Gurvich V, Khachiyan L. An Efficient Implementation of a Joint Generation Algorithm Lecture Notes in Computer Science. 114-128. DOI: 10.1007/978-3-540-24838-5_9 |
0.383 |
|
| 2004 |
Boros E, Elbassioni K, Gurvich V, Khachiyan L. Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3064: 152-162. |
0.309 |
|
| 2003 |
Boros E, Horiyama T, Ibaraki T, Makino K, Yagiura M. Annals of Mathematics and Artificial Intelligence. 39: 223-257. DOI: 10.1023/A:1024653703689 |
0.356 |
|
| 2003 |
Boros E, Gurvich V, Khachiyan L, Makino K. On maximal frequent and minimal infrequent sets in binary matrices Annals of Mathematics and Artificial Intelligence. 39: 211-221. DOI: 10.1023/A:1024605820527 |
0.322 |
|
| 2003 |
Boros E, Ibaraki T, Makino K. Variations on extending partially defined Boolean functions with missing bits Information and Computation. 180: 53-70. DOI: 10.1016/S0890-5401(02)00012-3 |
0.308 |
|
| 2003 |
Boros E, Gurvich V. On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles Mathematical Social Sciences. 46: 207-241. DOI: 10.1016/S0165-4896(03)00077-5 |
0.361 |
|
| 2003 |
Boros E, Elbassioni K, Gurvich V, Khachiyan L. Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices Mathematical Programming. 98: 355-368. DOI: 10.1007/S10107-003-0408-4 |
0.359 |
|
| 2002 |
Boros E, Elbassioni K, Gurvich V, Khachiyan L, Makino K. Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities Siam Journal On Computing. 31: 1624-1643. DOI: 10.1137/S0097539701388768 |
0.391 |
|
| 2002 |
Boros E, Elbassioni K, Gurvich V, Khachiyan L. Generating dual-bounded hypergraphs Optimization Methods and Software. 17: 749-781. DOI: 10.1080/1055678021000060801 |
0.407 |
|
| 2002 |
Boros E, Hammer PL. Pseudo-Boolean optimization Discrete Applied Mathematics. 123: 155-225. DOI: 10.1016/S0166-218X(01)00341-9 |
0.338 |
|
| 2002 |
Boros E, Gurvich V, Hougardy S. Recursive generation of partitionable graphs Journal of Graph Theory. 41: 259-285. DOI: 10.1002/Jgt.V41:4 |
0.375 |
|
| 2001 |
Boros E, Gurvich V, Khachiyan L, Makino K. Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph Siam Journal On Computing. 30: 2036-2050. DOI: 10.1137/S0097539700370072 |
0.418 |
|
| 2001 |
Randerath B, Speckenmeyer E, Boros E, Hammer P, Kogan A, Makino K, Simeone B, Cepek O. A Satisfiability Formulation of Problems on Level Graphs Electronic Notes in Discrete Mathematics. 9: 269-277. DOI: 10.1016/S1571-0653(04)00327-0 |
0.38 |
|
| 2001 |
Boros E, Caro Y, Füredi Z, Yuster R. Covering non-uniform hypergraphs Journal of Combinatorial Theory. Series B. 82: 270-284. DOI: 10.1006/Jctb.2001.2037 |
0.327 |
|
| 2000 |
Kantor PB, Boros E, Melamed B, Meñkov V, Shapira B, Neu DJ. Capturing human intelligence in the net Communications of the Acm. 43: 112-115. DOI: 10.1145/345124.345162 |
0.701 |
|
| 2000 |
Boros E, Gurvich V, Elbassioni K, Khachiyan L. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension Parallel Processing Letters. 10: 253-266. DOI: 10.1142/S0129626400000251 |
0.391 |
|
| 2000 |
Boros E, Crama Y, Ekin O, Hammer PL, Ibaraki T, Kogan A. Boolean Normal Forms, Shellability, and Reliability Computations Siam Journal On Discrete Mathematics. 13: 212-226. DOI: 10.1137/S089548019732180X |
0.32 |
|
| 2000 |
Boros E, Gurvich V. Stable effectivity functions and perfect graphs Mathematical Social Sciences. 39: 175-194. DOI: 10.1016/S0165-4896(99)00017-7 |
0.413 |
|
| 1999 |
Boros E, Gurvich V, Hammer PL. Dual subimplicants of positive Boolean functions Optimization Methods and Software. 10: 147-156. DOI: 10.1080/10556789808805708 |
0.374 |
|
| 1999 |
Boros E, Ünlüyurt T. Diagnosing double regular systems Annals of Mathematics and Artificial Intelligence. 26: 171-191. DOI: 10.1023/A:1018958928835 |
0.302 |
|
| 1999 |
Boros E. Maximum renamable Horn sub-CNFs Discrete Applied Mathematics. 96: 29-40. DOI: 10.1016/S0166-218X(99)00031-1 |
0.359 |
|
| 1999 |
Boros E, Ibaraki T, Makino K. Logical analysis of binary data with missing bits Artificial Intelligence. 107: 219-263. DOI: 10.1016/S0004-3702(98)00110-6 |
0.35 |
|
| 1999 |
Boros E, Kantor PB, Neu DJ. Pheromonic representation of user quests by digital structures Proceedings of the Asis Annual Meeting. 36: 633-639. |
0.709 |
|
| 1998 |
Badics T, Boros E. Minimization of half-products Mathematics of Operations Research. 23: 649-660. DOI: 10.1287/Moor.23.3.649 |
0.328 |
|
| 1998 |
Boros E. Horn minimization by iterative decomposition Annals of Mathematics and Artificial Intelligence. 23: 321-343. DOI: 10.1023/A:1018932728409 |
0.363 |
|
| 1998 |
Boros E, Gurvich V. A corrected version of the Duchet kernel conjecture Discrete Mathematics. 179: 231-233. DOI: 10.1016/S0012-365X(97)00094-0 |
0.362 |
|
| 1998 |
Boros E, Ibaraki T, Makino K. Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions Information and Computation. 140: 254-283. DOI: 10.1006/Inco.1997.2687 |
0.358 |
|
| 1997 |
Boros E, Gurvich V, Vasin A. Stable families of coalitions and normal hypergraphs Mathematical Social Sciences. 34: 107-123. DOI: 10.1016/S0165-4896(97)00007-3 |
0.306 |
|
| 1997 |
Boros E, Čepek O. On perfect 0,±1 matrices 1,2 Discrete Mathematics. 81-100. DOI: 10.1016/S0012-365X(96)00163-X |
0.312 |
|
| 1997 |
Boros E, Hammer PL, Ibaraki T, Kogan A. Logical analysis of numerical data Mathematical Programming. 79: 163-190. DOI: 10.1007/Bf02614316 |
0.368 |
|
| 1997 |
Bacso G, Boros E, Gurvich V, Maffray F, Preissmann M. On Minimally Imperfect Graphs with Circular Symmetry Journal of Graph Theory. 29: 209-225. DOI: 10.1002/(Sici)1097-0118(199812)29:4<>1.0.Co;2-A |
0.392 |
|
| 1996 |
Boros E, Hwang FK. Optimality of Nested Partitions and Its Application to Cluster Analysis Siam Journal On Optimization. 6: 1153-1162. DOI: 10.1137/S1052623494272399 |
0.336 |
|
| 1996 |
Boros E, Gurvich V. Perfect graphs are kernel solvable Discrete Mathematics. 159: 35-55. DOI: 10.1016/0012-365X(95)00096-F |
0.377 |
|
| 1995 |
Boros E, Gurvich V, Hammer PL, Ibaraki T, Kogan A. Decomposability of partially defined Boolean functions Discrete Applied Mathematics. 62: 51-75. DOI: 10.1016/0166-218X(94)00145-4 |
0.362 |
|
| 1995 |
Boros E, Recski A, Wettl F. Unconstrained multilayer switchbox routing Annals of Operations Research. 58: 481-491. DOI: 10.1007/Bf02057159 |
0.313 |
|
| 1994 |
Boros E, Hammer PL, Hooker JN. Predicting Cause-Effect Relationships from Incomplete Discrete Observations Siam Journal On Discrete Mathematics. 7: 531-543. DOI: 10.1137/S0895480191199385 |
0.316 |
|
| 1994 |
Boros E, Crama Y, Hammer PL, Saks M. Complexity index for satisfiability problems Siam Journal On Computing. 23: 45-49. DOI: 10.1137/S0097539792228629 |
0.306 |
|
| 1994 |
Boros E, Hammer PL, Hartmann ME, Shamir R. Balancing problems in acyclic networks Discrete Applied Mathematics. 49: 77-93. DOI: 10.1016/0166-218X(94)90202-X |
0.338 |
|
| 1994 |
Boros E, Hammer PL, Sun X. Recognition of q-Horn formulae in linear time Discrete Applied Mathematics. 55: 1-13. DOI: 10.1016/0166-218X(94)90033-7 |
0.36 |
|
| 1993 |
Boros E, Hammer PL. Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions Mathematics of Operations Research. 18: 245-253. DOI: 10.1287/Moor.18.1.245 |
0.372 |
|
| 1992 |
Boros E, Crama Y, Hammer PL. Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization Siam Journal On Discrete Mathematics. 5: 163-177. DOI: 10.1137/0405014 |
0.438 |
|
| 1992 |
Boros E, Hammer PL, Shamir R. A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs Ieee Transactions On Computers. 41: 1380-1385. DOI: 10.1109/12.177308 |
0.405 |
|
| 1991 |
Boros E. On shift stable hypergraphs Discrete Mathematics. 87: 81-84. DOI: 10.1016/0012-365X(91)90073-B |
0.314 |
|
| 1991 |
Boros E, Hammer PL. The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds Annals of Operations Research. 33: 151-180. DOI: 10.1007/Bf02115753 |
0.406 |
|
| 1990 |
Boros E, Crama Y, Hammer PL. Upper-bounds for quadratic 0-1 maximization Operations Research Letters. 9: 73-79. DOI: 10.1016/0167-6377(90)90044-6 |
0.343 |
|
| 1990 |
Boros E, Crama Y, Hammer PL. Polynomial-time inference of all valid implications for Horn and related formulae Annals of Mathematics and Artificial Intelligence. 1: 21-32. DOI: 10.1007/Bf01531068 |
0.386 |
|
| 1989 |
Boros E, Prékopa A. Closed Form Two-Sided Bounds for Probabilities that At Leastrand ExactlyrOut ofnEvents Occur Mathematics of Operations Research. 14: 317-342. DOI: 10.1287/Moor.14.2.317 |
0.368 |
|
| 1989 |
Boros E, Prékopa A. Probabilistic bounds and algorithms for the maximum satisfiability problem Annals of Operations Research. 21: 109-126. DOI: 10.1007/Bf02022095 |
0.374 |
|
| 1984 |
Biró M, Boros E. Network flows and non-guillotine cutting patterns European Journal of Operational Research. 16: 215-221. DOI: 10.1016/0377-2217(84)90075-4 |
0.352 |
|
| Show low-probability matches. |