| Publication | Date of Publication | Type |
|---|
| Removable edges in near-bipartite bricks | 2024-11-24 | Paper |
| Single-machine primary-secondary scheduling with total tardiness being the primary criterion | 2024-07-23 | Paper |
| The spectral radius of \(H_{2k}\)-free graphs | 2024-04-18 | Paper |
| Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs | 2024-01-09 | Paper |
| Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs | 2024-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6067995 | 2023-12-14 | Paper |
| Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work | 2023-10-25 | Paper |
| Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work | 2023-10-18 | Paper |
| Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work | 2023-10-17 | Paper |
| Properly colored even cycles in edge-colored complete balanced bipartite graphs | 2023-10-07 | Paper |
| Sufficient conditions for $k$-factors and spanning trees of graphs | 2023-08-26 | Paper |
| Single-machine scheduling of multiple projects with controllable processing times | 2023-07-10 | Paper |
| Spectral radius and spanning trees of graphs | 2023-05-31 | Paper |
| The \(A_\alpha\)-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree) | 2023-03-03 | Paper |
| Wiener-type invariants and \(k\)-leaf-connected graphs | 2023-02-03 | Paper |
| PM-compact graphs and vertex-deleted subgraphs | 2022-10-21 | Paper |
| Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works | 2022-10-10 | Paper |
| Properly colored 2-factors of edge-colored complete bipartite graphs | 2022-09-26 | Paper |
| A note on LP-based approximation algorithms for capacitated facility location problem | 2022-09-16 | Paper |
| Bicritical graphs without removable edges | 2022-08-24 | Paper |
| Pareto-scheduling of two competing agents with their own equal processing times | 2022-05-20 | Paper |
| Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three | 2022-04-11 | Paper |
| A note on the complexity of two supply chain scheduling problems | 2021-12-13 | Paper |
| Scheduling to tradeoff between the number and the length of accepted jobs | 2021-10-21 | Paper |
| Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines | 2021-09-30 | Paper |
| Single-machine online scheduling of jobs with non-delayed processing constraint | 2021-08-11 | Paper |
| Single-machine scheduling with maintenance activities and rejection | 2021-01-15 | Paper |
| Single-machine scheduling to minimize total weighted late work with positional due-indices | 2021-01-14 | Paper |
| Even cycles and perfect matchings in claw-free plane graphs | 2021-01-05 | Paper |
| A short note on open-neighborhood conflict-free colorings of graphs | 2020-10-27 | Paper |
| Single-machine scheduling with operator non-availability to minimize total weighted completion time | 2020-09-08 | Paper |
| Single-machine scheduling with multi-agents to minimize total weighted late work | 2020-08-31 | Paper |
| Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices | 2020-06-22 | Paper |
| Two sufficient conditions for 2-connected graphs to have proper connection number 2 | 2020-06-09 | Paper |
| Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery | 2020-05-05 | Paper |
| Bicriteria scheduling of equal length jobs on uniform parallel machines | 2020-03-24 | Paper |
| Unbounded parallel-batch scheduling with drop-line tasks | 2020-03-06 | Paper |
| Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time | 2020-02-10 | Paper |
| A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine | 2020-02-10 | Paper |
| Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines | 2020-01-22 | Paper |
| The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs | 2020-01-22 | Paper |
| ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost | 2020-01-14 | Paper |
| Single-machine scheduling with positional due indices and positional deadlines | 2019-11-28 | Paper |
| Paths and trails in edge-colored weighted graphs | 2019-11-13 | Paper |
| Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost | 2019-11-12 | Paper |
| Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead | 2019-10-30 | Paper |
| Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs | 2019-10-29 | Paper |
| Simultaneous approximation ratios for parallel machine scheduling problems | 2019-10-04 | Paper |
| Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan | 2019-07-19 | Paper |
| Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles | 2019-07-17 | Paper |
| On strong proper connection number of cubic graphs | 2019-07-17 | Paper |
| A note on a two-agent scheduling problem related to the total weighted late work | 2019-06-25 | Paper |
| Equivalence of some different maintenance activities in single-machine scheduling | 2019-06-18 | Paper |
| Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing | 2019-04-18 | Paper |
| Online scheduling with linear deteriorating jobs to minimize the total weighted completion time | 2019-03-19 | Paper |
| Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost | 2019-03-19 | Paper |
| The bounded parallel-batching scheduling with drop-line jobs to minimize total completion time | 2018-10-22 | Paper |
| Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery | 2018-10-16 | Paper |
| A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives | 2018-10-09 | Paper |
| A note on Pareto minimizing total completion time and maximum cost | 2018-09-28 | Paper |
| Unary NP-hardness of minimizing total weighted tardiness with generalized due dates | 2018-09-28 | Paper |
| Online scheduling with delivery time on a bounded parallel batch machine with limited restart | 2018-08-27 | Paper |
| Complexities of four problems on two-agent scheduling | 2018-08-03 | Paper |
| Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints | 2018-05-24 | Paper |
| Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs | 2017-11-30 | Paper |
| Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements | 2017-11-16 | Paper |
| An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities | 2017-11-09 | Paper |
| Online scheduling to minimize the total weighted completion time plus the rejection cost | 2017-10-17 | Paper |
| Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans | 2017-10-17 | Paper |
| Unary NP-hardness of minimizing the number of tardy jobs with deadlines | 2017-08-18 | Paper |
| Complexities of some problems on multi-agent scheduling on a single machine | 2017-08-10 | Paper |
| A note on Matching Cover Algorithm | 2016-12-03 | Paper |
| Rescheduling with new orders and general maximum allowable time disruptions | 2016-10-24 | Paper |
| Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness | 2016-08-31 | Paper |
| Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines | 2016-06-01 | Paper |
| Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart | 2016-05-11 | Paper |
| Two-machine open-shop scheduling with rejection to minimize the makespan | 2016-05-04 | Paper |
| Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time | 2016-02-26 | Paper |
| LPT online strategy for parallel-machine scheduling with kind release times | 2016-02-23 | Paper |
| An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead | 2016-02-19 | Paper |
| Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time | 2016-01-28 | Paper |
| The minimum spanning subgraph problem with given cyclomatic number | 2016-01-25 | Paper |
| Pareto minimizing total completion time and maximum cost with positional due indices | 2015-10-30 | Paper |
| On graphs with a unique perfect matching | 2015-09-24 | Paper |
| A note on unbounded parallel-batch scheduling | 2015-09-15 | Paper |
| A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints | 2015-07-28 | Paper |
| A characterization of PM-compact Hamiltonian bipartite graphs | 2015-07-22 | Paper |
| Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates | 2015-06-30 | Paper |
| First eigenvalue of nonsingular mixed graphs with given number of pendant vertices | 2015-06-19 | Paper |
| Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time | 2015-04-29 | Paper |
| Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness | 2015-01-30 | Paper |
| Online over time scheduling on parallel-batch machines: a survey | 2015-01-27 | Paper |
| Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs | 2014-12-05 | Paper |
| Batching machine scheduling with bicriteria: maximum cost and makespan | 2014-11-26 | Paper |
| A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines | 2014-11-26 | Paper |
| On matching cover of graphs | 2014-10-17 | Paper |
| A note on reverse scheduling with maximum lateness objective | 2014-08-18 | Paper |
| Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart | 2014-07-07 | Paper |
| Online scheduling of incompatible unit-length job families with lookahead | 2014-07-07 | Paper |
| Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard | 2014-05-14 | Paper |
| Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan | 2014-04-15 | Paper |
| Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost | 2014-04-11 | Paper |
| On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 | 2014-02-27 | Paper |
| The tree with minimal Laplacian spectral radius and diameter \(n-4\) | 2014-02-19 | Paper |
| The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices | 2014-02-10 | Paper |
| Unbounded parallel-batching scheduling with two competitive agents | 2014-02-05 | Paper |
| Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption | 2014-02-05 | Paper |
| Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines | 2014-01-13 | Paper |
| An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times | 2013-04-04 | Paper |
| Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time | 2013-04-04 | Paper |
| Unbounded parallel-batch scheduling with family jobs and delivery coordination | 2013-03-28 | Paper |
| A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints | 2012-10-11 | Paper |
| Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs | 2012-07-25 | Paper |
| Bi-criteria scheduling on a single parallel-batch machine | 2012-07-20 | Paper |
| An improved on-line algorithm for single parallel-batch machine scheduling with delivery times | 2012-05-30 | Paper |
| Strong NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time | 2011-07-19 | Paper |
| Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times | 2011-03-16 | Paper |
| Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine | 2011-01-28 | Paper |
| An on-line algorithm for the bounded \(P\)-batch scheduling with chain precedence constraints and unit processing time | 2011-01-28 | Paper |
| Some improved algorithms on the single machine hierarchical scheduling with total tardiness as the primary criterion | 2011-01-19 | Paper |
| Parallel-batch scheduling with multi-agent jobs to minimize the weighted number of tardy jobs | 2010-11-05 | Paper |
| Parallel-machine scheduling with deteriorating jobs and rejection | 2010-10-11 | Paper |
| A DP algorithm for minimizing makespan and total completion time on a series-batching machine | 2010-08-16 | Paper |
| Single-machine scheduling under the job rejection constraint | 2010-04-15 | Paper |
| Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan | 2010-03-09 | Paper |
| A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints | 2010-02-12 | Paper |
| Edge-deletable IM-extendable graphs with minimum number of edges | 2009-12-15 | Paper |
| Single machine scheduling with release dates and rejection | 2009-12-07 | Paper |
| A note on the single machine scheduling to minimize the number of tardy jobs with deadlines | 2009-11-17 | Paper |
| Single machine parallel-batch scheduling with release dates and machine availability constraints | 2009-11-11 | Paper |
| Scheduling with families of jobs and delivery coordination under job availability | 2009-11-06 | Paper |
| Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead | 2009-11-06 | Paper |
| A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times | 2009-09-18 | Paper |
| The weighted link ring loading problem | 2009-09-02 | Paper |
| On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs | 2009-08-28 | Paper |
| Cover a graph with small diameter by induced matchings | 2009-07-22 | Paper |
| Online scheduling in a parallel batch processing system to minimize makespan using restarts | 2009-06-22 | Paper |
| On-line scheduling with delivery time on a single batch machine | 2009-06-22 | Paper |
| A best online algorithm for scheduling on two parallel batch machines | 2009-05-28 | Paper |
| Bounded single-machine parallel-batch scheduling with release dates and rejection | 2009-05-19 | Paper |
| Single machine parallel-batch scheduling with deteriorating jobs | 2009-03-17 | Paper |
| Optimal batching structures of scheduling problems with fix batch number | 2009-03-06 | Paper |
| Unbounded parallel batch scheduling with job delivery to minimize makespan | 2009-03-04 | Paper |
| SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES | 2008-09-25 | Paper |
| SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN | 2008-08-26 | Paper |
| On-line scheduling on a batch machine to minimize makespan with limited restarts | 2008-08-06 | Paper |
| An inverse model for the most uniform problem | 2008-05-29 | Paper |
| The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan | 2008-05-28 | Paper |
| RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN | 2008-05-20 | Paper |
| Independent-set-deletable factor-critical power graphs | 2008-05-14 | Paper |
| A note on special optimal batching structures to minimize total weighted completion time | 2008-04-23 | Paper |
| Single machine unbounded parallel-batch scheduling with forbidden intervals | 2008-04-22 | Paper |
| Single machine scheduling with release dates and job delivery to minimize the makespan | 2008-04-15 | Paper |
| A best on-line algorithm for single machine scheduling with small delivery times | 2008-04-15 | Paper |
| Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem | 2008-01-11 | Paper |
| On the vertex arboricity of planar graphs of diameter two | 2007-09-21 | Paper |
| Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan | 2007-09-03 | Paper |
| Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption | 2007-05-30 | Paper |
| Approximation algorithms for shop scheduling problems with minsum objective: A correction | 2007-05-15 | Paper |
| A note on an on-line algorithm for the parallel-batching scheduling to minimize makespan | 2007-05-11 | Paper |
| Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal | 2007-02-13 | Paper |
| A note on the complexity of flow shop scheduling with transportation constraints | 2007-01-16 | Paper |
| Upper minus domination in a claw-free cubic graph | 2007-01-09 | Paper |
| Partition a graph with small diameter into two induced matchings | 2006-09-11 | Paper |
| Partition the vertices of a graph into one independent set and one acyclic set | 2006-08-04 | Paper |
| A proof of an inequality concerning \(k\)-restricted edge connectivity | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5698593 | 2005-10-27 | Paper |
| A PTAS for the P-batch scheduling with \(p_j=p\) to minimize total weighted completion time | 2005-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023237 | 2005-07-04 | Paper |
| 4-regular claw-free IM-extendable graphs | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672627 | 2005-05-03 | Paper |
| Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria | 2005-03-08 | Paper |
| Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times | 2005-02-09 | Paper |
| A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times | 2004-08-16 | Paper |
| On scheduling an unbounded batch machine | 2003-05-04 | Paper |
| Partition the vertices of a graph into induced matchings | 2003-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4543255 | 2003-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4781510 | 2003-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439289 | 2003-01-01 | Paper |
| Maximal IM-unextendable graphs | 2002-03-29 | Paper |
| The cycle basis interpolation property of planar graphs | 2001-06-20 | Paper |
| A counterexample to a conjecture on the connectivity of \(0\)-\(1\) polytope graphs | 2001-06-20 | Paper |
| Edge pancyclicity of unit interval graphs | 2001-06-20 | Paper |
| Path chromatic numbers of \(P_ 4\)-free planar graphs. | 2001-06-20 | Paper |
| Some results about \((g_i,f_i)^m_1\)-factorizable graphs and \((g,f;P)\)-deletable graphs | 2001-06-20 | Paper |
| NP-completeness of Hamilton circuit problem and Hamilton path problem for \(3\)-regular \(3\)-connected claw-free planar graphs | 2001-06-20 | Paper |
| An upper bound of the bandwidth of a graph in terms of the treewidth | 2001-06-20 | Paper |
| Bondage number of planar graphs | 2001-05-28 | Paper |
| Degree conditions of induced matching extendable graphs | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489771 | 2000-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488896 | 2000-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3837126 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836928 | 2000-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232283 | 1999-11-21 | Paper |
| The bandwidth of the complement of a \(k\)-tree | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246051 | 1999-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224511 | 1999-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232836 | 1999-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242938 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232815 | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232817 | 1999-03-16 | Paper |
| A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4391860 | 1998-11-25 | Paper |
| Harper-type lower bounds and the bandwidths of the compositions of graphs | 1998-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4388401 | 1998-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839555 | 1998-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4388217 | 1998-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4374704 | 1998-01-25 | Paper |
| Weak-quasi-bandwidth and forward-bandwidth of graphs | 1997-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4897245 | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885172 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879610 | 1996-08-26 | Paper |
| Optimal labelling of unit interval graphs | 1996-07-04 | Paper |
| Computational complexity of \((2,2)\) path chromatic number problem | 1996-05-13 | Paper |
| Fill-in and operations of graphs | 1996-04-08 | Paper |
| A local reductive elimination for the fill-in of graphs | 1996-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870352 | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842753 | 1995-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306326 | 1994-09-19 | Paper |
| Profile minimization problem for matrices and graphs | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139862 | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283631 | 1994-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289641 | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4034337 | 1993-05-16 | Paper |
