| 2008 |
|---|
| 112 | EE | 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 |
| 111 | EE | Endre Boros,
Khaled M. Elbassioni,
Kazuhisa Makino:
On Berge Multiplication for Monotone Boolean Dualization.
ICALP (1) 2008: 48-59 |
| 110 | EE | 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 |
| 109 | EE | Leonid Khachiyan,
Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.
Algorithmica 50(1): 159-172 (2008) |
| 108 | EE | 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) |
| 107 | EE | Endre Boros,
Lei Lei,
Yao Zhao,
Hua Zhong:
Scheduling vessels and container-yard operations with conflicting objectives.
Annals OR 161(1): 149-170 (2008) |
| 106 | EE | 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) |
| 105 | EE | 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) |
| 104 | EE | 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) |
| 103 | EE | Endre Boros,
Vladimir Gurvich:
Scientific contributions of Leo Khachiyan (a short overview).
Discrete Applied Mathematics 156(11): 2232-2240 (2008) |
| 102 | EE | Dominique de Werra,
Endre Boros,
Jacques Carlier,
Alain Hertz,
Marino Widmer:
Foreword.
Discrete Applied Mathematics 156(13): 2437-2438 (2008) |
| 101 | EE | Martin Anthony,
Endre Boros,
Alexander Kogan:
Preface.
Discrete Applied Mathematics 156(6): 823 (2008) |
| 100 | EE | Endre Boros,
Konrad Borys,
Vladimir Gurvich,
Gábor Rudolf:
Generating 3-vertex connected spanning subgraphs.
Discrete Mathematics 308(24): 6285-6297 (2008) |
| 99 | EE | 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) |
| 98 | EE | 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) |
| 97 | EE | Endre Boros,
Vladimir Gurvich,
Igor E. Zverovich:
Neighborhood hypergraphs of bipartite graphs.
Journal of Graph Theory 58(1): 69-95 (2008) |
| 96 | EE | 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) |
| 2007 |
|---|
| 95 | EE | 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 |
| 94 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter L. Hammer (1936-2006).
4OR 5(1): 1-4 (2007) |
| 93 | EE | 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) |
| 92 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer.
Discrete Mathematics 307(17-18): 2153-2155 (2007) |
| 91 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
Discrete Optimization 4(3-4): 257-259 (2007) |
| 90 | EE | 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) |
| 89 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
J. Heuristics 13(2): 95-98 (2007) |
| 88 | EE | Endre Boros,
Peter L. Hammer,
Gabriel Tavares:
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO).
J. Heuristics 13(2): 99-132 (2007) |
| 87 | EE | 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) |
| 86 | EE | 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) |
| 85 | EE | 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) |
| 2006 |
|---|
| 84 | EE | 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 |
| 83 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich:
Generating all vertices of a polyhedron is hard.
SODA 2006: 758-765 |
| 82 | EE | 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) |
| 81 | EE | Martin Anthony,
Endre Boros,
Peter L. Hammer,
Alexander Kogan:
Preface.
Discrete Applied Mathematics 154(7): 1037 (2006) |
| 80 | EE | Endre Boros,
Vladimir Gurvich:
Perfect graphs, kernels, and cores of cooperative games.
Discrete Mathematics 306(19-20): 2336-2354 (2006) |
| 79 | EE | 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) |
| 2005 |
|---|
| 78 | EE | Leonid Khachiyan,
Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich:
A New Algorithm for the Hypergraph Transversal Problem.
COCOON 2005: 767-776 |
| 77 | EE | 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 |
| 76 | EE | 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 |
| 75 | | Endre Boros,
Vladimir Gurvich,
Ying Liu:
Comparison of Convex Hulls and Box Hulls.
Ars Comb. 77: (2005) |
| 74 | EE | Endre Boros,
Tamás Szonyi,
Krisztián Tichler:
On defining sets for projective planes.
Discrete Mathematics 303(1-3): 17-31 (2005) |
| 73 | EE | 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) |
| 2004 |
|---|
| 72 | EE | 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 |
| 71 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan:
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
IPCO 2004: 152-162 |
| 70 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.
LATIN 2004: 488-498 |
| 69 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs.
MFCS 2004: 298-309 |
| 68 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan:
An Efficient Implementation of a Joint Generation Algorithm.
WEA 2004: 114-128 |
| 67 | EE | 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) |
| 66 | EE | 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) |
| 65 | EE | 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) |
| 64 | EE | Endre Boros,
Isabella Lari,
Bruno Simeone:
Block linear majorants in quadratic 0-1 optimization.
Discrete Applied Mathematics 145(1): 52-71 (2004) |
| 63 | EE | Endre Boros,
Vladimir Gurvich,
Roy Meshulam:
Difference graphs.
Discrete Mathematics 276(1-3): 59-64 (2004) |
| 62 | EE | 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) |
| 2003 |
|---|
| 61 | EE | 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 |
| 60 | EE | 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 |
| 59 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan:
Algorithms for Enumerating Circuits in Matroids.
ISAAC 2003: 485-494 |
| 58 | EE | Endre Boros,
Paul B. Kantor,
David J. Neu:
Combining First and Second Order Features in the TREC 2003 Robust Track.
TREC 2003: 544-546 |
| 57 | | 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) |
| 56 | | 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) |
| 55 | EE | 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) |
| 54 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput. 180(1): 53-70 (2003) |
| 2002 |
|---|
| 53 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems.
MFCS 2002: 143-154 |
| 52 | EE | Endre Boros,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.
STACS 2002: 133-141 |
| 51 | EE | Andrei Anghelescu,
Endre Boros,
David Lewis,
Vladimir Menkov,
David J. Neu,
Paul B. Kantor:
Rutgers Filtering Work at TREC 2002: Adaptive and Batch.
TREC 2002 |
| 50 | | Endre Boros,
Peter L. Hammer:
Pseudo-Boolean optimization.
Discrete Applied Mathematics 123(1-3): 155-225 (2002) |
| 49 | | 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) |
| 48 | EE | 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) |
| 2001 |
|---|
| 47 | EE | 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 |
| 46 | | 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) |
| 45 | EE | 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) |
| 44 | EE | Endre Boros,
Yair Caro,
Zoltán Füredi,
Raphael Yuster:
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B 82(2): 270-284 (2001) |
| 2000 |
|---|
| 43 | EE | Endre Boros,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph.
ICALP 2000: 588-599 |
| 42 | EE | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes in Binary Data.
IDEAL 2000: 133-138 |
| 41 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
IFIP TCS 2000: 257-272 |
| 40 | EE | Endre Boros,
Paul B. Kantor,
David J. Neu:
Logical Analysis of Data in the TREC-9 Filtering Track.
TREC 2000 |
| 39 | EE | 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) |
| 38 | EE | 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) |
| 37 | | 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) |
| 36 | EE | 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) |
| 35 | EE | 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) |
| 1999 |
|---|
| 34 | EE | Paul B. Kantor,
Endre Boros,
Benjamin Melamed,
David J. Neu,
Vladimir Menkov,
Qin Shi,
Myung Ho Kim:
Ant World (demonstration abstract).
SIGIR 1999: 323 |
| 33 | | Endre Boros,
Tonguç Ünlüyurt:
Diagnosing double regular systems.
Ann. Math. Artif. Intell. 26(1-4): 171-191 (1999) |
| 32 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits.
Artif. Intell. 107(2): 219-263 (1999) |
| 31 | | 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) |
| 30 | EE | 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) |
| 29 | EE | Endre Boros:
Maximum Renamable Horn sub-CNFs.
Discrete Applied Mathematics 96-97: 29-40 (1999) |
| 1998 |
|---|
| 28 | | Endre Boros,
Ondrej Cepek,
Alexander Kogan:
Horn Minimization by Iterative Decomposition.
Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998) |
| 27 | EE | Endre Boros,
Vladimir Gurvich:
A corrected version of the Duchet kernel conjecture.
Discrete Mathematics 179(1-3): 231-233 (1998) |
| 26 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput. 140(2): 254-283 (1998) |
| 1997 |
|---|
| 25 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets.
ALT 1997: 161-175 |
| 24 | EE | 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 |
| 23 | EE | Endre Boros,
Ondrej Cepek:
On perfect 0, +/- 1 matrices, .
Discrete Mathematics 165-166: 81-100 (1997) |
| 22 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Logical analysis of numerical data.
Math. Program. 79: 163-190 (1997) |
| 21 | | 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) |
| 1996 |
|---|
| 20 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Boolean Analysis of Incomplete Examples.
SWAT 1996: 440-451 |
| 19 | EE | Endre Boros,
Vladimir Gurvich:
Perfect graphs are kernel solvable.
Discrete Mathematics 159(1-3): 35-55 (1996) |
| 1995 |
|---|
| 18 | EE | Endre Boros:
Preface.
Discrete Applied Mathematics 60(1-3): 1 (1995) |
| 17 | EE | 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 |
|---|
| 16 | | Endre Boros,
Peter L. Hammer,
Mark E. Hartmann,
Ron Shamir:
Balancing Problems in Acyclic Networks.
Discrete Applied Mathematics 49(1-3): 77-93 (1994) |
| 15 | EE | Endre Boros,
Peter L. Hammer,
Xiaorong Sun:
Recognition of q-Horn Formulae in Linear Time.
Discrete Applied Mathematics 55(1): 1-13 (1994) |
| 14 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
SIAM J. Comput. 23(1): 45-49 (1994) |
| 13 | EE | 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 |
|---|
| 12 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
IPCO 1992: 220-226 |
| 11 | | Endre Boros,
Peter L. Hammer,
Ron Shamir:
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs.
IEEE Trans. Computers 41(11): 1380-1385 (1992) |
| 10 | | 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) |
| 1991 |
|---|
| 9 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
ISA 1991: 104-115 |
| 8 | | Endre Boros,
Dieter Jungnickel,
Scott A. Vanstone:
The existence of non-trivial hyperfactorization of K2n.
Combinatorica 11(1): 9-15 (1991) |
| 7 | EE | Endre Boros:
On shift stable hypergraphs.
Discrete Mathematics 87(1): 81-84 (1991) |
| 1990 |
|---|
| 6 | | 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) |
| 1989 |
|---|
| 5 | | Endre Boros,
Zoltán Füredi,
L. M. Kelly:
On Representing Sylvester- Gallai Designs.
Discrete & Computational Geometry 4: 345-348 (1989) |
| 4 | EE | Endre Boros,
Peter L. Hammer:
On clustering problems with connected optima in euclidean spaces.
Discrete Mathematics 75(1-3): 81-88 (1989) |
| 3 | EE | 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 |
|---|
| 2 | EE | Endre Boros:
On a linear diophantine problem for geometrical type sequences.
Discrete Mathematics 66(1-2): 27-33 (1987) |
| 1986 |
|---|
| 1 | | Endre Boros,
Tamás Szonyi:
On the sharpness of a theorem of B. Segre.
Combinatorica 6(3): 261-268 (1986) |
