| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the longest run subsequence problem
| 2024-10-21 | Paper |
An approximation algorithm for covering vertices by \(4^+\)-paths
| 2024-09-16 | 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 |
Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
Journal of Combinatorial Optimization | 2024-07-11 | 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 |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
Discrete Applied Mathematics | 2024-05-29 | Paper |
On computing a center persistence diagram
| 2024-05-29 | Paper |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
| 2024-05-06 | Paper |
Approximating the directed path partition problem
Information and Computation | 2024-03-27 | Paper |
Path cover problems with length cost
Algorithmica | 2023-11-17 | Paper |
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
Algorithmic Aspects in Information and Management | 2023-10-16 | 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 |
Improved approximation algorithms for multiprocessor scheduling with testing
Frontiers of Algorithmics | 2023-08-10 | Paper |
Approximation algorithms for the directed path partition problems
Frontiers of Algorithmics | 2023-08-10 | Paper |
Planar graphs are acyclically edge $(\Delta + 5)$-colorable
| 2023-06-27 | Paper |
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Lecture Notes in Computer Science | 2022-12-22 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Approximation algorithms for the maximally balanced connected graph tripartition problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Path cover problems with length cost
| 2022-07-13 | 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 |
Approximation algorithms for maximally balanced connected graph partition
Algorithmica | 2022-01-18 | Paper |
An improved approximation algorithm for the minimum common integer partition problem
Information and Computation | 2021-11-25 | 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 |
Improved hardness and approximation results for single allocation hub location
| 2021-07-05 | Paper |
A randomized approximation algorithm for metric triangle packing
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Graph classes and approximability of the happy set problem
| 2021-04-21 | Paper |
Complexity and approximability of the happy set problem
Theoretical Computer Science | 2021-04-14 | Paper |
Improved hardness and approximation results for single allocation hub location problems
Theoretical Computer Science | 2021-04-08 | 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 |
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
| 2020-11-25 | Paper |
Improved approximation algorithms for path vertex covers in regular graphs
Algorithmica | 2020-10-12 | 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 |
Approximation algorithms for maximally balanced connected graph partition
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
A randomized approximation algorithm for metric triangle packing
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
Single-machine scheduling with job-dependent machine deterioration
Journal of Scheduling | 2020-02-12 | Paper |
Approximation algorithms for the three-machine proportionate mixed shop scheduling
Theoretical Computer Science | 2019-12-27 | Paper |
Open-shop scheduling for unit jobs under precedence constraints
Theoretical Computer Science | 2019-12-27 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem
Algorithmica | 2019-10-17 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
| 2019-10-11 | Paper |
Open-shop scheduling for unit jobs under precedence constraints
Combinatorial Optimization and Applications | 2019-10-11 | Paper |
Rescheduling due to machine disruption to minimize the total weighted completion time
Journal of Scheduling | 2019-08-08 | Paper |
An improved approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
Frontiers in Algorithmics | 2019-04-26 | Paper |
Algorithms for communication scheduling in data gathering network with data compression
Algorithmica | 2019-01-11 | Paper |
Single machine scheduling with job delivery to multiple customers
Journal of Scheduling | 2018-11-07 | Paper |
An approximation framework for bounded facility location problems
| 2018-10-04 | Paper |
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
| 2018-10-04 | Paper |
Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments
European Journal of Operational Research | 2018-07-25 | Paper |
The Steiner traveling salesman problem with online advanced edge blockages
Computers \& Operations Research | 2018-07-12 | Paper |
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Theoretical Computer Science | 2018-06-05 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Algorithmica | 2018-05-18 | Paper |
Single machine scheduling with job-dependent machine deterioration
| 2018-04-19 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
Theoretical Computer Science | 2017-06-13 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Optimization Letters | 2017-03-28 | Paper |
An FPTAS for the parallel two-stage flowshop problem
Theoretical Computer Science | 2017-02-06 | Paper |
The Steiner traveling salesman problem with online edge blockages
European Journal of Operational Research | 2016-10-06 | Paper |
Approximating the maximum multiple RNA interaction problem
Theoretical Computer Science | 2016-06-27 | Paper |
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters | 2016-06-16 | Paper |
An improved two-machine flowshop scheduling with intermediate transportation
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
Optimization Letters | 2016-02-23 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
Smoothed heights of tries and patricia tries
Theoretical Computer Science | 2015-12-11 | Paper |
Competitive algorithms for unbounded one-way trading
Theoretical Computer Science | 2015-12-08 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Frontiers in Algorithmics | 2015-11-12 | Paper |
A 0.5358-approximation for Bandpass-2
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
An improved approximation algorithm for the minimum common integer partition problem
Algorithms and Computation | 2015-09-11 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Partially dynamic single-source shortest paths on digraphs with positive weights
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Theoretical Computer Science | 2014-10-06 | Paper |
On the smoothed heights of trie and patricia index trees
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
Set cover, set packing and hitting set for tree convex and tree-like set systems
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Approximation algorithms for the maximum multiple RNA interaction problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Diameter-constrained Steiner trees
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Exact and approximation algorithms for the complementary maximal strip recovery problem
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
An improved approximation algorithm for the bandpass problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Solving haplotype inference problem with non-genotyped founders via integer linear programming
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
An approximation algorithm for the minimum co-path set problem
Algorithmica | 2011-07-01 | Paper |
On the bandpass problem
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
The three column bandpass problem is solvable in linear time
Theoretical Computer Science | 2011-02-02 | Paper |
Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
Theoretical Computer Science | 2011-01-28 | Paper |
Diameter-constrained Steiner tree
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Linear coherent bi-cluster discovery via beam detection and sample set clustering
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Randomized approaches for nearest neighbor search in metric space when computing the pairwise distance is extremely expensive
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Linear time construction of 5-phylogenetic roots for tree chordal graphs
Journal of Combinatorial Optimization | 2010-03-09 | Paper |
More reliable protein NMR peak assignment via improved 2-interval scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
Information Processing Letters | 2010-01-29 | Paper |
Vertex covering by paths on trees with its applications in machine translation
Information Processing Letters | 2009-12-18 | Paper |
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Theoretical Computer Science | 2009-11-25 | Paper |
Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
Acta Mathematicae Applicatae Sinica. English Series | 2009-11-13 | Paper |
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
On the upper bounds of the minimum number of rows of disjunct matrices
Optimization Letters | 2009-06-17 | Paper |
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
In memoriam: Yong He (1969--2005)
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
The longest common subsequence problem for arc-annotated sequences
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Strictly chordal graphs are leaf powers
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Logic Programming and Nonmonotonic Reasoning
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
An improved approximation algorithm for multicast \(k\)-tree routing
Journal of Combinatorial Optimization | 2005-12-14 | Paper |
Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
Journal of Combinatorial Optimization | 2005-06-08 | Paper |
A further improved approximation algorithm for breakpoint graph decomposition
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
3-partitioning problems for maximizing the minimum load
Journal of Combinatorial Optimization | 2005-01-17 | Paper |
A space-efficient algorithm for sequence alignment with inversions and reversals
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 2080275 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1945156 (Why is no real title available?)
| 2003-07-02 | Paper |
Computing Phylogenetic Roots with Bounded Degrees and Errors
SIAM Journal on Computing | 2003-06-19 | Paper |
Approximation algorithms for NMR spectral peak assignment.
Theoretical Computer Science | 2003-05-25 | Paper |
The longest common subsequence problem for sequences with nested arc annotations.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Methods for reconstructing the history of tandem repeats and their application to the human genome.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
On the terminal Steiner tree problem.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1830750 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1696638 (Why is no real title available?)
| 2002-07-01 | Paper |
scientific article; zbMATH DE number 1754611 (Why is no real title available?)
| 2002-06-12 | Paper |
Approximations for Steiner trees with minimum number of Steiner points
Theoretical Computer Science | 2002-03-03 | Paper |
Reducing the Steiner problem in four uniform orientations
| 2001-12-12 | Paper |
On minimum-weight \(k\)-edge connected Steiner networks on metric spaces
Graphs and Combinatorics | 2001-10-04 | Paper |
scientific article; zbMATH DE number 1615278 (Why is no real title available?)
| 2001-07-08 | Paper |
Decision tree complexity of graph properties with dimension at most 5
Journal of Computer Science and Technology | 2001-05-28 | Paper |
Approximations for Steiner trees with minimum number of Steiner points
Journal of Global Optimization | 2001-03-20 | Paper |
Grade of service Steiner minimum trees in the Euclidean plane
Algorithmica | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1535251 (Why is no real title available?)
| 2000-11-23 | Paper |
scientific article; zbMATH DE number 1405677 (Why is no real title available?)
| 2000-10-03 | Paper |
On Rearrangeability of Multirate Clos Networks
SIAM Journal on Computing | 1999-10-28 | Paper |
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Operations Research Letters | 1999-02-18 | Paper |
K-center and K-median problems in graded distances
Theoretical Computer Science | 1999-01-12 | Paper |
The exact bound of Lee's MLPT
Discrete Applied Mathematics | 1998-08-20 | Paper |
scientific article; zbMATH DE number 1094170 (Why is no real title available?)
| 1998-06-08 | Paper |
Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
Applied Mathematics. Series B (English Edition) | 1998-03-18 | Paper |
