The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Endre Boros: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Endre Boros, Yves Crama, Peter L. Hammer
    Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:21-32 [Journal]
  2. Paul B. Kantor, Endre Boros, Benjamin Melamed, Vladimir Menkov, Bracha Shapira, David J. Neu
    Enabling technologies: capturing human intelligence in the Net. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 2000, v:43, n:8, pp:112-115 [Journal]
  3. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Monotone Extensions of Boolean Data Sets. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:161-175 [Conf]
  4. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    A New Algorithm for the Hypergraph Transversal Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:767-776 [Conf]
  5. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:122-133 [Conf]
  6. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:556-567 [Conf]
  7. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Enumerating Spanning and Connected Subsets in Graphs and Matroids. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:444-455 [Conf]
  8. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:92-103 [Conf]
  9. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    An Intersection Inequality for Discrete Distributions and Related Generation Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:543-555 [Conf]
  10. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Generating Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:588-599 [Conf]
  11. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes in Binary Data. [Citation Graph (0, 0)][DBLP]
    IDEAL, 2000, pp:133-138 [Conf]
  12. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:257-272 [Conf]
  13. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
    A Complexity Index for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:220-226 [Conf]
  14. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:152-162 [Conf]
  15. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
    Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:104-115 [Conf]
  16. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Algorithms for Enumerating Circuits in Matroids. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:485-494 [Conf]
  17. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:156-165 [Conf]
  18. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:488-498 [Conf]
  19. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Matroid Intersections, Polymatroid Inequalities, and Related Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:143-154 [Conf]
  20. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Generating Paths and Cuts in Multi-pole (Di)graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:298-309 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:556-567 [Conf]
  22. Paul B. Kantor, Endre Boros, Benjamin Melamed, David J. Neu, Vladimir Menkov, Qin Shi, Myung Ho Kim
    Ant World (demonstration abstract). [Citation Graph (0, 0)][DBLP]
    SIGIR, 1999, pp:323- [Conf]
  23. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
    Generating all vertices of a polyhedron is hard. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:758-765 [Conf]
  24. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:133-141 [Conf]
  25. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Boolean Analysis of Incomplete Examples. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:440-451 [Conf]
  26. Andrei Anghelescu, Endre Boros, David Lewis, Vladimir Menkov, David J. Neu, Paul B. Kantor
    Rutgers Filtering Work at TREC 2002: Adaptive and Batch. [Citation Graph (0, 0)][DBLP]
    TREC, 2002, pp:- [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    TREC, 1997, pp:611-617 [Conf]
  28. Endre Boros, Paul B. Kantor, David J. Neu
    Logical Analysis of Data in the TREC-9 Filtering Track. [Citation Graph (0, 0)][DBLP]
    TREC, 2000, pp:- [Conf]
  29. Endre Boros, Paul B. Kantor, David J. Neu
    Combining First and Second Order Features in the TREC 2003 Robust Track. [Citation Graph (0, 0)][DBLP]
    TREC, 2003, pp:544-546 [Conf]
  30. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An Efficient Implementation of a Joint Generation Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:114-128 [Conf]
  31. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Logical Analysis of Binary Data with Missing Bits. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:107, n:2, pp:219-263 [Journal]
  32. Endre Boros, Ondrej Cepek, Alexander Kogan
    Horn Minimization by Iterative Decomposition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:3-4, pp:321-343 [Journal]
  33. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:211-221 [Journal]
  34. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes from Binary Data. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:223-257 [Journal]
  35. Endre Boros, Tonguç Ünlüyurt
    Diagnosing double regular systems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:171-191 [Journal]
  36. Endre Boros, Vladimir Gurvich, Ying Liu
    Comparison of Convex Hulls and Box Hulls. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  37. Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl
    Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1999, v:18, n:4, pp:- [Journal]
  38. Endre Boros, Dieter Jungnickel, Scott A. Vanstone
    The existence of non-trivial hyperfactorization of K2n. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:9-15 [Journal]
  39. Endre Boros, Tamás Szonyi
    On the sharpness of a theorem of B. Segre. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:261-268 [Journal]
  40. Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan
    Introduction to special volume of Discrete Applied Mathematics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:1-0 [Journal]
  41. Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:7, pp:1037- [Journal]
  42. Endre Boros, Vladimir Menkov
    Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:43-58 [Journal]
  43. Endre Boros
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:1- [Journal]
  44. Endre Boros
    Maximum Renamable Horn sub-CNFs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:29-40 [Journal]
  45. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An inequality for polymatroid functions and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:255-281 [Journal]
  46. Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Decomposability of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:51-75 [Journal]
  47. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Dual-bounded generating problems: weighted transversals of a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:1-15 [Journal]
  48. Endre Boros, Martin Charles Golumbic, Vadim E. Levit
    On the number of vertices belonging to all maximum stable sets of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:17-25 [Journal]
  49. Endre Boros, Peter L. Hammer
    Pseudo-Boolean optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:155-225 [Journal]
  50. Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir
    Balancing Problems in Acyclic Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:77-93 [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:69-88 [Journal]
  52. Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone
    Combinatorial problems related to origin-destination matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:15-36 [Journal]
  53. Endre Boros, Peter L. Hammer, Xiaorong Sun
    Recognition of q-Horn Formulae in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:1, pp:1-13 [Journal]
  54. Endre Boros, Isabella Lari, Bruno Simeone
    Block linear majorants in quadratic 0-1 optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:52-71 [Journal]
  55. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2350-2372 [Journal]
  56. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:137-149 [Journal]
  57. Endre Boros, Zoltán Füredi, L. M. Kelly
    On Representing Sylvester- Gallai Designs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:345-348 [Journal]
  58. Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner
    Stable matchings in three-sided systems with cyclic preferences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:1-10 [Journal]
  59. Endre Boros, Vladimir Gurvich, Roy Meshulam
    Difference graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:59-64 [Journal]
  60. Endre Boros, Tamás Szonyi, Krisztián Tichler
    On defining sets for projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:17-31 [Journal]
  61. Endre Boros, Vladimir Gurvich
    Perfect graphs, kernels, and cores of cooperative games. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2336-2354 [Journal]
  62. Endre Boros, Peter L. Hammer, Gabriel Tavares
    Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:2, pp:99-132 [Journal]
  63. Endre Boros, Yves Crama, Bruno Simeone
    Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:2, pp:95-98 [Journal]
  64. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Variations on extending partially defined Boolean functions with missing bits. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:1, pp:53-70 [Journal]
  65. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:254-283 [Journal]
  66. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    A global parallel algorithm for the hypergraph transversal problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:4, pp:148-155 [Journal]
  67. Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
    Covering Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:270-284 [Journal]
  68. Endre Boros, Zoltán Füredi, Jeff Kahn
    Maximal intersecting families and affine regular polygons in PG(2, q). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:1-9 [Journal]
  69. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Logical analysis of numerical data. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:163-190 [Journal]
  70. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:253-266 [Journal]
  71. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
    A Complexity Index for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:45-49 [Journal]
  72. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1624-1643 [Journal]
  73. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:2036-2050 [Journal]
  74. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
    Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:93-109 [Journal]
  75. Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Boolean Normal Forms, Shellability, and Reliability Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:212-226 [Journal]
  76. Endre Boros, Yves Crama, Peter L. Hammer
    Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:163-177 [Journal]
  77. Endre Boros, Peter L. Hammer, J. N. Hooker
    Predicting Cause-Effect Relationships from Incomplete Discrete Observations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:4, pp:531-543 [Journal]
  78. Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    On the Complexity of Some Enumeration Problems for Matroids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:966-984 [Journal]
  79. Endre Boros, Peter L. Hammer, Ron Shamir
    A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:11, pp:1380-1385 [Journal]
  80. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
    An Implementation of Logical Analysis of Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2000, v:12, n:2, pp:292-306 [Journal]
  81. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:3, pp:209-232 [Journal]
  82. Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
    Generating Minimal k-Vertex Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:222-231 [Conf]
  83. Endre Boros, Yves Crama, Bruno Simeone
    Peter L. Hammer (1936-2006). [Citation Graph (0, 0)][DBLP]
    4OR, 2007, v:5, n:1, pp:1-4 [Journal]
  84. Endre Boros
    On a linear diophantine problem for geometrical type sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:27-33 [Journal]
  85. Endre Boros, Peter L. Hammer
    On clustering problems with connected optima in euclidean spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:81-88 [Journal]
  86. Endre Boros, Vladimir Gurvich
    A corrected version of the Duchet kernel conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:231-233 [Journal]
  87. Endre Boros, Ondrej Cepek
    On perfect 0, +/- 1 matrices, . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:81-100 [Journal]
  88. Endre Boros
    On shift stable hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:81-84 [Journal]
  89. Endre Boros, Vladimir Gurvich
    Perfect graphs are kernel solvable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:35-55 [Journal]
  90. Endre Boros, Yves Crama, Bruno Simeone
    Peter Ladislaw Hammer. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2153-2155 [Journal]
  91. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:361-376 [Journal]
  92. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:139-150 [Journal]

  93. A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. [Citation Graph (, )][DBLP]


  94. A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. [Citation Graph (, )][DBLP]


  95. On Berge Multiplication for Monotone Boolean Dualization. [Citation Graph (, )][DBLP]


  96. A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. [Citation Graph (, )][DBLP]


  97. On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. [Citation Graph (, )][DBLP]


  98. Generating Cut Conjunctions in Graphs and Related Problems. [Citation Graph (, )][DBLP]


  99. A subclass of Horn CNFs optimally compressible in polynomial time. [Citation Graph (, )][DBLP]


  100. Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra [Citation Graph (, )][DBLP]


  101. Preface. [Citation Graph (, )][DBLP]


  102. Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. [Citation Graph (, )][DBLP]


  103. Scientific contributions of Leo Khachiyan (a short overview). [Citation Graph (, )][DBLP]


  104. Foreword. [Citation Graph (, )][DBLP]


  105. Exclusive and essential sets of implicates of Boolean functions. [Citation Graph (, )][DBLP]


  106. Generating All Vertices of a Polyhedron Is Hard. [Citation Graph (, )][DBLP]


  107. Generating 3-vertex connected spanning subgraphs. [Citation Graph (, )][DBLP]


  108. Vertex- and edge-minimal and locally minimal graphs. [Citation Graph (, )][DBLP]


  109. Minimal and locally minimal games and game forms. [Citation Graph (, )][DBLP]


  110. Not complementary connected and not CIS d-graphs form weakly monotone families. [Citation Graph (, )][DBLP]


  111. Acyclic, or totally tight, two-person game forms: Characterization and main properties. [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.116secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002