| Publication | Date of Publication | Type |
|---|
Constructing red-black spanners for mixed-charging vehicular networks
Theoretical Computer Science | 2024-12-12 | Paper |
Permutation-constrained common string partitions with applications
Algorithmica | 2024-12-03 | Paper |
| The longest subsequence-repeated subsequence problem | 2024-09-16 | Paper |
| Guarding precise and imprecise polyhedral terrains with segments | 2024-09-16 | Paper |
The longest letter-duplicated subsequence and related problems
Acta Informatica | 2024-08-24 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
| Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals | 2024-08-22 | Paper |
| Algorithms and hardness for the longest common subsequence of three strings and related problems | 2024-05-29 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
| Beyond the longest letter-duplicated subsequence problem | 2024-05-06 | Paper |
New approximation algorithms for RNA secondary structures prediction problems by local search
Theoretical Computer Science | 2024-02-09 | Paper |
Two-guarding a rectilinear polygon
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Three dimensional weak visibility: Complexity and applications
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| The Tandem Duplication Distance Is NP-Hard | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651113 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Dispersing and grouping points on segments in the plane | 2022-12-22 | Paper |
Computing a consensus trajectory in a vehicular network
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
Computer Science – Theory and Applications | 2022-10-19 | Paper |
| The complexity of finding common partitions of genomes with predefined block sizes | 2022-08-11 | Paper |
| A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | 2022-07-18 | Paper |
| Permutation-constrained common string partitions with applications | 2022-06-15 | Paper |
Computing the tandem duplication distance is NP-hard
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
Dispersing and grouping points on planar segments
Theoretical Computer Science | 2021-10-06 | Paper |
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
Theoretical Computer Science | 2021-09-27 | Paper |
On the solution bound of two-sided scaffold filling
Theoretical Computer Science | 2021-06-22 | Paper |
A retrospective on genomic preprocessing for comparative genomics
Models and Algorithms for Genome Evolution | 2021-06-10 | Paper |
On some matching problems under the color-spanning model
Theoretical Computer Science | 2019-08-20 | Paper |
Efficient algorithms for computing one or two discrete centers hitting a set of line segments
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
The discrete and mixed minimax 2-center problems
Theoretical Computer Science | 2019-06-25 | Paper |
Genomic Scaffold Filling: A Progress Report
Frontiers in Algorithmics | 2019-04-26 | Paper |
Finding Disjoint Dense Clubs in an Undirected Graph
Frontiers in Algorithmics | 2019-04-26 | Paper |
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
Frontiers in Algorithmics | 2019-04-26 | Paper |
On the fixed-parameter tractability of some matching problems under the color-spanning model
Frontiers in Algorithmics | 2019-04-26 | Paper |
| A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications | 2018-10-04 | Paper |
A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
Theoretical Computer Science | 2018-06-18 | Paper |
Finding disjoint dense clubs in a social network
Theoretical Computer Science | 2018-06-05 | Paper |
Solving the maximum internal spanning tree problem on interval graphs in polynomial time
Theoretical Computer Science | 2018-06-05 | Paper |
| On the general chain pair simplification problem | 2018-03-21 | Paper |
The connected disk covering problem
Journal of Combinatorial Optimization | 2018-03-01 | Paper |
| Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction | 2017-10-23 | Paper |
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Genomic scaffold filling revisited | 2017-10-17 | Paper |
Improved algorithms for intermediate dataset storage in a cloud-based dataflow
Theoretical Computer Science | 2017-02-06 | Paper |
A polynomial time solution for permutation scaffold filling
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Following a curve with the discrete Fréchet distance
Theoretical Computer Science | 2016-06-27 | Paper |
Computing the optimal bridge between two convex polygons
Information Processing Letters | 2016-06-16 | Paper |
A 1.5-approximation algorithm for two-sided scaffold filling
Algorithmica | 2016-03-23 | Paper |
The discrete and mixed minimax 2-center problem
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
Theoretical Computer Science | 2015-12-08 | Paper |
A new algorithm for intermediate dataset storage in a cloud-based dataflow
Frontiers in Algorithmics | 2015-11-12 | Paper |
An incremental version of the \(k\)-center problem on boundary of a convex polygon
Journal of Combinatorial Optimization | 2015-11-03 | Paper |
On the Chain Pair Simplification Problem
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6472588 (Why is no real title available?) | 2015-08-14 | Paper |
Robust optimization for the hazardous materials transportation network design problem
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
Complexity analysis and algorithms for the program download problem
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Weak visibility polygons of NURBS curves inside simple polygons
Journal of Computational and Applied Mathematics | 2015-06-16 | Paper |
On the exact block cover problem
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Expected computations on color spanning sets
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
Frontiers in Algorithmics | 2014-09-02 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
A note on visibility-constrained Voronoi diagrams
Discrete Applied Mathematics | 2014-08-22 | Paper |
A linear kernel for the complementary maximal strip recovery problem
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Voronoi diagram with visual restriction
Theoretical Computer Science | 2014-04-15 | Paper |
Expected computations on color spanning sets
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Radiation hybrid map construction problem parameterized
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Streaming with minimum space: an algorithm for covering by two congruent balls
Theoretical Computer Science | 2014-01-16 | Paper |
Tight approximation bounds for connectivity with a color-spanning set
Algorithms and Computation | 2014-01-14 | Paper |
Largest area convex hull of imprecise data based on axis-aligned squares
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
Baseline bounded half-plane Voronoi diagram
Discrete Mathematics, Algorithms and Applications | 2013-11-26 | Paper |
On some geometric problems of color-spanning sets
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
The program download problem: complexity and algorithms
Lecture Notes in Computer Science | 2013-06-11 | Paper |
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Streaming with minimum space: an algorithm for covering by two congruent balls
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Radiation hybrid map construction problem parameterized
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
A linear kernel for the complementary maximal strip recovery problem
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
Theoretical Computer Science | 2012-08-08 | Paper |
Minimum common string partition revisited
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
Exact and approximation algorithms for the complementary maximal strip recovery problem
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
Voronoi diagram with visual restriction
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Erratum: ``The approximability of the exemplar breakpoint distance problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Continuous-time moving network Voronoi diagram
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Fréchet-Distance on Road Networks
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Largest area convex hull of axis-aligned squares based on imprecise data
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Minimum interval cover and its application to genome sequencing
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Exponential and polynomial time algorithms for the minimum common string partition problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
Combinatorial Pattern Matching | 2011-06-29 | Paper |
On some geometric problems of color-spanning sets
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
On the red/blue spanning tree problem
Theoretical Computer Science | 2011-05-18 | Paper |
Voronoi diagram of polygonal chains under the discrete Fréchet distance
International Journal of Computational Geometry & Applications | 2010-09-30 | Paper |
Guarding a terrain by two watchtowers
Algorithmica | 2010-09-16 | Paper |
Minimum common string partition revisited
Frontiers in Algorithmics | 2010-09-07 | Paper |
Breakpoint Distance and PQ-Trees
Combinatorial Pattern Matching | 2010-07-26 | Paper |
A linear kernel for co-path/cycle packing
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Efficient exact and approximate algorithms for the complement of Maximal Strip Recovery
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
On Lawson's oriented walk in random Delaunay triangulations.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Parametric search: three new applications
Frontiers of Mathematics in China | 2010-02-26 | Paper |
A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Information Processing Letters | 2009-12-04 | Paper |
On recovering syntenic blocks from comparative maps
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
The Canadian Traveller Problem and its competitive analysis
Journal of Combinatorial Optimization | 2009-11-16 | Paper |
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Frontiers in Algorithmics | 2009-07-14 | Paper |
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On the Red/Blue Spanning Tree Problem
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On the Tractability of Maximal Strip Recovery
Lecture Notes in Computer Science | 2009-06-03 | Paper |
A simple factor-3 approximation for labeling points with circles
Information Processing Letters | 2009-04-28 | Paper |
Volume Computation Using a Direct Monte Carlo Method
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On Recovering Syntenic Blocks from Comparative Maps
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Non-breaking Similarity of Genomes with Gene Repetitions
Combinatorial Pattern Matching | 2008-06-17 | Paper |
On the inapproximability of the exemplar conserved interval distance problem of genomes
Journal of Combinatorial Optimization | 2008-05-13 | Paper |
Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
Computational Geometry | 2008-04-25 | Paper |
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-04-15 | Paper |
A combinatorial theorem on labeling squares with points and its application
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
The Approximability of the Exemplar Breakpoint Distance Problem
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
RNA multiple structural alignment with longest common subsequences
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Theoretical Computer Science | 2007-01-09 | Paper |
On a minimum linear classification problem
Journal of Global Optimization | 2006-09-26 | Paper |
A PTAS for a disc covering problem using width-bounded separators
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
| scientific article; zbMATH DE number 2188396 (Why is no real title available?) | 2005-07-26 | Paper |
EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS
International Journal of Computational Geometry & Applications | 2005-02-28 | Paper |
New approximation algorithms for map labeling with sliding labels
Journal of Combinatorial Optimization | 2005-01-17 | Paper |
| scientific article; zbMATH DE number 2089997 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089213 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080239 (Why is no real title available?) | 2004-08-04 | Paper |
On a minimum linear classification problem
Journal of Global Optimization | 2003-08-21 | Paper |
Polynomial time algorithms for three-label point labeling.
Theoretical Computer Science | 2003-08-17 | Paper |
Some problems on factorizations with constraints in bipartite graphs
Discrete Applied Mathematics | 2003-06-10 | Paper |
| scientific article; zbMATH DE number 1796965 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1796960 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1766656 (Why is no real title available?) | 2002-07-11 | Paper |
Fast range searching with Delaunay triangulations
GeoInformatica | 2002-06-02 | Paper |
Some formal analysis of Rocchio's similarity-based relevance feedback algorithm
Information Retrieval | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1670674 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1629978 (Why is no real title available?) | 2001-10-23 | Paper |
On some polyhedra covering problems
Journal of Combinatorial Optimization | 2001-01-25 | Paper |
| scientific article; zbMATH DE number 1555971 (Why is no real title available?) | 2001-01-24 | Paper |
Three-dimensional weak visibility: Complexity and applications
Theoretical Computer Science | 2000-08-21 | Paper |
INTERSECTIONS OF RANDOM LINE SEGMENTS
International Journal of Computational Geometry & Applications | 2000-06-21 | Paper |
Computing the degree-4 shortest network under a given topology
Discrete & Computational Geometry | 2000-06-07 | Paper |
A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors
Algorithmica | 2000-01-03 | Paper |
| scientific article; zbMATH DE number 1696648 (Why is no real title available?) | 2000-01-01 | Paper |
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
Computational Geometry | 1999-10-20 | Paper |
A note on point location in Delaunay triangulations of random points
Algorithmica | 1999-02-02 | Paper |
Feasibility of design in stereolithography
Algorithmica | 1998-02-04 | Paper |
Guarding polyhedral terrains
Computational Geometry | 1997-03-18 | Paper |
Computing the shortest diagonal of a monotone polygon in linear time
Information Processing Letters | 1993-01-16 | Paper |
Counting \(k\)-subsets and convex \(k\)-gons in the plane
Information Processing Letters | 1992-06-26 | Paper |
