| Publication | Date of Publication | Type |
|---|
| String factorization via prefix free families | 2024-10-21 | Paper |
| Algorithms on a path covering problem with applications in transportation | 2024-09-16 | Paper |
Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
Scientific Annals of Computer Science | 2024-08-15 | Paper |
| Approximation and fixed parameter algorithms for the approximate cover problem | 2024-05-29 | Paper |
| scientific article; zbMATH DE number 7561360 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561384 (Why is no real title available?) | 2022-07-21 | Paper |
The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
Discrete Applied Mathematics | 2021-10-21 | Paper |
| Approximate and exact results for the harmonious chromatic number | 2021-06-01 | Paper |
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Discrete Applied Mathematics | 2021-03-25 | Paper |
Tractable low-delay atomic memory
Distributed Computing | 2021-03-12 | Paper |
On the (di)graphs with (directed) proper connection number two
Discrete Applied Mathematics | 2020-05-29 | Paper |
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
ACM Transactions on Algorithms | 2019-11-25 | Paper |
| Algorithms for closest and farthest string problems via rank distance | 2019-10-15 | Paper |
IP Solutions for International Kidney Exchange Programmes
(available as arXiv preprint) | 2019-04-15 | Paper |
Parameterized complexity of asynchronous border minimization
Algorithmica | 2019-01-11 | Paper |
| Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem | 2018-08-15 | Paper |
On the (di)graphs with (directed) proper connection number two
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
| scientific article; zbMATH DE number 6850484 (Why is no real title available?) | 2018-03-15 | Paper |
Hardness and approximation of the asynchronous border minimization problem
Discrete Applied Mathematics | 2017-12-06 | Paper |
| Making ``fast atomic operations computationally tractable | 2017-09-29 | Paper |
Approximation and hardness results for the maximum edge \(q\)-coloring problem
Journal of Discrete Algorithms | 2016-12-09 | Paper |
SOBRA -- shielding optimization for brachytherapy
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A parameterized study of maximum generalized pattern matching problems
Algorithmica | 2016-06-28 | Paper |
Min-sum 2-paths problems
Theory of Computing Systems | 2016-03-21 | Paper |
The min-max edge \(q\)-coloring problem
Journal of Graph Algorithms and Applications | 2015-10-29 | Paper |
Algorithmic and hardness results for the colorful components problems
Algorithmica | 2015-10-19 | Paper |
Parameterized complexity of asynchronous border minimization
Lecture Notes in Computer Science | 2015-09-30 | Paper |
The min-max edge \(q\)-coloring problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Approximation and hardness results for the maximum edges in transitive closure problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
A parameterized study of maximum generalized pattern matching problems
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Enumeration of Steiner triple systems with subsystems
Mathematics of Computation | 2015-08-13 | Paper |
Min-sum 2-paths problems
Approximation and Online Algorithms | 2014-09-02 | Paper |
Better lower and upper bounds for the minimum rainbow subgraph problem
Theoretical Computer Science | 2014-07-07 | Paper |
The Mendelsohn triple systems of order 13
Journal of Combinatorial Designs | 2014-04-04 | Paper |
Algorithmic and hardness results for the colorful components problems
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Enumerating cube tilings
Discrete & Computational Geometry | 2014-01-24 | Paper |
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Theoretical Computer Science | 2014-01-10 | Paper |
On the Shannon capacity of triangular graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Modelling the power supply network -- hardness and approximation
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Maximum subset intersection
Information Processing Letters | 2013-03-28 | Paper |
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Approximating the rainbow -- better lower and upper bounds
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the closest string via rank distance
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Hardness and approximation of the asynchronous border minimization problem (extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Restricted common superstring and restricted common supersequence
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Approximation and Hardness Results for the Maximum Edge q-coloring Problem
Algorithms and Computation | 2010-12-09 | Paper |
