| Publication | Date of Publication | Type |
|---|
Reallocation problems with minimum completion time
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Trade-offs among degree, diameter, and number of paths
Discrete Applied Mathematics | 2023-01-11 | Paper |
Posimodular function optimization
Algorithmica | 2022-03-22 | Paper |
| Settlement Fund Circulation Problem | 2020-11-25 | Paper |
Settlement fund circulation problem
Discrete Applied Mathematics | 2019-07-17 | Paper |
Subexponential fixed-parameter algorithms for partial vector domination
Discrete Optimization | 2018-05-24 | Paper |
Posimodular function optimization
Lecture Notes in Computer Science | 2017-09-22 | Paper |
(Total) vector domination for graphs with bounded branchwidth
Discrete Applied Mathematics | 2016-06-01 | Paper |
Subexponential fixed-parameter algorithms for partial vector domination
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Augmenting edge-connectivity between vertex subsets
Algorithmica | 2014-11-19 | Paper |
(Total) vector domination for graphs with bounded branchwidth
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Augmenting outerplanar graphs to meet diameter requirements
Journal of Graph Theory | 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
Algorithmica | 2013-06-25 | Paper |
A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
Journal of Discrete Algorithms | 2012-09-13 | Paper |
The \((p,q)\)-total labeling problem for trees
Discrete Mathematics | 2012-03-29 | Paper |
The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
The (p,q)-total Labeling Problem for Trees
Algorithms and Computation | 2010-12-09 | Paper |
Posi-modular systems with modulotone requirements under permutation constraints
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
Algorithmica | 2010-02-23 | Paper |
Posi-modular systems with modulotone requirements under permutation constraints
Algorithms and Computation | 2009-12-17 | Paper |
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
Journal of Discrete Algorithms | 2009-12-10 | Paper |
A Linear Time Algorithm for L(2,1)-Labeling of Trees
Lecture Notes in Computer Science | 2009-10-29 | Paper |
An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
Theoretical Computer Science | 2009-09-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
A simple recognition of maximal planar graphs
Information Processing Letters | 2009-07-09 | Paper |
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
Discrete Optimization | 2009-04-17 | Paper |
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
Algorithms and Computation | 2008-05-27 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
The source location problem with local 3-vertex-connectivity requirements
Discrete Applied Mathematics | 2007-11-30 | Paper |
Bisecting a 4-connected graph with three resource sets
Discrete Applied Mathematics | 2007-07-19 | Paper |
Minimum cost source location problem with local 3-vertex-connectivity requirements
Theoretical Computer Science | 2007-03-15 | Paper |
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Augmenting forests to meet odd diameter requirements
Discrete Optimization | 2006-10-10 | Paper |
Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
Algorithmica | 2006-06-14 | Paper |
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 2080985 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080257 (Why is no real title available?) | 2004-08-04 | Paper |
On the minimum local-vertex-connectivity augmentation in graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1789188 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1789189 (Why is no real title available?) | 2002-08-26 | Paper |
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Information Processing Letters | 2002-07-25 | Paper |
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Networks | 2001-12-19 | Paper |
| scientific article; zbMATH DE number 1617267 (Why is no real title available?) | 2001-07-11 | Paper |
Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph
Journal of Combinatorial Optimization | 2001-01-14 | Paper |
| scientific article; zbMATH DE number 1405799 (Why is no real title available?) | 2000-03-27 | Paper |
| scientific article; zbMATH DE number 1372654 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1303025 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303567 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1104329 (Why is no real title available?) | 1998-12-02 | Paper |
