| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the maximum path cover problem using long paths
Information and Computation | 2025-12-15 | Paper |
The effects of aggregation and sampling on periodic INGARCH processes
Metrika | 2025-10-13 | Paper |
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
Discrete Applied Mathematics | 2025-09-17 | Paper |
Improved approximation algorithms for multiprocessor indivisible coflow scheduling
Journal of Combinatorial Optimization | 2025-07-18 | Paper |
| Improved approximation algorithms for multiprocessor indivisible coflow scheduling | 2025-06-17 | 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 |
Bayesian estimation and model selection for the spatiotemporal autoregressive model with autoregressive conditional heteroscedasticity errors
Acta Mathematicae Applicatae Sinica. English Series | 2023-11-17 | Paper |
| A 21/16-Approximation for the Minimum 3-Path Partition Problem | 2023-02-03 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Temporal aggregation and systematic sampling for INGARCH processes
Journal of Statistical Planning and Inference | 2022-04-08 | Paper |
Comparison of BINAR(1) models with bivariate negative binomial innovations and explanatory variables
Journal of Statistical Computation and Simulation | 2022-03-18 | Paper |
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
Journal of Scheduling | 2020-12-11 | Paper |
Open-shop scheduling for unit jobs under precedence constraints
Theoretical Computer Science | 2019-12-27 | Paper |
Approximation algorithms for the three-machine proportionate mixed shop scheduling
Theoretical Computer Science | 2019-12-27 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
(available as arXiv preprint) | 2019-10-11 | Paper |
An improved approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Efficient algorithms for computing one or two discrete centers hitting a set of line segments
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Heteroscedastic Max–Min Distance Analysis for Dimensionality Reduction
IEEE Transactions on Image Processing | 2019-02-06 | Paper |
Discriminative Transformation for Multi-dimensional Temporal Sequences
IEEE Transactions on Image Processing | 2019-02-05 | Paper |
Unsupervised Hierarchical Dynamic Parsing and Encoding for Action Recognition
IEEE Transactions on Image Processing | 2019-02-05 | Paper |
| An approximation framework for bounded facility location problems | 2018-10-04 | Paper |
Minimax regret 1-sink location problem in dynamic path networks
Theoretical Computer Science | 2015-06-11 | Paper |
On the exact block cover problem
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
A note on visibility-constrained Voronoi diagrams
Discrete Applied Mathematics | 2014-08-22 | Paper |
Baseline bounded half-plane Voronoi diagram
Discrete Mathematics, Algorithms and Applications | 2013-11-26 | Paper |
Minimax regret 1-sink location problems in dynamic path networks
Lecture Notes in Computer Science | 2013-05-28 | Paper |
The Canadian Traveller Problem and its competitive analysis
Journal of Combinatorial Optimization | 2009-11-16 | Paper |
Finding an anti-risk path between two nodes in undirected graphs
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
| scientific article; zbMATH DE number 5585041 (Why is no real title available?) | 2009-07-22 | Paper |
Finding the anti-block vital edge of a shortest path between two nodes
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
| scientific article; zbMATH DE number 2134682 (Why is no real title available?) | 2005-02-16 | Paper |
