Endre Boros

From MaRDI portal
(Redirected from Person:226794)


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Generating minimal redundant and maximal irredundant subhypergraphs
Discrete Applied Mathematics
2024-09-26Paper
Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
International Journal of Game Theory
2024-08-01Paper
Recognizing distributed approval voting forms and correspondences
Annals of Operations Research
2024-07-16Paper
Envy-free relaxations for goods, chores, and mixed items
Theoretical Computer Science
2024-06-03Paper
Hypergraph Horn functions
SIAM Journal on Discrete Mathematics
2024-05-08Paper
Matroid Horn functions
Journal of Combinatorial Theory. Series A
2024-01-15Paper
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games
 
2023-11-05Paper
Boolean analysis of incomplete examples
Algorithm Theory — SWAT'96
2022-12-09Paper
Autarkies and Persistencies for QUBO
The Quadratic Unconstrained Binary Optimization Problem
2022-11-15Paper
Unique key Horn functions
Theoretical Computer Science
2022-06-13Paper
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
Journal of Graph Theory
2022-03-31Paper
Approximating minimum representations of key Horn functions
SIAM Journal on Computing
2022-03-11Paper
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions
 
2021-10-20Paper
On the Sprague-Grundy function of extensions of proper \textsc{nim}
International Journal of Game Theory
2021-09-24Paper
Generating clause sequences of a CNF formula
Theoretical Computer Science
2021-01-19Paper
Recognizing distributed approval voting forms and correspondences
 
2020-10-29Paper
On the degree sequences of dual graphs on surfaces
 
2020-08-02Paper
Compact quadratizations for pseudo-Boolean functions
Journal of Combinatorial Optimization
2020-03-24Paper
Sprague-Grundy function of matroids and related hypergraphs
Theoretical Computer Science
2019-11-13Paper
Decomposing 1-Sperner hypergraphs
The Electronic Journal of Combinatorics
2019-08-05Paper
On graphs whose maximal cliques and stable sets intersect
 
2019-07-25Paper
Sprague-Grundy function of symmetric hypergraphs
Journal of Combinatorial Theory. Series A
2019-06-25Paper
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
Information and Computation
2019-05-29Paper
Separable discrete functions: recognition and sufficient conditions
Discrete Mathematics
2019-03-25Paper
On the Sprague-Grundy function of compound games
 
2019-03-19Paper
Approximation schemes for stochastic mean payoff games with perfect information and few random positions
Algorithmica
2019-01-11Paper
A polynomial algorithm for balancing acyclic data flow graphs
IEEE Transactions on Computers
2018-09-14Paper
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
Dynamic Games and Applications
2018-06-05Paper
A three-person deterministic graphical game without Nash equilibria
Discrete Applied Mathematics
2018-05-24Paper
Vector connectivity in graphs
Networks
2018-05-23Paper
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
 
2018-05-09Paper
On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
Discrete Applied Mathematics
2018-03-21Paper
A convex programming-based algorithm for mean payoff stochastic games with perfect information
Optimization Letters
2017-12-15Paper
Strong duality in Horn minimization
 
2017-11-22Paper
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames
International Journal of Game Theory
2017-04-27Paper
A nested family of \(k\)-total effective rewards for positional games
International Journal of Game Theory
2017-04-12Paper
Quadratic reformulations of nonlinear binary optimization problems
Mathematical Programming. Series A. Series B
2017-03-23Paper
Markov decision processes and stochastic games with total effective payoff
 
2017-01-24Paper
Tetris Hypergraphs and Combinations of Impartial Games
 
2017-01-10Paper
On equistable, split, CIS, and related classes of graphs
Discrete Applied Mathematics
2016-11-24Paper
Equistarable bipartite graphs
Discrete Mathematics
2016-04-27Paper
Quadratization of symmetric pseudo-Boolean functions
Discrete Applied Mathematics
2016-03-18Paper
A potential reduction algorithm for ergodic two-person zero-sum limiting average payoff stochastic games
Combinatorial Optimization and Applications
2015-09-11Paper
Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
Discrete Mathematics
2015-08-05Paper
On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim}
 
2015-04-27Paper
Polynomially computable bounds for the probability of the union of events
Mathematics of Operations Research
2015-04-24Paper
Hardness results for approximate pure Horn CNF formulae minimization
Annals of Mathematics and Artificial Intelligence
2015-02-05Paper
Chess-like games may have no uniform Nash equilibria even in mixed strategies
Game Theory
2014-09-30Paper
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
Operations Research Letters
2014-05-14Paper
On CIS circulants
Discrete Mathematics
2014-01-27Paper
A decomposition method for CNF minimality proofs
Theoretical Computer Science
2014-01-13Paper
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
International Journal of Game Theory
2013-11-11Paper
On canonical forms for zero-sum stochastic mean payoff games
Dynamic Games and Applications
2013-09-16Paper
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions
Lecture Notes in Computer Science
2013-08-06Paper
Vector connectivity in graphs
Lecture Notes in Computer Science
2013-05-28Paper
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
2012-12-07Paper
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
Discrete Mathematics
2012-04-13Paper
Total tightness implies Nash-solvability for three-person game forms
Discrete Mathematics
2012-03-29Paper
Logical analysis of data: classification with justification
Annals of Operations Research
2011-11-17Paper
Optimal sequential inspection policies
Annals of Operations Research
2011-11-17Paper
The negative cycles polyhedron and hardness of checking some polyhedral properties
Annals of Operations Research
2011-11-17Paper
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics
2011-10-27Paper
Stochastic mean payoff games: smoothed analysis and approximation schemes
Automata, Languages and Programming
2011-07-06Paper
Left-to-right multiplication for monotone Boolean dualization
SIAM Journal on Computing
2011-04-04Paper
Friendship two-graphs
Graphs and Combinatorics
2010-11-12Paper
Generating all vertices of a polyhedron is hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
2010-08-16Paper
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
Integer Programming and Combinatorial Optimization
2010-06-22Paper
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
2010-05-05Paper
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
Discrete Mathematics
2010-04-27Paper
Acyclic, or totally tight, two-person game forms: characterization and main properties
Discrete Mathematics
2010-04-27Paper
On effectivity functions of game forms
Games and Economic Behavior
2010-03-10Paper
A large-scale linear programming model for finding optimal container inspection strategies
Naval Research Logistics
2010-03-09Paper
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Lecture Notes in Computer Science
2010-03-03Paper
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
2010-01-29Paper
Minimal and locally minimal games and game forms
Discrete Mathematics
2009-12-10Paper
Vertex- and edge-minimal and locally minimal graphs
Discrete Mathematics
2009-12-09Paper
A note on ``optimal resource allocation for security in reliability systems
European Journal of Operational Research
2009-12-07Paper
scientific article; zbMATH DE number 5605114 (Why is no real title available?)
 
2009-09-19Paper
Algorithms and Computation
Lecture Notes in Computer Science
2009-08-07Paper
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
Automata, Languages and Programming
2009-07-14Paper
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science
2009-05-07Paper
scientific article; zbMATH DE number 5548206 (Why is no real title available?)
 
2009-04-28Paper
Generating all vertices of a polyhedron is hard
 
2009-04-14Paper
On split and almost CIS-graphs
 
2009-03-16Paper
Generating Minimal k-Vertex Connected Spanning Subgraphs
Lecture Notes in Computer Science
2009-03-06Paper
Generating 3-vertex connected spanning subgraphs
Discrete Mathematics
2009-01-28Paper
A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Discrete Optimization
2008-10-29Paper
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
Discrete Applied Mathematics
2008-09-10Paper
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics
2008-09-10Paper
Scheduling vessels and container-yard operations with conflicting objectives
Annals of Operations Research
2008-09-03Paper
On Berge Multiplication for Monotone Boolean Dualization
Automata, Languages and Programming
2008-08-28Paper
Generating cut conjunctions in graphs and related problems
Algorithmica
2008-07-01Paper
On short paths interdiction problems: Total and node-wise limited interdiction
Theory of Computing Systems
2008-06-17Paper
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
Computer Science – Theory and Applications
2008-06-05Paper
Neighborhood hypergraphs of bipartite graphs
Journal of Graph Theory
2008-05-14Paper
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan
2008-04-29Paper
Generating all vertices of a polyhedron is hard
Discrete \& Computational Geometry
2008-04-16Paper
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Lecture Notes in Computer Science
2008-03-11Paper
On enumerating minimal dicuts and strongly connected subgraphs
Algorithmica
2008-02-18Paper
Geršgorin variations. III: On a theme of Brualdi and Varga
Linear Algebra and its Applications
2007-12-14Paper
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Theoretical Computer Science
2007-09-18Paper
Peter L. Hammer (1936-2006)
4OR
2007-08-31Paper
Peter Ladislaw Hammer
Discrete Mathematics
2007-08-23Paper
Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006)
Discrete Applied Mathematics
2007-07-19Paper
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Theoretical Computer Science
2007-07-16Paper
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics
2007-02-19Paper
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Journal of Graph Theory
2007-02-07Paper
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Discrete Applied Mathematics
2007-01-09Paper
Comparison of convex hulls and box hulls.
 
2006-11-15Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
Perfect graphs, kernels, and cores of cooperative games
Discrete Mathematics
2006-10-30Paper
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science
2006-10-20Paper
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
2006-06-01Paper
Heuristic approaches to the capacitated square covering problem
 
2006-02-08Paper
Computing and Combinatorics
Lecture Notes in Computer Science
2006-01-11Paper
On defining sets for projective planes
Discrete Mathematics
2005-12-29Paper
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science
2005-12-23Paper
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science
2005-08-22Paper
Algorithms – ESA 2004
Lecture Notes in Computer Science
2005-08-18Paper
On 3-simplicial vertices in planar graphs
Discussiones Mathematicae Graph Theory
2005-04-19Paper
Stable matchings in three-sided systems with cyclic preferences
Discrete Mathematics
2005-02-22Paper
Block linear majorants in quadratic 0--1 optimization
Discrete Applied Mathematics
2005-01-31Paper
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
Discrete Applied Mathematics
2004-11-12Paper
Dual-bounded generating problems: Weighted transversals of a hypergraph
Discrete Applied Mathematics
2004-08-19Paper
scientific article; zbMATH DE number 2086380 (Why is no real title available?)
 
2004-08-11Paper
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Mathematical Programming. Series A. Series B
2004-03-11Paper
Difference graphs
Discrete Mathematics
2004-02-14Paper
scientific article; zbMATH DE number 2038737 (Why is no real title available?)
 
2004-02-08Paper
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
Mathematical Social Sciences
2003-12-04Paper
An inequality for polymatroid functions and its applications.
Discrete Applied Mathematics
2003-10-14Paper
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence
2003-08-21Paper
On maximal frequent and minimal infrequent sets in binary matrices
Annals of Mathematics and Artificial Intelligence
2003-08-21Paper
Variations on extending partially defined Boolean functions with missing bits.
Information and Computation
2003-08-13Paper
scientific article; zbMATH DE number 1929933 (Why is no real title available?)
 
2003-06-18Paper
Recursive generation of partitionable graphs
Journal of Graph Theory
2003-03-19Paper
Covering non-uniform hypergraphs
Journal of Combinatorial Theory. Series B
2002-12-10Paper
On the number of vertices belonging to all maximum stable sets of a graph
Discrete Applied Mathematics
2002-12-02Paper
scientific article; zbMATH DE number 1759476 (Why is no real title available?)
 
2002-11-25Paper
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
SIAM Journal on Computing
2002-09-29Paper
Pseudo-Boolean optimization
Discrete Applied Mathematics
2002-09-17Paper
Logical analysis of binary data with missing bits
Artificial Intelligence
2002-07-24Paper
scientific article; zbMATH DE number 1754587 (Why is no real title available?)
 
2002-06-12Paper
scientific article; zbMATH DE number 1737291 (Why is no real title available?)
 
2002-05-05Paper
Generating dual-bounded hypergraphs
Optimization Methods \& Software
2002-01-01Paper
Minimization of half-products
Mathematics of Operations Research
2001-11-26Paper
Dual subimplicants of positive Boolean functions
Optimization Methods \& Software
2001-11-16Paper
scientific article; zbMATH DE number 1670855 (Why is no real title available?)
 
2001-11-11Paper
A satisfiability formulation of problems on level graphs
 
2001-09-24Paper
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
SIAM Journal on Computing
2001-06-21Paper
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics
2001-01-01Paper
Boolean Normal Forms, Shellability, and Reliability Computations
SIAM Journal on Discrete Mathematics
2000-07-20Paper
Diagnosing double regular systems
Annals of Mathematics and Artificial Intelligence
2000-06-07Paper
Stable effectivity functions and perfect graphs
Mathematical Social Sciences
2000-05-08Paper
scientific article; zbMATH DE number 1286503 (Why is no real title available?)
 
1999-08-31Paper
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Discrete Applied Mathematics
1999-05-25Paper
Stable families of coalitions and normal hypergraphs
Mathematical Social Sciences
1999-04-27Paper
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
1999-02-02Paper
Maximum renamable Horn sub-CNFs
Discrete Applied Mathematics
1999-01-01Paper
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation
1998-07-27Paper
scientific article; zbMATH DE number 1104349 (Why is no real title available?)
 
1998-05-25Paper
A corrected version of the Duchet kernel conjecture
Discrete Mathematics
1998-04-08Paper
Polynomial-time inference of all valid implications for Horn and related formulae
Annals of Mathematics and Artificial Intelligence
1997-12-14Paper
Logical analysis of numerical data
Mathematical Programming. Series A. Series B
1997-08-28Paper
Powers of circulants in bottleneck algebra
Linear Algebra and its Applications
1997-08-19Paper
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing
1997-08-03Paper
On perfect \(0,\pm 1\) matrices
Discrete Mathematics
1997-06-10Paper
On the number of flats spanned by a set of points in \(PG(d,q)\)
Discrete Mathematics
1997-05-13Paper
Perfect graphs are kernel solvable
Discrete Mathematics
1997-05-04Paper
Optimality of Nested Partitions and Its Application to Cluster Analysis
SIAM Journal on Optimization
1997-04-27Paper
Boolean regression
Annals of Operations Research
1996-05-02Paper
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics
1996-03-11Paper
Unconstrained multilayer switchbox routing
Annals of Operations Research
1996-02-01Paper
Recognition of \(q\)-Horn formulae in linear time
Discrete Applied Mathematics
1995-09-10Paper
Predicting Cause-Effect Relationships from Incomplete Discrete Observations
SIAM Journal on Discrete Mathematics
1994-12-20Paper
A Complexity Index for Satisfiability Problems
SIAM Journal on Computing
1994-08-16Paper
Balancing problems in acyclic networks
Discrete Applied Mathematics
1994-06-15Paper
scientific article; zbMATH DE number 515924 (Why is no real title available?)
 
1994-03-10Paper
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
Mathematics of Operations Research
1993-06-29Paper
scientific article; zbMATH DE number 176260 (Why is no real title available?)
 
1993-05-18Paper
Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
SIAM Journal on Discrete Mathematics
1992-09-27Paper
The existence of non-trivial hyperfactorizations of \(K_{2n}\)
Combinatorica
1992-06-27Paper
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
Annals of Operations Research
1992-06-27Paper
On the Existence of a Feasible Flow in a Stochastic Transportation Network
Operations Research
1992-06-26Paper
Maximal intersecting families and affine regular polygons in \(PG(2,q)\)
Journal of Combinatorial Theory. Series A
1992-06-25Paper
On shift stable hypergraphs
Discrete Mathematics
1991-01-01Paper
Upper-bounds for quadratic 0-1 maximization
Operations Research Letters
1990-01-01Paper
On representing Sylvester-Gallai designs
Discrete \& Computational Geometry
1989-01-01Paper
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
Mathematics of Operations Research
1989-01-01Paper
Probabilistic bounds and algorithms for the maximum satisfiability problem
Annals of Operations Research
1989-01-01Paper
On clustering problems with connected optima in Euclidean spaces
Discrete Mathematics
1989-01-01Paper
scientific article; zbMATH DE number 4054450 (Why is no real title available?)
 
1988-01-01Paper
Rectangular dissections of a square
European Journal of Combinatorics
1988-01-01Paper
On a linear diophantine problem for geometrical type sequences
Discrete Mathematics
1987-01-01Paper
Sperner extensions of affine spaces
Geometriae Dedicata
1987-01-01Paper
A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area
European Journal of Operational Research
1986-01-01Paper
scientific article; zbMATH DE number 3976768 (Why is no real title available?)
 
1986-01-01Paper
On the sharpness of a theorem of B. Segre
Combinatorica
1986-01-01Paper
On the complexity of the surrogate dual of 0–1 programming
Zeitschrift für Operations Research
1986-01-01Paper
Network flows and non-guillotine cutting patterns
European Journal of Operational Research
1984-01-01Paper
scientific article; zbMATH DE number 3916290 (Why is no real title available?)
 
1984-01-01Paper
scientific article; zbMATH DE number 3916015 (Why is no real title available?)
 
1984-01-01Paper
The number of triangles covering the center of an \(n\)-set
Geometriae Dedicata
1984-01-01Paper
scientific article; zbMATH DE number 3608712 (Why is no real title available?)
 
1978-01-01Paper
scientific article; zbMATH DE number 3626156 (Why is no real title available?)
 
1978-01-01Paper
scientific article; zbMATH DE number 3674107 (Why is no real title available?)
 
1977-01-01Paper
scientific article; zbMATH DE number 3691360 (Why is no real title available?)
 
1977-01-01Paper
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
 
N/APaper


Research outcomes over time


This page was built for person: Endre Boros