Endre Boros | Academic Influence

Endre Boros's AcademicInfluence.com Rankings

Endre Boros

Mathematics

#3488

World Rank

#5135

Historical Rank

#1290

USA Rank

Combinatorics

#91

World Rank

#99

Historical Rank

#14

USA Rank

Graph Theory

#102

World Rank

#110

Historical Rank

#14

USA Rank

Measure Theory

#2548

World Rank

#3056

Historical Rank

#724

USA Rank

mathematics Degrees

Download Badge

Mathematics

Endre Boros's Degrees

PhD Mathematics Eötvös Loránd University
Masters Mathematics Eötvös Loránd University
Bachelors Mathematics Eötvös Loránd University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Endre Boros Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Endre Boros is a Hungarian-American mathematician, a Distinguished Professor at Rutgers University in New Brunswick, New Jersey, and the Director of the Center for Operations Research . He is the author of 15 book chapters and edited volumes, and 165 research papers. He is Associate Editor of the Annals of Mathematics and Artificial Intelligence, and Editor-in-Chief of both the Annals of Operations Research and Discrete Applied Mathematics.

(See a Problem?)

Endre Boros's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Pseudo-Boolean optimization (2002) (858)
An Implementation of Logical Analysis of Data (2000) (435)
Logical analysis of numerical data (1997) (274)
Generating All Vertices of a Polyhedron Is Hard (2006) (181)
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) (2007) (135)
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur (1989) (119)
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction (2008) (113)
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets (2002) (108)
The number of triangles covering the center of an n-set (1984) (94)
A graph cut algorithm for higher-order Markov Random Fields (2011) (93)
Perfect graphs, kernels, and cores of cooperative games (2006) (93)
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds (1991) (90)
Preprocessing of unconstrained quadratic binary optimization (2006) (89)
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions (1998) (88)
Recognition of q-Horn Formulae in Linear Time (1994) (83)
On the Complexity of Some Enumeration Problems for Matroids (2005) (76)
Dual subimplicants of positive Boolean functions (1998) (71)
Polynomial-time inference of all valid implications for Horn and related formulae (1990) (71)
Difference graphs (2004) (70)
Perfect graphs are kernel solvable (1996) (65)
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension (2000) (61)
On the sharpness of a theorem of B. segre (1986) (61)
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities (2002) (61)
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions (1993) (61)
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle (1997) (60)
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (2006) (57)
On clustering problems with connected optima in euclidean spaces (1989) (57)
Minimization of Half-Products (1998) (53)
Capturing human intelligence in the net (2000) (53)
On quadratization of pseudo-Boolean functions (2012) (51)
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (2008) (51)
A Complexity Index for Satisfiability Problems (1994) (50)
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices (2003) (48)
On the number of vertices belonging to all maximum stable sets of a graph (2002) (46)
A large‐scale linear programming model for finding optimal container inspection strategies (2009) (46)
Upper-bounds for quadratic 0-1 maximization (1990) (46)
Stable matchings in three-sided systems with cyclic preferences (2004) (45)
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections (2004) (45)
Logical analysis of data: classification with justification (2011) (40)
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph (2001) (40)
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization (1992) (38)
Quadratic reformulations of nonlinear binary optimization problems (2017) (36)
Diagnosing double regular systems (1999) (36)
On the Existence of a Feasible Flow in a Stochastic Transportation Network (1991) (35)
Probabilistic bounds and algorithms for the maximum satisfiability problem (1990) (35)
A Clustering Based Approach to Creating Multi - Document Summaries (2001) (35)
Network flows and non-guillotine cutting patterns (1984) (34)
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information (2010) (33)
A global parallel algorithm for the hypergraph transversal problem (2007) (32)
Finding Essential Attributes from Binary Data (2003) (31)
Decomposability of Partially Defined Boolean Functions (1995) (31)
Predicting Cause-Effect Relationships from Incomplete Discrete Observations (1994) (30)
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles (2003) (30)
Enumerating Spanning and Connected Subsets in Graphs and Matroids (2006) (30)
A Satisfiability Formulation of Problems on Level Graphs (2001) (29)
Scheduling vessels and container-yard operations with conflicting objectives (2008) (29)
Logical Analysis of Binary Data with Missing Bits (1999) (28)
Optimal sequential inspection policies (2011) (27)
An Intersection Inequality for Discrete Distributions and Related Generation Problems (2003) (26)
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games (2012) (26)
Why Chess and Backgammon can be solved in pure positional uniformly optimal strategies (2009) (26)
On defining sets for projective planes (2005) (26)
Neighborhood hypergraphs of bipartite graphs (2008) (26)
A New Algorithm for the Hypergraph Transversal Problem (2005) (26)
An inequality for polymatroid functions and its applications (2003) (25)
Large Scale LP Model for Finding Optimal Container Inspection Strategies (2006) (25)
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time (1991) (25)
Quadratization of Symmetric Pseudo-Boolean Functions (2014) (25)
Sequential Testing of Series-Parallel Systems of Small Depth (2000) (24)
A subclass of Horn CNFs optimally compressible in polynomial time (2009) (22)
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems (2004) (22)
Maximal intersecting families and affine regular polygons in PG(2, q) (1989) (22)
A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area (1986) (22)
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals (2003) (21)
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (2009) (21)
Nash-solvable two-person symmetric cycle game forms (2011) (20)
Bounds for the Probability of the Union of Events (2014) (19)
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs (2007) (19)
The Information Quest: A Dynamic Model of User's Information Needs. (1999) (19)
Horn minimization by iterative decomposition (1998) (19)
Logical Analysis of Data (2005) (19)
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization (1999) (19)
Compact quadratizations for pseudo-Boolean functions (2020) (19)
Generating dual-bounded hypergraphs (2002) (18)
Covering Non-uniform Hypergraphs (2001) (18)
Algorithms for Enumerating Circuits in Matroids (2003) (18)
A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields (2015) (18)
On effectivity functions of game forms (2010) (18)
Generating Partial and Multiple Transversals of a Hypergraph (2000) (18)
The Use of Binomial Monments for Bounding Network Reliability (1989) (18)
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (2007) (17)
Optimization Problems for Port-of-Entry Detection Systems (2008) (17)
On Minimally Imperfect Graphs with Circular Symmetry (1997) (17)
Boolean Normal Forms, Shellability, and Reliability Computations (2000) (17)
Stable families of coalitions and normal hypergraphs (1997) (17)
Generating Cut Conjunctions in Graphs and Related Problems (2008) (17)
Maximum Renamable Horn sub-CNFs (1999) (17)
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generating vertices of polyhedra and related problems of monotone generation (2009) (16)
Stable effectivity functions and perfect graphs (2000) (16)
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (2011) (16)
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games (2013) (16)
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (2006) (16)
The negative cycles polyhedron and hardness of checking some polyhedral properties (2011) (16)
A decomposition method for CNF minimality proofs (2013) (15)
Recursive generation of partitionable graphs (2002) (15)
Generating Minimal k-Vertex Connected Spanning Subgraphs (2007) (15)
On CIS circulants (2013) (15)
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs (1992) (14)
On equistable, split, CIS, and related classes of graphs (2015) (14)
Every stochastic game with perfect information admits a canonical form (2009) (14)
Computing Many Maximal Independent Sets for Hypergraphs in Parallel (2007) (14)
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (2007) (14)
Approximate MRF Inference Using Bounded Treewidth Subgraphs (2012) (14)
Unconstrained multilayer switchbox routing (1995) (14)
Exclusive and essential sets of implicates of Boolean functions (2010) (13)
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs (2005) (13)
The Satisfiability Problem (1999) (13)
On split and almost CIS-graphs (2009) (13)
Extensions of Partially Defined Boolean Functions with Missing Data Extensions of Partially Defined Boolean Functions with Missing Data (1996) (13)
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (2001) (13)
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits (1995) (13)
Envy-free Relaxations for Goods, Chores, and Mixed Items (2020) (13)
Acyclic, or totally tight, two-person game forms: Characterization and main properties (2010) (13)
Boolean Analysis of Incomplete Examples (1996) (13)
Boolean regression (1995) (12)
A three-person deterministic graphical game without Nash equilibria (2016) (12)
ACCAM Global Optimization Model for the USCG Aviation Air Stations (2014) (12)
Dual-bounded generating problems: weighted transversals of a hypergraph (2004) (12)
Markov decision processes and stochastic games with total effective payoff (2018) (12)
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables (2018) (12)
Not complementary connected and not CIS d-graphs form weakly monotone families (2010) (12)
Inapproximability Bounds for Shortest-Path Network Interdiction Problems (2005) (11)
New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences (2008) (11)
Balancing Problems in Acyclic Networks (1994) (11)
On the Sprague-Grundyfunction of Exact k-Nim (2015) (11)
Minimal and locally minimal games and game forms (2009) (10)
Hardness results for approximate pure Horn CNF formulae minimization (2012) (10)
Monotone Extensions of Boolean Data Sets (1997) (10)
Generating Paths and Cuts in Multi-pole (Di)graphs (2004) (10)
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (2007) (10)
Vertex- and edge-minimal and locally minimal graphs (2009) (10)
Deceptive Detection Methods for Effective Security with Inadequate Budgets: The Testing Power Index (2010) (9)
Nash-solvable bidirected cyclic two-person game forms (2008) (9)
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (2013) (9)
Chess-Like Games May Have No Uniform Nash Equilibria Even in Mixed Strategies (2013) (9)
Optimality of Nested Partitions and Its Application to Cluster Analysis (1996) (9)
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (2003) (9)
Verifying Logic Circuits by Benders Decomposition (1991) (9)
Sprague-Grundy function of matroids and related hypergraphs (2018) (8)
Generating vertices of polyhedra and related monotone generation problems (2007) (8)
Rectangular Dissections of a Square (1988) (8)
A corrected version of the Duchet kernel conjecture (1998) (8)
Sprague-Grundy function of symmetric hypergraphs (2018) (8)
Pheromonic Representation of User Quests by Digital Structures (1999) (8)
Enumeration in Data Management (Dagstuhl Seminar 19211) (2019) (8)
Ant World (demonstration abstract) (1999) (8)
A convex programming-based algorithm for mean payoff stochastic games with perfect information (2016) (7)
On minimal imperfect graphs with circular symmetry (1998) (7)
Rutgers Filtering Work at TREC 2002: Adaptive and Batch (2002) (7)
On Berge Multiplication for Monotone Boolean Dualization (2008) (7)
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron–Frobenius theory (2013) (7)
On representing sylvester-gallai designs (1989) (7)
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure" (2015) (7)
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (2004) (6)
Matroid Intersections, Polymatroid Inequalities, and Related Problems (2002) (6)
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems (2004) (6)
Comparison of Convex Hulls and Box Hulls (2005) (6)
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs (2018) (6)
On Graphs Whose Maximal Cliques and Stable Sets Intersect (2018) (6)
Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees (1991) (6)
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (2008) (6)
Tetris Hypergraphs and Combinations of Impartial Games (2017) (6)
Variations on extending partially defined Boolean functions with missing bits (2003) (6)
An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded D (2000) (6)
On a linear diophantine problem for geometrical type sequences (1987) (5)
Pseudo-boolean Optimization Pseudo-boolean Optimization (2001) (5)
POWERS OF CIRCULANTS IN BOTTLENECK ALGEBRA (1997) (5)
On perfect 0, +/- 1 matrices, (1997) (5)
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games (2015) (5)
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (2013) (5)
Extended Complementary Nim (2015) (5)
Equistarable bipartite graphs (2015) (5)
Terminal games with 3 terminals have proper Nash equilibria in pure positional strategies (2009) (4)
On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim} (2015) (4)
A note on "Optimal resource allocation for security in reliability systems" (2009) (4)
Vector connectivity in graphs (2013) (4)
Left-to-Right Multiplication for Monotone Boolean Dualization (2010) (4)
Incompatibility graphs and data mining (2011) (4)
Block linear majorants in quadratic 0-1 optimization (2004) (4)
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games (2014) (4)
DECEPTIVE DETECTION METHODS FOR OPTIMAL SECURITY WITH INADEQUATE BUDGETS: THE SCREENING POWER INDEX (2007) (4)
Dual-Bounded Hypergraphs: A Survey∗ (2002) (4)
An Efficient Implementation of a Joint Generation Algorithm (2004) (4)
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities (2005) (4)
Closed Sets and Generators in Ternary Hamming Spaces (1998) (3)
Generating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs (2006) (3)
Combinatorial Analysis of Breast Cancer Data from Gene Expression Microarrays (2003) (3)
The existence of non-trivial hyperfactorizations ofK2n (1991) (3)
Decomposing 1-Sperner Hypergraphs (2015) (3)
On the Sprague–Grundy function of extensions of proper Nim (2020) (3)
Discrete Optimization: The State of the Art (2003) (3)
Total tightness implies Nash-solvability for three-person game forms (2012) (3)
A Nested Family of $k$-total Effective Rewards for Positional Games (2014) (3)
Approximating minimum representations of key Horn functions (2018) (3)
Finding Essential Attributes in Binary Data (2000) (3)
A potential reduction algorithm for two-person zero-sum limiting average payoff stochastic games (2012) (3)
Peter L. Hammer (1936–2006) (2007) (2)
Nested Family of Cyclic Games with $k$-total Effective Rewards (2014) (2)
Generating 3-vertex connected spanning subgraphs (2008) (2)
Convex separable minimization over partial order constraints (1991) (2)
On the complexity of the surrogate dual of 0–1 programming (1986) (2)
Combinatorial problems related to origin-destination matrices (2001) (2)
Separable discrete functions: Recognition and sufficient conditions (2017) (2)
Heuristic Approaches to the capacitated Square Covering Problem (2008) (2)
On 3-simplicial vertices in planar graphs (2004) (2)
The ACCAM model: simulating aviation mission readiness for U.S. coast guard stations (2015) (2)
On Canonical Forms for Two-person Zero-sum Limit Average Payoff Stochastic Games (2011) (2)
Geršgorin variations III: On a theme of Brualdi and Varga (2008) (2)
Optimal US coast guard boat allocations with sharing (2015) (2)
Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm (1999) (2)
Incompatibility Graphs in Data Mining (2011) (2)
On Parallel Edges in Cycles (1999) (2)
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (2008) (2)
A combinatorial min-max theorem and minimization of pure-Horn functions (2016) (2)
Cones of Nonnegative Quadratic Pseudo-Boolean Functions (2014) (2)
Even-hole-free and Balanced Circulants (2005) (1)
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron–Frobenius theory (2012) (1)
Discounted approximations of undiscounted stochastic games and Markov decision processes are already poor in the almost deterministic case (2012) (1)
Application of Logical Analysis of Data to the TREC-6 Routing Task (1997) (1)
On rank-profiles of stable matchings a (2012) (1)
Introduction to special volume of Discrete Applied Mathematics (2004) (1)
On minimal and locally minimal true vectors and weakly monotone Boolean functions (2009) (1)
A Linear Programming Approach for Optimal Protein Encoding (2005) (1)
Games: Smoothed Analysis and Approximation Schemes ? (2011) (1)
in Graphs and Related Problems (2007) (1)
Sufﬁcient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden 2 × 2 subgames (2015) (1)
Compact quadratizations for pseudo-Boolean functions (2019) (1)
Hardness results for approximate pure Horn CNF formulae minimization (2014) (1)
Matroid Horn functions (2023) (1)
On shift stable hypergraphs (1991) (1)
Boolean Functions: Horn functions (2011) (1)
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra (2008) (1)
Stable effectivity functions and perfect graphs 1 * (2000) (1)
A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games (2010) (1)
Hypergraph Horn functions (2023) (1)
A Pumping Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information (2010) (1)
Generalized sandwich problem for Π-and ∆-free multigraphs and its applications to positional extensions of game forms . a (2013) (1)
1-Sperner hypergraphs (2015) (1)
Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis (2016) (1)
Unique key Horn functions (2020) (1)
Scientific contributions of Leo Khachiyan (a short overview) (2008) (1)
Logical Analysis of Data in the TREC-9 Filtering Track (2000) (1)
A nested family of $$\varvec{k}$$k-total effective rewards for positional games (2017) (1)
Some properties of the Boolean Quadric Polytope (2009) (1)
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (2022) (1)
RRR 10 – 2006 , April , 2006 Preprocessing of Unconstrained Quadratic Binary Optimization (2006) (0)
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames (2016) (0)
More Extremal Properties of de Bruijn Sequences (2009) (0)
Incompatibility graphs and data mining in memory of bruno simeone (1945-2010) (2011) (0)
Feature Selection and Error Tolerance for the Logical Analysis of Data (2005) (0)
Preface (2008) (0)
Weighted Transversals of a Hypergraph (2001) (0)
Boolean Analysis of Incomplete Examples Boolean Analysis of Incomplete Examples (1996) (0)
Discrete Applied Mathematics: Preface (2006) (0)
Sperner extensions of affine spaces (1987) (0)
Logical analysis of numerical data 1 (0)
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games (2015) (0)
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions (2017) (0)
Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006 (2007) (0)
R U T C O R (2007) (0)
Discrete Optimization. Ed. North-Holland 2003 (2003) (0)
Computer-generated theorems on Nash-solvability of bimatrix games based on excluding certain 2 × 2 subgames (2007) (0)
Impartial games with decreasing Sprague–Grundy function and their hypergraph compound (2023) (0)
A convex programming-based algorithm for mean payoff stochastic games with perfect information (2017) (0)
Combining First and Second Order Features in the TREC 2003 Robust Track (2003) (0)
2009-02 February 2009 Logical Analysis of Data : Classification with Justification 1 by (2009) (0)
On the degree sequences of dual graphs on surfaces (2020) (0)
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions (2018) (0)
Enumeration in Data Management (2019) (0)
Generating clause sequences of a CNF formula (2020) (0)
Peter Ladislaw Hammer: December 23, 1936–December 27, 2006 (2007) (0)
Generating Minimal Valid Inequalities (2013) (0)
Annual Report Dimacs Project on Algorithms for Port of Entry Inspection (2005) (0)
The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models (2011) (0)
Enabling technologies: capturing human intelligence in the Net (2000) (0)
C O ] 2 7 A pr 2 01 5 EXTENDED COMPLEMENTARY NIM (2015) (0)
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions (2021) (0)
Horn Minimization by Iterative Decomposition Horn Minimization by Iterative Decomposition (2007) (0)
Optimal Layered Defense For Site Protection (2022) (0)
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$2×2 subgames (2016) (0)
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006 (2007) (0)
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games (2013) (0)
Inventory and Scheduling Problems in Supply Chain Management by SELIM BORA Dissertation Director : (2012) (0)
A Vessel Scheduling Problem with Special Cases (2014) (0)
Mathematical Programming Society Newsletter (2007) (0)
Recognizing distributed approval voting forms and correspondences. (2020) (0)
Optimization and Artificial Intelligence. (1996) (0)
Maximum renamable Horn sub-CNFs : The Satisfiability Problem (1999) (0)
Properties and solutions of a class of stochastic programming problems with probabilistic constraints by Kunikazu Yoda (2013) (0)
On the Sprague-Grundy function of compound games (2019) (0)
Feature selection with applications to text classification (2012) (0)
A LINEAR PROGRAMMING MODEL FOR SEQUENTIAL TESTING (2008) (0)
A Case of the Container-Vessel Scheduling Problem (2014) (0)
A three-person chess-like game without Nash equilibria (2016) (0)
On the number of flats spanned by a set of points in PG(d, q) (1996) (0)
An Implementation of LogicalAnalysis of DataEndre Borosa (1996) (0)
On Nash-solvability of chess-like games (2014) (0)
Strong Duality in Horn Minimization (2017) (0)
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games (2016) (0)
Stable families of coalitions and normal hypergraphs 1 Revised version of RUTCOR Research Report, RR (1997) (0)
Dual - Bounded Generating Problems : An Intersection Inequality for Discrete Distributions and Its Applications (2003) (0)
Obituary Peter L. Hammer (1936-2006) (2007) (0)
A Potential Reduction Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information (2010) (0)
On generation of cut conjunctions, minimal k-connected spanning subgraphs, minimal connected and spanning subsets and vertices (2006) (0)
Minimal representation of elementary Horn functions (2018) (0)
Quadratic reformulations of nonlinear binary optimization problems (2016) (0)
Preface (1995) (0)
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns (2008) (0)
Friendship Two-Graphs (2010) (0)
Stable Eeectivity Functions and Perfect Graphs 1;2 (1999) (0)

This paper list is powered by the following services:

Other Resources About Endre Boros

en.wikipedia.org

What Schools Are Affiliated With Endre Boros?

Endre Boros is affiliated with the following schools: