Endre Boros

According to our database1, Endre Boros authored at least 202 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs.
J. Graph Theory, 2020

Compact quadratizations for pseudo-Boolean functions.
J. Comb. Optim., 2020

On the degree sequences of dual graphs on surfaces.
CoRR, 2020

Envy-free Relaxations for Goods, Chores, and Mixed Items.
CoRR, 2020

Unique key Horn functions.
CoRR, 2020

Generating clause sequences of a CNF formula.
CoRR, 2020

Bounds for the Probability of the Union of Events.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Approximating minimum representations of key Horn functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

2019
Sprague-Grundy function of matroids and related hypergraphs.
Theor. Comput. Sci., 2019

Sprague-Grundy function of symmetric hypergraphs.
J. Comb. Theory, Ser. A, 2019

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.
Inf. Comput., 2019

Separable discrete functions: Recognition and sufficient conditions.
Discret. Math., 2019

Enumeration in Data Management (Dagstuhl Seminar 19211).
Dagstuhl Reports, 2019

Decomposing 1-Sperner Hypergraphs.
Electron. J. Comb., 2019

2018
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dyn. Games Appl., 2018

A three-person deterministic graphical game without Nash equilibria.
Discret. Appl. Math., 2018

On the Sprague-Grundyfunction of Exact k-Nim.
Discret. Appl. Math., 2018

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.
Algorithmica, 2018

Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

2017
A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optim. Lett., 2017

Quadratic reformulations of nonlinear binary optimization problems.
Math. Program., 2017

A nested family of \(\varvec{k}\) -total effective rewards for positional games.
Int. J. Game Theory, 2017

On equistable, split, CIS, and related classes of graphs.
Discret. Appl. Math., 2017

Strong Duality in Horn Minimization.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames.
Int. J. Game Theory, 2016

Equistarable bipartite graphs.
Discret. Math., 2016

Quadratization of symmetric pseudo-Boolean functions.
Discret. Appl. Math., 2016

Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis.
Comput. Vis. Image Underst., 2016

A three-person chess-like game without Nash equilibria.
CoRR, 2016

A combinatorial min-max theorem and minimization of pure-Horn functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015
A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields.
IEEE Trans. Pattern Anal. Mach. Intell., 2015

Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games.
Discret. Math., 2015

1-Sperner hypergraphs.
CoRR, 2015

Markov Decision Processes and Stochastic Games with Total Effective Payoff.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Vector connectivity in graphs.
Networks, 2014

Polynomially Computable Bounds for the Probability of the Union of Events.
Math. Oper. Res., 2014

On CIS circulants.
Discret. Math., 2014

Nested Family of Cyclic Games with $k$-total Effective Rewards.
CoRR, 2014

Hardness results for approximate pure Horn CNF formulae minimization.
Ann. Math. Artif. Intell., 2014

Cones of Nonnegative Quadratic Pseudo-Boolean Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

A Vessel Scheduling Problem with Special Cases.
Proceedings of the Operations Research and Enterprise Systems, 2014

A Case of the Container-Vessel Scheduling Problem.
Proceedings of the ICORES 2014, 2014

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
A decomposition method for CNF minimality proofs.
Theor. Comput. Sci., 2013

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.
Oper. Res. Lett., 2013

A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory.
Int. J. Game Theory, 2013

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games.
Dyn. Games Appl., 2013

2012
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discret. Math., 2012

Total tightness implies Nash-solvability for three-person game forms.
Discret. Math., 2012

On quadratization of pseudo-Boolean functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Approximate MRF Inference Using Bounded Treewidth Subgraphs.
Proceedings of the Computer Vision - ECCV 2012, 2012

2011
Nash-solvable two-person symmetric cycle game forms.
Discret. Appl. Math., 2011

Optimal sequential inspection policies.
Ann. Oper. Res., 2011

The negative cycles polyhedron and hardness of checking some polyhedral properties.
Ann. Oper. Res., 2011

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011

Logical analysis of data: classification with justification.
Ann. Oper. Res., 2011

A graph cut algorithm for higher-order Markov Random Fields.
Proceedings of the IEEE International Conference on Computer Vision, 2011

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Incompatibility graphs and data mining.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Left-to-Right Multiplication for Monotone Boolean Dualization.
SIAM J. Comput., 2010

On effectivity functions of game forms.
Games Econ. Behav., 2010

Friendship Two-Graphs.
Graphs Comb., 2010

Acyclic, or totally tight, two-person game forms: Characterization and main properties.
Discret. Math., 2010

Not complementary connected and not CIS d-graphs form weakly monotone families.
Discret. Math., 2010

Exclusive and essential sets of implicates of Boolean functions.
Discret. Appl. Math., 2010

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
A note on "Optimal resource allocation for security in reliability systems".
Eur. J. Oper. Res., 2009

Minimal and locally minimal games and game forms.
Discret. Math., 2009

Vertex- and edge-minimal and locally minimal graphs.
Discret. Math., 2009

A subclass of Horn CNFs optimally compressible in polynomial time.
Ann. Math. Artif. Intell., 2009

On split and almost CIS-graphs.
Australas. J Comb., 2009

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Optimization Problems for Port-of-Entry Detection Systems.
Proceedings of the Intelligence and Security Informatics, Techniques and Applications, 2008

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction.
Theory Comput. Syst., 2008

Neighborhood hypergraphs of bipartite graphs.
J. Graph Theory, 2008

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Trans. Inf. Syst., 2008

Generating 3-vertex connected spanning subgraphs.
Discret. Math., 2008

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO).
Discret. Optim., 2008

Generating All Vertices of a Polyhedron Is Hard.
Discret. Comput. Geom., 2008

Foreword.
Discret. Appl. Math., 2008

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discret. Appl. Math., 2008

Scientific contributions of Leo Khachiyan (a short overview).
Discret. Appl. Math., 2008

Preface.
Discret. Appl. Math., 2008

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR, 2008

Scheduling vessels and container-yard operations with conflicting objectives.
Ann. Oper. Res., 2008

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.
Algorithmica, 2008

Generating Cut Conjunctions in Graphs and Related Problems.
Algorithmica, 2008

On Berge Multiplication for Monotone Boolean Dualization.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
Proceedings of the Computer Science, 2008

2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci., 2007

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.
Theor. Comput. Sci., 2007

Computing Many Maximal Independent Sets for Hypergraphs in Parallel.
Parallel Process. Lett., 2007

A global parallel algorithm for the hypergraph transversal problem.
Inf. Process. Lett., 2007

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO).
J. Heuristics, 2007

Obituary Peter L. Hammer (1936-2006).
Bull. EATCS, 2007

Peter Ladislaw Hammer.
Discret. Math., 2007

Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
Discret. Optim., 2007

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
Discret. Appl. Math., 2007

Peter L. Hammer (1936-2006).
4OR, 2007

Generating Minimal k-Vertex Connected Spanning Subgraphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
J. Graph Theory, 2006

Perfect graphs, kernels, and cores of cooperative games.
Discret. Math., 2006

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discret. Appl. Math., 2006

Preface.
Discret. Appl. Math., 2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids.
Proceedings of the Algorithms, 2006

2005
On the Complexity of Some Enumeration Problems for Matroids.
SIAM J. Discret. Math., 2005

On defining sets for projective planes.
Discret. Math., 2005

Comparison of Convex Hulls and Box Hulls.
Ars Comb., 2005

Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A New Algorithm for the Hypergraph Transversal Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
On 3-simplicial vertices in planar graphs.
Discuss. Math. Graph Theory, 2004

Difference graphs.
Discret. Math., 2004

Stable matchings in three-sided systems with cyclic preferences.
Discret. Math., 2004

Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis.
Discret. Appl. Math., 2004

Block linear majorants in quadratic 0-1 optimization.
Discret. Appl. Math., 2004

Dual-bounded generating problems: weighted transversals of a hypergraph.
Discret. Appl. Math., 2004

Introduction to special volume of Discrete Applied Mathematics.
Discret. Appl. Math., 2004

An Efficient Implementation of a Joint Generation Algorithm.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Generating Paths and Cuts in Multi-pole (Di)graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.
Proceedings of the Algorithms, 2004

2003
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
Math. Soc. Sci., 2003

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.
Math. Program., 2003

Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput., 2003

An inequality for polymatroid functions and its applications.
Discret. Appl. Math., 2003

Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell., 2003

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices.
Ann. Math. Artif. Intell., 2003

Combining First and Second Order Features in the TREC 2003 Robust Track.
Proceedings of The Twelfth Text REtrieval Conference, 2003

Algorithms for Enumerating Circuits in Matroids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

An Intersection Inequality for Discrete Distributions and Related Generation Problems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.
Proceedings of the Algorithms, 2003

2002
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput., 2002

Generating dual-bounded hypergraphs.
Optim. Methods Softw., 2002

Recursive generation of partitionable graphs.
J. Graph Theory, 2002

Pseudo-Boolean optimization.
Discret. Appl. Math., 2002

On the number of vertices belonging to all maximum stable sets of a graph.
Discret. Appl. Math., 2002

Rutgers Filtering Work at TREC 2002: Adaptive and Batch.
Proceedings of The Eleventh Text REtrieval Conference, 2002

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Matroid Intersections, Polymatroid Inequalities, and Related Problems.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B, 2001

A Satisfiability Formulation of Problems on Level Graphs.
Electron. Notes Discret. Math., 2001

Combinatorial problems related to origin-destination matrices.
Discret. Appl. Math., 2001

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
An Implementation of Logical Analysis of Data.
IEEE Trans. Knowl. Data Eng., 2000

Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discret. Math., 2000

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph.
SIAM J. Comput., 2000

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.
Parallel Process. Lett., 2000

Stable effectivity functions and perfect graphs.
Math. Soc. Sci., 2000

Enabling technologies: capturing human intelligence in the Net.
Commun. ACM, 2000

Logical Analysis of Data in the TREC-9 Filtering Track.
Proceedings of The Ninth Text REtrieval Conference, 2000

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
Proceedings of the Theoretical Computer Science, 2000

Finding Essential Attributes in Binary Data.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

Generating Partial and Multiple Transversals of a Hypergraph.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.
Discret. Appl. Math., 1999

Maximum Renamable Horn sub-CNFs.
Discret. Appl. Math., 1999

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm.
Comput. Artif. Intell., 1999

Diagnosing double regular systems.
Ann. Math. Artif. Intell., 1999

Logical Analysis of Binary Data with Missing Bits.
Artif. Intell., 1999

Ant World (demonstration abstract).
Proceedings of the SIGIR '99: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1999

1998
Minimization of Half-Products.
Math. Oper. Res., 1998

On minimal imperfect graphs with circular symmetry.
J. Graph Theory, 1998

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput., 1998

A corrected version of the Duchet kernel conjecture.
Discret. Math., 1998

Horn Minimization by Iterative Decomposition.
Ann. Math. Artif. Intell., 1998

1997
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput., 1997

Logical analysis of numerical data.
Math. Program., 1997

On perfect 0, +/- 1 matrices<sup>, </sup>.
Discret. Math., 1997

Application of Logical Analysis of Data to the TREC-6 Routing Task.
Proceedings of The Sixth Text REtrieval Conference, 1997

Monotone Extensions of Boolean Data Sets.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Optimality of Nested Partitions and Its Application to Cluster Analysis.
SIAM J. Optim., 1996

On the number of flats spanned by a set of points in PG(d, q).
Discret. Math., 1996

Perfect graphs are kernel solvable.
Discret. Math., 1996

Boolean Analysis of Incomplete Examples.
Proceedings of the Algorithm Theory, 1996

1995
Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math., 1995

Preface.
Discret. Appl. Math., 1995

Unconstrained multilayer switchbox routing.
Ann. Oper. Res., 1995

Boolean regression.
Ann. Oper. Res., 1995

1994
Predicting Cause-Effect Relationships from Incomplete Discrete Observations.
SIAM J. Discret. Math., 1994

A Complexity Index for Satisfiability Problems.
SIAM J. Comput., 1994

Recognition of q-Horn Formulae in Linear Time.
Discret. Appl. Math., 1994

Balancing Problems in Acyclic Networks.
Discret. Appl. Math., 1994

1993
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions.
Math. Oper. Res., 1993

1992
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs.
IEEE Trans. Computers, 1992

Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
SIAM J. Discret. Math., 1992

1991
On the Existence of a Feasible Flow in a Stochastic Transportation Network.
Oper. Res., 1991

On shift stable hypergraphs.
Discret. Math., 1991

The existence of non-trivial hyperfactorization of K<sub>2n</sub>.
Comb., 1991

The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds.
Ann. Oper. Res., 1991

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
Proceedings of the ISA '91 Algorithms, 1991

Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees.
Proceedings of the Network Flows And Matching, 1991

1990
Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae.
Ann. Math. Artif. Intell., 1990

1989
Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur.
Math. Oper. Res., 1989

Maximal intersecting families and affine regular polygons in <i>PG</i>(2, <i>q</i>).
J. Comb. Theory, Ser. A, 1989

On clustering problems with connected optima in euclidean spaces.
Discret. Math., 1989

On Representing Sylvester- Gallai Designs.
Discret. Comput. Geom., 1989

The Use of Binomial Monments for Bounding Network Reliability.
Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988
Rectangular Dissections of a Square.
Eur. J. Comb., 1988

1987
On a linear diophantine problem for geometrical type sequences.
Discret. Math., 1987

1986
On the complexity of the surrogate dual of 0-1 programming.
Z. Oper. Research, 1986

On the sharpness of a theorem of B. Segre.
Comb., 1986


  Loading...