| Publication | Date of Publication | Type |
|---|
| Reallocation problems with minimum completion time | 2023-08-10 | Paper |
| Trade-offs among degree, diameter, and number of paths | 2023-01-11 | Paper |
| Posimodular function optimization | 2022-03-22 | Paper |
| Settlement Fund Circulation Problem | 2020-11-25 | Paper |
| Settlement fund circulation problem | 2019-07-17 | Paper |
| Subexponential fixed-parameter algorithms for partial vector domination | 2018-05-24 | Paper |
| Posimodular function optimization | 2017-09-22 | Paper |
| (Total) vector domination for graphs with bounded branchwidth | 2016-06-01 | Paper |
| Subexponential Fixed-Parameter Algorithms for Partial Vector Domination | 2015-10-16 | Paper |
| Augmenting edge-connectivity between vertex subsets | 2014-11-19 | Paper |
| (Total) Vector Domination for Graphs with Bounded Branchwidth | 2014-03-31 | Paper |
| Augmenting outerplanar graphs to meet diameter requirements | 2013-11-15 | Paper |
| Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs | 2013-08-27 | Paper |
| A linear time algorithm for \(L(2,1)\)-labeling of trees | 2013-06-25 | Paper |
| A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs | 2012-09-13 | Paper |
| The \((p,q)\)-total labeling problem for trees | 2012-03-29 | Paper |
| The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 | 2011-05-19 | Paper |
| The (p,q)-total Labeling Problem for Trees | 2010-12-09 | Paper |
| POSI-MODULAR SYSTEMS WITH MODULOTONE REQUIREMENTS UNDER PERMUTATION CONSTRAINTS | 2010-05-19 | Paper |
| Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs | 2010-02-23 | Paper |
| Posi-modular Systems with Modulotone Requirements under Permutation Constraints | 2009-12-17 | Paper |
| Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs | 2009-12-10 | Paper |
| A Linear Time Algorithm for L(2,1)-Labeling of Trees | 2009-10-29 | Paper |
| An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees | 2009-09-10 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A simple recognition of maximal planar graphs | 2009-07-09 | Paper |
| Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs | 2009-04-17 | Paper |
| An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees | 2008-07-15 | Paper |
| Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs | 2008-05-27 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| The source location problem with local 3-vertex-connectivity requirements | 2007-11-30 | Paper |
| Bisecting a 4-connected graph with three resource sets | 2007-07-19 | Paper |
| Minimum cost source location problem with local 3-vertex-connectivity requirements | 2007-03-15 | Paper |
| Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Augmenting forests to meet odd diameter requirements | 2006-10-10 | Paper |
| Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph | 2006-06-14 | Paper |
| A robust algorithm for bisecting a triconnected graph with two resource sets | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474082 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472505 | 2004-08-04 | Paper |
| On the minimum local-vertex-connectivity augmentation in graphs | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548785 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548786 | 2002-08-26 | Paper |
| Minimum cost source location problem with vertex-connectivity requirements in digraphs | 2002-07-25 | Paper |
| Multigraph augmentation under biconnectivity and general edge-connectivity requirements | 2001-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721988 | 2001-07-11 | Paper |
| Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938784 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703856 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249524 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250193 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370202 | 1998-12-02 | Paper |
