| Publication | Date of Publication | Type |
|---|
| Parameterized complexity of weighted target set selection | 2024-11-12 | Paper |
| On the routing problems in graphs with ordered forbidden transitions | 2024-08-22 | Paper |
| The shortest path reconfiguration problem based on relaxation of reconfiguration rules | 2024-07-19 | Paper |
| On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes | 2024-07-19 | Paper |
| Generalized edge-rankings of trees (extended abstract) | 2024-06-05 | Paper |
| Simple reduction of f-colorings to edge-colorings | 2023-12-12 | Paper |
| Parameterized complexity of optimizing list vertex-coloring through reconfiguration | 2023-11-24 | Paper |
| Minimization and parameterized variants of vertex partition problems on graphs | 2023-11-14 | Paper |
| Decremental optimization of vertex-coloring under the reconfiguration framework | 2023-03-30 | Paper |
| Algorithms for finding f-colorings of partial k-trees | 2023-03-21 | Paper |
| Finding edge-disjoint paths in partial k-trees | 2023-01-25 | Paper |
| A parallel algorithm for edge-coloring partial k-trees | 2022-12-09 | Paper |
| Effect of compositional fluctuation on the survival of bet-hedging species | 2022-11-09 | Paper |
| Recent advances in wave energy converters based on nonlinear stiffness mechanisms | 2022-08-15 | Paper |
| Global dynamics analysis and control of a rumor spreading model in online social networks | 2022-08-02 | Paper |
| Algorithms for Coloring Reconfiguration Under Recolorability Constraints | 2022-07-21 | Paper |
| Reconfiguration of Minimum Steiner Trees via Vertex Exchanges | 2022-07-21 | Paper |
| Approximability of the independent feedback vertex set problem for bipartite graphs | 2020-12-15 | Paper |
| Complexity of Coloring Reconfiguration under Recolorability Constraints | 2020-11-25 | Paper |
| Approximability of the independent feedback vertex set problem for bipartite graphs | 2020-07-22 | Paper |
| Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters | 2020-05-26 | Paper |
| An image copy-move forgery detection scheme based on A-KAZE and SURF features | 2019-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5194582 | 2019-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5381809 | 2019-06-21 | Paper |
| Fragile watermarking for image authentication using the characteristic of SVD | 2018-08-20 | Paper |
| RST resilient watermarking scheme based on DWT-SVD and scale-invariant feature transform | 2018-08-20 | Paper |
| Parameterized complexity of the list coloring reconfiguration problem with graph parameters | 2018-06-18 | Paper |
| The coloring reconfiguration problem on specific graph classes | 2018-02-26 | Paper |
| Time-Domain Shooting and Bouncing Rays Method Based on Beam Tracing Technique | 2017-10-30 | Paper |
| The Complexity of (List) Edge-Coloring Reconfiguration Problem | 2017-05-05 | Paper |
| The minimum vulnerability problem on specific graph classes | 2016-11-29 | Paper |
| Reconfiguration of Steiner Trees in an Unweighted Graph | 2016-09-29 | Paper |
| Threshold circuits detecting global patterns in two-dimensional maps | 2016-03-03 | Paper |
| Competitive Diffusion on Weighted Graphs | 2015-10-30 | Paper |
| Reconfiguration of Vertex Covers in a Graph | 2015-09-15 | Paper |
| Deterministic Algorithms for the Independent Feedback Vertex Set Problem | 2015-09-15 | Paper |
| The Minimum Vulnerability Problem on Graphs | 2015-09-11 | Paper |
| The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs | 2015-09-11 | Paper |
| A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES | 2015-04-29 | Paper |
| Threshold Circuits for Global Patterns in 2-Dimensional Maps | 2015-02-27 | Paper |
| Generalized rainbow connectivity of graphs | 2014-10-06 | Paper |
| Reconfiguration of list \(L(2,1)\)-labelings in a graph | 2014-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4980646 | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417816 | 2014-05-22 | Paper |
| Bandwidth consecutive multicolorings of graphs | 2014-04-15 | Paper |
| Energy and fan-in of logic circuits computing symmetric Boolean functions | 2014-01-16 | Paper |
| Global classical solutions to 1D compressible Navier-Stokes equations with density-dependent viscosity | 2013-11-19 | Paper |
| On the rainbow connectivity of graphs: complexity and FPT algorithms | 2013-11-11 | Paper |
| Energy-efficient threshold circuits computing MOD functions | 2013-07-30 | Paper |
| On the Minimum Caterpillar Problem in Digraphs | 2013-06-11 | Paper |
| Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays | 2013-05-28 | Paper |
| Generalized Rainbow Connectivity of Graphs | 2013-04-12 | Paper |
| Reconfiguration of List L(2,1)-Labelings in a Graph | 2013-03-21 | Paper |
| Energy-Efficient Threshold Circuits for Comparison Functions | 2013-03-14 | Paper |
| Minimum cost partitions of trees with supply and demand | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4902008 | 2013-01-24 | Paper |
| Small grid drawings of planar graphs with balanced partition | 2012-12-21 | Paper |
| Algorithms for Bandwidth Consecutive Multicolorings of Graphs | 2012-07-16 | Paper |
| Partitioning a weighted tree into subtrees with weights in a given range | 2012-04-26 | Paper |
| On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms | 2011-08-17 | Paper |
| An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree | 2011-07-01 | Paper |
| Energy and Fan-In of Threshold Circuits Computing Mod Functions | 2011-07-01 | Paper |
| List Total Colorings of Series-Parallel Graphs | 2011-03-18 | Paper |
| CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n2) GRIDS | 2010-12-15 | Paper |
| Minimum Cost Partitions of Trees with Supply and Demand | 2010-12-09 | Paper |
| Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings | 2010-09-07 | Paper |
| Partitioning graphs of supply and demand | 2010-04-28 | Paper |
| Small Grid Drawings of Planar Graphs with Balanced Bipartition | 2010-02-09 | Paper |
| Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids | 2009-12-17 | Paper |
| Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends | 2009-11-27 | Paper |
| Efficient algorithms for wavelength assignment on trees of rings | 2009-06-30 | Paper |
| Approximability of partitioning graphs with supply and demand | 2009-02-23 | Paper |
| Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 2009-01-29 | Paper |
| Approximability of Partitioning Graphs with Supply and Demand | 2008-04-24 | Paper |
| Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size | 2008-01-11 | Paper |
| Total colorings of degenerate graphs | 2007-11-12 | Paper |
| Algorithms for finding distance-edge-colorings of graphs | 2007-10-30 | Paper |
| Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size | 2007-09-10 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5482124 | 2006-08-28 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5315756 | 2005-09-09 | Paper |
| PARTITIONING TREES OF SUPPLY AND DEMAND | 2005-08-03 | Paper |
| List total colorings of series-parallel graphs | 2005-05-04 | Paper |
| Algorithm for the cost edge-coloring of trees | 2005-03-15 | Paper |
| Multicolorings of series-parallel graphs | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808664 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472489 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474118 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427881 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551367 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535043 | 2002-06-12 | Paper |
| The edge-disjoint paths problem is NP-complete for series-parallel graphs | 2002-04-22 | Paper |
| Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings | 2002-03-14 | Paper |
| A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761869 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511238 | 2001-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525701 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249537 | 2000-11-06 | Paper |
| Algorithms for generalized vertex-rankings of partial k-trees | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234138 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232781 | 1999-07-05 | Paper |
| Edge-Coloring and f-Coloring for Various Classes of Graphs | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364591 | 1998-02-23 | Paper |
| An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs | 1997-11-10 | Paper |
| Edge-Coloring Partialk-Trees | 1996-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886041 | 1996-09-23 | Paper |
| A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs | 1996-02-20 | Paper |
