| Publication | Date of Publication | Type |
|---|
| Enumeration algorithm for the edge coloring problem on bipartite graphs | 2024-07-05 | Paper |
| Monte Carlo methods for the Shapley-Shubik power index | 2022-11-02 | Paper |
| Trading transforms of non-weighted simple games and integer weights of weighted simple games | 2022-07-22 | Paper |
| Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games | 2022-01-24 | Paper |
| Additive approximation algorithms for modularity maximization | 2021-02-02 | Paper |
| A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption | 2020-10-07 | Paper |
| A doubly nonnegative relaxation for modularity density maximization | 2020-02-20 | Paper |
| Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists | 2019-09-13 | Paper |
| Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor | 2019-05-09 | Paper |
| Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems | 2019-02-14 | Paper |
| Compare the ratio of symmetric polynomials of odds to one and stop | 2018-09-26 | Paper |
| A linear time algorithm for the unbalanced Hitchcock transportation problem | 2018-05-23 | Paper |
| CHARACTERIZING DELAUNAY GRAPHS VIA FIXED POINT THEOREM: A SIMPLE PROOF | 2018-05-18 | Paper |
| Additive Approximation Algorithms for Modularity Maximization | 2018-04-19 | Paper |
| BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY | 2017-12-11 | Paper |
| Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems | 2017-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2833773 | 2016-11-25 | Paper |
| Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings | 2016-05-19 | Paper |
| Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography | 2015-09-11 | Paper |
| A 2.75-approximation algorithm for the unconstrained traveling tournament problem | 2014-11-26 | Paper |
| A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping | 2014-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921755 | 2014-10-13 | Paper |
| Fractional programming formulation for the vertex coloring problem | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906130 | 2013-02-07 | Paper |
| An approximation algorithm for the traveling tournament problem | 2012-11-15 | Paper |
| Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane | 2011-12-16 | Paper |
| An improved approximation algorithm for the traveling tournament problem | 2011-12-14 | Paper |
| Polynomial time approximate or perfect samplers for discretized Dirichlet distribution | 2011-02-08 | Paper |
| Cheating strategies for the Gale-Shapley algorithm with complete preference lists | 2010-10-07 | Paper |
| A note on generalized rank aggregation | 2010-08-20 | Paper |
| An Improved Approximation Algorithm for the Traveling Tournament Problem | 2009-12-17 | Paper |
| Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers | 2009-08-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems | 2009-06-24 | Paper |
| An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors | 2009-06-24 | Paper |
| A study of the quadratic semi-assignment polytope | 2009-04-17 | Paper |
| A general construction method for mixed-level supersaturated design | 2008-12-11 | Paper |
| Exact algorithms for the master ring problem | 2008-10-08 | Paper |
| Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers | 2008-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442491 | 2008-02-22 | Paper |
| Approximation Algorithms for Minimum Span Channel Assignment Problems | 2008-01-04 | Paper |
| Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks | 2007-05-29 | Paper |
| Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem | 2007-05-29 | Paper |
| Polynomial time perfect sampling algorithm for two-rowed contingency tables | 2007-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485309 | 2006-08-29 | Paper |
| Semidefinite programming based approaches to the break minimization problem | 2006-01-18 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5695986 | 2005-10-07 | Paper |
| A polynomial-time algorithm to find an equitable home--away assignment | 2005-06-01 | Paper |
| LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS | 2005-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154676 | 2005-01-14 | Paper |
| Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables | 2005-01-11 | Paper |
| NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT | 2004-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4433622 | 2003-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4423033 | 2003-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780789 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753323 | 2002-09-26 | Paper |
| Optimality of mixed-level supersaturated designs | 2002-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548303 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536691 | 2002-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4538166 | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331285 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331296 | 2002-05-15 | Paper |
| NP-completeness for calculating power indices of weighted majority games | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708237 | 2001-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722004 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761862 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504025 | 2001-02-13 | Paper |
| A fast bipartite network flow algorithm for selective assembly | 1998-12-06 | Paper |
| An algorithm for fractional assignment problems | 1995-09-14 | Paper |
| The minimum spanning tree problem on a planar graph | 1995-06-14 | Paper |
| Adjacency on combinatorial polyhedra | 1995-05-04 | Paper |
| A Note on K-Best Solutions to the Chinese Postman Problem | 1995-02-19 | Paper |
| AN INEFFICIENCY MEASUREMENT METHOD FOR MANAGEMENT SYSTEMS | 1995-02-19 | Paper |
| Adjacency of the best and second best valued solutions in combinatorial optimization problems | 1995-01-31 | Paper |
| Algorithms for finding a \(K\)th best valued assignment | 1994-07-18 | Paper |
| Finding all minimum-cost perfect matchings in Bipartite graphs | 1992-10-13 | Paper |
| Parametric simplex algorithms for solving a special class of nonconvex minimization problems | 1992-06-26 | Paper |
| On the finiteness of the criss-cross method | 1992-06-25 | Paper |
