default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEndre Boros
Person information
- affiliation: Rutgers University, Center for Operations Research (RUTCOR)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j155]Endre Boros, Ondrej Cepek, Vladimir Gurvich
, Kazuhisa Makino:
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336(3): 2091-2110 (2024)- [j154]Endre Boros, Kazuhisa Makino:
Generating minimal redundant and maximal irredundant subhypergraphs. Discret. Appl. Math. 358: 217-229 (2024) - [j153]Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Mikhail N. Vyalyi:
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. Int. J. Game Theory 53(2): 449-473 (2024) - [j152]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. J. Comb. Theory A 203: 105838 (2024) - [j151]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn Functions. SIAM J. Discret. Math. 38(2): 1417-1437 (2024) - [j150]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - [i27]Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno:
On Minimal Transversals of Maximal Cliques in Graphs. CoRR abs/2405.10789 (2024) - [i26]Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Mikhail N. Vyalyi:
Two-person positive shortest path games have Nash equlibria in pure stationary strategies. CoRR abs/2410.09257 (2024) - 2023
- [i25]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn functions. CoRR abs/2301.05461 (2023) - [i24]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. CoRR abs/2301.06642 (2023) - [i23]Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno:
Dually conformal hypergraphs. CoRR abs/2309.00098 (2023) - [i22]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi:
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR abs/2311.02685 (2023) - 2022
- [j149]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51(1): 116-138 (2022) - [j148]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. Theor. Comput. Sci. 922: 170-178 (2022) - [c54]Endre Boros, Joonhee Lee:
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions. ISAIM 2022 - [i21]Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi:
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. CoRR abs/2202.11554 (2022) - [i20]Tsvetan Asamov, Emre Yamangil, Endre Boros, Paul B. Kantor, Fred S. Roberts:
Optimal Layered Defense For Site Protection. CoRR abs/2204.08961 (2022) - 2021
- [j147]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino:
On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory 50(3): 635-654 (2021) - [j146]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856: 68-74 (2021) - 2020
- [j145]Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck:
Compact quadratizations for pseudo-Boolean functions. J. Comb. Optim. 39(3): 687-707 (2020) - [j144]Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory 94(3): 364-397 (2020) - [c53]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. ISAIM 2020 - [c52]Joonhee Lee, Endre Boros:
Bounds for the Probability of the Union of Events. ISAIM 2020 - [d2]Vladimir Gurvich, Endre Boros, Martin Milanic, Jernej Vicic:
Non realizable degree sequences of dual graphs on surfaces. Version 1. Zenodo, 2020 [all versions]
- [d1]Vladimir Gurvich, Endre Boros, Martin Milanic, Jernej Vicic:
Non realizable degree sequences of dual graphs on surfaces. Version 2. Zenodo, 2020 [all versions] - [i19]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i18]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. CoRR abs/2002.06964 (2020) - [i17]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR abs/2006.04428 (2020) - [i16]Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic:
On the degree sequences of dual graphs on surfaces. CoRR abs/2008.00573 (2020)
2010 – 2019
- 2019
- [j143]Endre Boros, Vladimir Gurvich, Martin Milanic:
Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. 26(3): 3 (2019) - [j142]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Separable discrete functions: Recognition and sufficient conditions. Discret. Math. 342(5): 1275-1292 (2019) - [j141]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. 267: 74-95 (2019) - [j140]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory A 165: 176-186 (2019) - [j139]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799: 40-58 (2019) - [i15]Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt:
Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports 9(5): 89-109 (2019) - 2018
- [j138]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica 80(11): 3132-3157 (2018) - [j137]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. 239: 1-14 (2018) - [j136]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243: 21-38 (2018) - [j135]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. 8(1): 22-41 (2018) - [c51]Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck:
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. ISAIM 2018 - [i14]Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR abs/1805.03405 (2018) - [i13]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. CoRR abs/1811.05160 (2018) - 2017
- [j134]Endre Boros, Vladimir Gurvich, Martin Milanic:
On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216: 47-66 (2017) - [j133]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A nested family of \(\varvec{k}\) -total effective rewards for positional games. Int. J. Game Theory 46(1): 263-293 (2017) - [j132]Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratic reformulations of nonlinear binary optimization problems. Math. Program. 162(1-2): 115-144 (2017) - [j131]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. 11(8): 1499-1512 (2017) - [c50]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
Strong Duality in Horn Minimization. FCT 2017: 123-135 - 2016
- [j130]Chaohui Wang, Nikos Komodakis, Hiroshi Ishikawa, Olga Veksler, Endre Boros:
Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis. Comput. Vis. Image Underst. 143: 52-53 (2016) - [j129]Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratization of symmetric pseudo-Boolean functions. Discret. Appl. Math. 203: 1-12 (2016) - [j128]Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. Discret. Math. 339(7): 1960-1969 (2016) - [j127]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames. Int. J. Game Theory 45(4): 1111-1131 (2016) - [c49]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM 2016 - [i12]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR abs/1610.06681 (2016) - [i11]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person chess-like game without Nash equilibria. CoRR abs/1610.07701 (2016) - 2015
- [j126]Endre Boros, Vladimir Gurvich:
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. Discret. Math. 338(12): 2421-2436 (2015) - [j125]Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih:
A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields. IEEE Trans. Pattern Anal. Mach. Intell. 37(7): 1387-1395 (2015) - [c48]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS 2015: 103-115 - [i10]Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. CoRR abs/1502.06343 (2015) - [i9]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR abs/1508.03431 (2015) - [i8]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR abs/1508.03455 (2015) - [i7]Endre Boros, Vladimir Gurvich, Martin Milanic:
1-Sperner hypergraphs. CoRR abs/1510.02438 (2015) - 2014
- [j124]Endre Boros, Aritanan Gruber:
Hardness results for approximate pure Horn CNF formulae minimization. Ann. Math. Artif. Intell. 71(4): 327-363 (2014) - [j123]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS circulants. Discret. Math. 318: 78-95 (2014) - [j122]Endre Boros, Andrea Scozzari, Fabio Tardella, Pierangela Veneziani:
Polynomially Computable Bounds for the Probability of the Union of Events. Math. Oper. Res. 39(4): 1311-1329 (2014) - [j121]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector connectivity in graphs. Networks 63(4): 277-285 (2014) - [c47]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA 2014: 694-709 - [c46]Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei:
A Case of the Container-Vessel Scheduling Problem. ICORES 2014: 63-71 - [c45]Selim Bora, Endre Boros, Lei Lei, W. Art Chaovalitwongse, Gino J. Lim, Hamid R. Parsaei:
A Vessel Scheduling Problem with Special Cases. ICORES (Selected Papers) 2014: 108-125 - [c44]Endre Boros, Isabella Lari:
Cones of Nonnegative Quadratic Pseudo-Boolean Functions. ISAIM 2014 - [i6]Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratization of Symmetric Pseudo-Boolean Functions. CoRR abs/1404.6535 (2014) - [i5]Endre Boros, Aritanan Gruber:
On Quadratization of Pseudo-Boolean Functions. CoRR abs/1404.6538 (2014) - [i4]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR abs/1412.6072 (2014) - 2013
- [j120]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. 3(2): 128-161 (2013) - [j119]Endre Boros, Vladimir Gurvich, Vladimir Oudalov:
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. Int. J. Game Theory 42(4): 891-915 (2013) - [j118]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. 41(4): 357-362 (2013) - [j117]Endre Boros, Ondrej Cepek, Petr Kucera:
A decomposition method for CNF minimality proofs. Theor. Comput. Sci. 510: 111-126 (2013) - [c43]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) 2013: 220-231 - [c42]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector Connectivity in Graphs. TAMC 2013: 331-342 - [i3]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS Circulants. CoRR abs/1302.3498 (2013) - 2012
- [j116]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. 312(4): 772-788 (2012) - [j115]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Total tightness implies Nash-solvability for three-person game forms. Discret. Math. 312(8): 1436-1443 (2012) - [c41]Alexander Fix, Joyce Chen, Endre Boros, Ramin Zabih:
Approximate MRF Inference Using Bounded Treewidth Subgraphs. ECCV (1) 2012: 385-398 - [c40]Endre Boros, Aritanan Gruber:
On quadratization of pseudo-Boolean functions. ISAIM 2012 - [c39]Aritanan Gruber, Endre Boros:
Hardness Results for Approximate Pure Horn CNF Formulae Minimization. ISAIM 2012 - [i2]Endre Boros, Aritanan Gruber:
Hardness Results for Approximate Pure Horn CNF Formulae Minimization. CoRR abs/1204.3529 (2012) - 2011
- [j114]Endre Boros, Noam Goldberg, Paul B. Kantor, Jonathan Word:
Optimal sequential inspection policies. Ann. Oper. Res. 187(1): 89-119 (2011) - [j113]Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray:
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Ann. Oper. Res. 188(1): 1-18 (2011) - [j112]Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1): 33-61 (2011) - [j111]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188(1): 63-76 (2011) - [j110]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao:
Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. 159(15): 1461-1487 (2011) - [c38]Endre Boros, Vincenzo Spinelli, Federica Ricca:
Incompatibility graphs and data mining. CTW 2011: 4-7 - [c37]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158 - [c36]Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih:
A graph cut algorithm for higher-order Markov Random Fields. ICCV 2011: 1020-1027 - 2010
- [j109]Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. 158(2): 81-96 (2010) - [j108]Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich:
Not complementary connected and not CIS d-graphs form weakly monotone families. Discret. Math. 310(5): 1089-1096 (2010) - [j107]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp:
Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. 310(6-7): 1135-1151 (2010) - [j106]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Friendship Two-Graphs. Graphs Comb. 26(5): 617-628 (2010) - [j105]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On effectivity functions of game forms. Games Econ. Behav. 68(2): 512-531 (2010) - [j104]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino:
Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010) - [c35]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354
2000 – 2009
- 2009
- [j103]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
On split and almost CIS-graphs. Australas. J Comb. 43: 163-180 (2009) - [j102]Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
A subclass of Horn CNFs optimally compressible in polynomial time. Ann. Math. Artif. Intell. 57(3-4): 249-291 (2009) - [j101]Endre Boros, Vladimir Gurvich:
Vertex- and edge-minimal and locally minimal graphs. Discret. Math. 309(12): 3853-3865 (2009) - [j100]Endre Boros, Vladimir Gurvich, Kazuhisa Makino:
Minimal and locally minimal games and game forms. Discret. Math. 309(13): 4456-4468 (2009) - [j99]Tonguç Ünlüyurt, Endre Boros:
A note on "Optimal resource allocation for security in reliability systems". Eur. J. Oper. Res. 199(2): 601-603 (2009) - [c34]Endre Boros, Kazuhisa Makino:
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) 2009: 183-194 - 2008
- [j98]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008) - [j97]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008) - [j96]Endre Boros, Lei Lei, Yao Zhao, Hua Zhong:
Scheduling vessels and container-yard operations with conflicting objectives. Ann. Oper. Res. 161(1): 149-170 (2008) - [j95]Martin Anthony, Endre Boros, Alexander Kogan:
Preface. Discret. Appl. Math. 156(6): 823 (2008) - [j94]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discret. Appl. Math. 156(11): 2020-2034 (2008) - [j93]Endre Boros, Vladimir Gurvich:
Scientific contributions of Leo Khachiyan (a short overview). Discret. Appl. Math. 156(11): 2232-2240 (2008) - [j92]Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer:
Foreword. Discret. Appl. Math. 156(13): 2437-2438 (2008) - [j91]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. 39(1-3): 174-190 (2008) - [j90]Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares:
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discret. Optim. 5(2): 501-529 (2008) - [j89]Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf:
Generating 3-vertex connected spanning subgraphs. Discret. Math. 308(24): 6285-6297 (2008) - [j88]Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki:
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. 91-D(3): 781-788 (2008) - [j87]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of bipartite graphs. J. Graph Theory 58(1): 69-95 (2008) - [j86]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao:
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008) - [c33]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109 - [c32]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino:
On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59 - [p1]Endre Boros, Elsayed A. Elsayed, Paul B. Kantor, Fred S. Roberts, Minge Xie:
Optimization Problems for Port-of-Entry Detection Systems. Intelligence and Security Informatics 2008: 319-335 - [i1]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra. CoRR abs/0801.3790 (2008) - 2007
- [j85]Endre Boros, Yves Crama, Bruno Simeone:
Peter L. Hammer (1936-2006). 4OR 5(1): 1-4 (2007) - [j84]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155(2): 137-149 (2007) - [j83]Endre Boros, Yves Crama, Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. Discret. Optim. 4(3-4): 257-259 (2007) - [j82]Endre Boros, Yves Crama, Bruno Simeone:
Peter Ladislaw Hammer. Discret. Math. 307(17-18): 2153-2155 (2007) - [j81]Endre Boros, Yves Crama, Bruno Simeone:
Obituary Peter L. Hammer (1936-2006). Bull. EATCS 91: 227-230 (2007) - [j80]Endre Boros, Yves Crama, Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. J. Heuristics 13(2): 95-98 (2007) - [j79]Endre Boros, Peter L. Hammer, Gabriel Tavares:
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). J. Heuristics 13(2): 99-132 (2007) - [j78]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007) - [j77]Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni:
Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Process. Lett. 17(2): 141-152 (2007) - [j76]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379(3): 361-376 (2007) - [j75]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2): 139-150 (2007) - [c31]Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - 2006
- [j74]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Preface. Discret. Appl. Math. 154(7): 1037 (2006) - [j73]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discret. Appl. Math. 154(16): 2350-2372 (2006) - [j72]Endre Boros, Vladimir Gurvich:
Perfect graphs, kernels, and cores of cooperative games. Discret. Math. 306(19-20): 2336-2354 (2006) - [j71]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. J. Graph Theory 53(3): 209-232 (2006) - [c30]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455 - [c29]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
Generating all vertices of a polyhedron is hard. SODA 2006: 758-765 - 2005
- [j70]Endre Boros, Vladimir Gurvich, Ying Liu:
Comparison of Convex Hulls and Box Hulls. Ars Comb. 77 (2005) - [j69]Endre Boros, Tamás Szonyi, Krisztián Tichler:
On defining sets for projective planes. Discret. Math. 303(1-3): 17-31 (2005) - [j68]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. 19(4): 966-984 (2005) - [c28]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776 - [c27]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165 - [c26]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS 2005: 556-567 - 2004
- [j67]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. 142(1-3): 1-15 (2004) - [j66]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Introduction to special volume of Discrete Applied Mathematics. Discret. Appl. Math. 144(1-2): 1- (2004) - [j65]Endre Boros, Vladimir Menkov:
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discret. Appl. Math. 144(1-2): 43-58 (2004) - [j64]Endre Boros, Isabella Lari, Bruno Simeone:
Block linear majorants in quadratic 0-1 optimization. Discret. Appl. Math. 145(1): 52-71 (2004) - [j63]Endre Boros, Vladimir Gurvich, Roy Meshulam:
Difference graphs. Discret. Math. 276(1-3): 59-64 (2004) - [j62]Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner:
Stable matchings in three-sided systems with cyclic preferences. Discret. Math. 289(1-3): 1-10 (2004) - [j61]Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder:
On 3-simplicial vertices in planar graphs. Discuss. Math. Graph Theory 24(3): 413-421 (2004) - [c25]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133 - [c24]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162 - [c23]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498 - [c22]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 - [c21]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128 - 2003
- [j60]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. 39(3): 211-221 (2003) - [j59]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003) - [j58]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An inequality for polymatroid functions and its applications. Discret. Appl. Math. 131(2): 255-281 (2003) - [j57]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003) - [j56]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Math. Program. 98(1-3): 355-368 (2003) - [j55]Endre Boros, Vladimir Gurvich:
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Math. Soc. Sci. 46(2): 207-241 (2003) - [c20]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567 - [c19]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555 - [c18]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494 - [c17]Endre Boros, Paul B. Kantor, David J. Neu:
Combining First and Second Order Features in the TREC 2003 Robust Track. TREC 2003: 544-546 - 2002
- [j54]Endre Boros, Peter L. Hammer:
Pseudo-Boolean optimization. Discret. Appl. Math. 123(1-3): 155-225 (2002) - [j53]Endre Boros, Martin Charles Golumbic, Vadim E. Levit:
On the number of vertices belonging to all maximum stable sets of a graph. Discret. Appl. Math. 124(1-3): 17-25 (2002) - [j52]Endre Boros, Vladimir Gurvich, Stefan Hougardy:
Recursive generation of partitionable graphs. J. Graph Theory 41(4): 259-285 (2002) - [j51]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating dual-bounded hypergraphs. Optim. Methods Softw. 17(5): 749-781 (2002) - [j50]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31(5): 1624-1643 (2002) - [c16]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 - [c15]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141 - [c14]Andrei Anghelescu, Endre Boros, David D. Lewis, Vladimir Menkov, David J. Neu, Paul B. Kantor:
Rutgers Filtering Work at TREC 2002: Adaptive and Batch. TREC 2002 - 2001
- [j49]Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone:
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115(1-3): 15-36 (2001) - [j48]Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9: 269-277 (2001) - [j47]Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster:
Covering Non-uniform Hypergraphs. J. Comb. Theory B 82(2): 270-284 (2001) - [c13]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103 - 2000
- [j46]Paul B. Kantor, Endre Boros, Benjamin Melamed, Vladimir Menkov, Bracha Shapira, David J. Neu:
Enabling technologies: capturing human intelligence in the Net. Commun. ACM 43(8): 112-115 (2000) - [j45]Endre Boros, Vladimir Gurvich:
Stable effectivity functions and perfect graphs. Math. Soc. Sci. 39(2): 175-194 (2000) - [j44]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Process. Lett. 10(4): 253-266 (2000) - [j43]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. 30(6): 2036-2050 (2000) - [j42]Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. 13(2): 212-226 (2000) - [j41]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik:
An Implementation of Logical Analysis of Data. IEEE Trans. Knowl. Data Eng. 12(2): 292-306 (2000) - [c12]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599 - [c11]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138 - [c10]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS 2000: 257-272 - [c9]Endre Boros, Paul B. Kantor, David J. Neu:
Logical Analysis of Data in the TREC-9 Filtering Track. TREC 2000
1990 – 1999
- 1999
- [j40]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107(2): 219-263 (1999) - [j39]Endre Boros, Tonguç Ünlüyurt:
Diagnosing double regular systems. Ann. Math. Artif. Intell. 26(1-4): 171-191 (1999) - [j38]Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl:
Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. Comput. Artif. Intell. 18(4): 403-413 (1999) - [j37]Endre Boros, Peter L. Hammer, Michel Minoux, David J. Rader Jr.:
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. Discret. Appl. Math. 90(1-3): 69-88 (1999) - [j36]Endre Boros:
Maximum Renamable Horn sub-CNFs. Discret. Appl. Math. 96-97: 29-40 (1999) - [c8]Paul B. Kantor, Endre Boros, Benjamin Melamed, David J. Neu, Vladimir Menkov, Qin Shi, Myung Ho Kim:
Ant World (demonstration abstract). SIGIR 1999: 323 - 1998
- [j35]Endre Boros, Ondrej Cepek, Alexander Kogan:
Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998) - [j34]Endre Boros, Vladimir Gurvich:
A corrected version of the Duchet kernel conjecture. Discret. Math. 179(1-3): 231-233 (1998) - [j33]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. 140(2): 254-283 (1998) - [j32]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. J. Graph Theory 29(4): 209-225 (1998) - [j31]Tamás Badics, Endre Boros:
Minimization of Half-Products. Math. Oper. Res. 23(3): 649-660 (1998) - 1997
- [j30]Endre Boros, Ondrej Cepek:
On perfect 0, +/- 1 matrices, . Discret. Math. 165-166: 81-100 (1997) - [j29]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Logical analysis of numerical data. Math. Program. 79: 163-190 (1997) - [j28]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. SIAM J. Comput. 26(1): 93-109 (1997) - [c7]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175 - [c6]Endre Boros, Paul B. Kantor, Jung Jin Lee, Kwong Bor Ng, Di Zhao:
Application of Logical Analysis of Data to the TREC-6 Routing Task. TREC 1997: 611-617 - 1996
- [j27]Endre Boros, Roy Meshulam:
On the number of flats spanned by a set of points in PG(d, q). Discret. Math. 150(1-3): 407-409 (1996) - [j26]Endre Boros, Vladimir Gurvich:
Perfect graphs are kernel solvable. Discret. Math. 159(1-3): 35-55 (1996) - [j25]Endre Boros, Frank K. Hwang:
Optimality of Nested Partitions and Its Application to Cluster Analysis. SIAM J. Optim. 6(4): 1153-1162 (1996) - [c5]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451 - 1995
- [j24]Endre Boros, Peter L. Hammer, John N. Hooker:
Boolean regression. Ann. Oper. Res. 58(3): 201-226 (1995) - [j23]Endre Boros, András Recski, Ferenc Wettl:
Unconstrained multilayer switchbox routing. Ann. Oper. Res. 58(7): 481-491 (1995) - [j22]Endre Boros:
Preface. Discret. Appl. Math. 60(1-3): 1 (1995) - [j21]Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 62(1-3): 51-75 (1995) - 1994
- [j20]Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir:
Balancing Problems in Acyclic Networks. Discret. Appl. Math. 49(1-3): 77-93 (1994) - [j19]Endre Boros, Peter L. Hammer, Xiaorong Sun:
Recognition of q-Horn Formulae in Linear Time. Discret. Appl. Math. 55(1): 1-13 (1994) - [j18]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. SIAM J. Comput. 23(1): 45-49 (1994) - [j17]Endre Boros, Peter L. Hammer, John N. Hooker:
Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discret. Math. 7(4): 531-543 (1994) - 1993
- [j16]Endre Boros, Peter L. Hammer:
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. Math. Oper. Res. 18(1): 245-253 (1993) - 1992
- [j15]Endre Boros, Yves Crama, Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. SIAM J. Discret. Math. 5(2): 163-177 (1992) - [j14]Endre Boros, Peter L. Hammer, Ron Shamir:
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. IEEE Trans. Computers 41(11): 1380-1385 (1992) - [c4]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. IPCO 1992: 220-226 - 1991
- [j13]Endre Boros, Peter L. Hammer:
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3): 151-180 (1991) - [j12]Endre Boros, Dieter Jungnickel, Scott A. Vanstone:
The existence of non-trivial hyperfactorization of K2n. Comb. 11(1): 9-15 (1991) - [j11]Endre Boros:
On shift stable hypergraphs. Discret. Math. 87(1): 81-84 (1991) - [j10]András Prékopa, Endre Boros:
On the Existence of a Feasible Flow in a Stochastic Transportation Network. Oper. Res. 39(1): 119-129 (1991) - [c3]Tamás Badics, Endre Boros:
Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees. Network Flows And Matching 1991: 43-63 - [c2]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115 - 1990
- [j9]Endre Boros, Yves Crama, Peter L. Hammer:
Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. Ann. Math. Artif. Intell. 1: 21-32 (1990)
1980 – 1989
- 1989
- [j8]Endre Boros, Zoltán Füredi, Leroy M. Kelly:
On Representing Sylvester- Gallai Designs. Discret. Comput. Geom. 4: 345-348 (1989) - [j7]Endre Boros, Peter L. Hammer:
On clustering problems with connected optima in euclidean spaces. Discret. Math. 75(1-3): 81-88 (1989) - [j6]Endre Boros, Zoltán Füredi, Jeff Kahn:
Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory A 52(1): 1-9 (1989) - [j5]Endre Boros, András Prékopa:
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur. Math. Oper. Res. 14(2): 317-342 (1989) - [c1]András Prékopa, Endre Boros, Keh-Wei Lih:
The Use of Binomial Monments for Bounding Network Reliability. Reliability Of Computer And Communication Networks 1989: 197-212 - 1988
- [j4]Endre Boros, Zoltán Füredi:
Rectangular Dissections of a Square. Eur. J. Comb. 9(3): 271-280 (1988) - 1987
- [j3]Endre Boros:
On a linear diophantine problem for geometrical type sequences. Discret. Math. 66(1-2): 27-33 (1987) - 1986
- [j2]Endre Boros, Tamás Szonyi:
On the sharpness of a theorem of B. Segre. Comb. 6(3): 261-268 (1986) - [j1]Endre Boros:
On the complexity of the surrogate dual of 0-1 programming. Z. Oper. Research 30(3) (1986)
Coauthor Index
Khaled M. Elbassioni
aka: Khaled Elbassioni
aka: Khaled Elbassioni
[i26] [j146] [i19] [j141] [j138] [j135] [j133] [j131] [j127] [i12] [c48] [i9] [i8] [c47] [i4] [j120] [j118] [c43] [j116] [j111] [c37] [j105] [j104] [c35] [j98] [j97] [j94] [j91] [j86] [c33] [c32] [i1] [j84] [j78] [j77] [j76] [j75] [c31] [j73] [j71] [c30] [c29] [j68] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [j58] [j56] [c20] [c19] [c18] [j51] [j50] [c16] [c13] [j44]
[j155] [j153] [i27] [i26] [i23] [i22] [i21] [j147] [j144] [d2] [d1] [i16] [j143] [j142] [j141] [j140] [j139] [j138] [j137] [j136] [j135] [i14] [j134] [j133] [j131] [j127] [i12] [i11] [j126] [c48] [i9] [i8] [i7] [j123] [c47] [i4] [j120] [j119] [j118] [c43] [i3] [j116] [j115] [j111] [j110] [c37] [j108] [j107] [j106] [j105] [c35] [j103] [j101] [j100] [j98] [j97] [j94] [j93] [j91] [j89] [j87] [j86] [c33] [i1] [j84] [j78] [j77] [j76] [j75] [c31] [j73] [j72] [j71] [c30] [c29] [j70] [j68] [c28] [c27] [c26] [j67] [j63] [j62] [c25] [c24] [c23] [c22] [c21] [j60] [j58] [j56] [j55] [c20] [c19] [c18] [j52] [j51] [j50] [c16] [c15] [c13] [j45] [j44] [j43] [c12] [j34] [j32] [j26] [j21]
Leonid Khachiyan
aka: Leonid G. Khachiyan
aka: Leonid G. Khachiyan
[j155] [j154] [j152] [j151] [j150] [i25] [i24] [i22] [j149] [j148] [j147] [j146] [c53] [i19] [i18] [i17] [j141] [j140] [j139] [j138] [j137] [j135] [i13] [j133] [j131] [c50] [j127] [c49] [i12] [c48] [i9] [i8] [c47] [i4] [j120] [j118] [c43] [j116] [j112] [j110] [c37] [j107] [j105] [j104] [c35] [j100] [c34] [j97] [c33] [c32] [j84] [j76] [c31] [c30] [j68] [c27] [j67] [c22] [j60] [j59] [j57] [c19] [j50] [c15] [j48] [c13] [j43] [c12] [c11] [c10] [j40] [j33] [c7] [c5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
