| Publication | Date of Publication | Type |
|---|
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
Operations Research Letters | 2024-06-17 | Paper |
Geometric stabbing via threshold rounding and factor revealing LPs
Discrete \& Computational Geometry | 2024-04-02 | Paper |
Anti Tai mapping for unordered labeled trees
Information Processing Letters | 2024-03-13 | Paper |
On Dualization over Distributive Lattices
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
Approximations for generalized unsplittable flow on paths with application to power systems optimization
Annals of Operations Research | 2023-01-23 | Paper |
Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
Algorithmica | 2022-12-08 | Paper |
Polynomial-time alternating probabilistic bisimulation for interval MDPs
Dependable Software Engineering. Theories, Tools, and Applications | 2022-11-04 | Paper |
Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
| 2022-05-11 | Paper |
Finding Sparse Solutions for Packing and Covering Semidefinite Programs
SIAM Journal on Optimization | 2022-04-20 | Paper |
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
Theoretical Computer Science | 2022-01-18 | Paper |
A PTAS for a class of binary non-linear programs with low-rank functions
Operations Research Letters | 2021-12-13 | Paper |
Generating clause sequences of a CNF formula
Theoretical Computer Science | 2021-01-19 | Paper |
Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks
IEEE Transactions on Control of Network Systems | 2020-10-05 | Paper |
Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
| 2020-08-25 | Paper |
Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
Computational aspects of optimal strategic network diffusion
Theoretical Computer Science | 2020-03-12 | Paper |
Approximation schemes for \(r\)-weighted minimization knapsack problems
Annals of Operations Research | 2020-01-20 | Paper |
A polynomial delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
Information and Computation | 2019-05-29 | Paper |
A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
Algorithmica | 2019-05-17 | Paper |
scientific article; zbMATH DE number 7051292 (Why is no real title available?)
| 2019-05-06 | Paper |
Quantifying Inefficiency of Fair Cost-Sharing Mechanisms for Sharing Economy
IEEE Transactions on Control of Network Systems | 2019-03-29 | Paper |
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
Theoretical Computer Science | 2019-03-26 | Paper |
Complex-demand scheduling problem with application in smart grid
Theoretical Computer Science | 2019-02-20 | Paper |
Approximation schemes for stochastic mean payoff games with perfect information and few random positions
Algorithmica | 2019-01-11 | Paper |
Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks
IEEE Transactions on Control of Network Systems | 2018-12-19 | Paper |
On the approximability of the maximum interval constrained coloring problem
Discrete Optimization | 2018-08-17 | Paper |
Finding small hitting sets in infinite range spaces of bounded VC-dimension
| 2018-08-13 | Paper |
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
Dynamic Games and Applications | 2018-06-05 | Paper |
Exact algorithms for list-coloring of intersecting hypergraphs
| 2018-04-10 | Paper |
A convex programming-based algorithm for mean payoff stochastic games with perfect information
Optimization Letters | 2017-12-15 | Paper |
Combinatorial Optimization of AC Optimal Power Flow with Discrete Demands in Radial Networks
| 2017-09-25 | Paper |
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
Discrete Applied Mathematics | 2017-08-22 | Paper |
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-27 | Paper |
A nested family of \(k\)-total effective rewards for positional games
International Journal of Game Theory | 2017-04-12 | Paper |
A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Towards more practical linear programming-based techniques for algorithmic mechanism design
Theory of Computing Systems | 2017-02-01 | Paper |
Approximation algorithms for the unsplittable flow problem on paths and trees
| 2017-01-26 | Paper |
Markov decision processes and stochastic games with total effective payoff
| 2017-01-24 | Paper |
A polynomial-time algorithm for computing low CP-rank decompositions
Information Processing Letters | 2016-11-23 | Paper |
Complex-demand scheduling problem with application in smart grid
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Optimal Power Flow with Inelastic Demands for Demand Response in Radial Distribution Networks
| 2016-01-11 | Paper |
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
Algorithmic Decision Theory | 2015-11-04 | Paper |
Towards more practical linear programming-based techniques for algorithmic mechanism design
Algorithmic Game Theory | 2015-11-04 | Paper |
On randomized fictitious play for approximating saddle points over convex sets
Algorithmica | 2015-10-19 | Paper |
A potential reduction algorithm for ergodic two-person zero-sum limiting average payoff stochastic games
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
A polynomial delay algorithm for generating connected induced subgraphs of a given cardinality
Journal of Graph Algorithms and Applications | 2015-05-18 | Paper |
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
On tree-constrained matchings and generalizations
Algorithmica | 2015-03-02 | Paper |
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Graphs and Combinatorics | 2014-06-16 | Paper |
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
| 2014-05-22 | Paper |
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
Operations Research Letters | 2014-05-14 | Paper |
A Lower Bound for the HBC Transversal Hypergraph Generation
Fundamenta Informaticae | 2014-05-14 | Paper |
On canonical forms for zero-sum stochastic mean payoff games
Dynamic Games and Applications | 2013-09-16 | Paper |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
On randomized fictitious play for approximating saddle points over convex sets
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Guarding 1.5D terrains with demands
International Journal of Computer Mathematics | 2013-01-18 | Paper |
On the complexity of the highway problem
Theoretical Computer Science | 2012-11-27 | Paper |
A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs
Automata, Languages, and Programming | 2012-11-01 | Paper |
Simpler approximation of the maximum asymmetric traveling salesman problem
| 2012-08-23 | Paper |
Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
Discrete \& Computational Geometry | 2012-08-13 | Paper |
The relation of connected set cover and group Steiner tree
Theoretical Computer Science | 2012-08-08 | Paper |
Improved approximations for guarding 1.5-dimensional terrains
| 2012-04-24 | Paper |
Finding simplices containing the origin in two and three dimensions
International Journal of Computational Geometry & Applications | 2012-04-19 | Paper |
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
Discrete Mathematics | 2012-04-13 | Paper |
Complexity of approximating the vertex centroid of a polyhedron
Theoretical Computer Science | 2012-03-13 | Paper |
On the readability of monotone Boolean formulae
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
Discrete \& Computational Geometry | 2011-11-25 | Paper |
The negative cycles polyhedron and hardness of checking some polyhedral properties
Annals of Operations Research | 2011-11-17 | Paper |
Approximation algorithms for the interval constrained coloring problem
Algorithmica | 2011-09-20 | Paper |
On tree-constrained matchings and generalizations
Automata, Languages and Programming | 2011-07-06 | Paper |
Stochastic mean payoff games: smoothed analysis and approximation schemes
Automata, Languages and Programming | 2011-07-06 | Paper |
Improved approximations for guarding 1.5-dimensional terrains
Algorithmica | 2011-05-10 | Paper |
Left-to-right multiplication for monotone Boolean dualization
SIAM Journal on Computing | 2011-04-04 | Paper |
On a cone covering problem
Computational Geometry | 2011-01-21 | Paper |
On the approximability of the maximum interval constrained coloring problem
Algorithms and Computation | 2010-12-09 | Paper |
Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
Discrete Mathematics | 2010-10-11 | Paper |
Generating all vertices of a polyhedron is hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Algorithms for dualization over products of partially ordered sets
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
On effectivity functions of game forms
Games and Economic Behavior | 2010-03-10 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters | 2010-01-29 | Paper |
Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices
Information Processing Letters | 2010-01-29 | Paper |
Complexity of approximating the vertex centroid of a polyhedron
Algorithms and Computation | 2009-12-17 | Paper |
On profit-maximizing pricing for the highway and tollbooth problems
Algorithmic Game Theory | 2009-12-01 | Paper |
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
Lecture Notes in Computer Science | 2009-10-29 | Paper |
A note on systems with max-min and max-product constraints
Fuzzy Sets and Systems | 2009-08-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On the Readability of Monotone Boolean Formulae
Lecture Notes in Computer Science | 2009-07-23 | Paper |
APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
International Journal of Computational Geometry & Applications | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
scientific article; zbMATH DE number 5548206 (Why is no real title available?)
| 2009-04-28 | Paper |
Generating Minimal k-Vertex Connected Spanning Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Finding All Minimal Infrequent Multi-dimensional Intervals
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics | 2008-09-10 | Paper |
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
Discrete Applied Mathematics | 2008-09-10 | Paper |
On Berge Multiplication for Monotone Boolean Dualization
Automata, Languages and Programming | 2008-08-28 | Paper |
Approximating the Interval Constrained Coloring Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Generating cut conjunctions in graphs and related problems
Algorithmica | 2008-07-01 | Paper |
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences | 2008-06-26 | Paper |
On short paths interdiction problems: Total and node-wise limited interdiction
Theory of Computing Systems | 2008-06-17 | Paper |
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
Parameterized and Exact Computation | 2008-06-05 | Paper |
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-05 | Paper |
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-29 | Paper |
On Approximating the TSP with Intersecting Neighborhoods
Algorithms and Computation | 2008-04-24 | Paper |
Generating all vertices of a polyhedron is hard
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Conflict-Free Colorings of Rectangles Ranges
STACS 2006 | 2008-03-19 | Paper |
Multiconsistency and Robustness with Global Constraints
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2008-03-17 | Paper |
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On enumerating minimal dicuts and strongly connected subgraphs
Algorithmica | 2008-02-18 | Paper |
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Theoretical Computer Science | 2007-09-18 | Paper |
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Theoretical Computer Science | 2007-07-16 | Paper |
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics | 2007-02-19 | Paper |
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Journal of Graph Theory | 2007-02-07 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Discrete Applied Mathematics | 2007-01-09 | Paper |
Multiconsistency and robustness with global constraints
Constraints | 2007-01-05 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2086381 (Why is no real title available?)
| 2004-08-11 | Paper |
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-11 | Paper |
scientific article; zbMATH DE number 2038737 (Why is no real title available?)
| 2004-02-08 | Paper |
An inequality for polymatroid functions and its applications.
Discrete Applied Mathematics | 2003-10-14 | Paper |
scientific article; zbMATH DE number 1953147 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1947411 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1929933 (Why is no real title available?)
| 2003-06-18 | Paper |
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
SIAM Journal on Computing | 2002-09-29 | Paper |
scientific article; zbMATH DE number 1754587 (Why is no real title available?)
| 2002-06-12 | Paper |
Generating dual-bounded hypergraphs
Optimization Methods \& Software | 2002-01-01 | Paper |
