| Publication | Date of Publication | Type |
|---|
| A TDI system and its application to approximation algorithms | 2025-10-29 | Paper |
Solution to a forcible version of a graphic sequence problem
Graphs and Combinatorics | 2022-05-25 | Paper |
| scientific article; zbMATH DE number 7491824 (Why is no real title available?) | 2022-03-17 | Paper |
A characterization of box-bounded degree sequences of graphs
Graphs and Combinatorics | 2018-09-14 | Paper |
| Approximation and computation of arbitrage in frictional foreign exchange market (extended abstract) | 2013-08-27 | Paper |
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science | 2011-02-02 | Paper |
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
Frontiers in Algorithmics | 2009-07-14 | Paper |
The partial inverse minimum spanning tree problem when weight increase is forbidden
European Journal of Operational Research | 2008-02-13 | Paper |
Computation of arbitrage in frictional bond markets
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Existence of Hamiltonian k-factor
Journal of Systems Science and Complexity | 2005-11-21 | Paper |
A Min-Max Theorem on Feedback Vertex Sets
Mathematics of Operations Research | 2005-11-11 | Paper |
Some new results on multi-dimension Knapsack problem
Journal of Industrial and Management Optimization | 2005-09-01 | Paper |
COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Minimum k arborescences with bandwidth constraints
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086930 (Why is no real title available?) | 2004-08-11 | Paper |
A network improvement problem under different norms
Computational Optimization and Applications | 2004-05-27 | Paper |
Inapproximability and a polynomially solvable special case of a network improvement problem.
European Journal of Operational Research | 2004-03-14 | Paper |
On computational complexity of membership test in flow games and linear production games
International Journal of Game Theory | 2003-11-23 | Paper |
Approximate sequencing for variable length tasks.
Theoretical Computer Science | 2003-08-17 | Paper |
Total balancedness condition for Steiner tree games.
Discrete Applied Mathematics | 2003-06-10 | Paper |
| scientific article; zbMATH DE number 1796969 (Why is no real title available?) | 2002-09-05 | Paper |
Upper bounds for the \(k\)-subdomination number of graphs
Discrete Mathematics | 2002-05-28 | Paper |
Some results on universal minimal total dominating functions
Acta Mathematicae Applicatae Sinica. English Series | 2002-05-07 | Paper |
Minus domination number in cubic graph
Chinese Science Bulletin | 2002-02-18 | Paper |
Tree decomposition
Chinese Science Bulletin | 2002-02-18 | Paper |
| scientific article; zbMATH DE number 1932373 (Why is no real title available?) | 2002-01-01 | Paper |
Inverse problems of submodular functions on digraphs
Journal of Optimization Theory and Applications | 2001-08-27 | Paper |
On quasifactorability in graphs
Discrete Mathematics | 2001-07-02 | Paper |
An approximation algorithm for feedback vertex sets in tournaments
SIAM Journal on Computing | 2001-06-21 | Paper |
Edge-forwarding indices of 2-edge-connected graphs.
Journal of Xinjiang University. Natural Science | 2001-06-20 | Paper |
| scientific article; zbMATH DE number 1522936 (Why is no real title available?) | 2001-03-06 | Paper |
Solution to a problem on degree sequences of graphs
Discrete Mathematics | 2000-12-13 | Paper |
Applications of matroid partition to tree decomposition
Acta Mathematicae Applicatae Sinica. English Series | 2000-11-29 | Paper |
Upper minus domination in regular graphs
Discrete Mathematics | 2000-11-19 | Paper |
| scientific article; zbMATH DE number 1421650 (Why is no real title available?) | 2000-09-24 | Paper |
Inverse problem of minimum cuts
Mathematical Methods of Operations Research | 2000-08-07 | Paper |
Vertices of degree k in a minimally k-edge-connected digraph
Discrete Mathematics | 2000-07-24 | Paper |
(3, k)-factor-critical graphs and toughness
Graphs and Combinatorics | 2000-07-05 | Paper |
Inverse problems of matroid intersection
Journal of Combinatorial Optimization | 2000-03-19 | Paper |
(2,k)-factor-critical graphs and toughness
Graphs and Combinatorics | 2000-02-09 | Paper |
The complexity analysis of the inverse center location problem
Journal of Global Optimization | 2000-01-05 | Paper |
| scientific article; zbMATH DE number 1342121 (Why is no real title available?) | 1999-11-21 | Paper |
Inverse polymatroidal flow problem
Journal of Combinatorial Optimization | 1999-09-22 | Paper |
A \([k,k+1]\)-factor containing a given Hamiltonian cycle
The Electronic Journal of Combinatorics | 1999-02-02 | Paper |
| scientific article; zbMATH DE number 1117461 (Why is no real title available?) | 1998-07-06 | Paper |
| scientific article; zbMATH DE number 1004242 (Why is no real title available?) | 1997-10-30 | Paper |
Inverse matroid intersection problem
Mathematical Methods of Operations Research | 1997-08-05 | Paper |
Connected \([k,k+1]\)-factors of graphs
Discrete Mathematics | 1997-06-16 | Paper |
| scientific article; zbMATH DE number 969172 (Why is no real title available?) | 1997-01-22 | Paper |
An eulerian trail traversing specified edges in given order
Journal of Graph Theory | 1996-11-27 | Paper |
| scientific article; zbMATH DE number 913257 (Why is no real title available?) | 1996-11-24 | Paper |
| scientific article; zbMATH DE number 850970 (Why is no real title available?) | 1996-03-20 | Paper |
| scientific article; zbMATH DE number 810445 (Why is no real title available?) | 1995-11-26 | Paper |
| scientific article; zbMATH DE number 721755 (Why is no real title available?) | 1995-03-19 | Paper |
An algorithm for an Eulerian trail traversing specified edges in given order
Discrete Applied Mathematics | 1995-02-01 | Paper |
An algorithm for optimum common root functions of two digraphs
Discrete Mathematics | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 270249 (Why is no real title available?) | 1993-09-02 | Paper |
A remark on the number of vertices of degree k in a minimally k-edge- connected graph
Discrete Mathematics | 1993-01-16 | Paper |
On some factor theorems of graphs
Discrete Mathematics | 1992-06-28 | Paper |
[<i>a,b</i>]‐factorizations of graphs
Journal of Graph Theory | 1992-06-25 | Paper |
The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
Discrete Mathematics | 1992-06-25 | Paper |
The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
Journal of Combinatorial Theory. Series B | 1992-01-01 | Paper |
| scientific article; zbMATH DE number 4212101 (Why is no real title available?) | 1990-01-01 | Paper |
Restricted covering of digraphs with arborescences
Discrete Mathematics | 1990-01-01 | Paper |
Common root functions of two digraphs
Journal of Graph Theory | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4019097 (Why is no real title available?) | 1987-01-01 | Paper |
A solution of Chartrand's problem on spanning trees
Acta Mathematicae Applicatae Sinica. English Series | 1984-01-01 | Paper |
On a problem of Katona on minimal completely separating systems with restrictions
Discrete Mathematics | 1984-01-01 | Paper |
On separating systems of graphs
Discrete Mathematics | 1984-01-01 | Paper |
A counterexample to a conjecture of Grant
Discrete Mathematics | 1983-01-01 | Paper |
Arc‐disjoint arborescences of digraphs
Journal of Graph Theory | 1983-01-01 | Paper |
Solutions to Edmonds' and Katona's problems on families of separating subsets
Discrete Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3776660 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3777519 (Why is no real title available?) | 1982-01-01 | Paper |
Minimally k-connected graphs of low order and maximal size
Discrete Mathematics | 1982-01-01 | Paper |
A new bound on the length of the shortest string containing all r- permutations
Discrete Mathematics | 1982-01-01 | Paper |
The maximum number of arc-disjoint arborescences in a tournament
Journal of Graph Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3741403 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3750976 (Why is no real title available?) | 1980-01-01 | Paper |
Optimum Restricted Base of a Matroid
Combinatorics 79 | 1980-01-01 | Paper |
