| Publication | Date of Publication | Type |
|---|
| Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques | 2024-03-15 | Paper |
| Characterization and algorithm for bivariate multi-unit assignment valuations | 2024-01-18 | Paper |
| Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines | 2023-08-03 | Paper |
| M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System | 2022-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5012285 | 2021-08-31 | Paper |
| Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints | 2020-11-09 | Paper |
| A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption | 2020-10-07 | Paper |
| Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost | 2020-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5208430 | 2020-01-15 | Paper |
| Models and algorithms for energy-efficient scheduling with immediate start of jobs | 2019-08-08 | Paper |
| Exact bounds for steepest descent algorithms of $L$-convex function minimization | 2018-09-28 | Paper |
| On Equivalence of M$^\natural$-concavity of a Set Function and Submodularity of Its Conjugate | 2018-09-17 | Paper |
| Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches | 2018-05-30 | Paper |
| Time bounds for iterative auctions: a unified approach by discrete convex analysis | 2018-05-24 | Paper |
| Buyback problem with discrete concave valuation functions | 2018-05-24 | Paper |
| Simpler exchange axioms for M-concave functions on generalized polymatroids | 2018-04-12 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization | 2018-02-13 | Paper |
| ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS | 2017-12-11 | Paper |
| Note on time bounds of two-phase algorithms for \(L\)-convex function minimization | 2017-08-28 | Paper |
| A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks | 2016-12-19 | Paper |
| Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines | 2016-05-19 | Paper |
| EQUILIBRIUM, AUCTION, AND GENERALIZED GROSS SUBSTITUTES AND COMPLEMENTS | 2016-04-13 | Paper |
| Buyback Problem with Discrete Concave Valuation Functions | 2016-02-26 | Paper |
| MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS | 2015-12-11 | Paper |
| Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times | 2015-10-19 | Paper |
| Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions | 2015-09-15 | Paper |
| GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY | 2015-08-05 | Paper |
| Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints | 2015-04-01 | Paper |
| Dijkstra's algorithm and L-concave function maximization | 2014-06-27 | Paper |
| Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items | 2014-01-14 | Paper |
| OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM | 2014-01-03 | Paper |
| A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines | 2013-06-27 | Paper |
| Matroid rank functions and discrete concavity | 2012-12-28 | Paper |
| Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra | 2012-08-22 | Paper |
| M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm | 2012-01-09 | Paper |
| Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints | 2011-09-16 | Paper |
| Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions | 2011-07-01 | Paper |
| A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions | 2011-02-16 | Paper |
| Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra | 2010-12-09 | Paper |
| Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm | 2010-01-29 | Paper |
| New algorithms for convex cost tension problem with application to computer vision | 2009-11-23 | Paper |
| A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions | 2009-07-23 | Paper |
| SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION | 2009-06-23 | Paper |
| ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS | 2009-06-23 | Paper |
| NOTE ON THE CONTINUITY OF M-CONVEX AND L-CONVEX FUNCTIONS IN CONTINUOUS VARIABLES | 2009-05-22 | Paper |
| Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach | 2008-11-25 | Paper |
| Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems | 2008-05-22 | Paper |
| EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS | 2006-10-04 | Paper |
| Substitutes and complements in network flows viewed as discrete convexity | 2006-01-09 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem | 2005-11-11 | Paper |
| A fast, accurate, and simple method for pricing European-Asian and saving-Asian options | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5462186 | 2005-08-01 | Paper |
| Conjugacy relationship between M-convex and L-convex functions in continuous variables | 2005-02-24 | Paper |
| Quadratic M-convex and L-convex functions | 2004-10-12 | Paper |
| The MA-ordering max-flow algorithm is not strongly polynomial for directed networks | 2004-07-01 | Paper |
| Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. | 2004-01-26 | Paper |
| Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411409 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548801 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331292 | 2002-05-15 | Paper |
| M-Convex Function on Generalized Polymatroid | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253469 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761946 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952722 | 2001-02-08 | Paper |
| Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks | 2001-01-01 | Paper |
| Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. | 2001-01-01 | Paper |
| Extension of M-convexity and L-convexity to polyhedral convex functions | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703087 | 1999-12-14 | Paper |
| A constructive proof for the induction of M-convex functions through networks | 1998-11-26 | Paper |
| Minimization of an M-convex function | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367277 | 1997-11-25 | Paper |
| A Linear Time Algorithm for Finding ak-Tree Core | 1997-06-04 | Paper |
| An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs | 1997-05-26 | Paper |
| EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH | 1997-05-25 | Paper |
