| Publication | Date of Publication | Type |
|---|
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter | 2023-11-15 | Paper |
| Defensive domination in proper interval graphs | 2023-03-29 | Paper |
| Hierarchical \(b\)-matching | 2022-03-24 | Paper |
| Approximation algorithms for maximum weight k-coverings of graphs by packings | 2022-03-17 | Paper |
| On the Online Coalition Structure Generation Problem | 2022-02-07 | Paper |
| On the maximum cardinality cut problem in proper interval graphs and related graph classes | 2021-12-01 | Paper |
| Minimum reload cost graph factors | 2021-08-05 | Paper |
| The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation | 2021-05-11 | Paper |
| Minimum reload cost graph factors | 2020-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111862 | 2020-05-27 | Paper |
| Profit maximization in flex-grid all-optical networks | 2020-02-27 | Paper |
| Complexity and online algorithms for minimum skyline coloring of intervals | 2019-08-09 | Paper |
| Complexity of edge coloring with minimum reload/changeover costs | 2019-07-30 | Paper |
| On one extension of Dirac's theorem on Hamiltonicity | 2018-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560224 | 2018-12-10 | Paper |
| Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid | 2018-11-30 | Paper |
| Equimatchable claw-free graphs | 2018-08-15 | Paper |
| On two extensions of equimatchable graphs | 2018-05-24 | Paper |
| Complexity and online algorithms for minimum skyline coloring of intervals | 2018-03-26 | Paper |
| The maximum cardinality cut problem in co-bipartite chain graphs | 2018-02-21 | Paper |
| Online regenerator placement | 2017-10-12 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2017-08-24 | Paper |
| On the complexity of the regenerator cost problem in general networks with traffic grooming | 2017-05-17 | Paper |
| A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs | 2017-02-21 | Paper |
| On three extensions of equimatchable graphs | 2017-02-14 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2016-12-22 | Paper |
| Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I | 2016-10-07 | Paper |
| Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) | 2016-08-16 | Paper |
| Graphs of edge-intersecting and non-splitting paths | 2016-05-27 | Paper |
| Constructing minimum changeover cost arborescenses in bounded treewidth graphs | 2016-02-26 | Paper |
| On-line maximum matching in complete multi-partite graphs with an application to optical networks | 2015-12-10 | Paper |
| On the complexity of the regenerator location problem treewidth and other parameters | 2015-12-10 | Paper |
| On the interval chromatic number of proper interval graphs | 2015-06-29 | Paper |
| Optimizing busy time on parallel machines | 2014-12-02 | Paper |
| Online optimization of busy time on parallel machines | 2014-12-02 | Paper |
| On the complexity of constructing minimum changeover cost arborescences | 2014-06-06 | Paper |
| On approximating the \(d\)-girth of a graph | 2014-04-10 | Paper |
| Profit Maximization in Flex-Grid All-Optical Networks | 2013-12-17 | Paper |
| Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations | 2013-12-06 | Paper |
| On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters | 2013-09-13 | Paper |
| Approximating the traffic grooming problem in tree and star networks | 2012-07-26 | Paper |
| Online Optimization of Busy Time on Parallel Machines | 2012-07-16 | Paper |
| Optimizing regenerator cost in traffic grooming | 2012-01-04 | Paper |
| On Approximating the d-Girth of a Graph | 2011-02-15 | Paper |
| Minimizing total busy time in parallel scheduling with application to optical networks | 2010-10-11 | Paper |
| On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms | 2010-09-09 | Paper |
| Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests | 2010-09-07 | Paper |
| Traffic Grooming in Star Networks via Matching Techniques | 2010-06-17 | Paper |
| Optimal on-line colorings for minimizing the number of ADMs in optical networks | 2010-05-25 | Paper |
| On minimizing the number of ADMs in a general topology optical network | 2010-04-28 | Paper |
| On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology | 2010-02-24 | Paper |
| Traffic Grooming: Combinatorial Results and Practical Resolutions | 2010-02-09 | Paper |
| Approximating the traffic grooming problem | 2009-05-13 | Paper |
| A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring | 2008-11-20 | Paper |
| On Minimizing the Number of ADMs in a General Topology Optical Network | 2008-09-09 | Paper |
| Approximating the Traffic Grooming Problem in Tree and Star Networks | 2008-09-04 | Paper |
| Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks | 2008-09-02 | Paper |
| On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion | 2008-07-10 | Paper |
| Selfishness, collusion and power of local search for the ADMs minimization problem | 2008-06-25 | Paper |
| On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing | 2008-04-17 | Paper |
| On the Complexity of the Traffic Grooming Problem in Optical Networks | 2007-11-15 | Paper |
| Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem | 2007-10-02 | Paper |
| On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing | 2007-04-26 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
