| Publication | Date of Publication | Type |
|---|
| A lower bound for linear interval routing | 2024-07-11 | Paper |
Labelled trees and pairs of input-output permutations in priority queues
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Minimum dominating sets of intervals on lines
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Optimal layouts on a chain ATM network
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Hierarchical \(b\)-matching
(available as arXiv preprint) | 2022-03-24 | Paper |
Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings
Discrete Mathematics, Algorithms and Applications | 2022-03-17 | Paper |
On the online coalition structure generation problem
Journal of Artificial Intelligence Research | 2022-02-07 | Paper |
Profit maximization in flex-grid all-optical networks
Theory of Computing Systems | 2020-02-27 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Theoretical Computer Science | 2019-08-09 | Paper |
Optimal bounds for the change-making problem
Automata, Languages and Programming | 2019-03-29 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
(available as arXiv preprint) | 2018-12-10 | Paper |
| Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II | 2018-12-10 | Paper |
Graphs of edge-intersecting and non-splitting one bend paths in a grid
(available as arXiv preprint) | 2018-11-30 | 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
Journal of Scheduling | 2018-11-07 | Paper |
A complete characterization of the path layout construction problem for ATM networks with given hop count and load
Automata, Languages and Programming | 2018-07-04 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Online regenerator placement
Theory of Computing Systems | 2017-10-12 | Paper |
Online regenerator placement
Theory of Computing Systems | 2017-10-12 | Paper |
Optimizing bandwidth allocation in elastic optical networks with application to scheduling
Journal of Discrete Algorithms | 2017-10-06 | Paper |
The virtual path layout problem in fast networks (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
On the complexity of the regenerator cost problem in general networks with traffic grooming
Algorithmica | 2017-05-17 | Paper |
On the complexity of approximation and online scheduling problems with applications to optical networks
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
Discrete Applied Mathematics | 2016-10-07 | Paper |
Graphs of edge-intersecting and non-splitting paths
Theoretical Computer Science | 2016-05-27 | Paper |
Constructing minimum changeover cost arborescenses in bounded treewidth graphs
Theoretical Computer Science | 2016-02-26 | Paper |
On the intersection of tolerance and cocomparability graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
On-line maximum matching in complete multi-partite graphs with an application to optical networks
Discrete Applied Mathematics | 2015-12-10 | Paper |
On the complexity of the regenerator location problem treewidth and other parameters
Discrete Applied Mathematics | 2015-12-10 | Paper |
Optimizing busy time on parallel machines
Theoretical Computer Science | 2014-12-02 | Paper |
Online optimization of busy time on parallel machines
Theoretical Computer Science | 2014-12-02 | Paper |
Flexible Bandwidth Assignment with Application to Optical Networks
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On the complexity of constructing minimum changeover cost arborescences
Theoretical Computer Science | 2014-06-06 | Paper |
Profit maximization in flex-grid all-optical networks
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
On the complexity of the regenerator location problem -- treewidth and other parameters (extended abstract)
Approximation and Online Algorithms | 2013-09-13 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Distributed Computing | 2013-02-04 | Paper |
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Online optimization of busy time on parallel machines. (Extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
The recognition of tolerance and bounded tolerance graphs
SIAM Journal on Computing | 2012-02-11 | Paper |
| The recognition of tolerance and bounded tolerance graphs | 2012-01-23 | Paper |
Optimizing regenerator cost in traffic grooming
Theoretical Computer Science | 2012-01-04 | Paper |
On the intersection of tolerance and cocomparability graphs
Algorithms and Computation | 2010-12-09 | Paper |
On the intersection of tolerance and cocomparability graphs
Algorithms and Computation | 2010-12-09 | Paper |
A new intersection model and improved algorithms for tolerance graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science | 2010-10-11 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Lecture Notes in Computer Science | 2010-09-10 | Paper |
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
Distributed Computing | 2010-09-09 | Paper |
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
Automata, Languages and Programming | 2010-09-07 | Paper |
Traffic Grooming in Star Networks via Matching Techniques
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms | 2010-05-25 | Paper |
On minimizing the number of ADMs in a general topology optical network
Discrete Applied Mathematics | 2010-04-28 | Paper |
More patterns in trees: up and down, young and old, odd and even
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Traffic Grooming: Combinatorial Results and Practical Resolutions
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
A new intersection model and improved algorithms for tolerance graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Approximating the traffic grooming problem
Journal of Discrete Algorithms | 2009-05-13 | Paper |
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
Lecture Notes in Computer Science | 2008-11-20 | Paper |
On Minimizing the Number of ADMs in a General Topology Optical Network
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Approximating the Traffic Grooming Problem in Tree and Star Networks
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks | 2008-06-25 | Paper |
On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
On the Complexity of the Traffic Grooming Problem in Optical Networks
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem
Theoretical Computer Science | 2007-10-02 | Paper |
On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 1862257 (Why is no real title available?) | 2003-01-30 | Paper |
The complexity of the characterization of networks supporting shortest-path interval routing.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1759399 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1696669 (Why is no real title available?) | 2002-01-28 | Paper |
On the total\(_k\)-diameter of connection networks
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1507216 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1340883 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1332662 (Why is no real title available?) | 1999-09-08 | Paper |
Scheduling in synchronous networks and the greedy algorithm
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1263996 (Why is no real title available?) | 1999-03-16 | Paper |
Labelled trees and pairs of input--output permutations in priority queues
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1107731 (Why is no real title available?) | 1998-06-11 | Paper |
Optimal layouts on a chain ATM network
Discrete Applied Mathematics | 1998-01-01 | Paper |
The bit complexity of distributed sorting
Algorithmica | 1997-07-23 | Paper |
Tight bounds on the round complexity of distributed 1-solvable tasks
Theoretical Computer Science | 1997-02-28 | Paper |
A new characterization of tree medians with applications to distributed sorting
Networks | 1994-11-17 | Paper |
A lower bound on the period length of a distributed scheduler
Algorithmica | 1994-05-15 | Paper |
| scientific article; zbMATH DE number 512926 (Why is no real title available?) | 1994-03-10 | Paper |
Optimal bounds for the change-making problem
Theoretical Computer Science | 1994-02-22 | Paper |
Optimal Linear Broadcast
Journal of Algorithms | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 139792 (Why is no real title available?) | 1993-03-28 | Paper |
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms | 1990-01-01 | Paper |
The cycle lemma and some applications
European Journal of Combinatorics | 1990-01-01 | Paper |
Bit complexity of order statistics on a distributed star network
Information Processing Letters | 1989-01-01 | Paper |
Efficient elections in chordal ring networks
Algorithmica | 1989-01-01 | Paper |
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science | 1989-01-01 | Paper |
Patterns in trees
Discrete Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4055012 (Why is no real title available?) | 1988-01-01 | Paper |
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
Mathematical Systems Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4085000 (Why is no real title available?) | 1988-01-01 | Paper |
On the bit complexity of distributed computations in a ring with a leader
Information and Computation | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3990855 (Why is no real title available?) | 1987-01-01 | Paper |
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
SIAM Journal on Computing | 1987-01-01 | Paper |
