| Publication | Date of Publication | Type |
|---|
| Labelled trees and pairs of input-output permutations in priority queues | 2024-01-05 | Paper |
| Minimum dominating sets of intervals on lines | 2023-12-12 | Paper |
| Optimal layouts on a chain ATM network | 2023-05-08 | 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 |
| 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 |
| Optimal bounds for the change-making problem | 2019-03-29 | 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 |
| Flexible bandwidth assignment with application to optical networks | 2018-11-07 | Paper |
| A complete characterization of the path layout construction problem for ATM networks with given hop count and load | 2018-07-04 | Paper |
| Complexity and online algorithms for minimum skyline coloring of intervals | 2018-03-26 | Paper |
| Online regenerator placement | 2017-10-12 | Paper |
| Optimizing bandwidth allocation in elastic optical networks with application to scheduling | 2017-10-06 | Paper |
| The virtual path layout problem in fast networks (extended abstract) | 2017-09-29 | Paper |
| On the complexity of the regenerator cost problem in general networks with traffic grooming | 2017-05-17 | Paper |
| On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks | 2016-10-21 | Paper |
| Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I | 2016-10-07 | 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 the intersection of tolerance and cocomparability graphs | 2015-12-10 | 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 |
| Optimizing busy time on parallel machines | 2014-12-02 | Paper |
| Online optimization of busy time on parallel machines | 2014-12-02 | Paper |
| Flexible Bandwidth Assignment with Application to Optical Networks | 2014-10-14 | Paper |
| On the complexity of constructing minimum changeover cost arborescences | 2014-06-06 | 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 |
| Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony | 2013-02-04 | 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 |
| Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism | 2012-06-29 | Paper |
| The Recognition of Tolerance and Bounded Tolerance Graphs | 2012-02-11 | Paper |
| The recognition of tolerance and bounded tolerance graphs. | 2012-01-23 | Paper |
| Optimizing regenerator cost in traffic grooming | 2012-01-04 | Paper |
| On the Intersection of Tolerance and Cocomparability Graphs | 2010-12-09 | Paper |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-12-03 | Paper |
| Minimizing total busy time in parallel scheduling with application to optical networks | 2010-10-11 | Paper |
| Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony | 2010-09-10 | 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 |
| More Patterns in Trees: Up and Down, Young and Old, Odd and Even | 2010-03-17 | 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 |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-01-21 | 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 |
| Intersection representations of matrices by subtrees and unicycles on graphs | 2008-08-08 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4791666 | 2003-01-30 | Paper |
| The complexity of the characterization of networks supporting shortest-path interval routing. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536347 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766866 | 2002-01-28 | Paper |
| On the total\(_k\)-diameter of connection networks | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503936 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262693 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259983 | 1999-09-08 | Paper |
| Scheduling in synchronous networks and the greedy algorithm | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232889 | 1999-03-16 | Paper |
| Labelled trees and pairs of input--output permutations in priority queues | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373680 | 1998-06-11 | Paper |
| Optimal layouts on a chain ATM network | 1998-01-01 | Paper |
| The bit complexity of distributed sorting | 1997-07-23 | Paper |
| Tight bounds on the round complexity of distributed 1-solvable tasks | 1997-02-28 | Paper |
| A new characterization of tree medians with applications to distributed sorting | 1994-11-17 | Paper |
| A lower bound on the period length of a distributed scheduler | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281639 | 1994-03-10 | Paper |
| Optimal bounds for the change-making problem | 1994-02-22 | Paper |
| Optimal Linear Broadcast | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028117 | 1993-03-28 | Paper |
| The cycle lemma and some applications | 1990-01-01 | Paper |
| A combinatorial characterization of the distributed 1-solvable tasks | 1990-01-01 | Paper |
| Bit complexity of order statistics on a distributed star network | 1989-01-01 | Paper |
| Efficient elections in chordal ring networks | 1989-01-01 | Paper |
| Optimal lower bounds for some distributed algorithms for a complete network of processors | 1989-01-01 | Paper |
| Patterns in trees | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790622 | 1988-01-01 | Paper |
| Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814791 | 1988-01-01 | Paper |
| On the bit complexity of distributed computations in a ring with a leader | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753476 | 1987-01-01 | Paper |
| The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785907 | 1987-01-01 | Paper |
| Ordered trees and non-crossing partitions | 1986-01-01 | Paper |
| Optimal Distributed Algorithms for Sorting and Ranking | 1985-01-01 | Paper |
| A new algorithm for generation of permutations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338269 | 1984-01-01 | Paper |
| On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744284 | 1983-01-01 | Paper |
| Golden ratios in a pairs covering problem | 1982-01-01 | Paper |
| Fair derivations in context-free grammars | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912031 | 1981-01-01 | Paper |
| Lexicographic generation of ordered trees | 1980-01-01 | Paper |
| Enumerations of ordered trees | 1980-01-01 | Paper |
| An NP-complete matching problem | 1980-01-01 | Paper |
