| Publication | Date of Publication | Type |
|---|
On the complexity of nucleolus computation for bipartite \(b\)-matching games
Theoretical Computer Science | 2024-04-17 | Paper |
| Hitting Weighted Even Cycles in Planar Graphs | 2023-11-20 | Paper |
Scalable timing-aware network design via Lagrangian decomposition
European Journal of Operational Research | 2023-07-10 | Paper |
Approximating stable matchings with ties of bounded size
(available as arXiv preprint) | 2022-12-21 | Paper |
A general framework for computing the nucleolus via dynamic programming
(available as arXiv preprint) | 2022-12-21 | Paper |
On the complexity of nucleolus computation for bipartite \(b\)-matching games
(available as arXiv preprint) | 2022-06-01 | Paper |
On the integrality gap of the prize-collecting Steiner forest LP
(available as arXiv preprint) | 2021-07-28 | Paper |
Travelling on graphs with small highway dimension
Algorithmica | 2021-04-19 | Paper |
Computing the nucleolus of weighted cooperative matching games in polynomial time
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Travelling on graphs with small highway dimension
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Computing the nucleolus of weighted cooperative matching games in polynomial time
Lecture Notes in Computer Science | 2020-02-06 | Paper |
| Optimized Cranial Bandeau Remodeling | 2019-12-22 | Paper |
Vehicle routing with subtours
Discrete Optimization | 2019-11-28 | Paper |
Additive stabilizers for unstable graphs
Discrete Optimization | 2019-06-13 | Paper |
| Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling | 2019-05-10 | Paper |
An elementary integrality proof of Rothblum's stable matching formulation
Operations Research Letters | 2019-01-15 | Paper |
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
SIAM Journal on Computing | 2018-09-18 | Paper |
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
(available as arXiv preprint) | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6850362 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850362 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
(available as arXiv preprint) | 2017-10-17 | Paper |
| On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree | 2017-03-22 | Paper |
Stable marriage with general preferences
Theory of Computing Systems | 2017-02-01 | Paper |
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Lehman's theorem and the directed Steiner tree problem
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
Network bargaining: using approximate blocking sets to stabilize unstable instances
Theory of Computing Systems | 2016-01-13 | Paper |
Finding small stabilizers for unstable graphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Approximate Deadline-Scheduling with Precedence Constraints
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Automata, Languages, and Programming | 2015-10-27 | Paper |
Sharing the cost more efficiently
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Efficient cost-sharing mechanisms for prize-collecting problems
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Stable marriage with general preferences. Extended abstract
Algorithmic Game Theory | 2015-01-14 | Paper |
| An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem | 2014-12-18 | Paper |
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| A group-strategyproof mechanism for Steiner forests | 2014-10-13 | Paper |
| Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy | 2014-10-13 | Paper |
Social exchange networks with distant bargaining
Theoretical Computer Science | 2014-10-06 | Paper |
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
| A gentle introduction to optimization | 2014-09-25 | Paper |
Finding small stabilizers for unstable graphs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Linear Programming Hierarchies Suffice for Directed Steiner Tree
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
The school bus problem on trees
Algorithmica | 2013-11-11 | Paper |
On generalizations of network design problems with degree bounds
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Network bargaining with general capacities
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Better approximation algorithms for technology diffusion
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Hypergraphic LP relaxations for Steiner trees
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Social exchange networks with distant bargaining
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Network bargaining: using approximate blocking sets to stabilize unstable instances
Lecture Notes in Computer Science | 2013-03-13 | Paper |
The school bus problem on trees
Algorithms and Computation | 2011-12-16 | Paper |
Strict cost sharing schemes for Steiner forest
SIAM Journal on Computing | 2011-04-04 | Paper |
A unified approach to approximating partial covering problems
Algorithmica | 2011-03-30 | Paper |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On column-restricted and priority covering integer programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On generalizations of network design problems with degree bounds
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Hypergraphic LP relaxations for Steiner trees
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Approximating the degree-bounded minimum diameter spanning tree problem
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
SIAM Journal on Computing | 2009-06-22 | Paper |
On the integrality ratio for tree augmentation
Operations Research Letters | 2009-03-04 | Paper |
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
SIAM Journal on Computing | 2008-10-28 | Paper |
Cut Problems in Graphs with a Budget Constraint
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing | 2008-04-22 | Paper |
A Unified Approach to Approximating Partial Covering Problems
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
SIAM Journal on Computing | 2005-09-16 | Paper |
Approximating \(k\)-hop minimum-spanning trees
Operations Research Letters | 2005-08-25 | Paper |
Approximating the degree-bounded minimum diameter spanning tree problem
Algorithmica | 2005-02-21 | Paper |
Min-max tree covers of graphs.
Operations Research Letters | 2005-01-11 | Paper |
An approximation algorithm for the edge-dilation \(k\)-center problem.
Operations Research Letters | 2005-01-11 | Paper |
Non-clairvoyant scheduling for minimizing mean slowdown
Algorithmica | 2004-11-05 | Paper |
Improved approximations for tour and tree covers
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2089224 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2079379 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 1962819 (Why is no real title available?) | 2003-08-11 | Paper |
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1670541 (Why is no real title available?) | 2002-01-06 | Paper |
