| Publication | Date of Publication | Type |
|---|
| A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces | 2024-06-17 | Paper |
| Geometric stabbing via threshold rounding and factor revealing LPs | 2024-04-02 | Paper |
| Anti Tai mapping for unordered labeled trees | 2024-03-13 | Paper |
| On Dualization over Distributive Lattices | 2023-05-31 | Paper |
| Approximations for generalized unsplittable flow on paths with application to power systems optimization | 2023-01-23 | Paper |
| Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations | 2022-12-08 | Paper |
| Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs | 2022-11-04 | Paper |
| Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations | 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 | 2022-04-20 | Paper |
| Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs | 2022-01-18 | Paper |
| A PTAS for a class of binary non-linear programs with low-rank functions | 2021-12-13 | Paper |
| Generating clause sequences of a CNF formula | 2021-01-19 | Paper |
| Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks | 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 | 2020-03-26 | Paper |
| Computational aspects of optimal strategic network diffusion | 2020-03-12 | Paper |
| Approximation schemes for \(r\)-weighted minimization knapsack problems | 2020-01-20 | Paper |
| A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem | 2019-09-11 | Paper |
| A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions | 2019-05-29 | Paper |
| A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs | 2019-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633936 | 2019-05-06 | Paper |
| Quantifying Inefficiency of Fair Cost-Sharing Mechanisms for Sharing Economy | 2019-03-29 | Paper |
| A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs | 2019-03-26 | Paper |
| Complex-demand scheduling problem with application in smart grid | 2019-02-20 | Paper |
| Approximation schemes for stochastic mean payoff games with perfect information and few random positions | 2019-01-11 | Paper |
| Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks | 2018-12-19 | Paper |
| On the approximability of the maximum interval constrained coloring problem | 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 | 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 | 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 | 2017-08-22 | Paper |
| Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames | 2017-04-27 | Paper |
| A nested family of \(k\)-total effective rewards for positional games | 2017-04-12 | Paper |
| A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs | 2017-04-04 | Paper |
| Towards more practical linear programming-based techniques for algorithmic mechanism design | 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 | 2016-11-23 | Paper |
| Complex-demand scheduling problem with application in smart grid | 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 | 2015-11-04 | Paper |
| Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design | 2015-11-04 | Paper |
| On randomized fictitious play for approximating saddle points over convex sets | 2015-10-19 | Paper |
| A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games | 2015-09-11 | Paper |
| A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality | 2015-05-18 | Paper |
| A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem | 2015-03-16 | Paper |
| On tree-constrained matchings and generalizations | 2015-03-02 | Paper |
| Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism | 2014-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417622 | 2014-05-22 | Paper |
| On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness | 2014-05-14 | Paper |
| A Lower Bound for the HBC Transversal Hypergraph Generation | 2014-05-14 | Paper |
| On canonical forms for zero-sum stochastic mean payoff games | 2013-09-16 | Paper |
| A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions | 2013-08-06 | Paper |
| On randomized fictitious play for approximating saddle points over convex sets | 2013-06-11 | Paper |
| Guarding 1.5D terrains with demands | 2013-01-18 | Paper |
| On the complexity of the highway problem | 2012-11-27 | Paper |
| A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs | 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 | 2012-08-13 | Paper |
| The relation of connected set cover and group Steiner tree | 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 | 2012-04-19 | Paper |
| On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games | 2012-04-13 | Paper |
| Complexity of approximating the vertex centroid of a polyhedron | 2012-03-13 | Paper |
| On the readability of monotone Boolean formulae | 2011-12-15 | Paper |
| A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics | 2011-11-25 | Paper |
| The negative cycles polyhedron and hardness of checking some polyhedral properties | 2011-11-17 | Paper |
| Approximation algorithms for the interval constrained coloring problem | 2011-09-20 | Paper |
| On Tree-Constrained Matchings and Generalizations | 2011-07-06 | Paper |
| Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes | 2011-07-06 | Paper |
| Improved approximations for guarding 1.5-dimensional terrains | 2011-05-10 | Paper |
| Left-to-Right Multiplication for Monotone Boolean Dualization | 2011-04-04 | Paper |
| On a cone covering problem | 2011-01-21 | Paper |
| On the Approximability of the Maximum Interval Constrained Coloring Problem | 2010-12-09 | Paper |
| Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry | 2010-10-11 | Paper |
| Generating all vertices of a polyhedron is hard | 2010-08-16 | Paper |
| A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information | 2010-06-22 | Paper |
| Algorithms for Dualization over Products of Partially Ordered Sets | 2010-03-17 | Paper |
| On effectivity functions of game forms | 2010-03-10 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A global parallel algorithm for the hypergraph transversal problem | 2010-01-29 | Paper |
| Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices | 2010-01-29 | Paper |
| Complexity of approximating the vertex centroid of a polyhedron | 2009-12-17 | Paper |
| On Profit-Maximizing Pricing for the Highway and Tollbooth Problems | 2009-12-01 | Paper |
| Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs | 2009-10-29 | Paper |
| A note on systems with max-min and max-product constraints | 2009-08-28 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On the Readability of Monotone Boolean Formulae | 2009-07-23 | Paper |
| APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS | 2009-06-30 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3622253 | 2009-04-28 | Paper |
| Generating Minimal k-Vertex Connected Spanning Subgraphs | 2009-03-06 | Paper |
| On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism | 2009-02-12 | Paper |
| A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs | 2008-09-25 | Paper |
| Finding All Minimal Infrequent Multi-dimensional Intervals | 2008-09-18 | Paper |
| On the complexity of monotone dualization and generating minimal hypergraph transversals | 2008-09-10 | Paper |
| Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions | 2008-09-10 | Paper |
| On Berge Multiplication for Monotone Boolean Dualization | 2008-08-28 | Paper |
| Approximating the Interval Constrained Coloring Problem | 2008-07-15 | Paper |
| Generating cut conjunctions in graphs and related problems | 2008-07-01 | Paper |
| Simultaneous matchings: Hardness and approximation | 2008-06-26 | Paper |
| On short paths interdiction problems: Total and node-wise limited interdiction | 2008-06-17 | Paper |
| Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems | 2008-06-05 | Paper |
| A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames | 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) | 2008-04-29 | Paper |
| On Approximating the TSP with Intersecting Neighborhoods | 2008-04-24 | Paper |
| Generating all vertices of a polyhedron is hard | 2008-04-16 | Paper |
| Conflict-Free Colorings of Rectangles Ranges | 2008-03-19 | Paper |
| Multiconsistency and Robustness with Global Constraints | 2008-03-17 | Paper |
| On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization | 2008-03-11 | Paper |
| Enumerating Spanning and Connected Subsets in Graphs and Matroids | 2008-03-11 | Paper |
| On enumerating minimal dicuts and strongly connected subgraphs | 2008-02-18 | Paper |
| On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs | 2007-09-18 | Paper |
| Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data | 2007-07-16 | Paper |
| Enumerating disjunctions and conjunctions of paths and cuts in reliability theory | 2007-02-19 | Paper |
| Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms | 2007-02-07 | Paper |
| An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation | 2007-01-09 | Paper |
| Multiconsistency and robustness with global constraints | 2007-01-05 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| On the Complexity of Some Enumeration Problems for Matroids | 2006-06-01 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736835 | 2004-08-11 | Paper |
| Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449202 | 2004-02-08 | Paper |
| An inequality for polymatroid functions and its applications. | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414551 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411378 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708565 | 2003-06-18 | Paper |
| Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535012 | 2002-06-12 | Paper |
| Generating dual-bounded hypergraphs | 2002-01-01 | Paper |
