| Publication | Date of Publication | Type |
|---|
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
Defensive domination in proper interval graphs
Discrete Applied Mathematics | 2023-03-29 | Paper |
Hierarchical \(b\)-matching
| 2022-03-24 | Paper |
Approximation algorithms for maximum weight k-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 |
On the maximum cardinality cut problem in proper interval graphs and related graph classes
Theoretical Computer Science | 2021-12-01 | Paper |
Minimum reload cost graph factors
Theory of Computing Systems | 2021-08-05 | Paper |
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Minimum reload cost graph factors
Lecture Notes in Computer Science | 2020-10-22 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
| 2020-05-27 | 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 |
Complexity of edge coloring with minimum reload/changeover costs
Networks | 2019-07-30 | Paper |
On one extension of Dirac's theorem on Hamiltonicity
Discrete Applied Mathematics | 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
| 2018-11-30 | Paper |
Equimatchable claw-free graphs
Discrete Mathematics | 2018-08-15 | Paper |
On two extensions of equimatchable graphs
Discrete Optimization | 2018-05-24 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
The maximum cardinality cut problem in co-bipartite chain graphs
Journal of Combinatorial Optimization | 2018-02-21 | Paper |
Online regenerator placement
Theory of Computing Systems | 2017-10-12 | Paper |
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
Theoretical Computer Science | 2017-08-24 | Paper |
On the complexity of the regenerator cost problem in general networks with traffic grooming
Algorithmica | 2017-05-17 | Paper |
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
Information Processing Letters | 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
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
Discrete Applied Mathematics | 2016-10-07 | Paper |
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
Discrete Mathematics | 2016-08-16 | 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-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 |
On the interval chromatic number of proper interval graphs
Discrete Mathematics | 2015-06-29 | 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 |
On the complexity of constructing minimum changeover cost arborescences
Theoretical Computer Science | 2014-06-06 | Paper |
On approximating the \(d\)-girth of a graph
Discrete Applied Mathematics | 2014-04-10 | 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 |
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 |
Optimizing regenerator cost in traffic grooming
Theoretical Computer Science | 2012-01-04 | Paper |
On Approximating the d-Girth of a Graph
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science | 2010-10-11 | 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 |
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 |
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 |
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 |
