| Publication | Date of Publication | Type |
|---|
| On the complexity of locally rainbow path | 2026-02-26 | Paper |
| Covering vertices by 4^+-paths: a simpler local search coupled with a more delicate amortization | 2026-01-13 | Paper |
| Happy set problems on cubic graphs and convex bipartite graphs | 2025-11-11 | Paper |
| Approximation algorithms for the longest run subsequence problem | 2024-10-21 | Paper |
| Shortest longest-path graph orientations | 2024-08-22 | Paper |
Approximation algorithms for covering vertices by long paths
Algorithmica | 2024-08-13 | Paper |
| Approximation algorithms for covering vertices by long paths | 2024-08-06 | Paper |
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
Annals of Operations Research | 2024-05-30 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
Discrete Applied Mathematics | 2024-05-29 | Paper |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
Happy set problem on subclasses of co-comparability graphs
Algorithmica | 2023-11-17 | Paper |
Path cover problems with length cost
Algorithmica | 2023-11-17 | Paper |
Independent set under a change constraint from an initial solution
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Corrigendum to: ``Complexity and approximability of the happy set problem''
Theoretical Computer Science | 2023-09-21 | Paper |
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Lecture Notes in Computer Science | 2022-12-22 | Paper |
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2022-07-13 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
Upper and lower degree-constrained graph orientation with minimum penalty
Theoretical Computer Science | 2021-12-22 | Paper |
| Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing | 2021-12-20 | Paper |
Parameterized algorithms for the happy set problem
Discrete Applied Mathematics | 2021-09-30 | Paper |
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Theoretical Computer Science | 2021-08-11 | Paper |
| Graph classes and approximability of the happy set problem | 2021-04-21 | Paper |
Graph orientation with edge modifications
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Complexity and approximability of the happy set problem
Theoretical Computer Science | 2021-04-14 | Paper |
How to pack directed acyclic graphs into small blocks
Discrete Applied Mathematics | 2020-11-02 | Paper |
Graph orientation with splits
Theoretical Computer Science | 2020-10-21 | Paper |
Exact algorithms for the repetition-bounded longest common subsequence problem
Theoretical Computer Science | 2020-09-01 | Paper |
Parameterized algorithms for the happy set problem
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
| Exact algorithms for the bounded repetition longest common subsequence problem | 2020-05-13 | Paper |
| Graph orientation with edge modifications | 2019-10-11 | Paper |
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
Frontiers in Algorithmics | 2019-04-26 | Paper |
Graph orientation with splits
Lecture Notes in Computer Science | 2018-08-17 | Paper |
| Complexity of the maximum \(k\)-path vertex cover problem | 2018-06-15 | Paper |
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Theoretical Computer Science | 2018-06-05 | Paper |
Optimal approximation algorithms for maximum distance-bounded subgraph problems
Algorithmica | 2018-06-01 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Algorithmica | 2018-05-18 | Paper |
Approximation algorithm for the distance-3 independent set problem on cubic graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Degree-constrained graph orientation: maximum satisfaction and minimum violation
Theory of Computing Systems | 2016-03-21 | Paper |
Optimal approximation algorithms for maximum distance-bounded subgraph problems
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Graph orientations optimizing the number of light or heavy vertices
Journal of Graph Algorithms and Applications | 2015-10-29 | Paper |
Approximation algorithms for packing element-disjoint Steiner trees on bounded terminal nodes
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Degree-constrained graph orientation: maximum satisfaction and minimum violation
Approximation and Online Algorithms | 2014-09-02 | Paper |
Complexity of finding maximum regular induced subgraphs with prescribed degree
Theoretical Computer Science | 2014-08-26 | Paper |
Optimal approximability of bookmark assignments
Discrete Applied Mathematics | 2014-04-10 | Paper |
Distance-\(d\) independent set problems for bipartite and chordal graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
(1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
Complexity of finding maximum regular induced subgraphs with prescribed degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Graph orientations optimizing the number of light or heavy vertices
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Distance-\(d\) independent set problems for bipartite and chordal graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Optimal distortion embedding of complete binary trees into lines
Information Processing Letters | 2012-07-20 | Paper |
NP-hardness of the sorting buffer problem on the uniform metric
Discrete Applied Mathematics | 2012-06-18 | Paper |
\((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
Graph orientation to maximize the minimum weighted outdegree
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics | 2011-04-19 | Paper |
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters | 2010-09-02 | Paper |
Approximating maximum diameter-bounded subgraphs
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Drawing borders efficiently
Theory of Computing Systems | 2009-08-06 | Paper |
On Approximation of Bookmark Assignments
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Grasp and delivery for moving objects on broken lines
Theory of Computing Systems | 2008-04-11 | Paper |
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Drawing Borders Efficiently
Lecture Notes in Computer Science | 2007-11-15 | Paper |
How to Pack Directed Acyclic Graphs into Small Blocks
Lecture Notes in Computer Science | 2007-05-02 | Paper |
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size
Journal of Algorithms | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1741112 (Why is no real title available?) | 2002-05-15 | Paper |
New bounds for oblivious mesh routing
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
A lower bound for elementary oblivious routing on three-dimensional meshes
Journal of Algorithms | 2001-12-12 | Paper |
Efficient randomized routing algorithms on the two-dimensional mesh of buses
Theoretical Computer Science | 2001-08-20 | Paper |
Oblivious routing algorithms on the mesh of buses
Journal of Parallel and Distributed Computing | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1305438 (Why is no real title available?) | 2000-04-13 | Paper |
| scientific article; zbMATH DE number 1404230 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1398072 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1222837 (Why is no real title available?) | 1998-11-11 | Paper |
Better approximations of non-Hamiltonian graphs
Discrete Applied Mathematics | 1998-06-02 | Paper |
| scientific article; zbMATH DE number 956856 (Why is no real title available?) | 1996-12-11 | Paper |
Routing Problems on the Mesh of Buses
Journal of Algorithms | 1996-08-21 | Paper |
