| Publication | Date of Publication | Type |
|---|
| On approximations for constructing required subgraphs using stock pieces of fixed length | 2024-02-23 | Paper |
| Eigenvalues and spanning trees with constrained degree | 2023-11-21 | Paper |
| Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties | 2023-10-26 | Paper |
| The constrained parallel-machine scheduling problem with divisible processing times and penalties | 2023-07-07 | Paper |
| Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties | 2023-05-11 | Paper |
| Delay-constrained minimum shortest path trees and related problems | 2023-01-04 | Paper |
| Approximation algorithms for solving the heterogeneous Chinese postman problem | 2022-11-29 | Paper |
| Approximation algorithms for solving the line-capacitated minimum Steiner tree problem | 2022-10-24 | Paper |
| \(1\)-line minimum rectilinear Steiner trees and related problems | 2022-10-18 | Paper |
| Approximation algorithms for constructing required subgraphs using stock pieces of fixed length | 2022-10-04 | Paper |
| An approximation algorithm for solving the heterogeneous Chinese postman problem | 2022-07-01 | Paper |
| Delay-constrained minimum shortest path trees and related problems | 2022-06-29 | Paper |
| Bin packing with divisible item sizes and rejection penalties | 2022-05-16 | Paper |
| On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) | 2021-07-05 | Paper |
| On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) | 2021-05-05 | Paper |
| Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem | 2020-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5210120 | 2020-01-22 | Paper |
| Improved approximation algorithms for the combination problem of parallel machine scheduling and path | 2019-10-29 | Paper |
| Recursive formula of enumeration on forbidden words | 2019-06-21 | Paper |
| Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces | 2018-06-15 | Paper |
| Approximation algorithms for the generalized stacker crane problem | 2018-02-26 | Paper |
| Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length | 2017-12-15 | Paper |
| Approximations for constructing tree-form structures using specific material with fixed length | 2016-09-21 | Paper |
| Approximation algorithms for solving the constrained arc routing problem in mixed graphs | 2016-06-24 | Paper |
| The Prize-collecting Call Control Problem on Weighted Lines and Rings | 2016-04-01 | Paper |
| Penalty cost constrained identical parallel machine scheduling problem | 2015-12-08 | Paper |
| Approximation algorithms for the ring loading problem with penalty cost | 2015-06-25 | Paper |
| The Directed Ring Loading with Penalty Cost | 2015-02-27 | Paper |
| Approximation algorithms for constructing some required structures in digraphs | 2015-02-18 | Paper |
| Parallel-Machine Scheduling Problem under the Job Rejection Constraint | 2014-09-02 | Paper |
| Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint | 2014-04-30 | Paper |
| The subdivision-constrained routing requests problem | 2014-02-25 | Paper |
| The capacity expansion path problem in networks | 2013-09-09 | Paper |
| Coordination mechanism for selfish scheduling under a grade of service provision | 2013-06-28 | Paper |
| A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring | 2013-01-03 | Paper |
| Shortest path problems with left-side time windows | 2012-12-28 | Paper |
| TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION | 2012-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3110842 | 2012-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3014094 | 2011-07-19 | Paper |
| ON THE VISUALIZATION OF STRINGS AND FRACTALS OF SOME FORBIDDEN WORDS | 2011-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3572614 | 2010-07-08 | Paper |
| An improved approximation algorithm for the maximum TSP | 2010-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3403479 | 2010-02-12 | Paper |
| POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION | 2009-11-19 | Paper |
| An improved approximation algorithm for the ATSP with parameterized triangle inequality | 2009-07-24 | Paper |
| Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision | 2009-07-07 | Paper |
| \((s,m)\)-radius of \(k\)-connected graphs | 2009-04-09 | Paper |
| The subdivision-constrained minimum spanning tree problem | 2009-03-17 | Paper |
| Long paths with endpoints in given vertex-subsets of graphs | 2008-09-04 | Paper |
| On partitioning simple bipartite graphs in vertex-disjoint paths | 2008-06-03 | Paper |
| On packing and coloring hyperedges in a cycle | 2007-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310215 | 2007-09-21 | Paper |
| Minimum Clique Partition Problem with Constrained Weight for Interval Graphs | 2007-09-10 | Paper |
| Some approximation algorithms for the clique partition problem in weighted interval graphs | 2007-09-03 | Paper |
| Partitioning a graph into vertex-disjoint paths | 2007-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5489900 | 2006-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374620 | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374631 | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374635 | 2006-03-09 | Paper |
| Maximizing profits of routing in WDM networks | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2716016 | 2005-07-20 | Paper |
| On the complexity of finding emerging patterns | 2005-06-10 | Paper |
| Exact matching of RNA secondary structure patterns | 2005-06-10 | Paper |
| On \(k\)-coloring of weighted circular-arc graphs | 2005-03-14 | Paper |
| On the Thomassen's conjecture | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779606 | 2002-04-15 | Paper |
| Independent triangles covering given vertices of a graph | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721961 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715952 | 2001-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4384660 | 1998-11-01 | Paper |
| A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions | 1997-08-31 | Paper |
| Cycles through subsets with large degree sums | 1997-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879720 | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4849129 | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4280254 | 1994-06-22 | Paper |
| Long cycles in 1-tough graphs with large degree sums | 1994-04-13 | Paper |
