Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Endre Boros
2010 – today
- 2013
[j103]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)- [c40]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic: Vector Connectivity in Graphs. TAMC 2013: 331-342
- [i3]
- 2012
- [j102]Endre Boros, Ondrej Cepek, Vladimir Gurvich: Total tightness implies Nash-solvability for three-person game forms. Discrete Mathematics 312(8): 1436-1443 (2012)
- [c39]Alexander Fix, Joyce Chen, Endre Boros, Ramin Zabih: Approximate MRF Inference Using Bounded Treewidth Subgraphs. ECCV (1) 2012: 385-398
- [c38]
- [c37]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
- [j101]Endre Boros, Noam Goldberg, Paul B. Kantor, Jonathan Word: Optimal sequential inspection policies. Annals OR 187(1): 89-119 (2011)
- [j100]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. Annals OR 188(1): 1-18 (2011)
- [j99]Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: Logical analysis of data: classification with justification. Annals OR 188(1): 33-61 (2011)
- [j98]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary: The negative cycles polyhedron and hardness of checking some polyhedral properties. Annals OR 188(1): 63-76 (2011)
- [j97]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao: Nash-solvable two-person symmetric cycle game forms. Discrete Applied Mathematics 159(15): 1461-1487 (2011)
- [c36]Endre Boros, Vincenzo Spinelli, Federica Ricca: Incompatibility graphs and data mining. CTW 2011: 4-7
- [c35]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
- [c34]Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih: A graph cut algorithm for higher-order Markov Random Fields. ICCV 2011: 1020-1027
- 2010
- [j96]Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera: Exclusive and essential sets of implicates of Boolean functions. Discrete Applied Mathematics 158(2): 81-96 (2010)
- [j95]Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich: Not complementary connected and not CIS d-graphs form weakly monotone families. Discrete Mathematics 310(5): 1089-1096 (2010)
- [j94]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp: Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discrete Mathematics 310(6-7): 1135-1151 (2010)
- [j93]Endre Boros, Vladimir Gurvich, Igor E. Zverovich: Friendship Two-Graphs. Graphs and Combinatorics 26(5): 617-628 (2010)
- [j92]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On effectivity functions of game forms. Games and Economic Behavior 68(2): 512-531 (2010)
- [j91]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010)
- [c33]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
- [j90]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)
- [j89]Endre Boros, Vladimir Gurvich: Vertex- and edge-minimal and locally minimal graphs. Discrete Mathematics 309(12): 3853-3865 (2009)
- [j88]Endre Boros, Vladimir Gurvich, Kazuhisa Makino: Minimal and locally minimal games and game forms. Discrete Mathematics 309(13): 4456-4468 (2009)
- [j87]Tonguç Ünlüyurt, Endre Boros: A note on "Optimal resource allocation for security in reliability systems". European Journal of Operational Research 199(2): 601-603 (2009)
- [c32]Endre Boros, Kazuhisa Makino: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) 2009: 183-194
- 2008
- [j86]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)
- [j85]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)
- [j84]Endre Boros, Lei Lei, Yao Zhao, Hua Zhong: Scheduling vessels and container-yard operations with conflicting objectives. Annals OR 161(1): 149-170 (2008)
- [j83]Martin Anthony, Endre Boros, Alexander Kogan: Preface. Discrete Applied Mathematics 156(6): 823 (2008)
- [j82]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. Discrete Applied Mathematics 156(11): 2020-2034 (2008)
- [j81]Endre Boros, Vladimir Gurvich: Scientific contributions of Leo Khachiyan (a short overview). Discrete Applied Mathematics 156(11): 2232-2240 (2008)
- [j80]Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer: Foreword. Discrete Applied Mathematics 156(13): 2437-2438 (2008)
- [j79]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008)
- [j78]Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares: A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discrete Optimization 5(2): 501-529 (2008)
- [j77]Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf: Generating 3-vertex connected spanning subgraphs. Discrete Mathematics 308(24): 6285-6297 (2008)
- [j76]Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki: A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Transactions 91-D(3): 781-788 (2008)
- [j75]Endre Boros, Vladimir Gurvich, Igor E. Zverovich: Neighborhood hypergraphs of bipartite graphs. Journal of Graph Theory 58(1): 69-95 (2008)
- [j74]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)
- [c31]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
- [c30]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 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
- [j73]
- [j72]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007)
- [j71]Endre Boros, Yves Crama, Bruno Simeone: Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. Discrete Optimization 4(3-4): 257-259 (2007)
- [j70]Endre Boros, Yves Crama, Bruno Simeone: Peter Ladislaw Hammer. Discrete Mathematics 307(17-18): 2153-2155 (2007)
- [j69]Endre Boros, Yves Crama, Bruno Simeone: Obituary Peter L. Hammer (1936-2006). Bulletin of the EATCS 91: 227-230 (2007)
- [j68]Endre Boros, Yves Crama, Bruno Simeone: Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. J. Heuristics 13(2): 95-98 (2007)
- [j67]Endre Boros, Peter L. Hammer, Gabriel Tavares: Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). J. Heuristics 13(2): 99-132 (2007)
- [j66]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)
- [j65]Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni: Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Processing Letters 17(2): 141-152 (2007)
- [j64]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)
- [j63]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)
- [c29]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
- [j62]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan: Preface. Discrete Applied Mathematics 154(7): 1037 (2006)
- [j61]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. Discrete Applied Mathematics 154(16): 2350-2372 (2006)
- [j60]Endre Boros, Vladimir Gurvich: Perfect graphs, kernels, and cores of cooperative games. Discrete Mathematics 306(19-20): 2336-2354 (2006)
- [j59]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. Journal of Graph Theory 53(3): 209-232 (2006)
- [c28]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
- [c27]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765
- 2005
- [j58]Endre Boros, Vladimir Gurvich, Ying Liu: Comparison of Convex Hulls and Box Hulls. Ars Comb. 77 (2005)
- [j57]Endre Boros, Tamás Szonyi, Krisztián Tichler: On defining sets for projective planes. Discrete Mathematics 303(1-3): 17-31 (2005)
- [j56]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005)
- [c26]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776
- [c25]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
- [c24]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
- [j55]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-bounded generating problems: weighted transversals of a hypergraph. Discrete Applied Mathematics 142(1-3): 1-15 (2004)
- [j54]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan: Introduction to special volume of Discrete Applied Mathematics. Discrete Applied Mathematics 144(1-2): 1- (2004)
- [j53]Endre Boros, Vladimir Menkov: Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discrete Applied Mathematics 144(1-2): 43-58 (2004)
- [j52]Endre Boros, Isabella Lari, Bruno Simeone: Block linear majorants in quadratic 0-1 optimization. Discrete Applied Mathematics 145(1): 52-71 (2004)
- [j51]Endre Boros, Vladimir Gurvich, Roy Meshulam: Difference graphs. Discrete Mathematics 276(1-3): 59-64 (2004)
- [j50]Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner: Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics 289(1-3): 1-10 (2004)
- [j49]Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder: On 3-simplicial vertices in planar graphs. Discussiones Mathematicae Graph Theory 24(3): 413-421 (2004)
- [c23]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
- [c22]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162
- [c21]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498
- [c20]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
- [c19]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128
- 2003
- [j48]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)
- [j47]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)
- [j46]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003)
- [j45]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003)
- [j44]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)
- [j43]Endre Boros, Vladimir Gurvich: On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Mathematical Social Sciences 46(2): 207-241 (2003)
- [c18]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
- [c17]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
- [c16]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494
- [c15]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
- [j42]Endre Boros, Peter L. Hammer: Pseudo-Boolean optimization. Discrete Applied Mathematics 123(1-3): 155-225 (2002)
- [j41]Endre Boros, Martin Charles Golumbic, Vadim E. Levit: On the number of vertices belonging to all maximum stable sets of a graph. Discrete Applied Mathematics 124(1-3): 17-25 (2002)
- [j40]Endre Boros, Vladimir Gurvich, Stefan Hougardy: Recursive generation of partitionable graphs. Journal of Graph Theory 41(4): 259-285 (2002)
- [j39]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)
- [c14]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154
- [c13]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141
- [c12]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
- [j38]Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone: Combinatorial problems related to origin-destination matrices. Discrete Applied Mathematics 115(1-3): 15-36 (2001)
- [j37]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. Electronic Notes in Discrete Mathematics 9: 269-277 (2001)
- [j36]Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster: Covering Non-uniform Hypergraphs. J. Comb. Theory, Ser. B 82(2): 270-284 (2001)
- [c11]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
- [j35]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)
- [j34]Endre Boros, Vladimir Gurvich: Stable effectivity functions and perfect graphs. Mathematical Social Sciences 39(2): 175-194 (2000)
- [j33]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 Processing Letters 10(4): 253-266 (2000)
- [j32]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)
- [j31]Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discrete Math. 13(2): 212-226 (2000)
- [j30]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)
- [c10]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599
- [c9]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138
- [c8]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS 2000: 257-272
- [c7]Endre Boros, Paul B. Kantor, David J. Neu: Logical Analysis of Data in the TREC-9 Filtering Track. TREC 2000
1990 – 1999
- 1999
- [j29]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107(2): 219-263 (1999)
- [j28]Endre Boros, Tonguç Ünlüyurt: Diagnosing double regular systems. Ann. Math. Artif. Intell. 26(1-4): 171-191 (1999)
- [j27]Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl: Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. Computers and Artificial Intelligence 18(4) (1999)
- [j26]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. Discrete Applied Mathematics 90(1-3): 69-88 (1999)
- [j25]
- [c6]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
- [j24]Endre Boros, Ondrej Cepek, Alexander Kogan: Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998)
- [j23]Endre Boros, Vladimir Gurvich: A corrected version of the Duchet kernel conjecture. Discrete Mathematics 179(1-3): 231-233 (1998)
- [j22]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. 140(2): 254-283 (1998)
- [j21]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann: On minimal imperfect graphs with circular symmetry. Journal of Graph Theory 29(4): 209-225 (1998)
- 1997
- [j20]Endre Boros, Ondrej Cepek: On perfect 0, +/- 1 matrices, . Discrete Mathematics 165-166: 81-100 (1997)
- [j19]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Logical analysis of numerical data. Math. Program. 79: 163-190 (1997)
- [j18]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)
- [c5]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175
- [c4]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
- [j17]Endre Boros, Vladimir Gurvich: Perfect graphs are kernel solvable. Discrete Mathematics 159(1-3): 35-55 (1996)
- [c3]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451
- 1995
- [j16]
- [j15]Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Decomposability of Partially Defined Boolean Functions. Discrete Applied Mathematics 62(1-3): 51-75 (1995)
- 1994
- [j14]Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir: Balancing Problems in Acyclic Networks. Discrete Applied Mathematics 49(1-3): 77-93 (1994)
- [j13]Endre Boros, Peter L. Hammer, Xiaorong Sun: Recognition of q-Horn Formulae in Linear Time. Discrete Applied Mathematics 55(1): 1-13 (1994)
- [j12]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks: A Complexity Index for Satisfiability Problems. SIAM J. Comput. 23(1): 45-49 (1994)
- [j11]Endre Boros, Peter L. Hammer, John N. Hooker: Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discrete Math. 7(4): 531-543 (1994)
- 1992
- [j10]Endre Boros, Yves Crama, Peter L. Hammer: Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. SIAM J. Discrete Math. 5(2): 163-177 (1992)
- [j9]Endre Boros, Peter L. Hammer, Ron Shamir: A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. IEEE Trans. Computers 41(11): 1380-1385 (1992)
- [c2]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks: A Complexity Index for Satisfiability Problems. IPCO 1992: 220-226
- 1991
- [j8]Endre Boros, Dieter Jungnickel, Scott A. Vanstone: The existence of non-trivial hyperfactorization of K2n. Combinatorica 11(1): 9-15 (1991)
- [j7]
- [c1]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami: Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115
- 1990
- [j6]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
- [j5]Endre Boros, Zoltán Füredi, L. M. Kelly: On Representing Sylvester- Gallai Designs. Discrete & Computational Geometry 4: 345-348 (1989)
- [j4]Endre Boros, Peter L. Hammer: On clustering problems with connected optima in euclidean spaces. Discrete Mathematics 75(1-3): 81-88 (1989)
- [j3]Endre Boros, Zoltán Füredi, Jeff Kahn: Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory, Ser. A 52(1): 1-9 (1989)
- 1987
- [j2]Endre Boros: On a linear diophantine problem for geometrical type sequences. Discrete Mathematics 66(1-2): 27-33 (1987)
- 1986
- [j1]Endre Boros, Tamás Szonyi: On the sharpness of a theorem of B. Segre. Combinatorica 6(3): 261-268 (1986)
Coauthor Index
[j103] [i3] [j102] [j98] [j97] [c35] [j95] [j94] [j93] [j92] [c33] [j89] [j88] [j86] [j85] [j82] [j81] [j79] [j77] [j75] [j74] [c31] [i1] [j72] [j66] [j65] [j64] [j63] [c29] [j61] [j60] [j59] [c28] [c27] [j58] [j56] [c26] [c25] [c24] [j55] [j51] [j50] [c23] [c22] [c21] [c20] [c19] [j48] [j46] [j44] [j43] [c18] [c17] [c16] [j40] [j39] [c14] [c13] [c11] [j34] [j33] [j32] [c10] [j23] [j21] [j17] [j15]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:21 CEST by the dblp team