| Publication | Date of Publication | Type |
|---|
| Contracting to a longest path in H-free graphs | 2023-11-14 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2022-03-22 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2021-12-01 | Paper |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs | 2021-05-13 | Paper |
| Simple games versus weighted voting games: bounding the critical threshold value | 2020-04-08 | Paper |
| Approximating bounded-degree spanning trees and connected factors with leaves | 2019-02-22 | Paper |
| Simple games versus weighted voting games | 2018-11-08 | Paper |
| Approximation schemes for wireless networks | 2018-11-05 | Paper |
| The stable fixtures problem with payments | 2018-07-12 | Paper |
| The asymptotic price of anarchy for \(k\)-uniform congestion games | 2018-06-22 | Paper |
| Greedy oriented flows | 2018-05-23 | Paper |
| The Stable Fixtures Problem with Payments | 2016-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816016 | 2016-07-01 | Paper |
| Approximate core allocations and integrality gap for the bin packing game | 2016-04-01 | Paper |
| Improved approximation algorithms for a bilevel knapsack problem | 2015-07-24 | Paper |
| Improved lower bound for online strip packing | 2015-05-12 | Paper |
| Improved Approximation Algorithms for a Bilevel Knapsack Problem | 2014-09-26 | Paper |
| Solutions for the stable roommates problem with payments | 2014-06-06 | Paper |
| Note on non-uniform bin packing games | 2014-05-05 | Paper |
| A note on perfect partial elimination | 2014-01-20 | Paper |
| A tight analysis of Brown-Baker-Katseff sequences for online strip packing | 2013-08-02 | Paper |
| The 1/4-Core of the Uniform Bin Packing Game Is Nonempty | 2013-06-11 | Paper |
| Integrality gap analysis for bin packing games | 2012-11-08 | Paper |
| Solutions for the Stable Roommates Problem with Payments | 2012-11-06 | Paper |
| Improved Lower Bound for Online Strip Packing | 2012-07-16 | Paper |
| On bounded block decomposition problems for under-specified systems of equations | 2012-05-11 | Paper |
| A ranking model for the greedy algorithm and discrete convexity | 2012-04-27 | Paper |
| Computing solutions for matching games | 2012-02-22 | Paper |
| On Greedy and Submodular Matrices | 2011-05-12 | Paper |
| Improved Taxation Rate for Bin Packing Games | 2011-05-12 | Paper |
| On the Core and f-Nucleolus of Flow Games | 2011-04-27 | Paper |
| Quadratic programming and combinatorial minimum weight product problems | 2010-07-21 | Paper |
| On Solution Concepts for Matching Games | 2010-06-17 | Paper |
| Quality of move-optimal schedules for minimizing total weighted completion time | 2008-03-28 | Paper |
| Computing an element in the lexicographic kernel of a game | 2008-03-06 | Paper |
| Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees | 2008-01-16 | Paper |
| Dynamic programming for minimum Steiner trees | 2007-12-19 | Paper |
| The number of tree stars is \(O^{*}(1.357^k)\) | 2007-11-28 | Paper |
| An improved local search algorithm for 3-SAT | 2007-05-29 | Paper |
| The number of tree stars is O*(1.357k) | 2007-05-29 | Paper |
| Quadratic Programming and Combinatorial Minimum Weight Product Problems | 2007-05-02 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708535 | 2005-11-18 | Paper |
| Matching Games: The Least Core and the Nucleolus | 2005-11-11 | Paper |
| The computational complexity of the elimination problem in generalized sports competitions | 2005-08-22 | Paper |
| Online matching on a line | 2005-04-06 | Paper |
| An improved deterministic local search algorithm for 3-SAT | 2005-02-09 | Paper |
| Note on the game chromatic index of trees | 2004-10-27 | Paper |
| The new FIFA rules are hard: Complexity aspects of sports competitions. | 2004-02-18 | Paper |
| On the computation of the nucleolus of a cooperative game | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4786439 | 2002-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780783 | 2002-11-21 | Paper |
| On a problem about covering lines by squares | 2001-11-05 | Paper |
| A Lagrangian relaxation approach to the edge-weighted clique problem | 2001-01-01 | Paper |
| On the core of ordered submodular cost games | 2000-08-14 | Paper |
| Computing the nucleolus of min-cost spanning tree games is NP-hard. | 2000-04-11 | Paper |
| A Greedy On-Line Algorithm for thek-Track Assignment Problem | 2000-01-12 | Paper |
| Note on the computational complexity of least core concepts for min-cost spanning tree games. | 2000-01-01 | Paper |
| An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games | 2000-01-01 | Paper |
| The nucleon of cooperative games and an algorithm for matching games | 1999-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233335 | 1999-04-27 | Paper |
| Approximate Core Allocation for Binpacking Games | 1998-09-21 | Paper |
| On the complexity of testing membership in the core of min-cost spanning tree games | 1998-04-22 | Paper |
| On approximately fair cost allocation in Euclidean TSP games | 1998-04-13 | Paper |
| Submodular linear programs on forests | 1997-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882998 | 1996-10-09 | Paper |
| Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) | 1996-07-28 | Paper |
| A Characterization of Nonnegative Box-Greedy Matrices | 1996-04-24 | Paper |
| On the average rank of LYM-sets | 1996-03-19 | Paper |
| Randomized online algorithms for maximizing busy time interval scheduling | 1996-03-17 | Paper |
| A random polynomial time algorithm for well-routing convex bodies | 1995-08-20 | Paper |
| Modular Substructures in Pseudomodular Lattices. | 1995-04-20 | Paper |
| Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints | 1995-01-12 | Paper |
| Scheduling jobs with release times on a machine with finite storage | 1994-08-18 | Paper |
| A Group-Theoretic Setting for Some Intersecting Sperner Families | 1994-08-10 | Paper |
| A guided tour through oriented matroid axioms | 1994-03-07 | Paper |
| On the depth of combinatorial optimization problems | 1994-01-09 | Paper |
| On some approximately balanced combinatorial cooperative games | 1993-12-06 | Paper |
| The Shapley value for cooperative games under precedence constraints | 1993-02-14 | Paper |
| Learning convex bodies under uniform distribution | 1993-01-16 | Paper |
| Linear programming duality: an introduction to oriented matroids | 1992-09-18 | Paper |
| Some Convergence Results for Probabilistic Tabu Search | 1992-08-13 | Paper |
| Matroid matching in pseudomodular lattices | 1992-06-25 | Paper |
| Note on the Convergence of Simulated Annealing Algorithms | 1992-06-25 | Paper |
| Some order dimension bounds for communication complexity problems | 1991-01-01 | Paper |
| On adjoints and dual matroids | 1990-01-01 | Paper |
| Optimization and optimality test for the Max-Cut Problem | 1990-01-01 | Paper |
| On a problem about covering lines by squares | 1990-01-01 | Paper |
| A probabilistic analysis of the switching algorithm for the Euclidean TSP | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3031924 | 1989-01-01 | Paper |
| On the Rate of Convergence of Some Stochastic Processes | 1989-01-01 | Paper |
| On sticky matroids | 1988-01-01 | Paper |
| On finite locally projective planar spaces | 1988-01-01 | Paper |
| Adjoints of oriented matroids | 1986-01-01 | Paper |
| Extension equivalence of oriented matroids | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749070 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337482 | 1984-01-01 | Paper |
