| Publication | Date of Publication | Type |
|---|
Algorithms for maximum social welfare of online random trading
Discrete Applied Mathematics | 2024-06-20 | Paper |
Packing Feedback Arc Sets in Tournaments Exactly
Mathematics of Operations Research | 2024-03-05 | Paper |
Bounding Residence Times for Atomic Dynamic Routings
Mathematics of Operations Research | 2023-01-09 | Paper |
On weak Pareto optimality of nonatomic routing networks
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Mechanisms for dual-role-facility location games: truthfulness and approximability
Theoretical Computer Science | 2022-09-16 | Paper |
Atomic dynamic flow games: adaptive vs. nonadaptive agents
Operations Research | 2022-02-16 | Paper |
Algorithms for the metric ring star problem with fixed edge-cost ratio
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
Information Processing Letters | 2021-03-11 | Paper |
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
Theoretical Computer Science | 2020-09-01 | Paper |
Sequential Location Game on Continuous Directional Star Networks
Complexity and Approximation | 2020-07-20 | Paper |
| The price of anarchy for the load balancing game with a randomizing scheduler | 2020-05-13 | Paper |
Ranking tournaments with no errors. II: Minimax relation
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Ranking tournaments with no errors. I: Structural description
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Densities, matchings, and fractional edge-colorings
SIAM Journal on Optimization | 2019-02-08 | Paper |
| The equilibrium existence of a robust routing game under interval uncertainty | 2018-11-08 | Paper |
Mechanism design for two-opposite-facility location games with penalties on distance
(available as arXiv preprint) | 2018-11-08 | Paper |
Embedding games with strategic complements into games with strategic substitutes
Journal of Mathematical Economics | 2018-10-26 | Paper |
Covering triangles in edge-weighted graphs
Theory of Computing Systems | 2018-08-03 | Paper |
| Algorithms for the ring star problem | 2018-03-26 | Paper |
Finding connected \(k\)-subgraphs with high density
Information and Computation | 2017-09-28 | Paper |
Continuous firefighting on infinite square grids
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Approximation algorithms for pricing with negative network externalities
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Network characterizations for excluding Braess's paradox
Theory of Computing Systems | 2017-02-01 | Paper |
Total dual integrality of triangle covering
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Sufficient conditions for Tuza's conjecture on packing and covering triangles
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Efficient mechanism design for online scheduling
The Journal of Artificial Intelligence Research (JAIR) | 2016-09-07 | Paper |
Network topologies for weakly Pareto optimal nonatomic selfish routing
Lecture Notes in Computer Science | 2016-09-02 | Paper |
A Polyhedral Description of Kernels
Mathematics of Operations Research | 2016-08-10 | Paper |
Copula-based randomized mechanisms for truthful scheduling on two unrelated machines
Theory of Computing Systems | 2016-01-13 | Paper |
Approximation for the minimum cost doubly resolving set problem
Theoretical Computer Science | 2015-12-11 | Paper |
Excluding Braess's paradox in nonatomic selfish routing
Algorithmic Game Theory | 2015-11-04 | Paper |
Finding Connected Dense $$k$$-Subgraphs
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Balancing Load via Small Coalitions in Selfish Ring Routing Games
Asia-Pacific Journal of Operational Research | 2015-04-15 | Paper |
New perspectives of several fundamental problems in combinatorial optimization
Operations Research Transactions | 2014-11-03 | Paper |
Schedules for marketing products with negative externalities
Theoretical Computer Science | 2014-10-06 | Paper |
Approximability of the minimum weighted doubly resolving set problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Risk models for the prize collecting Steiner tree problems with interval data
Acta Mathematicae Applicatae Sinica. English Series | 2014-08-29 | Paper |
Stability vs. optimality in selfish ring routing
Acta Mathematica Sinica, English Series | 2014-06-11 | Paper |
Reducing price of anarchy of selfish task allocation with more selfishness
Theoretical Computer Science | 2014-01-16 | Paper |
Maximizing the minimum load: the cost of selfishness
Theoretical Computer Science | 2014-01-09 | Paper |
Copula-based randomized mechanisms for truthful scheduling on two unrelated machines
Algorithmic Game Theory | 2013-10-23 | Paper |
How to schedule the marketing of products with negative externalities
Lecture Notes in Computer Science | 2013-06-11 | Paper |
The Maximum-Weight Stable Matching Problem: Duality and Efficiency
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Total dual integrality in some facility location problems
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Efficiency of dual equilibria in selfish task allocation to selfish machines
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science | 2012-08-13 | Paper |
Packing cycles exactly in polynomial time
Journal of Combinatorial Optimization | 2012-05-23 | Paper |
Bonds with parity constraints
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
A Characterization of Box-Mengerian Matroid Ports
Mathematics of Operations Research | 2011-04-27 | Paper |
A unified approach to box-Mengerian hypergraphs
Mathematics of Operations Research | 2011-04-27 | Paper |
Deterministic risk control for cost-effective network connections
Theoretical Computer Science | 2011-01-28 | Paper |
Reducing the maximum latency of selfish ring routing via pairwise cooperations
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Cost-effective designs of fault-tolerant access networks in communication systems
Networks | 2010-11-24 | Paper |
Efficient algorithms for the prize collecting Steiner tree problems with interval data
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
The price of atomic selfish ring routing
Journal of Combinatorial Optimization | 2010-06-11 | Paper |
| scientific article; zbMATH DE number 5629898 (Why is no real title available?) | 2009-11-11 | Paper |
A polynomial solvable minimum risk spanning tree problem with interval data
European Journal of Operational Research | 2009-06-30 | Paper |
Approximation algorithms for soft-capacitated facility location in capacitated network design
Algorithmica | 2009-06-17 | Paper |
The box-TDI system associated with 2-edge connected spanning subgraphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
On the Minimum Risk-Sum Path Problem
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
The Minimum Risk Spanning Tree Problem
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
A new model for path planning with interval data
Computers & Operations Research | 2009-02-12 | Paper |
On the restricted forwarding index problem in communication networks
Computers & Mathematics with Applications | 2009-01-27 | Paper |
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms | 2008-08-08 | Paper |
A Min-Max Theorem on Tournaments
SIAM Journal on Computing | 2008-06-19 | Paper |
A Min-Max Relation on Packing Feedback Vertex Sets
Mathematics of Operations Research | 2008-05-27 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Inapproximability and approximability of maximal tree routing and coloring
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
Algorithmica | 2006-06-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Perfect circular arc coloring
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
| scientific article; zbMATH DE number 2069436 (Why is no real title available?) | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 1782859 (Why is no real title available?) | 2002-08-18 | Paper |
A local intersection condition for \(n\)-extendable graphs
Journal of Nanjing University. Mathematical Biquarterly | 2001-07-10 | Paper |
