| 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
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Theoretical Computer Science | 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
Social Choice and Welfare | 2020-04-08 | Paper |
Approximating bounded-degree spanning trees and connected factors with leaves
Operations Research Letters | 2019-02-22 | Paper |
Simple games versus weighted voting games
| 2018-11-08 | Paper |
Approximation schemes for wireless networks
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The stable fixtures problem with payments
Games and Economic Behavior | 2018-07-12 | Paper |
The asymptotic price of anarchy for \(k\)-uniform congestion games
| 2018-06-22 | Paper |
Greedy oriented flows
Algorithmica | 2018-05-23 | Paper |
The stable fixtures problem with payments
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
A simple dual ascent algorithm for the multilevel facility location problem
| 2016-07-01 | Paper |
Relaxation methods for the Generalized Minimum Spanning Tree problem
| 2016-07-01 | Paper |
Approximate core allocations and integrality gap for the bin packing game
Theoretical Computer Science | 2016-04-01 | Paper |
Improved approximation algorithms for a bilevel knapsack problem
Theoretical Computer Science | 2015-07-24 | Paper |
Improved lower bound for online strip packing
Theory of Computing Systems | 2015-05-12 | Paper |
Improved approximation algorithms for a bilevel knapsack problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Solutions for the stable roommates problem with payments
Theoretical Computer Science | 2014-06-06 | Paper |
Note on non-uniform bin packing games
Discrete Applied Mathematics | 2014-05-05 | Paper |
A note on perfect partial elimination
Discrete Mathematics | 2014-01-20 | Paper |
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
The 1/4-core of the uniform bin packing game is nonempty
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Integrality gap analysis for bin packing games
Operations Research Letters | 2012-11-08 | Paper |
Solutions for the stable roommates problem with payments
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Improved Lower Bound for Online Strip Packing
Approximation and Online Algorithms | 2012-07-16 | Paper |
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences | 2012-05-11 | Paper |
A ranking model for the greedy algorithm and discrete convexity
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
Computing solutions for matching games
International Journal of Game Theory | 2012-02-22 | Paper |
On greedy and submodular matrices
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Improved Taxation Rate for Bin Packing Games
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
On the core and \(f\)-nucleolus of flow games
Mathematics of Operations Research | 2011-04-27 | Paper |
Quadratic programming and combinatorial minimum weight product problems
Mathematical Programming. Series A. Series B | 2010-07-21 | Paper |
On solution concepts for matching games
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Quality of move-optimal schedules for minimizing total weighted completion time
Operations Research Letters | 2008-03-28 | Paper |
Computing an element in the lexicographic kernel of a game
Mathematical Methods of Operations Research | 2008-03-06 | Paper |
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
Mathematical Methods of Operations Research | 2008-01-16 | Paper |
Dynamic programming for minimum Steiner trees
Theory of Computing Systems | 2007-12-19 | Paper |
The number of tree stars is \(O^{*}(1.357^k)\)
Algorithmica | 2007-11-28 | Paper |
An improved local search algorithm for 3-SAT
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The number of tree stars is O*(1.357k)
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Quadratic Programming and Combinatorial Minimum Weight Product Problems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
scientific article; zbMATH DE number 2230243 (Why is no real title available?)
| 2005-11-18 | Paper |
Matching Games: The Least Core and the Nucleolus
Mathematics of Operations Research | 2005-11-11 | Paper |
The computational complexity of the elimination problem in generalized sports competitions
Discrete Optimization | 2005-08-22 | Paper |
Online matching on a line
Theoretical Computer Science | 2005-04-06 | Paper |
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science | 2005-02-09 | Paper |
Note on the game chromatic index of trees
Theoretical Computer Science | 2004-10-27 | Paper |
The new FIFA rules are hard: Complexity aspects of sports competitions.
Discrete Applied Mathematics | 2004-02-18 | Paper |
On the computation of the nucleolus of a cooperative game
International Journal of Game Theory | 2003-11-23 | Paper |
scientific article; zbMATH DE number 1845876 (Why is no real title available?)
| 2002-12-16 | Paper |
scientific article; zbMATH DE number 1833402 (Why is no real title available?)
| 2002-11-21 | Paper |
On a problem about covering lines by squares
Séminaire Lotharingien de Combinatoire | 2001-11-05 | Paper |
A Lagrangian relaxation approach to the edge-weighted clique problem
European Journal of Operational Research | 2001-01-01 | Paper |
On the core of ordered submodular cost games
Mathematical Programming. Series A. Series B | 2000-08-14 | Paper |
Computing the nucleolus of min-cost spanning tree games is NP-hard.
International Journal of Game Theory | 2000-04-11 | Paper |
A Greedy On-Line Algorithm for thek-Track Assignment Problem
Journal of Algorithms | 2000-01-12 | Paper |
An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
Order | 2000-01-01 | Paper |
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Mathematical Methods of Operations Research | 2000-01-01 | Paper |
The nucleon of cooperative games and an algorithm for matching games
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
scientific article; zbMATH DE number 1264403 (Why is no real title available?)
| 1999-04-27 | Paper |
Approximate Core Allocation for Binpacking Games
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory | 1998-04-22 | Paper |
On approximately fair cost allocation in Euclidean TSP games
OR Spektrum | 1998-04-13 | Paper |
Submodular linear programs on forests
Mathematical Programming. Series A. Series B | 1997-02-23 | Paper |
scientific article; zbMATH DE number 894723 (Why is no real title available?)
| 1996-10-09 | Paper |
Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
Mathematical Programming. Series A. Series B | 1996-07-28 | Paper |
A Characterization of Nonnegative Box-Greedy Matrices
SIAM Journal on Discrete Mathematics | 1996-04-24 | Paper |
On the average rank of LYM-sets
Discrete Mathematics | 1996-03-19 | Paper |
Randomized online algorithms for maximizing busy time interval scheduling
Computing | 1996-03-17 | Paper |
A random polynomial time algorithm for well-routing convex bodies
Discrete Applied Mathematics | 1995-08-20 | Paper |
Modular Substructures in Pseudomodular Lattices.
MATHEMATICA SCANDINAVICA | 1995-04-20 | Paper |
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
Operations Research | 1995-01-12 | Paper |
Scheduling jobs with release times on a machine with finite storage
European Journal of Operational Research | 1994-08-18 | Paper |
A Group-Theoretic Setting for Some Intersecting Sperner Families
Combinatorics, Probability and Computing | 1994-08-10 | Paper |
A guided tour through oriented matroid axioms
Acta Mathematicae Applicatae Sinica. English Series | 1994-03-07 | Paper |
On the depth of combinatorial optimization problems
Discrete Applied Mathematics | 1994-01-09 | Paper |
On some approximately balanced combinatorial cooperative games
ZOR - Methods and Models of Operations Research | 1993-12-06 | Paper |
The Shapley value for cooperative games under precedence constraints
International Journal of Game Theory | 1993-02-14 | Paper |
Learning convex bodies under uniform distribution
Information Processing Letters | 1993-01-16 | Paper |
Linear programming duality: an introduction to oriented matroids
Universitext | 1992-09-18 | Paper |
Some Convergence Results for Probabilistic Tabu Search
ORSA Journal on Computing | 1992-08-13 | Paper |
Note on the Convergence of Simulated Annealing Algorithms
SIAM Journal on Control and Optimization | 1992-06-25 | Paper |
Matroid matching in pseudomodular lattices
Combinatorica | 1992-06-25 | Paper |
Some order dimension bounds for communication complexity problems
Acta Informatica | 1991-01-01 | Paper |
Optimization and optimality test for the Max-Cut Problem
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1990-01-01 | Paper |
On adjoints and dual matroids
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
On a problem about covering lines by squares
Discrete & Computational Geometry | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4130003 (Why is no real title available?)
| 1989-01-01 | Paper |
A probabilistic analysis of the switching algorithm for the Euclidean TSP
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the Rate of Convergence of Some Stochastic Processes
Mathematics of Operations Research | 1989-01-01 | Paper |
On sticky matroids
Discrete Mathematics | 1988-01-01 | Paper |
On finite locally projective planar spaces
Journal of Combinatorial Theory. Series A | 1988-01-01 | Paper |
Adjoints of oriented matroids
Combinatorica | 1986-01-01 | Paper |
Extension equivalence of oriented matroids
European Journal of Combinatorics | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3985242 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3869347 (Why is no real title available?)
| 1984-01-01 | Paper |
Partitioned Matching Games for International Kidney Exchange
| N/A | Paper |
