| Publication | Date of Publication | Type |
|---|
| Solution to a forcible version of a graphic sequence problem | 2022-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5062460 | 2022-03-17 | Paper |
| A characterization of box-bounded degree sequences of graphs | 2018-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843928 | 2013-08-27 | Paper |
| Shortest path and maximum flow problems in networks with additive losses and gains | 2011-02-02 | Paper |
| Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains | 2009-07-14 | Paper |
| The partial inverse minimum spanning tree problem when weight increase is forbidden | 2008-02-13 | Paper |
| Computation of arbitrage in frictional bond markets | 2007-01-09 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Existence of Hamiltonian \(k\)-factor | 2005-11-21 | Paper |
| A Min-Max Theorem on Feedback Vertex Sets | 2005-11-11 | Paper |
| Some new results on multi-dimension Knapsack problem | 2005-09-01 | Paper |
| COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE | 2005-06-22 | Paper |
| Minimum \(k\) arborescences with bandwidth constraints | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737535 | 2004-08-11 | Paper |
| A network improvement problem under different norms | 2004-05-27 | Paper |
| Inapproximability and a polynomially solvable special case of a network improvement problem. | 2004-03-14 | Paper |
| On computational complexity of membership test in flow games and linear production games | 2003-11-23 | Paper |
| Approximate sequencing for variable length tasks. | 2003-08-17 | Paper |
| Total balancedness condition for Steiner tree games. | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551363 | 2002-09-05 | Paper |
| Upper bounds for the \(k\)-subdomination number of graphs | 2002-05-28 | Paper |
| Some results on universal minimal total dominating functions | 2002-05-07 | Paper |
| Minus domination number in cubic graph | 2002-02-18 | Paper |
| Tree decomposition | 2002-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709646 | 2002-01-01 | Paper |
| Inverse problems of submodular functions on digraphs | 2001-08-27 | Paper |
| On quasifactorability in graphs | 2001-07-02 | Paper |
| An Approximation Algorithm for Feedback Vertex Sets in Tournaments | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715335 | 2001-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511232 | 2001-03-06 | Paper |
| Solution to a problem on degree sequences of graphs | 2000-12-13 | Paper |
| Applications of matroid partition to tree decomposition | 2000-11-29 | Paper |
| Upper minus domination in regular graphs | 2000-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946545 | 2000-09-24 | Paper |
| Inverse problem of minimum cuts | 2000-08-07 | Paper |
| Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph | 2000-07-24 | Paper |
| \((3, k)\)-factor-critical graphs and toughness | 2000-07-05 | Paper |
| Inverse problems of matroid intersection | 2000-03-19 | Paper |
| \((2,k)\)-factor-critical graphs and toughness | 2000-02-09 | Paper |
| The complexity analysis of the inverse center location problem | 2000-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263703 | 1999-11-21 | Paper |
| Inverse polymatroidal flow problem | 1999-09-22 | Paper |
| A \([k,k+1\)-factor containing a given Hamiltonian cycle] | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4376498 | 1998-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129189 | 1997-10-30 | Paper |
| Inverse matroid intersection problem | 1997-08-05 | Paper |
| Connected \([k,k+1\)-factors of graphs] | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284643 | 1997-01-22 | Paper |
| An eulerian trail traversing specified edges in given order | 1996-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887674 | 1996-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867575 | 1996-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852142 | 1995-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4322712 | 1995-03-19 | Paper |
| An algorithm for an Eulerian trail traversing specified edges in given order | 1995-02-01 | Paper |
| An algorithm for optimum common root functions of two digraphs | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5288885 | 1993-09-02 | Paper |
| A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph | 1993-01-16 | Paper |
| On some factor theorems of graphs | 1992-06-28 | Paper |
| The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices | 1992-06-25 | Paper |
| [a,b‐factorizations of graphs] | 1992-06-25 | Paper |
| The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph | 1992-01-01 | Paper |
| Restricted covering of digraphs with arborescences | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360214 | 1990-01-01 | Paper |
| Common root functions of two digraphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030854 | 1987-01-01 | Paper |
| A solution of Chartrand's problem on spanning trees | 1984-01-01 | Paper |
| On a problem of Katona on minimal completely separating systems with restrictions | 1984-01-01 | Paper |
| On separating systems of graphs | 1984-01-01 | Paper |
| Solutions to Edmonds' and Katona's problems on families of separating subsets | 1983-01-01 | Paper |
| A counterexample to a conjecture of Grant | 1983-01-01 | Paper |
| Arc‐disjoint arborescences of digraphs | 1983-01-01 | Paper |
| Minimally k-connected graphs of low order and maximal size | 1982-01-01 | Paper |
| A new bound on the length of the shortest string containing all r- permutations | 1982-01-01 | Paper |
| The maximum number of arc-disjoint arborescences in a tournament | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956223 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956965 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3927257 | 1981-01-01 | Paper |
| Optimum Restricted Base of a Matroid | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934411 | 1980-01-01 | Paper |
