| Publication | Date of Publication | Type |
|---|
| Algorithms for maximum social welfare of online random trading | 2024-06-20 | Paper |
| On weak Pareto optimality of nonatomic routing networks | 2022-10-04 | Paper |
| Introduction to combinatorial optimization | 2022-08-02 | Paper |
| Algorithms for the metric ring star problem with fixed edge-cost ratio | 2021-11-25 | Paper |
| 2-level station location for bike sharing | 2021-07-05 | Paper |
| Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game | 2021-03-11 | Paper |
| The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler | 2020-09-01 | Paper |
| Sequential Location Game on Continuous Directional Star Networks | 2020-07-20 | Paper |
| The price of anarchy for the load balancing game with a randomizing scheduler | 2020-05-13 | Paper |
| Domain decomposition based exponential time differencing method for fluid dynamics problems with smooth solutions | 2019-10-30 | Paper |
| Transformation matrix for time discretization based on Tustin's method | 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 | 2018-11-08 | Paper |
| Robust adaptive fuzzy output tracking control for a class of twin-roll strip casting systems | 2018-11-05 | Paper |
| Adaptive fuzzy tracking control for a class of uncertain nonlinear time-delayed systems with saturation constrains | 2018-10-08 | Paper |
| Covering triangles in edge-weighted graphs | 2018-08-03 | Paper |
| Converter placement supporting broadcast in WDM optical networks | 2018-07-09 | Paper |
| Algorithms for the ring star problem | 2018-03-26 | Paper |
| Finding connected \(k\)-subgraphs with high density | 2017-09-28 | Paper |
| Continuous Firefighting on Infinite Square Grids | 2017-05-19 | Paper |
| Approximation algorithms for pricing with negative network externalities | 2017-02-22 | Paper |
| Network characterizations for excluding Braess's paradox | 2017-02-01 | Paper |
| Total Dual Integrality of Triangle Covering | 2017-02-01 | Paper |
| Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles | 2016-09-29 | Paper |
| Approximation for the minimum cost doubly resolving set problem | 2015-12-11 | Paper |
| Excluding Braess’s Paradox in Nonatomic Selfish Routing | 2015-11-04 | Paper |
| Finding Connected Dense $$k$$-Subgraphs | 2015-09-30 | Paper |
| Balancing Load via Small Coalitions in Selfish Ring Routing Games | 2015-04-15 | Paper |
| The conditional diagnosability of shuffle-cubes | 2014-11-11 | Paper |
| Risk models for the prize collecting Steiner tree problems with interval data | 2014-08-29 | Paper |
| Enumeration of digraph embeddings | 2014-03-25 | Paper |
| Reducing price of anarchy of selfish task allocation with more selfishness | 2014-01-16 | Paper |
| On the union of intermediate nodes of shortest paths | 2013-08-09 | Paper |
| The Maximum-Weight Stable Matching Problem: Duality and Efficiency | 2013-01-04 | Paper |
| Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines | 2012-11-02 | Paper |
| A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY | 2012-10-15 | Paper |
| Pairwise cooperations in selfish ring routing for minimax linear latency | 2012-08-13 | Paper |
| Design and analysis of approximation algorithms | 2011-11-22 | Paper |
| Deterministic risk control for cost-effective network connections | 2011-01-28 | Paper |
| Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations | 2011-01-10 | Paper |
| Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data | 2010-07-20 | Paper |
| The price of atomic selfish ring routing | 2010-06-11 | Paper |
| ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS | 2010-05-19 | Paper |
| Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks | 2010-03-01 | Paper |
| Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks | 2010-02-26 | Paper |
| Dedication on the occasion of the thirtieth anniversary of the founding of Institute of Applied Mathematics | 2009-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3640350 | 2009-11-11 | Paper |
| Improved algorithm for minimum data aggregation time problem in wireless sensor networks | 2009-10-15 | Paper |
| A polynomial solvable minimum risk spanning tree problem with interval data | 2009-06-30 | Paper |
| On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs | 2009-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615802 | 2009-03-24 | Paper |
| On the Minimum Risk-Sum Path Problem | 2009-03-03 | Paper |
| The Minimum Risk Spanning Tree Problem | 2009-03-03 | Paper |
| Algorithms for Minimum m-Connected k-Dominating Set Problem | 2009-03-03 | Paper |
| A new model for path planning with interval data | 2009-02-12 | Paper |
| On the restricted forwarding index problem in communication networks | 2009-01-27 | Paper |
| Identifying codes of cycles with odd orders | 2008-09-04 | Paper |
| Inapproximability and approximability of minimal tree routing and coloring | 2008-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514991 | 2008-07-24 | Paper |
| A Min-Max Theorem on Tournaments | 2008-06-19 | Paper |
| A Min-Max Relation on Packing Feedback Vertex Sets | 2008-05-27 | Paper |
| Connected Set Cover Problem and Its Applications | 2008-01-04 | Paper |
| Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes | 2007-09-19 | Paper |
| Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem | 2007-09-03 | Paper |
| Rotational Steiner Ratio Problem Under Uniform Orientation Metrics | 2007-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3431158 | 2007-04-05 | Paper |
| Edge-bipancyclicity of star graphs under edge-fault tolerant | 2007-02-19 | Paper |
| Optimal Binomial Group Testing with a Test History | 2007-01-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Inapproximability and approximability of maximal tree routing and coloring | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5699407 | 2005-10-26 | Paper |
| Biography of Professor Jiye Han (on the occasion of his 70th birthday) | 2005-06-07 | Paper |
| Routing algorithm for multicast under multi-tree model in optical networks | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736227 | 2004-08-09 | Paper |
| On shortest \(k\)-edge-connected Steiner networks in metric spaces | 2004-02-18 | Paper |
| Transversally Elliptic Operators | 2003-11-05 | Paper |
| Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet | 2003-10-29 | Paper |
| On shortest three-edge-connected Steiner networks with Euclidean distance | 2003-07-29 | Paper |
| Algorithms for multicast connection under multi-path routing model. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4786436 | 2002-12-16 | Paper |
| Optimization of wavelength assignment for QoS multicast in WDM networks | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550356 | 2002-08-21 | Paper |
| Placement of data replicas for optimal data availability in ring networks | 2002-07-31 | Paper |
| On shortest two-connected Steiner networks with Euclidean distance | 2002-07-21 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2002-03-03 | Paper |
| Wire segmenting for buffer insertion based on RSTP-MSP | 2002-03-03 | Paper |
| Optimal Placement of Web Proxies for Replicated Web Servers in the Internet | 2002-02-27 | Paper |
| Monotone routing in multirate rearrangeable Clos networks | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751928 | 2001-10-21 | Paper |
| On minimum-weight \(k\)-edge connected Steiner networks on metric spaces | 2001-10-04 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2001-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4523274 | 2001-01-09 | Paper |
| Minimizing number of wavelengths in multicast routing trees in WDM networks | 2000-09-14 | Paper |
| The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables | 2000-09-03 | Paper |
| Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive | 2000-01-12 | Paper |
| On Rearrangeability of Multirate Clos Networks | 1999-10-28 | Paper |
| Equivariant Chern character for the invariant Dirac operator | 1999-05-04 | Paper |
| Exact reliabilities of most reliable double-loop networks | 1998-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883373 | 1997-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883381 | 1996-10-13 | Paper |
| A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming | 1994-12-12 | Paper |
| A new competitive algorithm for the counterfeit coin problem | 1994-09-25 | Paper |
| Cutting numbers for the forward loop backward hop network | 1994-09-04 | Paper |
| An overall study of convergence conditions for algorithms in nonlinear programming | 1994-03-07 | Paper |
| Most reliable double loop networks in survival reliability | 1993-12-20 | Paper |
| An improved upper bound for the subarray partial concentrators | 1993-01-16 | Paper |
| Feasible point methods and their global convergence | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016115 | 1992-12-16 | Paper |
| Reliabilities of chordal rings | 1992-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3982526 | 1992-06-26 | Paper |
| A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties | 1992-06-25 | Paper |
